Decomposition based hybrid metaheuristics

European Journal of Operational Research

Volumn 244, Issue 1, 2015, Pages 66-76

  Raidl, Günther R ^a  

^a VIENNA UNIVERSITY OF TECHNOLOGY   (Austria)

Author keywords

Combinatorial optimization; Decomposition techniques; Hybrid optimization approaches; Metaheuristics; Mixed integer programming

Indexed keywords

COMBINATORIAL OPTIMIZATION; COMPUTER PROGRAMMING; CONSTRAINT THEORY; DYNAMIC PROGRAMMING; HEURISTIC ALGORITHMS;

COMBINATORIAL OPTIMIZATION PROBLEMS; DANTZIG-WOLFE DECOMPOSITION; DECOMPOSITION TECHNIQUE; HYBRID OPTIMIZATION APPROACHES; META HEURISTICS; META-HEURISTIC TECHNIQUES; MIXED INTEGER LINEAR PROGRAMMING; MIXED INTEGER PROGRAMMING;

INTEGER PROGRAMMING;

EID: 84930482474     PISSN: 03772217     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.ejor.2014.12.005     Document Type: Conference Paper

References (95)

1. Ahuja R.K., Ergun Ö., Orlin J.B., and Punnen A.P. A survey of very large-scale neighborhood search techniques Discrete Applied Mathematics 123 2002 75 102
2. Alvelos F., de Sousa A., and Santos D. Combining column generation and metaheuristics Studies in computational intelligence: Vol. 434. Hybrid metaheuristics 2013 Springer 285 334
3. Angelelli E., Mansini R., and Grazia Speranza M. Kernel search: A general heuristic for the multi-dimensional knapsack problem Computers and Operations Research 37 11 2010 2017 2026
4. Applegate D.L., Bixby R.E., Chvátal V., and Cook W.J. On the solution of the traveling salesman problem Documenta Mathematica Extra Volume ICM III 1998 645 656
5. Azi N., Gendreau M., and Potvin J.-Y. An adaptive large neighborhood search for a vehicle routing problem with multiple routes Computers & Operations Research 41 2014 167 173
6. Barahona F., and Anbil R. The volume algorithm: Producing primal solutions with a subgradient method Mathematical Programming, Series A 87 3 2000 385 399
7. Benders J.F. Partitioning procedures for solving mixed-variables programming problems Numerische Mathematik 4 1962 238 252
8. Blum C., and Blesa M.J. Solving the KCT problem: Large-scale neighborhood search and solution merging E. Alba, Optimization techniques for solving complex problems 2008 John Wiley & Sons 407 421
9. Blum C., Blesa Aguilera M.J., Roli A., and Sampels M. Studies in computational intelligence: Vol. 114. Hybrid metaheuristics - An emerging approach to optimization 2008 Springer
10. Blum C., Puchinger J., Raidl G.R., and Roli A. Hybrid metaheuristics in combinatorial optimization: A survey Applied Soft Computing 11 2011 4135 4151
11. Blum C., Roli A., and Sampels M. Proceedings of HM 2004 - First international workshop on hybrid metaheuristics 2004
12. Boschetti M., and Maniezzo V. Benders decomposition, Lagrangian relaxation and metaheuristic design Journal of Heuristics 15 2009 283 312
13. Boschetti M., Maniezzo V., and Roffilli M. Decomposition techniques as metaheuristic frameworks Annals of information systems 10 2009 Springer 135 158
14. Büdenbender K., Grünert T., and Sebastian H.-J. A hybrid tabu search/branch-and-bound algorithm for the direct flight network design problem Transportation Science 34 4 2000 364 380
15. Burke E.K., Gendreau M., Hyde M., Kendall G., Ochoa G., Özcan E., and Qu R. Hyper-heuristics: A survey of the state of the art Journal of the Operational Research Society 64 12 2013 1695 1724
16. Chu P.C., and Beasley J.E. A genetic algorithm for the multidimensional knapsack problem Journal of Heuristics 4 1998 63 86
17. Cordeau J.-F., Stojković G., Soumis F., and Desrosiers J. Benders decomposition for simultaneous aircraft routing and crew scheduling Transportation Science 35 4 2001 375 388
18. Costa A.M. A survey on Benders decomposition applied to fixed-charge network design problem Computers & Operations Research 32 2005 1429 1450
19. Cotta C., Talbi E.G., and Alba E. Parallel hybrid metaheuristics E. Alba, Parallel metaheuristics: A new class of algorithms 2005 Wiley 347 370
20. Danna E., Rothberg E., and Le Pape C. Exploring relaxation induced neighborhoods to improve MIP solutions Mathematical Programming, Series A 102 2005 71 90
21. Dantzig G.B., and Wolfe P. Decomposition principle for linear programs Operations Research 8 1960 101 111
22. Desaulniers G., Desrosiers J., and Solomon M.M. Column generation 2005 Springer
23. Di Gaspero L., and Urli T. A CP/LNS approach for multi-day homecare scheduling problems Lecture notes in computer science: Vol. 8457. Proceedings of HM 2014 - Ninth international workshop on hybrid metaheuristics 2014 Springer 1 15
24. Dowsland K.A., Herbert E.A., Kendall G., and Burke E. Using tree search bounds to enhance a genetic algorithm approach to two rectangle packing problems European Journal of Operational Research 168 2 2006 390 402
25. Easwaran G., and Üster H. Tabu search and Benders decomposition approaches for a capacitated closed-loop supply chain network design problem Transportation Science 43 3 2009 301 320
26. El-Abd M., and Kamel M. A taxonomy of cooperative search algorithms M.J. Blesa Aguilera, C. Blum, A. Roli, M. Sampels, Lecture notes in computer science: Vol. 3636. Proceedings of HM 2005 - Second international workshop on hybrid metaheuristics 2005 Springer 32 41
27. Eremeev A.V. On complexity of optimal recombination for binary representations of solutions Evolutionary Computation 16 1 2008 127 147
28. Feo T.A., and Resende M.G.C. Greedy randomized adaptive search procedures Journal of Global Optimization 6 1995 109 133
29. Filho G.R., and Lorena L.A.N. Constructive genetic algorithm and column generation: An application to graph coloring L.P. Chuen, Proceedings of APORS 2000, the fifth conference of the association of asian-pacific operations research societies within IFORS 2000
30. Fischetti M., and Lodi A. Local branching Mathematical Programming, Series B 98 2003 23 47
31. Fisher M.L. The Lagrangian relaxation method for solving integer programming problems Management Science 27 1 1981 1 18
32. Fisher M.L., and Jaikumar R. A generalized assignment heuristic for vehicle routing Networks 11 2 1981 109 124
33. Fontaine M., Loudni S., and Boizumault P. Guiding VNS with tree decomposition Proceedings of the IEEE international conference on tools with artificial intelligence 2011 IEEE 505 512
34. Geoffrion A.M. Generalized Benders decomposition Journal of Optimization Theory and Applications 10 4 1972 237 260
35. Gilmour S., and Dras M. Kernelization as heuristic structure for the vertex cover problem M. Dorigo, Lecture notes in computer science: Vol. 4150. Ant colony optimization and swarm intelligence 2006 Springer 452 459
36. Glover F. Future paths for integer programming and links to artificial intelligence Decision Sciences 8 1977 156 166
37. Glover F., Laguna M., and Martí R. Fundamentals of scatter search and path relinking Control and Cybernetics 39 3 2000 653 684
38. Gomes T.M., Santos H.G., and Souza J.F. A pre-processing aware RINS based MIP heuristic Lecture notes in computer science: Vol. 7919. Proceedings of HM 2013 - Eigth international workshop on hybrid metaheuristics 2013 Springer 1 11
39. Hansen P., Mladenovic N., and Perez-Britos D. Variable neighborhood decomposition search Journal of Heuristics 7 4 2001 335 350
40. Haouari M., and Siala J.C. A hybrid Lagrangian genetic algorithm for the prize collecting Steiner tree problem Computers & Operations Research 33 5 2006 1274 1288
41. Hart W.E., Krasnogor N., and Smith J.E. Studies in fuzziness and soft computing: Vol. 166. Recent advances in memetic algorithms 2005 Springer
42. Hemmelmayr V.C., Cordeau J.-F., and Crainic T.G. An adaptive large neighborhood search heuristic for two-echelon vehicle routing problems arising in city logistics Computers & Operations Research 39 12 2012 3215 3228
43. Hooker J.N. Planning and scheduling by logic-based Benders decomposition Operations Research 55 3 2007 588 602
44. Hooker J.N., and Ottosson G. Logic-based Benders decomposition Mathematical Programming 96 2003 33 60
45. Jeet V., and Kutanoglu E. Lagrangian relaxation guided problem space search heuristic for generalized assignment problems European Journal of Operational Research 182 3 2007 1039 1056
46. Kellerer H., Pferschy U., and Pisinger D. Knapsack problems 2004 Springer
47. Lai M.-C., and Sohn H.-S. Using a genetic algorithm to solve the Benders master problem for capacitated plant location S. Gao, Bio-inspired computational algorithms and their applications 2012 InTech 405 420
48. Lai M.-C., Sohn H.-S., Tseng T.-L., and Bricker D.L. A hybrid Benders/genetic algorithm for vehicle routing and scheduling problem International Journal of Industrial Engineering 19 1 2012 33 46
49. Lai M.-C., Sohn H.-s., Tseng T.-L., and Chiang C. A hybrid algorithm for capacitated plant location problem Expert Systems with Applications 37 12 2010 8599 8605
50. Leitner M., Ljubić I., Luipersbeck M., and Resch M. A partition-based heuristic for the Steiner tree problem in large graphs Lecture notes in computer science: Vol. 7919. Proceedings of HM 2013 - Eigth international workshop on hybrid metaheuristics 2014 Springer 56 70
51. Leitner M., and Raidl G.R. Lagrangian decomposition, metaheuristics, and hybrid approaches for the design of the last mile in fiber optic networks M.J. Blesa Aguilera, C. Blum, C. Cotta, A.J. Fernández, J.E. Gallardo, A. Roli, M. Sampels, Lecture notes in computer science: Vol. 5296. Proceedings of HM 2008 - Fifth international workshop on hybrid metaheuristics 2008 Springer 158 174
52. Leitner, M. Raidl, G. R., (2009). Combining Lagrangian decomposition with very large scale neighborhoood search for capacitated connected facility location. In Post-conference book of the eight metaheuristics international conference - MIC.
53. Lodi A. The heuristic (dark) side of MIP solvers Studies in computational intelligence: Vol. 434. Hybrid metaheuristics 2013 Springer 273 284
54. Lopes R., Morais V.W.C., Noronha T.F., and Souza V.A.A. Heuristics and matheuristics for a real-life machine reassignment problem International Transactions in Operational Research 40 2014 179 200
55. Loudni S., Fontaine M., and Boizumault P. Intensification/diversification in decomposition guided VNS Lecture notes in computer science: Vol. 7919. Proceedings of HM 2013 - Eigth international workshop on hybrid metaheuristics 2013 Springer 22 36
56. Lübbecke M.E., and Desrosiers J. Selected topics in column generation Operations Research 53 6 2005 1007 1023
57. Magnanti T.L., Mireault P., and Wong R.T. Tailoring Benders decomposition for uncapacitated network design G. Gallo, C. Sandi, Mathematical programming studies: Vol. 26. Netflow at Pisa 1986 Springer 112 154
58. Proceedings of matheuristics 2006: First international workshop on mathematical contributions to metaheuristics Maniezzo V., Hansen P., and Voss S. 2006 Bertinoro, Italy
59. Maniezzo V., Stützle T., and Voss S. Annals of information systems: Vol. 10. Matheuristics - Hybridizing Metaheuristics and Mathematical Programming 2009 Springer
60. Martello S., Pisinger D., and Toth P. Dynamic programming and strong bounds for the 0-1 knapsack problem Management Science 45 1999 414 424
61. Martins S.L., and Ribeiro C.C. Metaheuristics and applications to optimization problems in telecommunications M.G.C. Resende, P.M. Pardalos, Handbook of optimization in telecommunications 2006 Springer 103 128
62. Massen F., Deville Y., and Hentenryck P.V. Pheromone-based heuristic column generation for vehicle routing problems with black box feasibility N. Beldiceanu, Lecture notes in computer science: Vol. 7298. Integration of AI and OR techniques in constraint programming for combinatorial optimization problems - CPAIOR 2012 2012 Springer 260 274
63. Massen F., López-Ibáñez M., Stützle T., and Deville Y. Experimental analysis of pheromone-based heuristic column generation using irace Lecture notes in computer science: Vol. 7919. Proceedings of HM 2013 - Eigth international workshop on hybrid metaheuristics 2013 Springer 92 106
64. Meyer B., and Ernst A. Integrating ACO and constraint propagation M. Dorigo, Lecture notes in computer science: Vol. 3172. Proceedings of ants 2004 - Fourth international workshop on ant colony optimization and swarm intelligence 2004 Springer 166 177
65. Moscato P. Memetic algorithms: A short introduction D. Corne, New ideas in optimization 1999 McGraw Hill 219 234
66. Nemhauser G.L., and Wolsey L.A. Integer and combinatorial optimization 1988 Wiley & Sons
67. Ouali A., Loudni S., Loukil L., Boizumault P., and Lebbah Y. Cooperative parallel decomposition guided VNS for solving weighted CSP Lecture notes in computer science: Vol. 8457. Proceedings of HM 2014 - Ninth international workshop on hybrid metaheuristics 2014 Springer 100 114
68. Pessoa L.S., Resende M.G.C., and Ribeiro C.C. A hybrid Lagrangean heuristic with GRASP and path-relinking for set k-covering Computers and Operations Research 40 12 2013 3132 3146
69. Pirkwieser S., and Raidl G.R. Matheuristics for the periodic vehicle routing problem with time windows Proceedings of matheuristics 2010: Third international workshop on model-based metaheuristics 2010 Vienna, Austria 83 95
70. Pirkwieser S., Raidl G.R., and Puchinger J. Combining Lagrangian decomposition with an evolutionary algorithm for the knapsack constrained maximum spanning tree problem C. Cotta, J.I. van Hemert, Lecture notes in computer science: Vol. 4446. Evolutionary computation in combinatorial optimization - EvoCOP 2007 2007 Springer 176 187
71. Poojari C.A., and Beasley J.E. Improving Benders decomposition using a genetic algorithm European Journal of Operational Research 199 1 2009 89 97
72. Prandtstetter M., and Raidl G.R. An integer linear programming approach and a hybrid variable neighborhood search for the car sequencing problem European Journal of Operational Research 191 3 2008 1004 1022
73. Prins, C., Lacomme, P. Prodhon, C. (2014). Order-first split-second methods for vehicle routing problems: A review. Transportation Research Part C, 40, 179-200. 10.1016/j.trc.2014.01.011
74. Puchinger J., and Raidl G.R. Combining metaheuristics and exact algorithms in combinatorial optimization: A survey and classification Lecture notes in computer science: Vol. 3562. Proceedings of the first international work-conference on the interplay between natural and artificial computation, part ii 2005 Springer 41 53
75. Puchinger J., and Raidl G.R. Models and algorithms for three-stage two-dimensional bin packing European Journal of Operational Research 183 2007 1304 1327
76. Puchinger J., Raidl G.R., and Pferschy U. The multidimensional knapsack problem: Structure and algorithms INFORMS Journal on Computing 22 2 2010 250 265
77. Raidl G.R. A unified view on hybrid metaheuristics F. Almeida, M.J. Blesa Aguilera, C. Blum, J.M. Moreno Vega, M.P. Pérez, A. Roli, M. Sampels, Lecture notes in computer science: Vol. 4030. Proceedings of HM 2006 - Third international workshop on hybrid metaheuristics 2006 Springer 1 12
78. Raidl G.R., Baumhauer T., and Hu B. Speeding up logic-based Benders' decomposition by a metaheuristic for a bi-level capacitated vehicle routing problem Lecture notes in computer science: Vol. 8457. Proceedings of HM 2014 - Ninth international workshop on hybrid metaheuristics 2014 Springer 183 197
79. Raidl G.R., and Hu B. Enhancing genetic algorithms by a trie-based complete solution archive P. Cowling, P. Merz, Lecture notes in computer science: Vol. 6022. Evolutionary computation in combinatorial optimisation - EvoCOP 2010 2010 Springer 239 251
80. Raidl G.R., and Puchinger J. Combining (integer) linear programming techniques and metaheuristics for combinatorial optimization Optimization techniques for solving complex problems 2008 John Wiley & Sons 407 421
81. Raidl G.R., Puchinger J., and Blum C. Metaheuristic hybrids M. Gendreau, J.Y. Potvin, International series in operations research & management science. (2nd ed.): Vol. 146. Handbook of metaheuristics 2010 Springer 469 496
82. Randazzo C.D., and Luna H.P.L. A comparison of optimal methods for local access uncapacitated network design Annals of Operations Research 106 2001 263 286
83. Rei W., Cordeau J.-F., Gendreau M., and Soriano P. Accelerating Benders decomposition by local branching INFORMS Journal on Computing 21 2 2008 333 345
84. Ropke S., and Pisinger D. An adaptive large neighborhood search heuristic for the pickup and delivery problem with time windows Transportation Science 40 4 2006 455 472
85. Shaw P. Using constraint programming and local search methods to solve vehicle routing problems M. Maher, J.-F. Puget, Lecture notes in computer science: Vol. 1520. Principle and practice of constraint programming - CP 98 1998 Springer 417 431
86. Taillard É.D., and Voß S. POPMUSIC: Partial optimization metaheuristic under special intensification conditions C.C. Ribeiro, P. Hansen, Essays and surveys in metaheuristics 2001 Kluwer Academic Publishers 613 629
87. Talbi E.-G. A taxonomy of hybrid metaheuristics Journal of Heuristics 8 5 2002 541 565
88. Talbi E.-G. Studies in computational intelligence: Vol. 434. Hybrid metaheuristics 2013 Springer
89. Talbi E.-G. A unified taxonomy of hybrid metaheuristics with mathematical programming, constraint programming and machine learning Studies in computational intelligence: Vol. 434. Hybrid metaheuristics 2013 Springer 3 76
90. Thiruvady D., Singh G., and Ernst A.T. Hybrids of integer programming and ACO for resource constrained job scheduling Lecture notes in computer science: Vol. 8457. Proceedings of HM 2014 - Ninth international workshop on hybrid metaheuristics 2014 Springer 130 144
91. Valejo A., Valverde-Rebaza J., Drury B., and Lopes A.d. A. Multilevel refinement based on neighborhood similarity Proceedings of the 18th international database engineering & applications symposium 2014 ACM 67 76
92. Walshaw C. Multilevel refinement for combinatorial optimisation: Boosting metaheuristic performance Optimization techniques for solving complex problems 2008 John Wiley & Sons 407 421
93. Wolpert D., and Macready W. No free lunch theorems for optimization IEEE Transactions on Evolutionary Computation 1 1 1997 67 82
94. Wolsey L.A. Integer Programming 1998 Wiley-Interscience
95. Zakeri G., Philpott A.B., and Ryan D.M. Inexact cuts in Benders decomposition SIAM Journal on Optimization 10 3 1999 643 657