du.sePublikasjoner
Endre søk
RefereraExporteraLink to record
Permanent link

Direct link
Referera
Referensformat
  • apa
  • ieee
  • modern-language-association-8th-edition
  • vancouver
  • chicago-author-date
  • chicago-note-bibliography
  • Annet format
Fler format
Språk
  • de-DE
  • en-GB
  • en-US
  • fi-FI
  • nn-NO
  • nn-NB
  • sv-SE
  • Annet språk
Fler språk
Utmatningsformat
  • html
  • text
  • asciidoc
  • rtf
On statistical bounds of heuristic solutions to location problems
Högskolan Dalarna, Akademin Industri och samhälle, Statistik.ORCID-id: 0000-0003-2317-9157
Högskolan Dalarna, Akademin Industri och samhälle, Statistik.ORCID-id: 0000-0003-2970-9622
2014 (engelsk)Rapport (Annet vitenskapelig)
Abstract [en]

Solutions to combinatorial optimization problems, such as problems of locating facilities, frequently rely on heuristics to minimize the objective function. The optimum is sought iteratively and a criterion is needed to decide when the procedure (almost) attains it. Pre-setting the number of iterations dominates in OR applications, which implies that the quality of the solution cannot be ascertained. A small, almost dormant, branch of the literature suggests using statistical principles to estimate the minimum and its bounds as a tool to decide upon stopping and evaluating the quality of the solution. In this paper we examine the functioning of statistical bounds obtained from four different estimators by using simulated annealing on p-median test problems taken from Beasley’s OR-library. We find the Weibull estimator and the 2nd order Jackknife estimator preferable and the requirement of sample size to be about 10 being much less than the current recommendation. However, reliable statistical bounds are found to depend critically on a sample of heuristic solutions of high quality and we give a simple statistic useful for checking the quality. We end the paper with an illustration on using statistical bounds in a problem of locating some 70 distribution centers of the Swedish Post in one Swedish region. 

sted, utgiver, år, opplag, sider
Borlänge: Högskolan Dalarna, 2014.
Serie
Working papers in transport, tourism, information technology and microdata analysis, ISSN 1650-5581 ; 2014:10
Emneord [en]
p-median problem, simulated annealing, jack-knife, discrete optimization, extreme value theory
HSV kategori
Forskningsprogram
Komplexa system - mikrodataanalys
Identifikatorer
URN: urn:nbn:se:du-14135OAI: oai:DiVA.org:du-14135DiVA, id: diva2:719712
Forskningsfinansiär
Swedish Retail and Wholesale Development CouncilTilgjengelig fra: 2014-05-26 Laget: 2014-05-26 Sist oppdatert: 2018-01-11bibliografisk kontrollert

Open Access i DiVA

On statistical bounds of heuristic solutions(2017 kB)170 nedlastinger
Filinformasjon
Fil FULLTEXT01.pdfFilstørrelse 2017 kBChecksum SHA-512
624a6ff1cfb697ed80e215ed6d90ae74e795224de9276cca54acb3a97e2ad5863a312616bb7def973a5afec97a291ab62032ace6cb4c1d9ea6cd6fc575a91202
Type fulltextMimetype application/pdf

Personposter BETA

Carling, KennethMeng, Xiangli

Søk i DiVA

Av forfatter/redaktør
Carling, KennethMeng, Xiangli
Av organisasjonen

Søk utenfor DiVA

GoogleGoogle Scholar
Totalt: 170 nedlastinger
Antall nedlastinger er summen av alle nedlastinger av alle fulltekster. Det kan for eksempel være tidligere versjoner som er ikke lenger tilgjengelige

urn-nbn

Altmetric

urn-nbn
Totalt: 878 treff
RefereraExporteraLink to record
Permanent link

Direct link
Referera
Referensformat
  • apa
  • ieee
  • modern-language-association-8th-edition
  • vancouver
  • chicago-author-date
  • chicago-note-bibliography
  • Annet format
Fler format
Språk
  • de-DE
  • en-GB
  • en-US
  • fi-FI
  • nn-NO
  • nn-NB
  • sv-SE
  • Annet språk
Fler språk
Utmatningsformat
  • html
  • text
  • asciidoc
  • rtf