Hybridizing exact methods and metaheuristics: a taxonomy
From MaRDI portal
Publication:1042187
DOI10.1016/j.ejor.2007.07.035zbMath1176.90499OpenAlexW2101657530MaRDI QIDQ1042187
El-Ghazali Talbi, Matthieu Basseur, Laetitia Jourdan
Publication date: 7 December 2009
Published in: European Journal of Operational Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.ejor.2007.07.035
Approximation methods and heuristics in mathematical programming (90C59) Combinatorial optimization (90C27)
Related Items (30)
A matheuristic approach for the design of multiproduct batch plants with parallel production lines ⋮ A new Bayesian approach to multi-response surface optimization integrating loss function with posterior probability ⋮ Evolutionary algorithms for supply chain management ⋮ An exact hybrid method for the vehicle routing problem with time windows and multiple deliverymen ⋮ A bi-objective approach for scheduling ground-handling vehicles in airports ⋮ The robust set covering problem with interval data ⋮ A POPMUSIC matheuristic for the capacitated vehicle routing problem ⋮ A robust desirability function method for multi-response surface optimization considering model uncertainty ⋮ Patient admission scheduling problems with uncertain length of stay: optimization models and an efficient matheuristic approach ⋮ A matheuristic approach for the minimum broadcast time problem using a biased random‐key genetic algorithm ⋮ Solving the bi‐objective capacitated p‐median problem with multilevel capacities using compromise programming and VNS ⋮ Mathematical model applied to single-track line scheduling problem in Brazilian railways ⋮ A matheuristic for the driver scheduling problem with staff cars ⋮ Combining metaheuristics with mathematical programming, constraint programming and machine learning ⋮ A hybrid quantum inspired harmony search algorithm for 0-1 optimization problems ⋮ Inbound and outbound flow integration for cross-docking operations ⋮ An iterated local search procedure for the job sequencing and tool switching problem with non-identical parallel machines ⋮ Learnheuristics: hybridizing metaheuristics with machine learning for optimization with dynamic inputs ⋮ Combining metaheuristics with mathematical programming, constraint programming and machine learning ⋮ An efficient matheuristic for offline patient-to-bed assignment problems ⋮ Bacterial foraging-tabu search metaheuristics for identification of nonlinear friction model ⋮ A hybrid genetic algorithm for the single machine scheduling problem with sequence-dependent setup times ⋮ Coupling genetic local search and recovering beam search algorithms for minimizing the total completion time in the single machine scheduling problem subject to release dates ⋮ Architecture of manufacturing scheduling systems: literature review and an integrated proposal ⋮ A branch and bound enhanced genetic algorithm for scheduling a flowline manufacturing cell with sequence dependent family setup times ⋮ A column generation-based diving heuristic to solve the multi-project personnel staffing problem with calendar constraints and resource sharing ⋮ Application of chaos-based chaotic invasive weed optimization techniques for environmental OPF problems in the power system ⋮ A matheuristic for the 0--1 generalized quadratic multiple knapsack problem ⋮ Matheuristics for the capacitated p‐median problem ⋮ A matheuristic for the truck and trailer routing problem
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Optimization by Simulated Annealing
- A survey of very large-scale neighborhood search techniques
- LSSPER: Solving the resource-constrained project scheduling problem with large neighbourhood search
- A hybrid method combining continuous tabu search and Nelder--Mead simplex algorithms for the global optimization of multiminima functions
- A co-operative parallel heuristic for mixed zero--one linear programming: Combining simulated annealing with branch and bound
- A new class of hybrid global optimization algorithms for peptide structure prediction: integrated hybrids
- Solving irregular strip packing problems by hybridising simulated annealing and linear program\-ming
- Pareto ant colony optimization with ILP preprocessing in multiobjective project portfolio selection
- Heuristic concentration: Two stage solution construction
- Branch and bound crossed with GA to solve hybrid flowshops
- Embedding branch and bound within evolutionary algorithms
- Upper and lower bounds for the single source capacitated location problem.
- Separating capacity constraints in the CVRP using tabu search
- Beam-ACO--hybridizing ant colony optimization with beam search: an application to open shop scheduling
- Future paths for integer programming and links to artificial intelligence
- Recovering beam search: Enhancing the beam search approach for combinatorial optimization problems
- An ant colony optimization algorithm to solve a 2-machine bicriteria flowshop scheduling problem
- A constraint programming framework for local search methods
- Embedded local search approaches for routing optimization
- \(\alpha BB\): A global optimization method for general constrained nonconvex problems
- A combined branch-and bound and genetic algorithm based approach for a flowshop scheduling problem
- A combined Lagrangian, linear programming, and implication heuristic for large-scale set partitioning problems
- One-dimensional cutting stock problem with a given number of setups: a hybrid approach of metaheuristics and linear programming
- Asynchronous teams: cooperation schemes for autonomous agents
- A scatter search method for bi-criteria \(\{0,1\}\)-knapsack problems
- Branch-and-Price: Column Generation for Solving Huge Integer Programs
- A Hybrid Tabu Search/Branch-and-Bound Algorithm for the Direct Flight Network Design Problem
- An Iterated Dynasearch Algorithm for the Single-Machine Total Weighted Tardiness Scheduling Problem
- A Hybrid Genetic/Optimization Algorithm for Finite-Horizon, Partially Observed Markov Decision Processes
- Implementation of a Variance Reduction-Based Lower Bound in a Branch-and-Bound Algorithm for the Quadratic Assignment Problem
- Outline of an algorithm for integer solutions to linear programs
- A Branch-and-Cut Procedure for the Vehicle Routing Problem with Time Windows
- A Simplex-Based Tabu Search Method for Capacitated Network Design
- Exact and Approximate Nondeterministic Tree-Search Procedures for the Quadratic Assignment Problem
- A hybrid search combining interior point methods and metaheuristics for 0-1 programming
- Linear programming based meta-heuristics for the weighted maximal planar graph
- A branch-and-bound-based local search method for the flow shop problem
- Branch-and-Bound Methods: A Survey
- Genetic Programming
- Solving vehicle routing problems using constraint programming and metaheuristics
- Using a hybrid genetic-algorithm/branch and bound approach to solve feasibility and optimization integer programming problems
This page was built for publication: Hybridizing exact methods and metaheuristics: a taxonomy
