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
Lab-STICC - Laboratoire des sciences et techniques de l'information, de la communication et de la connaissance, UBO - Université de Brest
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
Type de document :
Communication dans un congrès
INFORMS, Nov 2015, Philadelphia, United States
Liste complète des métadonnées
http://hal.univ-brest.fr/hal-01198391
Contributeur : Laurent Lemarchand <>
Soumis le : samedi 12 septembre 2015 - 10:11:09
Dernière modification le : mardi 16 janvier 2018 - 15:54:23

Identifiants

  • HAL Id : hal-01198391, version 1

Collections

UNIV-BREST | ENIB | LAB-STICC_ENIB | LAB-STICC | LAB-STICC_UBO

Citation

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

Exporter

BibTeX TEI DC DCterms EndNote

Partager

Métriques

Consultations de la notice

110

Contact

support.ccsd.cnrs.fr
hal.support@ccsd.cnrs.fr
Logo CCSD