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

DOI10.1016/j.cor.2015.10.014zbMath1349.90705OpenAlexW1899797054MaRDI QIDQ342297

José A. Lozano, Manuel López-Ibáñez, Pedro Pinacho, Christian Blum

Publication date: 17 November 2016

Published in: Computers \& Operations Research (Search for Journal in Brave)

Full work available at URL: https://www.research.manchester.ac.uk/portal/en/publications/construct-merge-solve--adapt-a-new-general-algorithm-for-combinatorial-optimization(b1d35339-7263-4409-9f5b-fe9593b315f7).html

zbMATH Keywords

metaheuristicshybrid algorithmsminimum common string partitionexact solverminimum covering arborescence

Mathematics Subject Classification ID

Learning and adaptive systems in artificial intelligence (68T05) Approximation methods and heuristics in mathematical programming (90C59) Combinatorial optimization (90C27)

Related Items (21)

A simple and effective algorithm for the maximum happy vertices problem ⋮ Finding happiness: an analysis of the maximum happy vertices problem ⋮ A two-step gradient estimation approach for setting supply chain operating parameters ⋮ MineReduce: an approach based on data mining for problem size reduction ⋮ The weighted independent domination problem: integer linear programming models and metaheuristic approaches ⋮ Matheuristics: survey and synthesis ⋮ On the role of metaheuristic optimization in bioinformatics ⋮ Multi-constructor CMSA for the maximum disjoint dominating sets problem ⋮ Ejection chain moves for automatic neighborhood synthesis in constrained cardinality‐minimization problems ⋮ Heuristic and exact algorithms for minimum-weight non-spanning arborescences ⋮ Minimum common string partition: on solving large‐scale problem instances ⋮ Parallel matheuristics for the discrete unit commitment problem with min‐stop ramping constraints ⋮ Application of Adapt-CMSA to the two-echelon electric vehicle routing problem with simultaneous pickup and deliveries ⋮ Hybridizations of evolutionary algorithms with large neighborhood search ⋮ Construct, Merge, Solve and Adapt Versus Large Neighborhood Search for Solving the Multi-dimensional Knapsack Problem: Which One Works Better When? ⋮ Generalization of machine learning for problem reduction: a case study on travelling salesman problems ⋮ The maximum happy induced subgraph problem: bounds and algorithms ⋮ A comparative analysis of two matheuristics by means of merged local optima networks ⋮ ILP-based reduced variable neighborhood search for large-scale minimum common string partition ⋮ A two-phase approach for single container loading with weakly heterogeneous boxes ⋮ Generalized relax-and-fix heuristic

Uses Software

• irace

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Decomposition based hybrid metaheuristics
• Computing a longest common subsequence for a set of strings
• Mathematical programming strategies for solving the minimum common string partition problem
• Tour Merging via Branch-Decomposition
• Quick Greedy Computation for Minimum Common String Partitions
• A Hybrid Optimization Framework for Cutting and Packing Problems
• Algorithms on Strings, Trees and Sequences
• Minimum‐weight rooted not‐necessarily‐spanning arborescence problem
• Models and heuristics for a minimum arborescence problem
• Reversal Distance for Strings with Duplicates: Linear Time Approximation Using Hitting Set
• Algorithms and Computation

This page was built for publication: Construct, Merge, Solve \& Adapt A new general algorithm for combinatorial optimization