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
How does different algorithm work when applied on the different road networks when optimal location of facilities is searched for in rural areas?
Dalarna University, School of Technology and Business Studies, Computer Engineering.ORCID iD: 0000-0003-1015-8015
Dalarna University, School of Technology and Business Studies, Statistics.
Dalarna University, School of Technology and Business Studies, Human Geography.ORCID iD: 0000-0003-4871-833X
2014 (English)In: Web Information Systems Engineering – WISE 2013 Workshops: WISE 2013 International Workshops BigWebData, MBC, PCS, STeH, QUAT, SCEH, and STSC 2013, Nanjing, China, October 13-15, 2013, Revised Selected Papers / [ed] Zhisheng Huang, Chengfei Liu, Jing He, Guangyan Huang, Berlin: Springer Berlin/Heidelberg, 2014, Vol. 8182, 284-291 p.Conference paper, Published paper (Refereed)
Abstract [en]

The p-median problem is often used to locate P service facilities in a geographically distributed population. Important for the performance of such a model is the distance measure. The first aim in this study is to analyze how the optimal location solutions vary, using the p-median model, when the road network is alternated. It is hard to find an exact optimal solution for p-median problems. Therefore, in this study two heuristic solutions are applied, simulating annealing and a classic heuristic. The secondary aim is to compare the optimal location solutions using different algorithms for large p-median problem. The investigation is conducted by the means of a case study in a rural region with a. asymmetrically distributed population, Dalecarlia. The study shows that the use of more accurate road networks gives better solutions for optimal location, regardless what algorithm that is used and regardless how many service facilities that is opt for. It is also shown that the Simulating annealing algorithm not just is much faster than the classic heuristic used here, but also in most cases gives better solutions.

Place, publisher, year, edition, pages
Berlin: Springer Berlin/Heidelberg, 2014. Vol. 8182, 284-291 p.
Series
Lecture Notes in Computer Science, ISSN 0302-9743 ; 8182
Keyword [en]
road network effect, p-median problem, simulated annealing heuristics, complex problem
National Category
Electrical Engineering, Electronic Engineering, Information Engineering
Research subject
Complex Systems – Microdata Analysis
Identifiers
URN: urn:nbn:se:du-18629DOI: 10.1007/978-3-642-54370-8_24ISI: 000337296200024ISBN: 978-3-642-54370-8 (print)ISBN: 978-3-642-54369-2 (print)OAI: oai:DiVA.org:du-18629DiVA: diva2:838743
Conference
14th International Conference on Web Information Systems Engineering (WISE), OCT 13-15, 2013, Nanjing, PEOPLES R CHINA
Available from: 2015-07-01 Created: 2015-06-29 Last updated: 2017-03-30Bibliographically approved

Open Access in DiVA

No full text

Other links

Publisher's full text

Search in DiVA

By author/editor
Rebreyend, PascalHan, MengjieHåkansson, Johan
By organisation
Computer EngineeringStatisticsHuman Geography
Electrical Engineering, Electronic Engineering, Information Engineering

Search outside of DiVA

GoogleGoogle Scholar

Altmetric score

Total: 483 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