Hybridizations of evolutionary algorithms with large neighborhood search

Cites Work

Title not available (Why is that?)
Title not available (Why is that?)
Differential evolution -- a simple and efficient heuristic for global optimization over continuous spaces
Ant colony optimization.
Local branching
Title not available (Why is that?)
POPMUSIC as a matheuristic for the berth allocation problem
Algorithms for the Assignment and Transportation Problems
Exploring relaxation induced neighborhoods to improve MIP solutions
Variable neighborhood search and local branching
An adaptive large neighborhood search for a vehicle routing problem with multiple routes
Title not available (Why is that?)
Handbook of metaheuristics
A survey of very large-scale neighborhood search techniques
A vehicle routing improvement algorithm comparison of a greedy and a matching implementation for inventory routing
Record breaking optimization results using the ruin and recreate principle
An adaptive large neighborhood search heuristic for the pollution-routing problem
An evolutionary algorithm for polishing mixed integer programming solutions
Hybrid large neighborhood search for the bus rapid transit route design problem
Bioinspired computation in combinatorial optimization. Algorithms and their computational complexity
An integer linear programming local search for capacitated vehicle routing problems
Complexity of buffer capacity allocation problems for production lines with unreliable machines
Large neighborhood local search for the p-median problem
An exponential neighborhood for a one-machine batching problem
Subgraph extraction and metaheuristics for the maximum clique problem
Two very large-scale neighborhoods for single machine scheduling
Tour merging via branch-decomposition
Construct, Merge, Solve \& Adapt A new general algorithm for combinatorial optimization
The use of dynamic programming in genetic algorithms for permutation problems
Optimized Crossover for the Independent Set Problem
Title not available (Why is that?)
A greedy genetic algorithm for the quadratic assignment problem
The algebra of genetic algorithms
Optimized crossover-based genetic algorithms for the maximum cardinality and maximum weight clique problems
A memetic algorithm with a large neighborhood crossover operator for the generalized traveling salesman problem
Title not available (Why is that?)
Exponential neighbourhood local search for the traveling salesman problem
Hybrid genetic algorithms with selective crossover for the capacitated \(p\)-Median problem
Embedding branch and bound within evolutionary algorithms
On solving Travelling Salesman Problem with Vertex Requisitions
Optimal recombination in genetic algorithms for combinatorial optimization problems: Part I
Optimizing epochal evolutionary search: population-size independent theory.
A large neighborhood search heuristic for supply chain network design
Genetic algorithms for a supply management problem: MIP-recombination vs greedy decoder
More effective crossover operators for the all-pairs shortest path problem
Matheuristics. Algorithms and implementations
Optimal recombination in genetic algorithms for combinatorial optimization problems: Part II
Hybrid adaptive large neighborhood search for vehicle routing problems with depot location decisions
Title not available (Why is that?)

This page was built for publication: Hybridizations of evolutionary algorithms with large neighborhood search

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6158769)