Comparing backhauling strategies in vehicle routing using ant colony optimization

DOI10.1007/s10100-006-0163-8zbMath1203.90086OpenAlexW2020033931MaRDI QIDQ926337

Marc Reimann, Heinz Ulrich

Publication date: 27 May 2008

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-006-0163-8

zbMATH Keywords

ant colony optimizationvehicle routing problemsbackhauling strategies

Mathematics Subject Classification ID

Management decision making, including multiple objectives (90B50) Transportation, logistics and supply chain management (90B06) Approximation methods and heuristics in mathematical programming (90C59) Inventory, storage, reservoirs (90B05)

Related Items (12)

Rich vehicle routing problems: from a taxonomy to a definition ⋮ Bi-objective bimodal urban road network design using hybrid metaheuristics ⋮ The pickup and delivery problem with time windows, multiple stacks, and handling operations ⋮ Vehicle routing with backhauls: review and research perspectives ⋮ An iterative biased‐randomized heuristic for the fleet size and mix vehicle‐routing problem with backhauls ⋮ Multi-trip pickup and delivery problem with time windows and synchronization ⋮ Vehicle routing with multiple deliverymen: modeling and heuristic approaches for the VRPTW ⋮ Heuristics for vehicle routing problems with backhauls, time windows, and 3D loading constraints ⋮ Optimizing logistics routings in a network perspective of supply and demand nodes ⋮ The vehicle routing problem with simultaneous pickup and delivery and handling costs ⋮ Adaptive memory artificial bee colony algorithm for Green vehicle routing with cross-docking ⋮ Heuristic algorithms for a vehicle routing problem with simultaneous delivery and pickup and time windows in home health care

Uses Software

• VRP
• MACS-VRPTW

Cites Work

• Unnamed Item
• A unified heuristic for a large class of vehicle routing problems with backhauls
• CompetAnts for problem solving. The case of full truckload transportation.
• ACO algorithms with guaranteed convergence to the optimal solution
• Tabu search heuristics for the vehicle routing problem with time windows.
• A new branching strategy for time constrained routing problems with application to backhauling
• Metastrategy simulated annealing and tabu search algorithms for the vehicle routing problem
• Heuristic approaches to vehicle routing with backhauls and time windows
• The Vehicle Routing Problem
• Algorithms for the Vehicle Routing and Scheduling Problems with Time Window Constraints
• A tabu search heuristic for periodic and multi-depot vehicle routing problems
• A Tabu Search Heuristic for the Vehicle Routing Problem with Backhauls and Time Windows
• A guide to vehicle routing heuristics
• A unified tabu search heuristic for vehicle routing problems with time windows
• A GRASP for the Vehicle Routing Problem with Time Windows

This page was built for publication: Comparing backhauling strategies in vehicle routing using ant colony optimization