Parallel solution methods for vehicle routing problems
From MaRDI portal
Publication:3564355
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
Cites work
- scientific article; zbMATH DE number 3643061 (Why is no real title available?)
- scientific article; zbMATH DE number 51132 (Why is no real title available?)
- scientific article; zbMATH DE number 53884 (Why is no real title available?)
- scientific article; zbMATH DE number 1062113 (Why is no real title available?)
- scientific article; zbMATH DE number 1163099 (Why is no real title available?)
- scientific article; zbMATH DE number 2013520 (Why is no real title available?)
- scientific article; zbMATH DE number 1424205 (Why is no real title available?)
- scientific article; zbMATH DE number 1452993 (Why is no real title available?)
- scientific article; zbMATH DE number 1453001 (Why is no real title available?)
- scientific article; zbMATH DE number 2209658 (Why is no real title available?)
- A Tabu Search Heuristic for the Vehicle Routing Problem
- 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 dynamic model and parallel tabu search heuristic for real-time ambulance relocation
- A first multilevel cooperative algorithm for capacitated multicommodity network design
- A library hierarchy for implementing scalable parallel search algorithms
- A multilevel cooperative tabu search algorithm for the covering design problem
- A multilevel tabu search algorithm for the feature selection problem in biomedical data
- A parallel algorithm for the vehicle routing problem with time window constraints
- A parallel hybrid genetic algorithm 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 simple and effective evolutionary algorithm for the vehicle routing problem
- A unified tabu search heuristic for vehicle routing problems with time windows
- Algorithms for the Vehicle Routing and Scheduling Problems with Time Window Constraints
- An asynchronous parallel metaheuristic for the period vehicle routing problem
- An improved ant system algorithm for the vehicle routing problem
- D-Ants: Savings Based Ants divide and conquer the vehicle routing problem.
- Evolutionary Computation in Combinatorial Optimization
- Evolutionary Computation in Combinatorial Optimization
- Feature Article—Reporting Computational Experiments with Parallel Algorithms: Issues, Measures, and Experts' Opinions
- Network Optimization Problems: Algorithms, Applications and Complexity
- Parallel Metaheuristics Applications
- Parallel Strategies for Meta-Heuristics
- Parallel Tabu Search
- Parallel Tabu Search for Real-Time Vehicle Routing and Dispatching
- Parallel Variable Neighborhood Search
- Parallel asynchronous tabu search for multicommodity location-allocation with balancing requirements
- Parallel branch, cut, and price for large-scale discrete optimization
- Parallel iterative search methods for vehicle routing problems
- Parallel local search
- Parallelization of a two-phase metaheuristic for routing problems with time windows
- Probabilistic diversification and intensification in local search for vehicle routing
- Strategies for the parallel implementation of metaheuristics
- The Ant Colony Optimization Metaheuristic: Algorithms, Applications, and Advances
- Toward a Taxonomy of Parallel Tabu Search Heuristics
- Two Evolutionary Metaheuristics For The Vehicle Routing Problem With Time Windows
Cited in
(16)- A parallel algorithm for the vehicle routing problem
- Cooperative versus non-cooperative parallel variable neighborhood search strategies: a case study on the capacitated 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
- An asynchronous parallel metaheuristic for the period vehicle routing problem
- 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
- Anomalies in distributed branch-and-cut solving of the CVRP with different search strategies
- A cooperative parallel metaheuristic for the capacitated vehicle routing problem
- Solving variants of the vehicle routing problem with a simple parallel iterated tabu search
- Extensions of the Petal Method for Vehicle Routeing
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)
