Hybridizations of evolutionary algorithms with large neighborhood search
From MaRDI portal
Publication:6158769
Cites work
- scientific article; zbMATH DE number 1664952 (Why is no real title available?)
- scientific article; zbMATH DE number 6007914 (Why is no real title available?)
- scientific article; zbMATH DE number 3497315 (Why is no real title available?)
- scientific article; zbMATH DE number 1487885 (Why is no real title available?)
- scientific article; zbMATH DE number 194544 (Why is no real title available?)
- scientific article; zbMATH DE number 2102230 (Why is no real title available?)
- scientific article; zbMATH DE number 795588 (Why is no real title available?)
- A greedy genetic algorithm for the quadratic assignment problem
- A large neighborhood search heuristic for supply chain network design
- A memetic algorithm with a large neighborhood crossover operator for the generalized traveling salesman problem
- 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
- Algorithms for the Assignment and Transportation Problems
- An adaptive large neighborhood search for a vehicle routing problem with multiple routes
- An adaptive large neighborhood search heuristic for the pollution-routing problem
- An evolutionary algorithm for polishing mixed integer programming solutions
- An exponential neighborhood for a one-machine batching problem
- An integer linear programming local search for capacitated vehicle routing problems
- Ant colony optimization.
- Bioinspired computation in combinatorial optimization. Algorithms and their computational complexity
- Complexity of buffer capacity allocation problems for production lines with unreliable machines
- Construct, Merge, Solve \& Adapt A new general algorithm for combinatorial optimization
- Differential evolution -- a simple and efficient heuristic for global optimization over continuous spaces
- Embedding branch and bound within evolutionary algorithms
- Exploring relaxation induced neighborhoods to improve MIP solutions
- Exponential neighbourhood local search for the traveling salesman problem
- Genetic algorithms for a supply management problem: MIP-recombination vs greedy decoder
- Handbook of metaheuristics
- Hybrid adaptive large neighborhood search for vehicle routing problems with depot location decisions
- Hybrid genetic algorithms with selective crossover for the capacitated p-Median problem
- Hybrid large neighborhood search for the bus rapid transit route design problem
- Large neighborhood local search for the \(p\)-median problem
- Local branching
- Matheuristics. Algorithms and implementations
- More effective crossover operators for the all-pairs shortest path problem
- On solving travelling salesman problem with vertex requisitions
- Optimal recombination in genetic algorithms for combinatorial optimization problems. I
- Optimal recombination in genetic algorithms for combinatorial optimization problems. II
- Optimized Crossover for the Independent Set Problem
- Optimized crossover-based genetic algorithms for the maximum cardinality and maximum weight clique problems
- Optimizing epochal evolutionary search: population-size independent theory.
- POPMUSIC as a matheuristic for the berth allocation problem
- Record breaking optimization results using the ruin and recreate principle
- Subgraph extraction and metaheuristics for the maximum clique problem
- The algebra of genetic algorithms
- The use of dynamic programming in genetic algorithms for permutation problems
- Tour merging via branch-decomposition
- Two very large-scale neighborhoods for single machine scheduling
- Variable neighborhood search and local branching
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)
