Iterated local search algorithm based on very large-scale neighborhood for prize-collecting vehicle routing problem

International Journal of Advanced Manufacturing Technology

Volumn 29, Issue 11-12, 2006, Pages 1246-1258

  Tang, Lixin ^a   Wang, Xianpeng ^a  

^a NORTHEASTERN UNIVERSITY   (China)

Author keywords

Cyclic transfer; ILS; PCVRP; VLSN

Indexed keywords

CONSTRAINT THEORY; CUSTOMER SATISFACTION; IRON AND STEEL INDUSTRY; ITERATIVE METHODS; PROBLEM SOLVING;

CYCLIC TRANSFER; ILS; PCVRP; VLSN;

ALGORITHMS;

EID: 33746218072     PISSN: 02683768     EISSN: 14333015     Source Type: Journal    
DOI: 10.1007/s00170-005-0014-0     Document Type: Article

References (30)

1. Laporte G, Mercure H, Nobert Y (1986) An exact algorithm for the asymmetrical capacitated vehicle routing problem. Networks 16:33-46
2. Laporte G, Mercure H, Tailiefer S (1987) A branch and bound algorithm for the asymmetrical distance constrained vehicle routing problem. Math Model 9:857-868
3. Solomon MM (1987) Algorithm for the vehicle routing and scheduling problem with time window constraints, Oper Res 35 (2):254-265
4. Desrochers M, Desrosiers J, Solomon M (1992) A new optimization algorithm for the vehicle routing problem with time windows. Oper Res 40:342-354
5. Koskosidis YA, Powell WB, Solomon MM (1992) An optimization-based heuristic for vehicle routing and scheduling with soft time window constraints, Transport Sci 26:69-85
6. Balas E (1989) The prize collecting travelling salesman problem. Networks 19:621-636
7. Wright JR, Houck MH (1985) An application of systems modeling in steel production scheduling. Engineering Software IV. In: Proceedings of the 4th International Conference. Kensington Exhibition Center, London, England 15:127-140
8. Balas E, Martin C (1991) Combinatorial optimization in steel rolling. In: The DIMACS/RUTCOR Workshop on Combinatorial Optimization in Science and Technology, Rutgers University, New Brunswick, NJ
9. Kosiba ED, Wright JR, Cobbs AE (1992) Discrete event sequencing as a traveling salesman problem. Comput Ind 19:317-327
10. Lopez L, Carter MW, Gendreau M (1998) The hot strip mill production scheduling problem: a tabu search approach. Eur J OperRes 106:317-335
11. Tang LX, Liu JY, Rong AY, Yang ZH (2000) Multiple travelling salesman problem model for hot scheduling in Shanghai Baoshan Iron & Steel Complex. Eur J Oper Res 124:267-282
12. Cowling P (1995) Optimisation in steel hot rolling, Optimization in industry 3. Wiley, Chichester, England, pp 55-66
13. Cowling P (2003) A flexible decision support system for steel hot rolling mill scheduling. Comput Ind Eng 45(2):307-321
14. Butt SE, Cavalier TM (1994) A heuristic for the multiple tour maximum collection problem. Comput Oper Res 21(1):101-111
15. Butt SE, Ryan DM (1999) An optimal solution procedure for the multiple tour maximum collection problem using column generation. Comput Oper Res 26(4):427-441
16. Chao I-M, Golden BL, Wasil EA (1996) The team orienteering problem. Eur J Oper Res 88(3):464-474
17. Laporte G, Mercure H, Nobert Y (1992) A branch and bound algorithm for a class of asymmetrical vehicle routeing problems. J Oper Res Soc 43:469-481
18. Thompson PM, Orlin JB (1989) The theory of cyclic transfers. Oper Res Centre Working Paper, MIT, Cambridge MA
19. Croes GA (1958) A method for solving travelling salesman problems. Oper Res 6:791-812
20. Lin S (1965) Computer solutions to the travelling salesman problem. Bell Syst Tech J 44:2245-2269
21. Lin S, Kernighan BW (1973) An effective heuristic algorithm for the travelling salesman problem. Oper Res 21:498-516
22. Thompson PM, Psaraftis HN (1993) Cyclic transfer algorithms for multivehicle routing and scheduling problems. Oper Res 41:935-946
23. Lau HC, Sim M, Teo KM (2003) Vehicle routing problem with time windows and a limited number of vehicles. Eur J Oper Res 148:559-569
24. Clark G, Wright JW (1964) Scheduling of vehicles from a central depot to a number of delivery points. Oper Res 12:568-581
25. Prosser P, Shaw P (1996) Study of Greedy Search with multiple improvement heuristics for vehicle routing problems. Technical Report RR96/201, Department of Computer Science, University of Strathclyde, Glasgow, Scotland
26. Congram RK (2000) Polynomially searchable exponential neighbourhoods for sequencing problems in combinatorial optimisation. Dissertation, Faculty of Mathematical Studies, University of Southampton
27. Martin O, Otto SW, Felten EW (1992) Large-step Markov chains for the TSP incorporating local search heuristics. Oper Res Lett 11:219-224
28. Lourenço HR, Martin O, Stützte T (2001) A beginner's introduction to iterated local search. In: Proceedings of 4th Metaheuristics International Conference
29. Ahuja RK, Orlin JB, Sharma D (2000) Very large-scale neighbourhood search. Int Trans Oper Res7:301-317
30. Ahuja RK, Ergun Ö, Orlin JB, Punnen AP (2002) A survey of very large-scale neighbourhood search techniques. Discrete Appl Math 123:75-102