On the generalized elementary shortest path problem: A heuristic approach

Electronic Notes in Discrete Mathematics

Volumn 41, Issue , 2013, Pages 503-510

  Guerrero, W J ^a,b   Velasco, N ^a,b   Prodhon, C ^b   Amaya, C A ^a  

^a UNIVERSIDAD DE LOS ANDES   (Colombia)

^b UNIVERSITÉ DE TECHNOLOGIE DE TROYES   (France)

Author keywords

Elementary shortest path problem; Labeling algorithm

Indexed keywords

EID: 84879701925     PISSN: None     EISSN: 15710653     Source Type: Journal    
DOI: 10.1016/j.endm.2013.05.131     Document Type: Article

References (10)

1. Baldacci R., Bartolini E., Laporte G. Some applications of the generalized vehicle routing problem. Journal of the Operational Research Society 2010, 61(7):1072-1077.
2. Bellman R. On a routing problem. Quarterly of Applied Mathematics 1958, 16(1):89-90.
3. Cormen Thomas H., Leiserson Charles E., Rivest Ronald L., Stein Clifford Introduction to algorithms 2001, MIT Press, Cambridge, MA, USA. 2nd edition.
4. Current J.R., Revelle C.S., Cohon J.L. The median shortest path problem: A multiobjective approach to analyze cost vs. accessibility in the design of transportation networks. Transportation Science 1987, 21(3):188-197.
5. Dijkstra E.W. A note on two problems in connexion with graphs. Numerische Mathematik 1959, 1(1):269-271.
6. Feillet D., Dejax P., Gendreau M. Traveling salesman problems with profits. Transportation Science 2005, 39(2):188-205.
7. Feillet D., Dejax P., Gendreau M., Gueguen C. An exact algorithm for the elementary shortest path problem with resource constraints: Application to some vehicle routing problems. Networks 2004, 44(3):216-229.
8. Labbé M., Laporte G., Rodríguez-Martín I., Salazar González J.J. Locating median cycles in networks. European Journal of Operational Research 2005, 160(2):457-470.
9. Miller C.E., Tucker A.W., Zemlin R.A. Integer programming formulation of traveling salesman problems. J. ACM 1960, 7(4):326-329.
10. Tricoire F., Romauch M., Doerner K.F., Hartl R.F. Heuristics for the multi-period orienteering problem with multiple time windows. Computers & Operations Research 2010, 37(2):351-367.