A comparative analysis of two matheuristics by means of merged local optima networks

DOI10.1016/j.ejor.2020.08.008zbMath1487.90647OpenAlexW3048852632MaRDI QIDQ2029302

Christian Blum, Gabriela Ochoa

Publication date: 3 June 2021

Published in: European Journal of Operational Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.ejor.2020.08.008

Mathematics Subject Classification ID

Approximation methods and heuristics in mathematical programming (90C59) Combinatorial optimization (90C27)

Related Items (1)

Multi-constructor CMSA for the maximum disjoint dominating sets problem

Uses Software

• igraph
• irace

Cites Work

• Unnamed Item
• POPMUSIC as a matheuristic for the berth allocation problem
• Hybrid large neighborhood search for the bus rapid transit route design problem
• Solving large-scale multidimensional knapsack problems with a new binary harmony search algorithm
• Construct, Merge, Solve \& Adapt A new general algorithm for combinatorial optimization
• Kernel search: an application to the index tracking problem
• Kernel search: a general heuristic for the multi-dimensional knapsack problem
• An efficient preprocessing procedure for the multidimensional 0-1 knapsack problem
• Local branching
• An efficient tabu search approach for the 0-1 multidimensional knapsack problem
• A large neighborhood search heuristic for supply chain network design
• A hybrid simulated annealing metaheuristic algorithm for the two-dimensional knapsack packing problem
• Ejection chains, reference structures and alternating path methods for traveling salesman problems
• Record breaking optimization results using the ruin and recreate principle
• A two-phase tabu-evolutionary algorithm for the 0-1 multidimensional knapsack problem
• An adaptive large neighborhood search heuristic for the pollution-routing problem
• A two-phase approach for single container loading with weakly heterogeneous boxes
• Approximation schemes for a class of subset selection problems
• Mathematical programming strategies for solving the minimum common string partition problem
• Tour Merging via Branch-Decomposition
• Construct, Merge, Solve and Adapt Versus Large Neighborhood Search for Solving the Multi-dimensional Knapsack Problem: Which One Works Better When?
• Algorithms and Computation
• Handbook of metaheuristics
• Variable neighborhood search: Principles and applications
• Minimum common string partition: on solving large‐scale problem instances

This page was built for publication: A comparative analysis of two matheuristics by means of merged local optima networks