A cooperative parallel metaheuristic for the capacitated vehicle routing problem
From MaRDI portal
Publication:2257342
Recommendations
- A cooperative parallel meta-heuristic for the vehicle routing problem with time windows
- Cooperative versus non-cooperative parallel variable neighborhood search strategies: a case study on the capacitated vehicle routing problem
- Parallel solution methods for vehicle routing problems
- Solving variants of the vehicle routing problem with a simple parallel iterated tabu search
- Parallelization of a two-phase metaheuristic for routing problems with time windows
Cites work
- scientific article; zbMATH DE number 1062113 (Why is no real title available?)
- scientific article; zbMATH DE number 761271 (Why is no real title available?)
- scientific article; zbMATH DE number 1452993 (Why is no real title available?)
- A Hybrid Genetic Algorithm for Multidepot and Periodic Vehicle Routing Problems
- A Tabu Search Heuristic for the Vehicle Routing Problem with Soft Time Windows
- A cooperative parallel meta-heuristic for the vehicle routing problem with time windows
- A library of local search heuristics for the vehicle routing problem
- A parallel algorithm for the vehicle routing problem
- A simple and effective evolutionary algorithm for the vehicle routing problem
- Active-guided evolution strategies for large-scale capacitated vehicle routing problems
- An Exchange Heuristic for Routeing Problems with Time Windows
- An efficient variable neighborhood search heuristic for very large scale vehicle routing problems
- Parallel Metaheuristics
- Parallel Metaheuristics Applications
- Parallel solution methods for vehicle routing problems
- The Vehicle Routing Problem with Time Windows: Minimizing Route Duration
- The granular tabu search and its application to the vehicle-routing problem
- The traveling-salesman problem
- The vehicle routing problem
- Very large-scale vehicle routing: new test problems, algorithms, and results
Cited in
(17)- A meta-heuristic for capacitated green vehicle routing problem
- Parallel Metaheuristics Applications
- Cooperative versus non-cooperative parallel variable neighborhood search strategies: a case study on the capacitated vehicle routing problem
- Swarm intelligence-based hyper-heuristic for the vehicle routing problem with prioritized customers
- An integrative cooperative search framework for multi-decision-attribute combinatorial optimization: application to the MDPVRP
- An asynchronous parallel metaheuristic for the period vehicle routing problem
- An integration of Lagrangian split and VNS: the case of the capacitated vehicle routing problem
- A parallel variable neighborhood search for the vehicle routing problem with divisible deliveries and pickups
- Limited memory rank-1 cuts for vehicle routing problems
- A parallel hybrid metaheuristic for bicluster editing
- A unified solution framework for multi-attribute vehicle routing problems
- Parallel solution methods for vehicle routing problems
- Optimizing energy consumption of robotic cells by a branch \& bound algorithm
- An urban transportation problem solved by parallel programming with hyper-heuristics
- Parallel computational optimization in operations research: a new integrative framework, literature review and research directions
- Parallel local search algorithms for high school timetabling problems
- A cooperative parallel meta-heuristic for the vehicle routing problem with time windows
This page was built for publication: A cooperative parallel metaheuristic for the capacitated vehicle routing problem
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2257342)
