Ant colony system with characterization-based heuristics for a bottled-products distribution logistics system

DOI10.1016/j.cam.2013.10.035zbMath1314.90025MaRDI QIDQ2349706

Juan J. González B., Juan J. Martínez P., Laura Cruz-Reyes, Héctor J. Fraire H., Rodolfo A. Pazos R., Claudia G. Gómez S.

Publication date: 17 June 2015

Published in: Journal of Computational and Applied Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.cam.2013.10.035

zbMATH Keywords

vehicle routing problem; ant colony system algorithm; heuristics hybridization

Mathematics Subject Classification ID

90B06: Transportation, logistics and supply chain management

90C59: Approximation methods and heuristics in mathematical programming

Uses Software

• VRP

Cites Work

• Unnamed Item
• Unnamed Item
• Model-based search for combinatorial optimization: A critical survey
• A general heuristic for vehicle routing problems
• Formulations and exact algorithms for the vehicle routing problem with time windows
• Ant colony optimization theory: a survey
• The Truck Dispatching Problem
• The Vehicle Routing Problem
• A Reactive Variable Neighborhood Search for the Vehicle-Routing Problem with Time Windows
• Algorithms for the Vehicle Routing and Scheduling Problems with Time Window Constraints
• A branch-and-price-based large neighborhood search algorithm for the vehicle routing problem with time windows