Construct, Merge, Solve & Adapt A new general algorithm for combinatorial optimization

Computers and Operations Research

Volumn 68, Issue , 2016, Pages 75-88

  Blum, Christian ^a,b   Pinacho, Pedro ^a,c   López Ibáñez, Manuel ^d   Lozano, José A ^a  

^a UNIVERSITY OF THE BASQUE COUNTRY UPV EHU   (Spain)

^b BASQUE FOUNDATION FOR SCIENCE   (Spain)

^c UNIVERSIDAD SANTO TOMÁS   (Chile)

^d UNIVERSITY OF MANCHESTER   (United Kingdom)

Author keywords

Exact solver; Hybrid algorithms; Metaheuristics; Minimum common string partition; Minimum covering arborescence

Indexed keywords

ALGORITHMS; COMBINATORIAL OPTIMIZATION; ITERATIVE METHODS;

EXACT SOLVER; HYBRID ALGORITHMS; META HEURISTICS; MINIMUM COMMON STRING PARTITION; MINIMUM COVERING ARBORESCENCE;

OPTIMIZATION;

EID: 84948166237     PISSN: 03050548     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.cor.2015.10.014     Document Type: Article

References (41)

1. C. Blum, J. Puchinger, G. Raidl, and A. Roli Hybrid metaheuristics in combinatorial optimization: a survey Appl Soft Comput 11 6 2011 4135 4151
2. E.-G. Talbi Hybrid metaheuristics, Studies in computational intelligence, No. 434 2013 Springer Verlag Berlin, Germany
3. G.R. Raidl Decomposition based hybrid metaheuristics Eur J Oper Res 244 1 2015 66 76
4. Boschetti MA, Maniezzo V, Roffilli M, Bolufé Röhler A, Matheuristics: optimization, simulation and control. In: Blesa MJ, Blum C, Di Gaspero L, Roli A, Sampels M, Schaerf A (Eds.), Proceedings of HM 2009sixth international workshop on hybrid metaheuristics. Lecture notes in computer science. vol. 5818. Berlin, Heidelberg: Springer; 2009. pp. 171-77.
5. L.A. Wolsey Integer programming 1998 Wiley-Interscience Hoboken, NJ
6. Nepomuceno NV, Combinação de metaheurísticas e programação linear inteira: uma metodologia híbrida aplicada ao problema de carregamento de contêineres [Ph.D. thesis], [MSc Thesis]. University of Fortaleza; 2006.
7. Nepomuceno NV, Pinheiro PR, Coelho ALV. Combining metaheuristics and integer linear programming: a hybrid methodology applied to the container loading problem. In: Proceedings of the XX congreso da sociedade brasileira de computação, concurso de teses e dissertações; 2007. p. 2028-32.
8. Nepomuceno NV, Pinheiro PR, Coelho ALV. Tackling the container loading problem: a hybrid approach based on integer linear programming and genetic algorithms. In: Cotta C, van Hemert J (Eds.), Proceedings of EvoCOP 2007 - 7th European conference on evolutionary computation in combinatorial optimization. Lecture notes in computer science, vol. 4446. Berlin, Heidelberg: Springer; 2007. p. 154-165.
9. Nepomuceno, N, Pinheiro P, Coelho ALV. Recent advances in evolutionary computation for combinatorial optimization. In: Studies in Computational Intelligence. vol. 153. Berlin, Germany: Springer Verlag; 2008, p. 87-99. [Ch. A hybrid optimization framework for cutting and packing problems].
10. P.R. Pinheiro, A.L.V. Coelho, A.B. de Aguiar, and T.O. Bonates On the concept of density control and its application to a hybrid optimization framework: investigation into cutting problems Comput Ind Eng 61 3 2011 463 472
11. R.D. Saraiva, N.V. Nepomuceno, and P.R. Pinheiro The generate-and-solve framework revisited: generating by simulated annealing M. Middendorf, C. Blum, Evolutionary computation in combinatorial optimization. Lecture notes in computer science vol. 7832 2013 Springer Berlin, Heidelberg 262 273
12. D. Coudert, N.V. Nepomuceno, and I. Tahiri Energy saving in fixed wireless broadband networks J. Pahl, T. Reiners, S. Voß, Proceedings of INOC 2011 - fifth international conference on network optimization. Lecture notes in computer science vol. 6701 2011 Springer Berlin, Heidelberg 484 489
13. D. Coudert, N. Nepomuceno, and H. Rivano Power-efficient radio configuration in fixed broadband wireless networks Comput Commun 33 8 2010 898 906
14. Pinheiro PR, Coelho ALV, de Aguiar AB, de Menezes Sobreira Neto A. Towards aid by generate and solve methodology: application in the problem of coverage and connectivity in wireless sensor networks. Int J Distrib Sensor Netw 2012, article ID 790459.
15. Applegate D, Bixby R, Chvátal V, Cook W. Finding tours in the TSP, Tech. rep., Forschungsinstitut für Diskrete Mathematik, Germany: University of Bonn; 1999.
16. W. Cook, and P. Seymour Tour merging via branch-decomposition INFORMS J Comput 15 3 2003 233 248
17. Klau GW, Ljubić I, Moser A, Mutzel P, Neuner P, Pferschy U, et al. Combining a memetic algorithm with integer programming to solve the prize-collecting Steiner tree problem. In: Proceedings of GECCO 2004 - genetic and evolutionary computation conference. Lecture notes in computer science, vol. 3102. Berlin, Heidelberg: Springer; 2004. p. 1304-1315.
18. Massen F, Deville Y, Hentenryck P, Pheromone-based heuristic column generation for vehicle routing problems with black box feasibility. In: Beldiceanu N, Jussien N, Pinson É (Eds.), Proceedings of CP-AI-OR 2012 - integration of AI and OR techniques in constraint programming for combinatorial optimzation problems. Lecture notes in computer science. vol. 7298. Berlin, Heidelberg: Springer; 2012. p. 260-274.
19. Massen F, López-Ibánez M, Stützle M, Deville Y, Experimental analysis of pheromone-based heuristic column generation using irace. In: Blesa MJ, Blum C, Festa P, Roli A, Sampels M (Eds.), Proceedings of HM 2013 - international workshop on hybrid metaheuristics. Lecture notes in computer science, vol. 7919. Berlin, Heidelberg: Springer; 2013. p. 92-106.
20. C. Blum, and B. Calvo A matheuristic for the minimum weight rooted arborescence problem J Heuristics 21 4 2015 479 499
21. Chen X, Zheng J, Fu Z, Nan P, Zhong Y, Lonardi S, et al. Computing the assignment of orthologous genes via genome rearrangement. In: Proceedings of the asia pacific bioinformatics conference 2005; 2005. p. 363-378.
22. S. Mousavi, M. Babaie, and M. Montazerian An improved heuristic for the far from most strings problem J Heuristics 18 2012 239 262
23. C. Meneses, C. Oliveira, and P. Pardalos Optimization techniques for string selection and comparison problems in genomics IEEE Eng Med Biol Mag 24 3 2005 81 87
24. W.J. Hsu, and M.W. Du Computing a longest common subsequence for a set of strings BIT Numer Math 24 1 1984 45 59
25. T. Smith, and M. Waterman Identification of common molecular subsequences J Mol Biol 147 1 1981 195 197
26. D. Gusfield Algorithms on strings, trees, and sequences, computer science and computational biology 1997 Cambridge University Press Cambridge
27. M.R. Garey, and D.S. Johnson Computers and intractability; a guide to the theory of NP-completeness 1979 W. H. Freeman San Francisco, LA
28. Goldstein A, Kolman P, Zheng J, Minimum common string partition problem: hardness and approximations. In: Fleischer R, Trippen G (Eds.), Proceedings of ISAAC 2004 - 15th international symposium on algorithms and computation. Lecture notes in computer science, vol. 3341. Berlin, Heidelberg: Springer; 2005. p. 484-495.
29. P. Kolman, and T. Waleń Reversal distance for strings with duplicates: linear time approximation using hitting set T. Erlebach, C. Kaklamanis, Proceedings of WAOA 2007 - fourth international workshop on approximation and online algorithms. Lecture notes in computer science vol. 4368 2007 Springer Berlin, Heidelberg 279 289
30. I. Goldstein, and M. Lewenstein Quick greedy computation for minimum common string partitions R. Giancarlo, G. Manzini, Proceedings of CPM 2011 - 22nd annual symposium on combinatorial pattern matching. Lecture notes in computer science vol. 6661 2011 Springer Berlin, Heidelberg 273 284
31. D. He A novel greedy algorithm for the minimum common string partition problem I. Mandoiu, A. Zelikovsky, Proceedings of ISBRA 2007 - third international symposium on bioinformatics research and applications. Lecture notes in computer science vol. 4463 2007 Springer Berlin, Heidelberg 441 452
32. S.M. Ferdous, and M. Sohel Rahman Solving the minimum common string partition problem with the help of ants Y. Tan, Y. Shi, H. Mo, Proceedings of ICSI 2013 - fourth international conference on advances in swarm intelligence. Lecture notes in computer science vol. 7928 2013 Springer Berlin, Heidelberg 306 313
33. Ferdous SM, Sohel Rahman M. A MAX-MIN ant colony system for minimum common string partition problem, CoRR abs/1401.4539. (http://arxiv.org/abs/1401.4539).
34. C. Blum, J.A. Lozano, and P. Pinacho Davidson Iterative probabilistic tree search for the minimum common string partition problem M.J. Blesa, C. Blum, S. Voss, Proceedings of HM 20104 - ninth international workshop on hybrid metaheuristics. Lecture notes in computer science vol. 8457 2014 Springer Verlag Berlin, Germany 154
35. C. Blum, J.A. Lozano, and P. Pinacho Davidson Mathematical programming strategies for solving the minimum common string partition problem Eur J Oper Res 242 3 2015 769 777
36. Venkata Rao, V, Sridharan R. The minimum weight rooted arborescence problem: weights on arcs case. Tech. Rep., Indian Institute of Management Ahmedabad, Research and Publication Department; 1992.
37. W.T. Tutte Graph theory 2001 Cambridge University Press Cambridge, UK
38. J. Bang-Jensen, and G.Z. Gutin Digraphs: theory, algorithms and applications 2008 Springer Science and Business Media London, UK
39. V. Venkata Rao, and R. Sridharan Minimum-weight rooted not-necessarily-spanning arborescence problem Networks 39 2 2002 77 87
40. C. Duhamel, L. Gouveia, P. Moura, and M. Souza Models and heuristics for a minimum arborescence problem Networks 51 1 2008 34 47
41. López-Ibáñez, M, Dubois-Lacoste J, Stützle T, Birattari M, The irace package, iterated race for automatic algorithm configuration, Tech. Rep. TR/IRIDIA/2011-004, IRIDIA, Université Libre de Bruxelles, Belgium; 2011.