A cooperative parallel metaheuristic for the capacitated vehicle routing problem
DOI10.1016/J.COR.2013.10.004zbMATH Open1307.90024OpenAlexW2004303822MaRDI QIDQ2257342FDOQ2257342
Authors: Jianyong Jin, Teodor Gabriel Crainic, Arne Løkketangen 
Publication date: 25 February 2015
Published in: Computers \& Operations Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.cor.2013.10.004
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
Approximation methods and heuristics in mathematical programming (90C59) Deterministic network models in operations research (90B10) Transportation, logistics and supply chain management (90B06)
Cites Work
- A library of local search heuristics for the vehicle routing problem
- Title not available (Why is that?)
- A simple and effective evolutionary algorithm for the vehicle routing problem
- The vehicle routing problem
- The Vehicle Routing Problem with Time Windows: Minimizing Route Duration
- A Tabu Search Heuristic for the Vehicle Routing Problem with Soft Time Windows
- An Exchange Heuristic for Routeing Problems with Time Windows
- An efficient variable neighborhood search heuristic for very large scale vehicle routing problems
- Parallel Metaheuristics
- A Hybrid Genetic Algorithm for Multidepot and Periodic Vehicle Routing Problems
- Very large-scale vehicle routing: new test problems, algorithms, and results
- A parallel algorithm for the vehicle routing problem
- Parallel Metaheuristics Applications
- Parallel solution methods for vehicle routing problems
- Title not available (Why is that?)
- The granular tabu search and its application to the vehicle-routing problem
- The traveling-salesman problem
- A cooperative parallel meta-heuristic for the vehicle routing problem with time windows
- Active-guided evolution strategies for large-scale capacitated vehicle routing problems
- Title not available (Why is that?)
Cited In (17)
- A meta-heuristic for capacitated green vehicle routing problem
- Parallel Metaheuristics Applications
- Swarm intelligence-based hyper-heuristic for the vehicle routing problem with prioritized customers
- Cooperative versus non-cooperative parallel variable neighborhood search strategies: a case study on the capacitated vehicle routing problem
- An asynchronous parallel metaheuristic for the period vehicle routing problem
- An integrative cooperative search framework for multi-decision-attribute combinatorial optimization: application to the MDPVRP
- 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
- A parallel hybrid metaheuristic for bicluster editing
- Limited memory rank-1 cuts for vehicle routing problems
- A unified solution framework for multi-attribute vehicle routing problems
- Parallel solution methods for vehicle routing problems
- An urban transportation problem solved by parallel programming with hyper-heuristics
- Optimizing energy consumption of robotic cells by a branch \& bound algorithm
- 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
Uses Software
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)
