Vehicle routing problems with time windows and multiple service workers: a systematic comparison between ACO and GRASP

DOI10.1007/S10100-014-0341-ZMaRDI QIDQ2629574zbMATH OpenOpenAlexFDO

Authors Gerald Senarclens de Grancy

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

zbMATH Keywords

ant colony optimizationGRASPlocal searchmetaheuristicstime windowsvehicle routing

Mathematics Subject Classification ID

Transportation, logistics and supply chain management (90B06) Approximation methods and heuristics in mathematical programming (90C59)

Recommendations

• A GRASP for the Vehicle Routing Problem with Time Windows
• scientific article; zbMATH DE number 5944664
• Ant colony system for a VRP with multiple time windows and multiple visits
• Ant Colonies Optimization (ACO) for the solution of the Vehicle Routing Problem (VRP)
• scientific article; zbMATH DE number 1488087

Cites work

• A probabilistic heuristic for a computationally difficult set covering problem
• Algorithms for the Vehicle Routing and Scheduling Problems with Time Window Constraints
• Cyclic Transfer Algorithm for Multivehicle Routing and Scheduling Problems
• D-Ants: Savings Based Ants divide and conquer the vehicle routing problem.
• Efficient GRASP+VND and GRASP+VNS metaheuristics for the traveling repairman problem
• Greedy randomized adaptive search procedures
• scientific article; zbMATH DE number 2050711 (Why is no real title available?)
• Improved Constructive Multistart Strategies for the Quadratic Assignment Problem Using Adaptive Memory
• Scatter search for the fleet size and mix vehicle routing problem with time windows
• The truck dispatching problem
• Vehicle routing with multiple deliverymen: modeling and heuristic approaches for the VRPTW

Cited in

(7)

• An exact hybrid method for the vehicle routing problem with time windows and multiple deliverymen
• 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
• Evaluating two new heuristics for constructing customer clusters in a VRPTW with multiple service workers
• Boosting the exploration of huge dynamic graphs
• The paired mail carrier problem
• An exact method for a last-mile delivery routing problem with multiple deliverymen

Describes a project that uses

Uses Software

• GNU parallel

This page was built for publication: Vehicle routing problems with time windows and multiple service workers: a systematic comparison between ACO and GRASP

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