A spatial and temporal bi-criteria parallel-savings-based heuristic algorithm for solving vehicle routing problems with time windows

Transportation Planning and Technology

Volumn 20, Issue 2, 1997, Pages 163-181

  Tzeng, Gwo Hshiung ^a   Huang, Wen Chang ^a   Teodorovic, Dusan ^b  

^a NATIONAL CHIAO TUNG UNIVERSITY   (Taiwan)

^b UNIVERSITY OF BELGRADE   (Serbia)

Author keywords

Bi criteria; Heuristic algorithm; Parallel savings; Time windows; Vehicle routing problem

Indexed keywords

CONVERGENCE OF NUMERICAL METHODS; COST EFFECTIVENESS; HEURISTIC PROGRAMMING; PARALLEL ALGORITHMS; PROBLEM SOLVING;

BICRITERIA PARALLEL SAVINGS BASED HEURISTIC PROGRAMMING; INSERTION METHOD; TIME WINDOWS;

TRANSPORTATION ROUTES;

HEURISTIC ALGORITHM; METHODOLOGICAL EVALUATION; ROUTING PROBLEM; TIME WINDOW; TRANSPORT PLANNING; VEHICLE ROUTING;

EID: 5844269966     PISSN: 03081060     EISSN: None     Source Type: Journal    
DOI: 10.1080/03081069708717586     Document Type: Article

References (16)

1. Altinkemer, K. and Gavish, B. L. (1991) "Parallel Savings based Heuristics for The Delivery Problem", Operations Research, 39, 456-469.
2. Baker, E. K. and Schaffer, J. R. (1986) "Solution Improvement Heuristics for the Vehicle Routing and Scheduling Problem with Time Window Constraints", American Journal of Mathematical and Management Sciences, 6, 261-300.
3. Burkard, R. E. and Derigs, U. (1980) "Assignment and Matching Problems: Solution Methods with FORTRAN-Programs", Lecture Notes in Economics and Mathematical Systems, Springer Verlag, No. 184.
4. Clarke, G. and Eright, J. W. (1964) "Scheduling Vehicles from a Central Delivery Depot to a Number of Delivery Points", Operational Research Quarterly, 12, 568-581.
5. Desrochers, M., Lenstra, J. K., Savelsbergh, M. W. P. and Soumis, F. (1988) "Vehicle Routing with Time Windows: Optimization and Approximation", Vehicle Routing: Methods and Studies, B. L. Golden and A. A. Assad (Editors), Elsevier Science Publishers B.V., 65-84.
6. Golden, B. (1976) "Shortest Path Algorithms: a Comparison", Operations Research, 24, 1164-1168.
7. Golden, B. (1977) "Evaluating a Sequential Vehicle Routing Algorithm", AIIE Transactions, 9, 204-208.
8. Golden, B. and Assad, A. A. (1986) "Vehicle Routing with Time Window Constraints", American Journal of Mathematical and Management Science, 6, 251-260.
9. Kolen, A., Rinnooy Kan, A. and Trienkekens, H. (1987) "Vehicle Routing with Time Windows", Operations Research, 35, 266-273.
10. Koskosidis, Y., Powell, W. and Solomon, M. (1992) "An Optimization Based Heuristic for Vehicle Routing and Scheduling with Soft Time Window Constraints", Transportation Science, 26, 69-85.
11. Mole, R. H. and Janeson, S. R. (1976) "A Sequential Route-builting Algorithm Employing Generalized Savings Criterion", Operational Research Quarterly, 27, 503-511.
12. Solomon, M. M. (1986) "On the Worst-case Performance of Some Heuristics for the Vehicle Routing and Scheduling Problem with Time Window Constraints", Networks, 16, 161-174.
13. Solomon, M. M. (1987) "Algorithms for the Vehicle Routing and Scheduling Problems with Time Window Constraints", Operations Research, 35, 254-265.
14. Teodorovic, D., Kikuchi, S. and Hohlacov, D. (1991) "A Routing and Scheduling Method in Considering Trade-off Between the User's and the Operator's Objectives", Transportation Planning and Technology, 16, 63-75.
15. Van Landeghem, H. R. G. V. (1988) "A Bi-criteria Heuristic for the Vehicle Routing Problem with Time Windows", European Journal of Operational Research, 36, 217-226.
16. Yellow, P. C. (1970) "A Computational Modification to the Savings Method of Vehicle Scheduling", Operational Research Quarterly, 21, 281-283.