Creating very large scale neighborhoods out of smaller ones by compounding moves

Journal of Heuristics

Volumn 12, Issue 1-2, 2006, Pages 115-140

  Ergun, Özlem ^a   Orlin, James B ^b   Steele Feldman, Abran ^c  

^a Georgia Institute of Technology   (United States)

^b MASSACHUSETTS INSTITUTE OF TECHNOLOGY   (United States)

^c UNIVERSITY OF WASHINGTON   (United States)

Author keywords

Local search; Routing; Very large scale neighborhood search

Indexed keywords

ALGORITHMS; COMPUTATIONAL COMPLEXITY; HEURISTIC METHODS; INPUT OUTPUT PROGRAMS; PROBLEM SOLVING;

COMPOUNDING INDEPENDENT MOVES (CIM); LOCAL SEARCH; ROUTING; VERY-LARGE SCALE NEIGHBORHOOD SEARCH (VLSN);

SEARCH ENGINES;

EID: 32544451745     PISSN: 13811231     EISSN: None     Source Type: Journal    
DOI: 10.1007/s10732-006-5561-5     Document Type: Article

References (35)

1. Aarts, E. and J.K. Lenstra. (1997). Local Search in Combinatorial Optimization. New York: John Wiley & Sons.
2. Ahuja, R.K., Ö. Ergun, J.B. Orlin, and A.B. Punnen. (2002) "A Survey of Very Large-Scale Neighborhood Search Techniques." Discrete Applied Mathematics 123, 75-102.
3. Ahuja, R.K., J.B. Orlin, and Thomas, L. Magnanti. (1993). Network Flows. NJ: Prentice-Hall.
4. Ahuja, R.K., J.B. Orlin, and D. Sharma. (2001). "Multi-Exchange Neighborhood Search Algorithms for The Capacitated Minimum Spanning Tree Problem." Mathematical Programming 91, 71-97.
5. Christofides, N., A. Mingozzi, and P. Toth. (1979). "The Vehicle Routing Problem." In N. Christofides, A. Mingozzi, P. Toth, and C. Sandi (eds.), Combinatorial Optimization, Chichester: Wiley.
6. Clarke, G. and J.W. Wright. (1964). "Scheduling of Vehicles From a Central Depot to a Number of Delivery Points." Operations Research 12, 568-581.
7. Congram, R.K. (2000). "Pollynomially Searchable Exponential Neighborhoods for Sequencing Problems in Combinatorial Optimization." Faculty of Mathematical Studies Thesis, University of Southampton.
8. Congram, R.K., C.N. Potts, and S.L. van de Velde. (2002). "An Iterated Dynasearch Algorithm for The Single Machine Total Weighted Tardiness Scheduling Problem." INFORMS Journal on Computing 14, 52-67.
9. Deineko, V. and G.J. Woeginger. (2000). A Study of Exponential Neighborhoods for The Traveling Salesman Problem and The Quadratic Assignment Problem." Mathematical Programming Series A 87, 519-542.
10. Desrochers, M. and F. Soumis. (1988). A Generalized Permanent Labeling Algorithm for the Shortest Path Problem With Time Windows." INFOR 26, 191-212.
11. Dongarra, J. (2004). "Performance of Various Computers Using Standard Linear Equations Software." University of Tennessee, Knoxville TN, 37996, Computer Science Technical Report Number CS-89 85. url:http://www. netlib.org/benchmark/performance.ps
12. Ergun, Ö. (2001). "New Neighborhood Search Algorithms Based on Exponentially Large Neighborhoods." Operations Research Center Thesis, MIT.
13. Firla, R.T., B. Spille, and R. Weismantel. Personal Communication.
14. Fisher, M. (1995). "Vehicle Routing." In M.O. Ball, T.L. Magnanti, C.L. Monma, and G.L. Nemhauser (eds.), Network Routing, Handbooks in OR & MS Vol. 8. Amsterdam: Elsevier.
15. Gendreau, M., A. Hertz, and G. Laporte. (1994). "A Tabu Search Heuristic for the Vehicle Routing Problem." Management Science 40, 1276-1290.
16. Gendreau, M., G. Laporte, and J.-Y. Potvin. (1997). "Vehicle Routing: Modern Heuristics." In E. Aarts and J.K. Lenstra (eds.), Local Search in Combinatorial Optimization. New York: John Wiley & Sons, pp. 311-336.
17. Glover, F. (1996). "Ejection Chains, Reference Structures, and Alternating Path Algorithms for The Traveling Salesman Problem, Research Report, University of Colorado-Boulder, Graduate School of Business (1992)." A Short Version Appeared in Discrete Applied Mathematics 65, 223-253.
18. Glover, F. and M. Laguna. (1997). Tabu Search. Boston: Kluwer Academic Publisher.
19. Golden, B.L., E.A. Wasil, J.P. Kelly, and I-M. Chao. (1998). "Metaheuristics in Vehicle Routing." In T.G Crainic, and C. Laporte (eds.), Fleet Management and Logistics. Boston: Kluwer Academic Publisher pp. 33-56.
20. Kirby, R.F. and R.B. Potts. (1969). "The Minimum Route Problem for Networks With Turn Penalties and Prohibitions." Transportation Research 3, 397-408.
21. Laporte, G. and I.H. Osman. (1995). "Routing Problems: A Bibliography, in Freight Transportation." In G. Laporte, and M. Gendreau (eds.), Annals of Operations Research Vol. 61, pp. 227-262
22. Liu, C.L. (1985). Elements of Discrete Mathematics. Singapore: McGraw-Hill
23. . Osman, I.H. (1993). "Metastrategy Simulated Annealing Search Algorithms for The Vehicle Routing Problem." Annals of Operations Research 41, 421-451.
24. Potts, C.N. and S.L. van de Velde. (1995). "Dynasearch - Iterative Local Improvement by Dynamic Programming: Part I." The Traveling Salesman Problem, Technical Report, University of Twente, The Netherlands.
25. Prins, C. (2004). "A Simple and Effective Evolutionary Algorithm for The Vehicle Routing Problem." Computers and Operations Research 31, 1985-2002.
26. Punnen, A.P. and F. Glover. (1996). "Ejection Chains With Combinatorial Leverage for The TSP." Research Report, University of Colorado-Boulder.
27. Ralphs, T.K., L. Kopman, W.R. Pulleyblank, and L.E. Trotter, Jr. (2000). "On The Capacitated Vehicle Routing Problem." Research Report. Updates available at http://www.branchandcut.org
28. . Rego, C. and C. Roucairol. (1996). "A Parallel Tabu Search Algorithm Using Ejection Chains for The Vehicle Routing Problem. In I.H. Osman and J.P. Kelly (eds.), Meta-Heuristics: Theory & Applications. Boston: Kluwer Academic Publisher, MA, pp. 661-675
29. Rego, C. (1998). "A Subpath Ejection Method for The Vehicle Routing Problem." Management Science. 44, 1447-1459.
30. Rochat, Y. and E. Taillard. (1995). "Probabilistic Diversification and Intensification in Local Search for Vehicle Routing.". Journal of Heuristics 1, 147-167.
31. Taillard, E. (1993). "Parallel Iterative Search Methods for Vehicle Routing Problem." Networks 23, 661-673.
32. Thompson, P.M. and J.B. Orlin. (1989). "The Theory of Cyclic Transfers." Operations Research Center Working Paper, MIT.
33. Thompson, P.M. and H.N. Psaraftis. (1993). "Cyclic Transfer Algorithms for Multivehicle Routing and Scheduling Problems." Operations Research 41.
34. Toth, P. and Vigo, D. (2003). "The Granular Tabu Search and Its Application to The Vehicle Routing Problem." INFORMS Journal on Computing 15, 333-346.
35. Toth, P. and D. Vigo. (2002). Vehicle Routing Problem. Philadelphia: Society for Industrial and Applied Mathematics, PA.