Testing Algorithm For Large P-median Problems In Heterogenous Road Networks - Université de Bretagne Occidentale
Communication Dans Un Congrès Année : 2015

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

Pascal Rebreyend
Laurent Lemarchand

Résumé

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.
Fichier non déposé

Dates et versions

hal-01198391 , version 1 (12-09-2015)

Identifiants

  • HAL Id : hal-01198391 , version 1

Citer

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

Partager

More