A metaheuristic for the vehicle-routeing problem with soft time windows

Journal of the Operational Research Society

Volumn 55, Issue 12, 2004, Pages 1298-1310

  Chiang, W C ^a   Russell, R A ^a  

^a UNIVERSITY OF TULSA   (United States)

Author keywords

Logistics; Metaheuristics; Vehicle routeing

Indexed keywords

CONSTRAINT THEORY; COST EFFECTIVENESS; HEURISTIC METHODS; LOGISTICS; PROBLEM SOLVING; TRAFFIC CONTROL;

METAHEURISTICS; MIXED NEIGHBOURHOOD STRUCTURE; SOFT TIME WINDOWS; VEHICLE ROUTEING;

SCHEDULING;

EID: 9744257014     PISSN: 01605682     EISSN: None     Source Type: Journal    
DOI: 10.1057/palgrave.jors.2601791     Document Type: Article

References (18)

1. Chiang WC and Russell RA (2004). Integrating purchasing and routeing in a propane gas supply chain. Eur J Opl Res 154: 710-729.
2. Solomon MM and Desrosiers J (1988). Time window constrained routeing and scheduling problems. Trans Sci 22: 1-13.
3. Desrosiers J, Dumas Y, Solomon MM and Soumis F (1995). Time constrained routing and scheduling. In: Ball MO, Magnanti TL, Monma CL and Nemhauser EL (eds). Handbooks in Operations Research and Management Sciences, Volume 8: Network Routeing. North-Holland: Amsterdam, pp. 35-139.
4. Taillard E et al (1997). A tabu search heuristic for the vehicle routeing problem with soft time windows. Trans Sci 31: 170-186.
5. Sexton T and Choi Y (1986). Pickup and delivery of partial loads with soft time windows. Am J Math Mgmt Sci 6: 369-398.
6. Ferland JA and Fortin L (1989). Vehicle routeing with sliding time-windows. Eur J Opl Res 38: 213-226.
7. Koskosidis YA, Powell WB and Solomon MM (1992). An optimization based heuristic for vehicle routeing and scheduling with soft time window constraints. Trans Sci 26: 69- 85.
8. Balakrishnan N (1993). Simple heuristics for the vehicle routeing problem with soft time 'windows. J Opl Res Soc 44: 279-287.
9. Clarke G and Wright JW (1964). Scheduling of vehicles from a central depot to a number of delivery points. Opns Res 12: 568-589.
10. Solomon MM (1987). Algorithms for the vehicle routeing and scheduling problems with time window constraints. Opns Res 35: 254-265.
11. Lin S and Kernighan B (1973). An effective heuristic algorithm for the traveling salesman problem. Opns Res 21: 498-516.
12. Osman H (1993). Metastrategy simulated annealing and tabu search algorithms for the vehicle routeing problem. Ann Opns Res 41: 421-451.
13. Xu J, Chin SY and Glover F. (1999). Optimizing a ring-based private line telecommunication network using tabu search. Mgt Sci 45: 330-345.
14. Chiang WC and Russell RA (1997). A reactive tabu search metaheuristic for the vehicle routeing problem with time windows. INFORMS J Comput 9: 417-430.
15. Russell RA (1977). An effective heuristic for the M-tour traveling salesman problem with some side conditions. Opns Res 25: 517-524.
16. Rochat Y and Taillard ED (1995). Probabilistic diversication and intensication in local search for vehicle routing. J Heuristics 1: 147-167.
17. Thangiah SR, Ibrahim HO and long S (1995). Metaheuristics for Vehicle Routing Problems with Time Windows. Research Report No: UKC/IMS/OR94/8, Institute of Mathematics and Statistics. University of Kent.
18. Bräysy O (2001). Local search and variable neighborhood search algorithms for the vehicle routing problems with time windows. Mathematics 8. Operations Research. Acta Wasaensia 87.