Construct , Merge , Solve & Adapt : A New General Algorithm For Combinatorial Optimization

This paper describes a general hybrid metaheuristic for combinatorial optimization labelled Construct, Merge, Solve & Adapt. The proposed algorithm is a specific instantiation of a framework known from the literature as Generate-And-Solve, which is based on the following general idea. First, generate a reduced sub-instance of the original problem instance, in a way such that a solution to the sub-instance is also a solution to the original problem instance. Second, apply an exact solver to the reduced sub-instance in order to obtain a (possibly) high quality solution to the original problem instance. And third, make use of the results of the exact solver as feedback for the next algorithm iteration. The minimum common string partition problem and the minimum covering arborescence problem are chosen as test cases in order to demonstrate the application of the proposed algorithm. The obtained results show that the algorithm is competitive with the exact solver for small to medium size problem instances, while it significantly outperforms the exact solver for larger problem instances. HighlightsWe present a new general algorithm for combinatorial optimization.The algorithm combines probabilistic solution construction with an ILP solver.The ILP solver is used to solve sub-instances to optimality.First application example: minimum common string partition.Second application example: minimum covering arborescence.

[1]  Plácido Rogério Pinheiro,et al.  The Generate-and-Solve Framework Revisited: Generating by Simulated Annealing , 2013, EvoCOP.

[2]  P. Pardalos,et al.  Optimization techniques for string selection and comparison problems in genomics , 2005, IEEE Engineering in Medicine and Biology Magazine.

[3]  Antonio Bolufé Röhler,et al.  Matheuristics: Optimization, Simulation and Control , 2009, Hybrid Metaheuristics.

[4]  Hervé Rivano,et al.  Power-efficient radio configuration in fixed broadband wireless networks , 2010, Comput. Commun..

[5]  Carlos Cotta,et al.  Recent Advances in Evolutionary Computation for Combinatorial Optimization , 2008, Recent Advances in Evolutionary Computation for Combinatorial Optimization.

[6]  Mauro Birattari,et al.  The irace Package: Iterated Race for Automatic Algorithm , 2011 .

[7]  M S Waterman,et al.  Identification of common molecular subsequences. , 1981, Journal of molecular biology.

[8]  Christian Blum,et al.  A matheuristic for the minimum weight rooted arborescence problem , 2015, J. Heuristics.

[9]  Gregory Gutin,et al.  Digraphs - theory, algorithms and applications , 2002 .

[10]  L. Gouveia,et al.  Models and heuristics for a minimum arborescence problem , 2008 .

[11]  Christian Blum,et al.  Hybrid metaheuristics in combinatorial optimization: A survey , 2011, Appl. Soft Comput..

[12]  Moshe Lewenstein,et al.  Quick Greedy Computation for Minimum Common String Partitions , 2011, CPM.

[13]  Petr Kolman,et al.  Minimum Common String Partition Problem: Hardness and Approximations , 2004, Electron. J. Comb..

[14]  Mohammad Sohel Rahman,et al.  Solving the Minimum Common String Partition Problem with the Help of Ants , 2013, ICSI.

[15]  Plácido Rogério Pinheiro,et al.  Towards Aid by Generate and Solve Methodology: Application in the Problem of Coverage and Connectivity in Wireless Sensor Networks , 2012, Int. J. Distributed Sens. Networks.

[16]  V. Venkata Rao,et al.  The Minimum Weight Rooted Arborescence Problem: Weights on ARCS Case , 1992 .

[17]  David Coudert,et al.  Energy Saving in Fixed Wireless Broadband Networks , 2011, INOC.

[18]  Tao Jiang,et al.  Computing the Assignment of Orthologous Genes via Genome Rearrangement , 2005, APBC.

[19]  R. Sridharan,et al.  Minimum-weight rooted not-necessarily-spanning arborescence problem , 2002, Networks.

[20]  David S. Johnson,et al.  Computers and Intractability: A Guide to the Theory of NP-Completeness , 1978 .

[21]  Tibérius O. Bonates,et al.  On the concept of density control and its application to a hybrid optimization framework: Investigation into cutting problems , 2011, Comput. Ind. Eng..

[22]  André L. V. Coelho,et al.  Combining Metaheuristics and Integer Linear Programming : A Hybrid Methodology Applied to the Container Loading Problem , 2007 .

[23]  Dan Gusfield,et al.  Algorithms on strings , 1997 .

[24]  Günther R. Raidl,et al.  Decomposition based hybrid metaheuristics , 2015, Eur. J. Oper. Res..

[25]  Thomas Stützle,et al.  Experimental Analysis of Pheromone-Based Heuristic Column Generation Using irace , 2013, Hybrid Metaheuristics.

[26]  Petr Kolman,et al.  Reversal Distance for Strings with Duplicates: Linear Time Approximation using Hitting Set , 2006, Electron. J. Comb..

[27]  G. Nemhauser,et al.  Integer Programming , 2020 .

[28]  Christian Blum,et al.  Iterative Probabilistic Tree Search for the Minimum Common String Partition Problem , 2014, Hybrid Metaheuristics.

[29]  Sayyed Rasoul Mousavi,et al.  An improved heuristic for the far from most strings problem , 2012, J. Heuristics.

[30]  M. W. Du,et al.  Computing a longest common subsequence for a set of strings , 1984, BIT.

[31]  Paul D. Seymour,et al.  Tour Merging via Branch-Decomposition , 2003, INFORMS J. Comput..

[32]  BlumChristian,et al.  Hybrid metaheuristics in combinatorial optimization , 2011 .

[33]  W. T. Tutte.  Graph Theory , 1984 .

[34]  Plácido Rogério Pinheiro,et al.  Tackling the Container Loading Problem: A Hybrid Approach Based on Integer Linear Programming and Genetic Algorithms , 2007, EvoCOP.

[35]  Christian Blum,et al.  Mathematical programming strategies for solving the minimum common string partition problem , 2014, Eur. J. Oper. Res..

[36]  Dan He,et al.  A Novel Greedy Algorithm for the Minimum Common String Partition Problem , 2007, ISBRA.

[37]  Petra Mutzel,et al.  Combining a Memetic Algorithm with Integer Programming to Solve the Prize-Collecting Steiner Tree Problem , 2004, GECCO.

[38]  Dan Gusfield,et al.  Algorithms on Strings, Trees, and Sequences - Computer Science and Computational Biology , 1997 .

[39]  Pascal Van Hentenryck,et al.  Pheromone-Based Heuristic Column Generation for Vehicle Routing Problems with Black Box Feasibility , 2012, CPAIOR.

[40]  William J. Cook,et al.  Finding Tours in the TSP , 1999 .