On-line vehicle routing with time windows: Optimization-based heuristics approach for freight demands requested in real-time

Transportation Research Record

Volumn , Issue 1617, 1998, Pages 171-178

  Shieh, How Ming ^a   May, Ming Der ^a  

^a NATIONAL CENTRAL UNIVERSITY   (Taiwan)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; HEURISTIC METHODS; MATHEMATICAL MODELS; OPTIMIZATION; TRAVELING SALESMAN PROBLEM; VEHICLE LOCATING SYSTEMS; VEHICLES;

ONLINE ALGORITHM; ONLINE VEHICLE ROUTING; TIME WINDOWS;

TRANSPORTATION ROUTES;

EID: 0032155806     PISSN: 03611981     EISSN: None     Source Type: Journal    
DOI: 10.3141/1617-24     Document Type: Article

References (12)

1. Psaraftis, H. N. Dynamic Vehicle-Routing - Status and Prospects. Annals of Operations Research, Vol. 61, 1995, pp. 143-164.
2. Solomon, M. M. Algorithms for the Vehicle Routing and Scheduling Problems with Time Window Constraints. Operations Research, Vol. 35, No. 2, 1987, pp 254-265.
3. Regan, A. C., H. S. Mahmassani, and P. Jaillet. Improving Efficiency of Commercial Vehicle Operations Using Real-Time Information: Potential Uses and Assignment Strategies. In Transportation Research Record 1493, TRB, National Research Council, Washington, D.C., 1995, pp. 188-198.
4. Regan, A. C., H. S. Mahmassani, and P. Jaillet. Dynamic Decision Making for Commercial Fleet Operations Using Real-Time Information. In Transportation Research Record 1537, TRB, National Research Council, Washington, D.C., 1996, pp 91-97.
5. Psaraftis, H. N. Dynamic Vehicle Routing Problems. In Vehicle Routing: Methods and Studies (B. L. Golden and A. A. Assad, eds.), North Holland, Amsterdam, 1988, pp. 223-248.
6. Bertsimas, D. J., and G. van Ryzin. A Stochastic and Dynamic Vehicle Routing Problem in the Euclidean Plane. Operations Research, Vol. 39, No. 4, 1991, pp. 601-615.
7. Hall, R. W. Pickup and Delivery Systems for Overnight Carriers. Transportarion Research, Vol. 30A, No. 3, 1996, pp. 173-187.
8. Sgall, J. Randomized On-Line Scheduling of Parallel Jobs. Journal of Algorithms, Vol. 21, No. 1, 1996, pp. 149-175.
9. Dean T. L., and M. Boddy. An Analysis of Time-Dependent Planning. Proc., 7th National Conference on Artificial Intelligence, Minneapolis, Minn., 1988, pp. 49-54.
10. Zilberstein, S., and S. Russell. Optimal Composition of Real-Time Systems. Artificial Intelligence, Vol. 82. No. 1, 1996, pp. 181-213.
11. Or, I. Traveling Salesman - Type Combinatorial Problems and Their Relation to the Logistics of Blood Banking. Ph.D. dissertation. Department of Industrial Engineering and Management Science, Northwestern University, Evanston, III., 1976.
12. Rochat, Y., and E. Taillard. Probabilistic Diversification and Intensification in Local Search for Vehicle Routing. Journal of Heuristics, Vol. 1, No. 1, 1995, pp. 147-167.