Hybridizations of evolutionary algorithms with large neighborhood search
From MaRDI portal
Publication:6158769
DOI10.1016/j.cosrev.2022.100512MaRDI QIDQ6158769
Christian Blum, Anton Valentinovich Eremeev, Yulia Zakharova
Publication date: 20 June 2023
Published in: Computer Science Review (Search for Journal in Brave)
Research exposition (monographs, survey articles) pertaining to computer science (68-02) Computer science (68-XX)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- POPMUSIC as a matheuristic for the berth allocation problem
- Hybrid large neighborhood search for the bus rapid transit route design problem
- An adaptive large neighborhood search for a vehicle routing problem with multiple routes
- Construct, Merge, Solve \& Adapt A new general algorithm for combinatorial optimization
- Complexity of buffer capacity allocation problems for production lines with unreliable machines
- Bioinspired computation in combinatorial optimization. Algorithms and their computational complexity
- A survey of very large-scale neighborhood search techniques
- A memetic algorithm with a large neighborhood crossover operator for the generalized traveling salesman problem
- The use of dynamic programming in genetic algorithms for permutation problems
- Optimized crossover-based genetic algorithms for the maximum cardinality and maximum weight clique problems
- Exponential neighbourhood local search for the traveling salesman problem
- Differential evolution -- a simple and efficient heuristic for global optimization over continuous spaces
- Embedding branch and bound within evolutionary algorithms
- Local branching
- Optimizing epochal evolutionary search: population-size independent theory.
- A greedy genetic algorithm for the quadratic assignment problem
- A large neighborhood search heuristic for supply chain network design
- Exploring relaxation induced neighborhoods to improve MIP solutions
- Hybrid genetic algorithms with selective crossover for the capacitated \(p\)-Median problem
- An exponential neighborhood for a one-machine batching problem
- A vehicle routing improvement algorithm comparison of a greedy and a matching implementation for inventory routing
- The algebra of genetic algorithms
- More effective crossover operators for the all-pairs shortest path problem
- Record breaking optimization results using the ruin and recreate principle
- Matheuristics. Algorithms and implementations
- An adaptive large neighborhood search heuristic for the pollution-routing problem
- Subgraph extraction and metaheuristics for the maximum clique problem
- Genetic algorithms for a supply management problem: MIP-recombination vs greedy decoder
- Variable neighborhood search and local branching
- Two very large-scale neighborhoods for single machine scheduling
- Hybrid adaptive large neighborhood search for vehicle routing problems with depot location decisions
- Tour Merging via Branch-Decomposition
- An Evolutionary Algorithm for Polishing Mixed Integer Programming Solutions
- Optimal recombination in genetic algorithms for combinatorial optimization problems: Part I
- Optimal recombination in genetic algorithms for combinatorial optimization problems: Part II
- Algorithms for the Assignment and Transportation Problems
- An Integer Linear Programming Local Search for Capacitated Vehicle Routing Problems
- Optimized Crossover for the Independent Set Problem
- Large neighborhood local search for the p-median problem
- On solving Travelling Salesman Problem with Vertex Requisitions
- Handbook of metaheuristics
This page was built for publication: Hybridizations of evolutionary algorithms with large neighborhood search