Finding K shortest looping paths with waiting time in a time-window network

Applied Mathematical Modelling

Volumn 30, Issue 5, 2006, Pages 458-465

  Yang, Hsu Hao ^a   Chen, Yen Liang ^b  

^a NATIONAL CHIN YI UNIVERSITY OF TECHNOLOGY   (Taiwan)

^b NATIONAL CENTRAL UNIVERSITY   (Taiwan)

Author keywords

Shortest looping path; Time window

Indexed keywords

ALGORITHMS; COMPUTATIONAL COMPLEXITY; POLYNOMIALS;

SHORTEST LOOPING PATH; TIME WINDOW;

MATHEMATICAL MODELS;

ALGORITHMS; COMPUTATIONAL COMPLEXITY; MATHEMATICAL MODELS; POLYNOMIALS;

EID: 33144486944     PISSN: 0307904X     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.apm.2005.05.005     Document Type: Article

References (24)

1. M. Desrochers J. Desrosiers M.M. Solomon A new optimization algorithm for the vehicle routing problem with time windows Oper. Res. 40 1992 342-354
2. Y. Dumas J. Desrosiers E. Gelinas M.M. Solomon An optimal algorithm for the traveling salesman problem with time windows Oper. Res. 43 1995 367-371
3. N. Kohl O.B.G. Madsen An optimization algorithm for the vehicle routing problem with time windows based on lagrangian relaxation Oper. Res. 45 1997 395-406
4. J. Bramel D. Simchilevi Probabilistic analyses and practical algorithms for the vehicle routing problem with time windows Oper. Res. 44 1996 501-509
5. R.A. Russell Hybrid heuristics for the vehicle-routing problem with time windows Transport Sci. 29 1996 156-166
6. N. Balakrishnan Simple heuristics for the vehicle routing problem with soft time windows J. Oper. Res. Soc. 44 1993 279-287
7. Y.-L. Chen H.-H. Yang Finding the first k shortest paths in a time-window network Comput. Oper. Res. 31 2004 499-513
8. J.Y. Yen Finding the k shortest loopless paths in a network Manage. Sci. 17 1971 712-716
9. N. Katoh T. Ibaraki H. Mine An efficient algorithm for k shortest simple paths Networks 12 1982 411-427
10. E. Hadjiconstantinou N. Christofides An efficient implementation of an algorithm for finding k shortest simple paths Networks 34 1999 88-101
11. Y.-L. Chen D. Rinks K. Tang The first k minimum cost paths in a time-schedule network J. Oper. Res. Soc. 52 2001 102-108
12. S. Dreyfus An appraisal of some shortest path algorithms Oper. Res. 17 1969 395-412
13. B.L. Fox Data structures and computer science techniques in operations research Oper. Res. 26 1978 686-717
14. E.Q.V. Martins An algorithm for ranking paths that may contain cycles Eur. J. Oper. Res. 18 1984 123-130
15. J.A. Azevedo M.E.O. Santos Costa J.J.E.R. Silvestre Madeira E.Q.V. Martins An algorithm for the ranking of shortest paths Eur. J. Oper. Res. 69 1993 97-106
16. D. Villeneuve G. Desaulniers The shortest path problem with forbidden paths Eur. J. Oper. Res. 165 2004 97-107
17. H.-H. Yang Y.-L. Chen Finding k shortest looping paths in a traffic-light network Comput. Oper. Res. 32 2005 571-581
18. D. Eppstein Finding the k shortest paths SIAM J. Comput. 28 1998 652-673
19. V.M. Jiménez A. Marzal A lazy version of Eppstein's k shortest paths algorithm Lect. Notes Comput. Sci. 2647 2003 179-191
20. H.-H. Yang Y.-L. Chen The first k shortest unique-arc walks in a traffic-light network Math. Comput. Model. 40 2004 1453-1464
21. E. Ruppert Finding the k shortest paths in parallel Algorithmica 28 2000 242-254
22. N.J. van der Zijpp S. Fiorenzo Catalano Path enumeration by finding the constrained k-shortest paths Transport Res. B 39 2005 545-563
23. Y.-L. Chen H.-H. Yang Shortest paths in traffic-light networks Transport Res. B 34 2000 241-253
24. M.L. Fredman R.E. Tarjan Fibonacci heaps and their uses in improved network optimization algorithms J. ACM 34 1987 596-615