Vehicle routing problems with time windows and multiple service workers: a systematic comparison between ACO and GRASP
From MaRDI portal
Publication:2629574
DOI10.1007/s10100-014-0341-zzbMath1339.90064OpenAlexW1975250852MaRDI QIDQ2629574
Publication date: 6 July 2016
Published in: CEJOR. Central European Journal of Operations Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10100-014-0341-z
Transportation, logistics and supply chain management (90B06) Approximation methods and heuristics in mathematical programming (90C59)
Related Items (6)
Evaluating two new heuristics for constructing customer clusters in a VRPTW with multiple service workers ⋮ An exact hybrid method for the vehicle routing problem with time windows and multiple deliverymen ⋮ The paired mail carrier problem ⋮ Boosting the Exploration of Huge Dynamic Graphs ⋮ Application of a fuzzy ant colony system to solve the dynamic vehicle routing problem with uncertain service time ⋮ Robust optimization for the vehicle routing problem with multiple deliverymen
Uses Software
Cites Work
- Unnamed Item
- Vehicle routing with multiple deliverymen: modeling and heuristic approaches for the VRPTW
- Efficient GRASP+VND and GRASP+VNS metaheuristics for the traveling repairman problem
- Scatter search for the fleet size and mix vehicle routing problem with time windows
- A probabilistic heuristic for a computationally difficult set covering problem
- D-Ants: Savings Based Ants divide and conquer the vehicle routing problem.
- Greedy randomized adaptive search procedures
- The Truck Dispatching Problem
- Algorithms for the Vehicle Routing and Scheduling Problems with Time Window Constraints
- Cyclic Transfer Algorithm for Multivehicle Routing and Scheduling Problems
- Improved Constructive Multistart Strategies for the Quadratic Assignment Problem Using Adaptive Memory
This page was built for publication: Vehicle routing problems with time windows and multiple service workers: a systematic comparison between ACO and GRASP