Testing Algorithm For Large P-median Problems In Heterogenous Road Networks - Université de Bretagne Occidentale Access content directly
Conference Papers Year : 2015

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

Pascal Rebreyend
Laurent Lemarchand

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.
No file

Dates and versions

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

Identifiers

  • HAL Id : hal-01198391 , version 1

Cite

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

Share

Gmail Mastodon Facebook X LinkedIn More