du.sePublikationer
Ändra sökning
RefereraExporteraLänk till posten
Permanent länk

Direktlänk
Referera
Referensformat
  • apa
  • ieee
  • modern-language-association-8th-edition
  • vancouver
  • chicago-author-date
  • chicago-note-bibliography
  • Annat format
Fler format
Språk
  • de-DE
  • en-GB
  • en-US
  • fi-FI
  • nn-NO
  • nn-NB
  • sv-SE
  • Annat språk
Fler språk
Utmatningsformat
  • 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?
Högskolan Dalarna, Akademin Industri och samhälle, Datateknik.ORCID-id: 0000-0003-1015-8015
Högskolan Dalarna, Akademin Industri och samhälle, Statistik.ORCID-id: 0000-0003-4212-8582
Högskolan Dalarna, Akademin Industri och samhälle, Kulturgeografi.ORCID-id: 0000-0003-4871-833X
2014 (Engelska)Ingår i: 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, s. 284-291Konferensbidrag, Publicerat paper (Refereegranskat)
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.

Ort, förlag, år, upplaga, sidor
Berlin: Springer Berlin/Heidelberg, 2014. Vol. 8182, s. 284-291
Serie
Lecture Notes in Computer Science, ISSN 0302-9743 ; 8182
Nyckelord [en]
road network effect, p-median problem, simulated annealing heuristics, complex problem
Nationell ämneskategori
Elektroteknik och elektronik
Forskningsämne
Komplexa system - mikrodataanalys
Identifikatorer
URN: urn:nbn:se:du-18629DOI: 10.1007/978-3-642-54370-8_24ISI: 000337296200024ISBN: 978-3-642-54370-8 (tryckt)ISBN: 978-3-642-54369-2 (tryckt)OAI: oai:DiVA.org:du-18629DiVA, id: diva2:838743
Konferens
14th International Conference on Web Information Systems Engineering (WISE), OCT 13-15, 2013, Nanjing, PEOPLES R CHINA
Tillgänglig från: 2015-07-01 Skapad: 2015-06-29 Senast uppdaterad: 2019-08-26Bibliografiskt granskad

Open Access i DiVA

Fulltext saknas i DiVA

Övriga länkar

Förlagets fulltext

Personposter BETA

Rebreyend, PascalHåkansson, Johan

Sök vidare i DiVA

Av författaren/redaktören
Rebreyend, PascalHan, MengjieHåkansson, Johan
Av organisationen
DatateknikStatistikKulturgeografi
Elektroteknik och elektronik

Sök vidare utanför DiVA

GoogleGoogle Scholar

doi
isbn
urn-nbn

Altmetricpoäng

doi
isbn
urn-nbn
Totalt: 606 träffar
RefereraExporteraLänk till posten
Permanent länk

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