Dalarna University's logo and link to the university's website

du.sePublications
Change search
CiteExportLink to record
Permanent link

Direct link
Cite
Citation style
  • apa
  • ieee
  • modern-language-association-8th-edition
  • vancouver
  • chicago-author-date
  • chicago-note-bibliography
  • Other style
More styles
Language
  • de-DE
  • en-GB
  • en-US
  • fi-FI
  • nn-NO
  • nn-NB
  • sv-SE
  • Other locale
More languages
Output format
  • html
  • text
  • asciidoc
  • rtf
Distance measure and the p-median problem in rural areas
Dalarna University, School of Technology and Business Studies, Statistics.ORCID iD: 0000-0003-2317-9157
Dalarna University, School of Technology and Business Studies, Statistics.ORCID iD: 0000-0003-4212-8582
Dalarna University, School of Technology and Business Studies, Information Systems.ORCID iD: 0000-0003-4871-833X
Dalarna University, School of Technology and Business Studies, Computer Engineering.ORCID iD: 0000-0003-1015-8015
2015 (English)In: Annals of Operations Research, ISSN 0254-5330, E-ISSN 1572-9338, Vol. 226, no 1, p. 89-99Article in journal (Refereed) Published
Abstract [en]

The p-median model is used to locate P facilities to serve a geographically distributed population. Conventionally, it is assumed that the population patronize the nearest facility and that the distance between the resident and the facility may be measured by the Euclidean distance. Carling, Han, and Håkansson (2012) compared two network distances with the Euclidean in a rural region with a sparse, heterogeneous network and a non-symmetric distribution of the population. For a coarse network and P small, they found, in contrast to the literature, the Euclidean distance to be problematic. In this paper we extend their work by use of a refined network and study systematically the case when P is of varying size (1-100 facilities). We find that the network distance give as good a solution as the travel-time network. The Euclidean distance gives solutions some 4-10 per cent worse than the network distances, and the solutions tend to deteriorate with increasing P. Our conclusions extend to intra-urban location problems.

Place, publisher, year, edition, pages
Springer, 2015. Vol. 226, no 1, p. 89-99
Keywords [en]
dense network, location model, optimal location, simulated annealing, travel-time, urban areas
National Category
Transport Systems and Logistics
Research subject
Complex Systems – Microdata Analysis, General Microdata Analysis - methods; Complex Systems – Microdata Analysis, General Microdata Analysis - transports
Identifiers
URN: urn:nbn:se:du-14682DOI: 10.1007/s10479-014-1677-4ISI: 000349852400005Scopus ID: 2-s2.0-84922967961OAI: oai:DiVA.org:du-14682DiVA, id: diva2:734606
Available from: 2014-07-18 Created: 2014-07-18 Last updated: 2021-11-12Bibliographically approved

Open Access in DiVA

No full text in DiVA

Other links

Publisher's full textScopus

Authority records

Carling, KennethHåkansson, JohanRebreyend, Pascal

Search in DiVA

By author/editor
Carling, KennethHan, MengjieHåkansson, JohanRebreyend, Pascal
By organisation
StatisticsInformation SystemsComputer Engineering
In the same journal
Annals of Operations Research
Transport Systems and Logistics

Search outside of DiVA

GoogleGoogle Scholar

doi
urn-nbn

Altmetric score

doi
urn-nbn
Total: 1198 hits
CiteExportLink to record
Permanent link

Direct link
Cite
Citation style
  • apa
  • ieee
  • modern-language-association-8th-edition
  • vancouver
  • chicago-author-date
  • chicago-note-bibliography
  • Other style
More styles
Language
  • de-DE
  • en-GB
  • en-US
  • fi-FI
  • nn-NO
  • nn-NB
  • sv-SE
  • Other locale
More languages
Output format
  • html
  • text
  • asciidoc
  • rtf