Embedded local search approaches for routing optimization

Computers and Operations Research

Volumn 32, Issue 3, 2005, Pages 465-490

  Cowling, P I ^a   Keuthen, R ^b  

^a UNIVERSITY OF BRADFORD   (United Kingdom)

^b UNIVERSITY OF NOTTINGHAM   (United Kingdom)

Author keywords

Iterated local search; Local search; Travelling salesman; Variable neighbourhood search

Indexed keywords

ALGORITHMS; ELECTRONIC EQUIPMENT; EMBEDDED SYSTEMS; HEURISTIC METHODS; MARKOV PROCESSES; MATHEMATICAL MODELS; PERSONNEL; PROBLEM SOLVING;

ITERATED LOCAL SEARCH (ILS); LOCAL SEARCH; TRAVELLING SALESMAN; VARIABLE NEIGHBOURHOOD SEARCH (VNS);

ROUTERS;

EID: 4744371000     PISSN: 03050548     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0305-0548(03)00248-X     Document Type: Article

References (50)

1. Ahmadi J., Grotzinger S., Johnson D. Component allocation and partitioning for a dual delivery placement machine. Operations Research. 36(2):1998;176-191.
2. Ball M., Magazine M. Sequencing of insertion in printed circuit board assembly. Operations Research. 36(2):1989;192-210.
3. Burke EK, Cowling P, Keuthen R. New models and heuristics for component placement in printed circuit board assembly. In: Proceedings of the 1999 International Conference on Information, Intelligence and Systems (ICIIS99), 1999. p. 133-40.
4. Burke EK, Cowling P, Keuthen R. Effective heuristic and metaheuristic approaches to optimize component placement in printed circuit board assembly. In: Proceedings of the Congress on Evolutionary Computation CEC2000, 2000. p. 301-8.
5. Shevell SF, Buzacott JA, Magazine MJ. Simulation and analysis of a circuit board manufacturing facility. In: Proceeding of the 1986 Winter Simulation Conference (December), Washington, DC, 1986. p. 686-93.
6. Hong JM, Lee SH, Lee BH. Hierarchical optimization method in the PCB assembly for surface mounting machines. In: Proceedings of the 1997 IEEE International Symposium on Industrial Electronics, ISIE, 1997. p. 129-34.
7. Lee SH, Hong JM, Kim DW, Lee BH. Effective algorithm for a surface mounting machine in printed circuit board assembly. In: Proceedings of the 1997 IEEE/RSJ International Conference on Intelligent Robot and Systems, 1997. p. 932-7.
8. Burke EK, Cowling P, Keuthen R. The printed circuit board assembly problem: heuristic approaches for multi-headed placement machinery. In: Proceedings of the International Conference on Artificial Intelligence 2001 (IC-AI2001), Las Vegas, Nevada, USA: C.S.R.E.A. Press; 2001.
9. Lawler E.J., Lenstra J.K., Rinnoy Kan A.H.G., Shmoys D.B. The travelling salesman problem: a guided tour of combinatorial optimization. 1985;Wiley, New York.
10. Reinelt G. The travelling salesman: computational solutions for TSP applications. In: Lecture notes in computer science. Berlin: Springer; 1994.
11. Garey MR, Johnson DS. Computers and intractability: a guide to the theory of NP-completeness. San Fransisco, CA: Freeman; 1979.
12. Pekney J.F., Miller D.L. Exact solution of the no-wait flowshop scheduling problem with a comparison to heuristic methods. Computers & Chemical Engineering. 15(11):1991;741-748.
13. Kanellakis P.C., Papadimitriou C.H. Local search for the asymmetric traveling salesman problem. Operations Research. 28(5):1980;1086-1099.
14. Cowling P. Optimization in steel hot rolling. In: Optimization in industry, Chichester, England: Wiley; 1995. p. 55-66.
15. Laporte G., Semet F., Dadeshidze V.V., Olsson L.J. A tiling and routing heuristic for screening of cytological samples. Journal of the OR Society. 49:1998;1233-1238.
16. Sankoff D., Blanchette M. Multiple genome rearrangement and breakpoint phylogeny. Journal of Computational Biology. 5(4):1998;555-570.
17. Lin K.H., Chen C.S., Twang T.T. Layout-driven chaining of scan flip-flops. IEE Proceedings-Computers and Digital Techniques. 143(6):1996;421-425.
18. Wade G., Roberts A. Ordering of cascade FIR filter structures. Electronics Letters. 30(17):1994;1393-1994.
19. Bland R., Shallcross D.F. Large travelling salesman problems arising from experiments in X-ray crystallography. a preliminary report on computation OR Letters. 8:1989;125-128.
20. Kolohan F., Liang M. A tabu search approach to optimization of drilling operations. Computers in Engineering. 31(1):1996;371-374.
21. Walas R.A., Askin R.G. An algorithm for NC turret punch press tool location and hit sequencing. IIE Transactions. 16(3):1984;280-287.
22. Johnson DS. Local optimization and the traveling salesman problem. In: Proceedings of the 17th Colloquium on Automata, Language and Programming, Lecture notes in computer science, vol. 443. Berlin: Springer, 1990. p. 446-61.
23. Applegate D, Bixby R, Chvátal V, Cook W. Finding tours in the TSP. Technical Report 99885, Research Institute for Discrete Mathematics, Universitaet Bonn, 1999.
24. Helsgaun K. An effective implementation of the Lin-Kernighan traveling salesman heuristic. European Journal of Operational Research. 126:2000;106-130.
25. Rego C. Relaxed tours and path ejections for the traveling salesman problem. European Journal of Operational Research. 106:1998;522-538.
26. Lin S., Kernighan B.W. An effective heuristic algorithm for the travelling salesman problem. Operational Research. 21:1973;498-516.
27. Johnson DS, McGeoch LA. The travelling salesman problem: a case study. In: Local search in combinatorial optimization. New York: Wiley; 1997. p. 215-310.
28. Bellman R.E. Dynamic programming treatment of the traveling salesman problem. Journal of the Association for Computing Machinery. 9:1962;61-63.
29. Held M., Karp R.M. A dynamic programming approach to sequencing problems. Journal of the Society for Industrial and Applied Mathematics. 10(1):1962;196-210.
30. Burke EK, Cowling P, Keuthen R. Effective local and guided variable neighborhood search methods for the asymmetric travelling salesman problem. In: Proceedings of the EvoWorkshops 2001, Lecture notes in computer science, Berlin: Springer; 2001. p. 203-12.
31. Bentley J.L. Fast algorithms for geometric traveling salesman problems. ORSA Journal on Computing. 4(4):1992;387-411.
32. Martin O., Otto S.W., Felten E.W. Large-step markov chains for the traveling salesman problem. Complex Systems. 5(3):1991;299-326.
33. Martin O., Otto S.W., Felten E.W. Large-step Markov chains for the TSP incorporating local search heuristics. Operations Research Letters. 11(4):1992;219-224.
34. Martin O, Otto SW. Combining simulated annealing with local search heuristics. Annals of Operations Research 1996.
35. Hansen P, Mladenović N. An introduction to variable neighborhood search. In: Voss S. et al., editor. Proceeding of the 2nd International Conference on Metaheuristics-MIC97, 1998.
36. Hansen P., Mladenović N. Variable neighborhood search. principles and applications European Journal of Operational Research. 130:2001;449-467.
37. Mladenović N., Hansen P. Variable neighborhood search. Computers & Operations Research. 24:1997;1097-1100.
38. Kirpatrick S., Gelatt C.D., Vecchi M.P. Optimization by simulated annealing. Science. 220:1983;671-680.
39. Applegate D, Cook W, Rohe A. Chained Lin-Kerningham for large travelling salesman problems. Technical Report 99887, Research Institute for Discrete Mathematics, Universitaet Bonn, 1999.
40. Cirasella J, Johnson DS, McGeoch LA, Zhang W. The asymmetric traveling salesman problem: algorithms, instance generators, and tests. In: ALENEX 2001 Proceedings, Lecture notes in computer science. Berlin: Springer; 2001.
41. Baum EB. Iterated descent: a better algorithm for local search in combinatorial optimization problems. Manuscript 1986.
42. Baum EB. Towards practical 'neural' computation for combinatorial optimization problems. In: Neural Networks for Computing, AIP Conference Proceedings, 1986. p. 151.
43. Hong I., Kahng A.B., Moon B.R. Improved large-step markov chain variants for the symmetric tsp. Journal of Heuristics. 3(1):1997;63-81.
44. Codenotti B., Manzini G., Margara L., Resta G. Perturbation. an efficient technique for the solution of very large instances of the Euclidean TSP INFORMS Journal of Computing. 8:1996;125-1330.
45. Reinelt G. TSPLIB-A travelling salesman problem library. ORSA Journal on Computing. 3:1991;376-384.
46. Reinelt G. TSPLIB95. Technical report, Institut fuer Angewandte Mathematik, Universitaet Heidelberg, 1995.
47. Glover F. Finding a best traveling salesman 4-opt move in the same time as a best 2-opt move. Journal of Heuristics. 2(2):1996;169-179.
48. Bentley J.L. Multidimensional binary search trees used for associative searching. Communications of the ACM. 18(9):1975;509-517.
49. Bentley JL. K-d trees for semidynamic point sets. In: Proceedings of the 6th Annual Symposium on Computational Geometry, 1990. p. 187-97.
50. Johnson DS. Personal Communication, 2001.