Minimization of travel time and weighted number of stops in a traffic-light network

European Journal of Operational Research

Volumn 144, Issue 3, 2003, Pages 565-580

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

^a NATIONAL CENTRAL UNIVERSITY   (Taiwan)

^b NATIONAL CHIN YI UNIVERSITY OF TECHNOLOGY   (Taiwan)

Author keywords

Road network; Shortest path; Time window; Traffic light

Indexed keywords

COMPUTER SIMULATION; MATHEMATICAL MODELS; MATHEMATICAL TRANSFORMATIONS; OPTIMIZATION; TRAFFIC CONTROL;

TRAFFIC-LIGHT NETWORKS;

PROBLEM SOLVING;

EID: 0037290076     PISSN: 03772217     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0377-2217(02)00148-0     Document Type: Article

References (20)

1. Ahuja R.K., Magnanti T.L., Orlin J.B. Network Flows: Theory, Algorithms, and Applications. 1993;Prentice-Hall, Englewood Cliffs, NJ.
2. Baker E. Vehicle routing with time window constraints. Logistics & Transportation Review. 18:1982;385-401.
3. Baker E. An exact algorithm for the time-constrained traveling salesman problem. Operations Research. 31:1983;938-945.
4. Balakrishnan N. Simple heuristics for the vehicle routing problem with soft time windows. Journal of the Operational Research Society. 44:1993;279-287.
5. Bodin L.D., Golden B.L., Assad A.A., Ball M.O. Routing and scheduling of vehicles and crews: The state of the art. Computers & Operations Research. 10:1982;63-211.
6. Bramel J., Simchilevi D. Probabilistic analyses and practical algorithms for the vehicle routing problem with time windows. Operations Research. 44:1996;501-509.
7. Chen Y.L., Tang K. Shortest paths in time-schedule networks. International Journal of Operations and Quantitative Management. 3:1997;157-173.
8. Chen Y.L., Tang K. Minimal time paths in a network with mixed time constraints. Computers & Operations Research. 25:1998;793-805.
9. Chen Y.L., Tang K. The first k minimum cost paths in a time-schedule network. Journal of Operational Research Society. 52:2001;102-108.
10. Chen Y.L., Yang H.H. Shortest paths in traffic-light networks. Transportation Research B. 34:2000;241-253.
11. Deo N., Pang C. Shortest path algorithms: Taxonomy and annotation. Networks. 14:1984;275-323.
12. Desrochers M., Soumis F. A reoptimization algorithm for the shortest path problem with time windows. European Journal of Operational Research. 35:1988;242-254.
13. Dijkstra E.W. A note on two problems in connection with graphs. Numerische Mathematik. 1:1959;269-271.
14. Dumas Y., Desrosiers J., Gelinas E., Solomon M. An optimal algorithm for the traveling salesman problem with time windows. Operations Research. 43:1995;367-371.
15. Dumas Y., Desrosiers J., Soumis F. The pickup and delivery problem with time windows. European Journal of Operational Research. 54:1991;7-22.
16. Fredman M.L., Tarjan R.E. Fibonacci heaps and their uses in improved network optimization algorithms. Journal of the ACM. 34:1987;596-615.
17. Fu L., Rilett L.R. Expected shortest paths in dynamic and stochastic traffic networks. Transportation Research B. 32:1998;499-516.
18. Golden B.L., Magnanti T.L. Deterministic network optimization: A bibliography. Networks. 7:1977;149-183.
19. Kolen A.W.J., Kan A.H.G.R., Trienekens H.W.J.M. Vehicle routing with time windows. Operations Research. 35:1987;266-273.
20. Russell R.A. Hybrid heuristics for the vehicle-routing problem with time windows. Transportation Sciences. 29:1995;156-166.