Parallel Solution Methods for Vehicle Routing Problems
From MaRDI portal
Publication:3564355
DOI10.1007/978-0-387-77778-8_8zbMath1187.90046OpenAlexW2163715979MaRDI QIDQ3564355
Publication date: 2 June 2010
Published in: Operations Research/Computer Science Interfaces (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-0-387-77778-8_8
metaheuristicsparallel computationbranch-and-boundvehicle routing problemsparallelization strategies
Transportation, logistics and supply chain management (90B06) Deterministic scheduling theory in operations research (90B35)
Related Items
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, Using parallel \& distributed computing for real-time solving of vehicle routing problems with stochastic demands, Parallel computational optimization in operations research: a new integrative framework, literature review and research directions, A cooperative parallel metaheuristic for the capacitated vehicle routing problem, A parallel heuristic for the vehicle routing problem with simultaneous pickup and delivery, Cooperative versus non-cooperative parallel variable neighborhood search strategies: a case study on the capacitated vehicle routing problem, Heuristics for multi-attribute vehicle routing problems: a survey and synthesis
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- 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 implementation of the tabu search heuristic for vehicle routing problems with time window constraints
- Parallel branch, cut, and price for large-scale discrete optimization
- D-Ants: Savings Based Ants divide and conquer the vehicle routing problem.
- A library hierarchy for implementing scalable parallel search algorithms
- A cooperative parallel meta-heuristic for the vehicle routing problem with time windows
- An improved ant system algorithm for the vehicle routing problem
- Parallelization of a two-phase metaheuristic for routing problems with time windows
- A simple and effective evolutionary algorithm for the vehicle routing problem
- A parallel hybrid genetic algorithm for the vehicle routing problem with time windows
- Parallel asynchronous tabu search for multicommodity location-allocation with balancing requirements
- Parallel local search
- Probabilistic diversification and intensification in local search for vehicle routing
- A first multilevel cooperative algorithm for capacitated multicommodity network design
- Algorithms for the Vehicle Routing and Scheduling Problems with Time Window Constraints
- Parallel Variable Neighborhood Search
- Parallel Tabu Search
- Parallel Metaheuristics Applications
- Feature Article—Reporting Computational Experiments with Parallel Algorithms: Issues, Measures, and Experts' Opinions
- Parallel iterative search methods for vehicle routing problems
- A Tabu Search Heuristic for the Vehicle Routing Problem with Soft Time Windows
- Toward a Taxonomy of Parallel Tabu Search Heuristics
- The Ant Colony Optimization Metaheuristic: Algorithms, Applications, and Advances
- Parallel Strategies for Meta-Heuristics
- An asynchronous parallel metaheuristic for the period vehicle routing problem
- A unified tabu search heuristic for vehicle routing problems with time windows
- A Tabu Search Heuristic for the Vehicle Routing Problem
- Network Optimization Problems: Algorithms, Applications and Complexity
- Parallel Tabu Search for Real-Time Vehicle Routing and Dispatching
- Two Evolutionary Metaheuristics For The Vehicle Routing Problem With Time Windows
- Evolutionary Computation in Combinatorial Optimization
- Evolutionary Computation in Combinatorial Optimization
- A dynamic model and parallel tabu search heuristic for real-time ambulance relocation