Skip to Main content Skip to Navigation
Conference papers

Testing Algorithm For Large P-median Problems In Heterogenous Road Networks

Pascal Rebreyend 1 Laurent Lemarchand 2
1 Hogskolan Dalarna
2 Lab-STICC_UBO_CACS_MOCS
UBO - Université de Brest, Lab-STICC - Laboratoire des sciences et techniques de l'information, de la communication et de la connaissance
Abstract : This paper presents and compares different algorithms on large scale p-median problems, up to 2000 candidate nodes. Our main focus is instances where the demand is asymmetric distributed. We use as real data the Swedish road network including distances and as demand points the location of Swedish citizens as our experimental context. Tested methods simulated annealing, volume algorithm and Cplex. Our new hybrid genetic approach outperforms other existing approaches on large instances.
Keywords : P-median problem genetic algoritms large scale instances linear programming
Document type :
Conference papers
Complete list of metadata
https://hal.univ-brest.fr/hal-01198391
Contributor : Laurent Lemarchand Connect in order to contact the contributor
Submitted on : Saturday, September 12, 2015 - 10:11:09 AM
Last modification on : Monday, October 11, 2021 - 2:23:12 PM

Identifiers

  • HAL Id : hal-01198391, version 1

Collections

UNIV-BREST | CNRS | INSTITUT-TELECOM | ENIB | LAB-STICC_ENIB | LAB-STICC | LAB-STICC_UBO | IBNM

Citation

Pascal Rebreyend, Laurent Lemarchand. Testing Algorithm For Large P-median Problems In Heterogenous Road Networks. INFORMS, Nov 2015, Philadelphia, United States. ⟨hal-01198391⟩

Export

BibTeX TEI DC DCterms EndNote

Share

Metrics

Record views

213