An exchange heuristic for routeing problems with time windows

Journal of the Operational Research Society

Volumn 46, Issue 12, 1995, Pages 1433-1446

  Potvin, Jean Yves ^a   Rousseau, Jean Marc ^a  

^a UNIVERSITÉ DE MONTRÉAL   (Canada)

Author keywords

Heuristics; Time windows; Vehicle routeing

Indexed keywords

COSTS; GROUND VEHICLES; OPTIMIZATION; SCHEDULING; TRANSPORTATION ROUTES;

EXCHANGE HEURISTICS; TIME WINDOWS; VEHICLE ROUTEING;

HEURISTIC METHODS;

EID: 0029492327     PISSN: 01605682     EISSN: 14769360     Source Type: Journal    
DOI: 10.1057/jors.1995.204     Document Type: Article

References (14)

1. L. Bodin, B. Golden, A. Assad and M. Ball (1983) Routing and scheduling of vehicles and crews: the state of the art. Comps & Opns Res. 10 (2), 63-211.
2. M. M. Solomon (1987) Algorithms for the vehicle routing and scheduling problem with time window constraints. Opns Res. 35, 254-265.
3. J. Y. Potvin and J. M. Rousseau (1993) A parallel route building algorithm for the vehicle routing and scheduling problem with time windows. Eur. J. Opl Res. 66, 331-340.
4. I. Or (1976) Traveling salesman-type combinatorial problems and their relation to the logistics of blood banking. PhD Thesis, Department of Industrial Engineering and Management Sciences, Northwestern University.
5. S. Lin (1965) Computer solutions of the traveling salesman problem. Bell Syst. Tech. J. 44, 2245-2269.
6. D. S. Johnson, C. H. Papadimitriou and M. Yannakakis (1985) How easy is local search? In 26th IEEE Annual Symposium on Foundations of Computer Science pp. 39-42. IEEE Press, New York.
7. M. M. Solomon, E. K. Baker and J. R. Schaffer (1988) Vehicle routing and scheduling problems with time window constraints: efficient implementation of solution improvement procedures. In Vehicle Routing: Methods and Studies. (B. L. Golden and A. A. Assad, Eds) pp. 85-106. North-Holland, Amsterdam.
8. M. W. P. Savelsbergh (1986) Local search in routing problems with time windows. Ann. Opns Res. 4, 285-305.
9. H. N. Psaraftis (1983) fc-Interchange procedures for local search in a precedence-constrained routing problem. Eur. J. Opl Res. 13, 391-402.
10. M. Bellmore and S. Hong (1974) Transformation of multi-salesman problem to the standard traveling salesman problem. J. ACM 21, 500-504.
11. J. Svestka and V. Huckfeldt (1973) Computational experience with an M-salesmen traveling salesman algorithm. Mgmt Sci. 19, 790-799.
12. P. M. Thompson and H. N. Psaraftis (1993) Cyclic transfer algorithms for multivehicle routing and scheduling problems. Opns Res. 41, 935-946.
13. J. Y. Potvin, T. Kervahut, B. L. Garcia and J. M. Rousseau (1993) A tabu search heuristic for the vehicle routing problem with time windows. Technical Report CRT-755, Centre de recherche sur les transports, Universite de Montreal, Montreal, Canada.
14. S. R. Thangiah, I. H. Osman and T. Sun (1994) Hybrid genetic algorithms, simulated annealing and tabu search methods for vehicle routing problems with time windows. Technical report SRU-CpSc-TR-94-27, Slippery Rock University, Slippery Rock, PA.