Plus court chemin avec dépendance horaire : résolution et application aux problèmes de tournées

M. Haouari; P. Dejax

RAIRO - Operations Research - Recherche Opérationnelle (1997)

  • Volume: 31, Issue: 2, page 117-131
  • ISSN: 0399-0559

How to cite

top

Haouari, M., and Dejax, P.. "Plus court chemin avec dépendance horaire : résolution et application aux problèmes de tournées." RAIRO - Operations Research - Recherche Opérationnelle 31.2 (1997): 117-131. <http://eudml.org/doc/105145>.

@article{Haouari1997,
author = {Haouari, M., Dejax, P.},
journal = {RAIRO - Operations Research - Recherche Opérationnelle},
keywords = {column generation; branch-and-bound; Lagrangian relaxation; time dependent shortest path problem; time windows constraints; knapsack type constraint; time dependent vehicle routing},
language = {fre},
number = {2},
pages = {117-131},
publisher = {EDP-Sciences},
title = {Plus court chemin avec dépendance horaire : résolution et application aux problèmes de tournées},
url = {http://eudml.org/doc/105145},
volume = {31},
year = {1997},
}

TY - JOUR
AU - Haouari, M.
AU - Dejax, P.
TI - Plus court chemin avec dépendance horaire : résolution et application aux problèmes de tournées
JO - RAIRO - Operations Research - Recherche Opérationnelle
PY - 1997
PB - EDP-Sciences
VL - 31
IS - 2
SP - 117
EP - 131
LA - fre
KW - column generation; branch-and-bound; Lagrangian relaxation; time dependent shortest path problem; time windows constraints; knapsack type constraint; time dependent vehicle routing
UR - http://eudml.org/doc/105145
ER -

References

top
  1. 1. K. L. COOK et E. HALSEY, The Shortest Route Through a Network with Time Dependent Internodal Transit Times, Journal of Mathematical Analysis and Applications, vol. 14, 1966, p. 493-498. Zbl0173.47601MR192921
  2. 2. A. DE PALMA, P. HANSEN et M. LABBÉ, Commuter's Paths with Penalties for Early or Late Arrival Time, CORE Discussion Paper n° 8712, 1987. Zbl0724.90075
  3. 3. J. P. DESROSIERS et F. PELLETIER, F. SOUMIS, Plus court chemin avec contraintes d'Horaires, RAIRO, Recherche Opérationnelle, vol. 17, 1983, p. 1-21. Zbl0528.90082
  4. 4. S. E. DREYFUS, An Appraisal of Some Shortest Path Algorithms, Operations Research, vol. 17, 1968, p. 395-412. Zbl0172.44202
  5. 5. M. GONDRAN et M. MINOUX, Graphes et Algorithmes, Eyrolles, Paris, 1986. Zbl0497.05023MR868083
  6. 6. R. W. HALL, The Fastest Path Through a Network with Random Time-Dependent Travel Times, Transportation Science, vol 20, 1986, p. 182-188. 
  7. 7. J. HALPERN et I. PRIESS, Shortest Path with Time Constraints on Mouvement and Parking, Network, vol 4, 1974, p. 241-253. Zbl0284.90077MR347378
  8. 8. G. Y. HANDLER et I. ZANG, A Dual Algorithm for the Constrained Shortest Path Problem, Networks, vol 10, 1980, p. 293-310. Zbl0453.68033MR597270
  9. 9. H. C. JOKSCH, The Shortest Route with Constraints, Journal of Mathematical.Analysis and Applications, vol. 14, 1966, p. 191-197. Zbl0135.20506MR192923
  10. 10. C. MALANDRAKI, Time Dependent Vehicle Routing Problems: Formulations, Solution Algorithms and Computational Experiments, Thèse de Ph. D., Northwestern University, Evanston, Illinois, 1989. Zbl0758.90029
  11. 11. M. MINOUX, Plus court chemin avec contraintes : algorithmes et application, Annales des Télécommunications, vol 30, 1975, p. 383-394. Zbl0347.90065
  12. 12. M. MINOUX, Structures algébriques généralisées des problèmes de cheminement dans les graphes : théorèmes, algorithmes, et applications, RAIRO, Recherche Opérationnelle, vol. 10, 1976, p. 33-62. Zbl0337.05122MR446463
  13. 13. M. MINOUX, Résolution des problèmes de grandes dimensions : programmation linéaire généralisée et techniques de décomposition, in Programmation Mathématique, Tome 2, Dunod, Paris, 1983, p. 55-105. 
  14. 14. C. RIBEIRO, M. MINOUX et M. PENNA, An Optimal Column Generation with Ranking Algorithm for Very Large S cale Set Partitionning Problems in Traffic Assignement, European Journal of Operation Research, vol. 41, 1989, p. 232-239. Zbl0679.90043MR1010320

NotesEmbed ?

top

You must be logged in to post comments.

To embed these notes on your page include the following JavaScript code on your page where you want the notes to appear.

Only the controls for the widget will be shown in your chosen language. Notes will be shown in their authored language.

Tells the widget how many notes to show per page. You can cycle through additional notes using the next and previous controls.

    
                

                
Note: Best practice suggests putting the JavaScript code just before the closing </body> tag.