Boosting local search with Lagrangian relaxation (original) (raw)

References

• Aiex, R.M., Resende, M.G., Ribeiro, C.C.: TTT plots: a perl program to create time-to-target plots. Optim. Lett. 1(4), 355–366 (2007)
  Article MATH MathSciNet Google Scholar
• Alekseeva, E., Kochetov, Y., Plyasunov, A.: Complexity of local search for the p-median problem. Eur. J. Oper. Res. 191(3), 736–752 (2008)
  Article MATH MathSciNet Google Scholar
• Avella, P., Sassano, A., Vasil’ev, I.: Computational study of large-scale p-median problems. Math. Program. 109(1), 89–114 (2007)
  Article MATH MathSciNet Google Scholar
• Beasley, J.E.: Lagrangean heuristics for location problems. Eur. J. Oper. Res. 65(3), 383–399 (1993)
  Article MATH Google Scholar
• Belov, A., Järvisalo, M., Stachniak, Z.: Depth-driven circuit-level stochastic local search for sat. In: Proceedings of the Twenty-Second International Joint Conference on Artificial Intelligence, vol. 1, pp. 504–509. AAAI Press, Menlo Park (2011)
• Bennell, J., Song, X.: A beam search implementation for the irregular shape packing problem. J. Heuristics 16(2), 167–188 (2010)
  Article MATH Google Scholar
• Brimberg, J., Mladenović, N., Urošević, D.: Local and variable neighborhood search for the k-cardinality subgraph problem. J. Heuristics 14(5), 501–517 (2008)
  Article MATH Google Scholar
• Brueggemann, T., Hurink, J.L.: Matching based very large-scale neighborhoods for parallel machine scheduling. J. Heuristics 17(6), 637–658 (2011)
  Article MATH Google Scholar
• Ceschia, S., Schaerf, A.: Local search for a multi-drop multi-container loading problem. J. Heuristics 19(2), 275–294 (2013)
  Article Google Scholar
• Christofides, N., Beasley, J.E.: A tree search algorithm for the p-median problem. Eur. J. Oper. Res. 10(2), 196–204 (1982)
  Article MATH MathSciNet Google Scholar
• Climer, S., Zhang, W.: Searching for backbones and fat: a limit-crossing approach with applications. In: Proceedings of The National Conference on Artificial Intelligence, pp 707–712. AAAI Press, Menlo Park (2002)
• Croce, F., Ghirardi, M., Tadei, R.: Recovering beam search: enhancing the beam search approach for combinatorial optimization problems. J. Heuristics 10(1), 89–104 (2004)
  Article MATH Google Scholar
• Fischetti, M., Lodi, A.: Local branching. Math. Program. 98(1–3), 23–47 (2003)
  Article MATH MathSciNet Google Scholar
• García, S., Labbé, M., Marín, A.: Solving large p-median problems with a radius formulation. INFORMS J. Comput. 23(4), 546–556 (2011)
  Article MATH MathSciNet Google Scholar
• Glover, F.: Tabu search-part I. ORSA J. Comput. 1(3), 190–206 (1989)
  Article MATH Google Scholar
• Glover, F.: Tabu search-part II. ORSA J. Comput. 2(1), 4–32 (1990)
  Article MATH Google Scholar
• Gutin, G., Karapetyan, D.: Local search heuristics for the multidimensional assignment problem. Graph Theory, Computational Intelligence and Thought, pp. 100–115. Springer, Berlin (2009)
  Chapter Google Scholar
• Hakimi, S.L.: Optimum locations of switching centers and the absolute centers and medians of a graph. Oper. Res. 12(3), 450–459 (1964)
  Article MATH Google Scholar
• Hansen, P., Mladenovic, N.: Variable neighborhood search for the p-median. Locat. Sci. 5(4), 207–226 (1997)
  Article MATH Google Scholar
• Helsgaun, K.: General k-opt submoves for the Lin–Kernighan TSP heuristic. Math. Program. Comput. 1(2–3), 119–163 (2009)
  Article MATH MathSciNet Google Scholar
• Hoos, H.H., Stützle, T.: Stochastic Local Search. Foundations and Applications. Elsevier, Amsterdam (2005)
  MATH Google Scholar
