Multi-start methods for combinatorial optimization

European Journal of Operational Research

Volumn 226, Issue 1, 2013, Pages 1-8

  Martí, Rafael ^a   Resende, Mauricio G C ^b   Ribeiro, Celso C ^c  

^a UNIVERSITY OF VALENCIA   (Spain)

^b AT AND T LABS RESEARCH   (United States)

^c FLUMINENSE FEDERAL UNIVERSITY   (Brazil)

Author keywords

Adaptive memory programming; GRASP; Metaheuristics; Multi start methods

Indexed keywords

COMBINATORIAL OPTIMIZATION; OPTIMIZATION; SAMPLING;

ADAPTIVE MEMORY; GRASP; HIGH-QUALITY SOLUTIONS; HISTORICAL DEVELOPMENT; META HEURISTICS; MULTISTART; OPTIMIZATION PROBLEMS; STRUCTURAL VARIATIONS;

ITERATIVE METHODS;

EID: 84873058957     PISSN: 03772217     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.ejor.2012.10.012     Document Type: Article

References (46)

1. Aiex, R.M., Resende, M.G.C., Ribeiro, C.C., 2007. TTT plots: a perl program to create time-to-target plots. Optimization Letters 1, 355-366.
2. Beausoleil, R.P., Baldoquin, G., Montejo, R., 2008. A multi-start and path relinking methods to deal with multiobjective knapsack problems. Annals of Operations Research 157, 105-133.
3. Boese, K.D., Kahng, A.B., Muddu, S., 1994. A new adaptive multi-start technique for combinatorial global optimisation. Operations Research Letters 16, 103-113.
4. Braysy, O., Hasle, G., Dullaert, W., 2004. A multi-start local search algorithm for the vehicle routing problem with time windows. European Journal of Operational Research 159, 586-605.
5. Charon, I., Hudry, O., 2002. The noising methods: a survey. In: Ribeiro, C.C., Hansen, P. (Eds.), Essays and Surveys in Metaheuristics. Kluwer Academic Publishers., pp. 245-261.
6. Chiarandini, M., Paquete, L., Preuss, M., Ridge, E., 2007. Experiments on Metaheuristics: Methodological Overview and Open Issues. Technical Report. Department of Mathematics and Computer Science, University of Southern Denmark, Odense, Denmark. .
7. Crowston, W.B., Glover, F., Thompson, G.L., Trawick, J.D., 1963. Probabilistic and Parametric Learning Combinations of Local Job Shop Scheduling Rules. Technical Report 117. Carnegie-Mellon University, Pittsburgh.
8. Dhouib, S., Kharrat, A., Chabchoub, H., 2010. A multi-start threshold accepting algorithm for multiple objective continuous optimization problems. International Journal for Numerical Methods in Engineering 83, 1498-1517.
9. Essafi, M., Delorme, X., Dolgui, Al, 2010. Balancing lines with CNC machines: a multi-start and based heuristic. CIRP Journal of Manufacturing Science and Technology 2, 176-182.
10. Feo, T.A., Resende, M.G.C., 1989. A probabilistic heuristic for a computationally difficult set covering problem. Operations Research Letters 8, 67-71.
11. Feo, T.A., Resende, M.G.C., 1995. Greedy randomized adaptive search procedures. Journal of Global Optimization 6, 109-133.
12. Festa, P., Resende, M.G.C., 2009a. An annotated bibliography of GRASP, Part I: algorithms. International Transactions in Operational Research 16, 1-24.
13. Festa, P., Resende, M.G.C., 2009b. An annotated bibliography of GRASP, Part II: applications. International Transactions in Operational Research 16, 131-172.
14. Fleurent, C., Glover, F., 1999. Improved constructive multi-start strategies for the quadratic assignment problem using adaptive memory. INFORMS Journal on Computing 11, 198-204.
15. Glover, F., 1977. Heuristics for integer programming using surrogate constraints. Decision Sciences 8, 156-166.
16. Glover, F., 1986. Future paths for integer programming and links to artificial intelligence. Computers and Operations Research 13, 533-549.
17. Glover, F., 1989. Tabu search. Part I. ORSA Journal on Computing 1, 190-206.
18. Glover, F., 2000. Multi-start and strategic oscillation methods - principles to exploit adaptive memory. In: Laguna, M., Gonzalez-Velarde, J.L. (Eds.), Computing Tools for Modeling Optimization and Simulation. Kluwer Academic Publishers, pp. 1- 25.
19. Glover, F., Laguna, M., 1997. Tabu Search. Kluwer Academic Publishers.
20. Hagen, L.W., Kahng, A.B., 1997. Combining problem reduction and adaptive multistart: a new technique for superior iterative partitioning. IEEE Transactions on CAD 16, 709-717.
21. Hart, J.P., Shogan, A.W., 1987. Semi-greedy heuristics: an empirical study. Operations Research Letters 6, 107-114.
22. Held, M., Karp, R.M., 1970. The traveling-salesman problem and minimum spanning trees. Operations Research 18, 1138-1162.
23. Kirkpatrick, S., Gelatt Jr., C.D., Vecchi, M.P., 1983. Optimization by simulated annealing. Science 220, 671-680.
24. Kochenberger, G.A., McCarl, B.A., Wyman, F.P., 1974. A heuristic for general integer programming. Decision Sciences 5, 36-41.
25. Laguna, M., Martí, R., 1999. GRASP and path relinking for 2-layer straight line crossing minimization. INFORMS Journal on Computing 11, 44-52.
26. Laguna, M., Martí, R., 2003. Scatter Search - Methodology and Implementations in C. Kluwer Academic Publishers.
27. Lan, G., DePuy, G.W., 2006. On the effectiveness of incorporating randomness and memory into a multi-start metaheuristic with application to the set covering problem. Computers and Industrial Engineering 51, 362-374.
28. Lawler, E.L., Lenstra, J.K., Rinnooy Kan, A.H.G., Shmoys, D.B., 1985. The Traveling Salesman Problem. Wiley.
29. Lozano, M., Glover, F., García-Martínez, C., Rodrguez, F.J., Martí, R., 2012. Tabu Search with Strategic Oscillation for the Quadratic Minimum Spanning Tree. Technical Report 1A. University of Valencia, Valencia, Spain.
30. Mezmaz, M., Melab, N., Talbi, E.G., 2006. Using the multi-start and island models for parallel multi-objective optimization on the computational grid. In: Second IEEE International Conference on e-Science and Grid Computing.
31. Moreno, J.A., Mladenovic, N., Moreno-Vega, J.M., 1995. An statistical analysis of strategies for multistart heuristic searches for p-facility location-allocation problems. In: Eighth Meeting of the EWG on Locational Analysis Lambrecht.
32. Muth, J.F., Thompson, G.L., 1963. Industrial Scheduling. Prentice-Hall.
33. Patterson, R., Pirkul, H., Rolland, E., 1999. Adaptive reasoning technique for the capacitated minimum spanning tree problem. Journal of Heuristics 5, 159-180.
34. Resende, M.G., Martí, R., Gallego, M., Duarte, A., 2008. GRASP and path relinking for the max-min diversity problem. Computers and Operations Research 37, 498- 508.
35. Resende, M.G.C., Ribeiro, C.C., 2010. Greedy randomized adaptive search procedures: advances and applications. In: Gendreau, M., Potvin, J.-Y. (Eds.), Handbook of Metaheuristics, second ed. Springer, pp. 293-319.
36. Resende, M.G.C., Ribeiro, C.C., 2011. Restart strategies for GRASP with pathrelinking heuristics. Optimization Letters 5, 467-478.
37. Resende, M.G.C., Werneck, R.F., 2004. A hybrid heuristic for the p-median problem. Journal of Heuristics 10, 59-88.
38. Resende, M.G.C., Martí, R., Gallego, M., Duarte, A., 2010. GRASP and path relinking for the max-min diversity problem. Computers and Operations Research 37, 498-508.
39. Ribeiro, C.C., Resende, M.G.C., 2012. Path-relinking intensification methods for stochastic local search algorithms. Journal of Heuristics 18, 193-214. http://dx.doi.org/10.1007/s10732-011-9167-1.
40. Ribeiro, C.C., Rosseti, I., Souza, R.C., 2011a. Effective probabilistic stopping rules for randomized metaheuristics: GRASP implementations. Lecture Notes in Computer Science 6683, 146-160.
41. Ribeiro, C.C., Rosseti, I., Vallejos, R., 2011b. Exploiting run time distributions to compare sequential and parallel stochastic local search algorithms. Journal of Global Optimization. http://dx.doi.org/10.1007/s10898- 011-9769-z.
42. Senju, S., Toyoda, Y., 1968. An approach to linear programming with 0-1 variables. Management Science 15, 196-207.
43. Taillard, E.D., Badeau, P., Gendreau, M., Guertin, F., Potvin, J.Y., 1997. A tabu search heuristic of the vehicle routing problem with time windows. Transportation Science 31, 170-186.
44. Taillard, E.D., Gambardella, L.M., Gendreau, M., Potvin, J.Y., 2001. Adaptive memory programming: a unified view of metaheuristics. European Journal of Operational Research 135.
45. Villegas, J.G., Prins, C., Prodhon, C., Medaglia, A.L., Velasco, N., 2010. GRASP/VND and multi-start evolutionary local search for the single truck and trailer routing problem with satellite depots. Engineering Applications of Artificial Intelligence 23, 780-794.
46. Wyman, F.P., 1973. Binary programming: a occasion rule for selecting optimal vs. heuristic techniques. The Computer Journal 16, 135-140.