Parallel solution methods for vehicle routing problems

Cites Work

A library hierarchy for implementing scalable parallel search algorithms
Title not available (Why is that?)
D-Ants: Savings Based Ants divide and conquer the vehicle routing problem.
Title not available (Why is that?)
A simple and effective evolutionary algorithm for the vehicle routing problem
Algorithms for the Vehicle Routing and Scheduling Problems with Time Window Constraints
A Tabu Search Heuristic for the Vehicle Routing Problem with Soft Time Windows
A unified tabu search heuristic for vehicle routing problems with time windows
A first multilevel cooperative algorithm for capacitated multicommodity network design
Title not available (Why is that?)
The Ant Colony Optimization Metaheuristic: Algorithms, Applications, and Advances
A dynamic model and parallel tabu search heuristic for real-time ambulance relocation
A parallel hybrid genetic algorithm for the vehicle routing problem with time windows
Parallel asynchronous tabu search for multicommodity location-allocation with balancing requirements
Probabilistic diversification and intensification in local search for vehicle routing
Parallel Metaheuristics Applications
Parallel iterative search methods for vehicle routing problems
Toward a Taxonomy of Parallel Tabu Search Heuristics
A Tabu Search Heuristic for the Vehicle Routing Problem
Parallel Tabu Search for Real-Time Vehicle Routing and Dispatching
Title not available (Why is that?)
Title not available (Why is that?)
Two Evolutionary Metaheuristics For The Vehicle Routing Problem With Time Windows
A parallel implementation of the tabu search heuristic for vehicle routing problems with time window constraints
A cooperative parallel meta-heuristic for the vehicle routing problem with time windows
An asynchronous parallel metaheuristic for the period vehicle routing problem
Parallel Variable Neighborhood Search
Parallel Tabu Search
Title not available (Why is that?)
Title not available (Why is that?)
An improved ant system algorithm for the vehicle routing problem
Evolutionary Computation in Combinatorial Optimization
Strategies for the parallel implementation of metaheuristics
Title not available (Why is that?)
Parallel Strategies for Meta-Heuristics
Title not available (Why is that?)
Network Optimization Problems: Algorithms, Applications and Complexity
Parallel local search
A parallel algorithm for the vehicle routing problem with time window constraints
Parallelization of a two-phase metaheuristic for routing problems with time windows
Feature Article—Reporting Computational Experiments with Parallel Algorithms: Issues, Measures, and Experts' Opinions
Parallel branch, cut, and price for large-scale discrete optimization
A multilevel tabu search algorithm for the feature selection problem in biomedical data
Evolutionary Computation in Combinatorial Optimization
Title not available (Why is that?)
Title not available (Why is that?)

Cited In (13)

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
Sequential and parallel large neighborhood search algorithms for the periodic location routing problem
An integrative cooperative search framework for multi-decision-attribute combinatorial optimization: application to the MDPVRP
A parallel implementation of the TSSP+1 decomposition for the capacity-constrained vehicle routing problem
Using parallel \& distributed computing for real-time solving of vehicle routing problems with stochastic demands
Heuristics for multi-attribute vehicle routing problems: a survey and synthesis
A SCALABLE PARALLEL ALGORITHM FOR TURNPIKE PROBLEM
A parallel heuristic for the vehicle routing problem with simultaneous pickup and delivery
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
Extensions of the Petal Method for Vehicle Routeing
A cooperative parallel metaheuristic for the capacitated vehicle routing problem

Uses Software

ALPS
BLIS
BiCePS

   Recommendations

A parallel algorithm for the vehicle routing problem 👍 👎
Solving variants of the vehicle routing problem with a simple parallel iterated tabu search 👍 👎
A parallel heuristic for the vehicle routing problem with simultaneous pickup and delivery 👍 👎
A parallel implementation of the TSSP+1 decomposition for the capacity-constrained vehicle routing problem 👍 👎
A cooperative parallel metaheuristic for the capacitated vehicle routing problem 👍 👎

This page was built for publication: Parallel solution methods for vehicle routing problems

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