• Järvinen, P., Rajala, J., Sinervo, H.: A branch-and-bound algorithm for seeking the p-median. Oper. Res. 20(1), 173–178 (1972)
  Article MATH Google Scholar
• Kernighan, B., Lin, S.: An eflicient heuristic procedure for partitioning graphs. Bell Syst. Tech. J. 29, 209 (1970)
  Google Scholar
• Kochetov, Y., Levanova, T., Alekseeva, E., Loresh, M.: Large neighborhood local search for the p-median problem. Yugosl. J. Oper. Res. 15(1), 53–63 (2005)
  Article MATH MathSciNet Google Scholar
• Li, C.M., Quan, Z.: An efficient branch-and-bound algorithm based on MaxSAT for the maximum clique problem. In: Proceedings of the Twenty-Fourth AAAI Conference on Artificial Intelligence, pp. 128–133 (2010)
• Mladenovic, N., Brimberg, J., Hansen, P., Moreno-Prez, J.A.: The p-median problem: a survey of metaheuristic approaches. Eur. J. Oper. Res. 179(3), 927–939 (2007)
  Article MATH Google Scholar
• Puchinger, J., Raidl, G.R.: Bringing order into the neighborhoods: relaxation guided variable neighborhood search. J. Heuristics 14(5), 457–472 (2008)
  Article MATH Google Scholar
• Pullan, W.: A population based hybrid metaheuristic for the p-median problem. In: 2008 IEEE Congress on Evolutionary Computation, pp. 75–82 (2008)
• Reese, J.: Solution methods for the p-median problem: an annotated bibliography. Networks 48(3), 125–142 (2006)
  Article MATH MathSciNet Google Scholar
• Reinelt, G.: TSPLIB-a traveling salesman problem library. ORSA J. Comput. 3, 376–384 (1991)
  Article MATH Google Scholar
• Ren, Z., Jiang, H., Xuan, J., Hu, Y., Luo, Z.: New insights into diversification of hyper-heuristics. IEEE Trans. Cybern (in press) (2013)
• Ren, Z., Jiang, H., Xuan, J., Luo, Z.: An accelerated-limit-crossing-based multilevel algorithm for the p-median problem. IEEE Trans. Syst. Man Cybern. B 42(4), 1187–1202 (2012a)
  Article Google Scholar
• Ren, Z., Jiang, H., Xuan, J., Luo, Z.: Hyper-heuristics with low level parameter adaptation. Evol. Comput. 20(2), 189–227 (2012b)
  Article Google Scholar
• Resende, M.G., Werneck, R.F.: On the implementation of a swap-based local search procedure for the p-median problem. In: Proceedings of the Fifth Workshop on Algorithm Engineering and Experiments, pp. 119–127 (2003)
• Resende, M.G.C., Werneck, R.F.: A hybrid heuristic for the p-median problem. J. Heuristics 10(1), 59–88 (2004)
  Article MATH Google Scholar
• Riise, A., Burke, E.K.: Local search for the surgery admission planning problem. J. Heuristics 17(4), 389–414 (2011)
  Article Google Scholar
• Rosing, K.E., Revelle, C.S., Schilling, D.A.: A gamma heuristic for the p-median problem. Eur. J. Oper. Res. 117(3), 522–532 (1999)
  Article MATH Google Scholar
• Senne, E., Lorena, L.: Lagrangean/surrogate heuristics for p-median problems. Computing Tools for Modeling, Optimization and Simulation: Interfaces in Computer Science and Operations Research. Kluwer Academic, Dordrecht (2000)
  Google Scholar
• Smith-Miles, K.A.: Cross-disciplinary perspectives on meta-learning for algorithm selection. ACM Comput. Surv. 41(1), 6:1–6:25 (2009)
  Google Scholar
• Teitz, M.B., Bart, P.: Heuristic methods for estimating the generalized vertex median of a weighted graph. Oper. Res. 16(5), 955–961 (1968)
  Article MATH Google Scholar
• Vela, C.R., Varela, R., González, M.A.: Local search and genetic algorithm for the job shop scheduling problem with sequence dependent setup times. J. Heuristics 16(2), 139–165 (2010)
  Article MATH Google Scholar
• Whitaker, R.: A fast algorithm for the greedy interchange for large-scale clustering and median location problems. INFOR J. 21(2), 95–108 (1983)
  MATH Google Scholar

Download references