A heuristic algorithm for the asymmetric capacitated vehicle routing problem

DOI10.1016/S0377-2217(96)90060-0zbMath0908.90115MaRDI QIDQ1266654

Daniele Vigo

Publication date: 7 October 1998

Published in: European Journal of Operational Research (Search for Journal in Brave)

zbMATH Keywords

local searchheuristic algorithmasymmetric capacitated vehicle routing problem

Mathematics Subject Classification ID

Transportation, logistics and supply chain management (90B06) Combinatorial optimization (90C27)

Related Items

Using decomposition-based multi-objective algorithm to solve selective pickup and delivery problems with time windows, Heuristic algorithms for the vehicle routing problem with simultaneous pick-up and delivery, Polyhedral results and exact algorithms for the asymmetric travelling salesman problem with replenishment arcs, An exact algorithm for the capacitated shortest spanning arborescence, A heuristic algorithm for the symmetric and asymmetric vehicle routing problems with backhauls, A matheuristic for the asymmetric capacitated vehicle routing problem, Matheuristics: survey and synthesis, The capacitated general windy routing problem with turn penalties, Models, relaxations and exact approaches for the capacitated vehicle routing problem, Extended guided tabu search and a new packing algorithm for the two-dimensional loading vehicle routing problem, A way to optimally solve a time-dependent vehicle routing problem with time windows, Tolerance-Based vs. Cost-Based Branching for the Asymmetric Capacitated Vehicle Routing Problem

Uses Software

• VRP

Cites Work

• Unnamed Item
• Unnamed Item
• Polyhedral study of the capacitated vehicle routing problem
• The savings algorithm for the vehicle routing problem
• An additive bounding procedure for the asymmetric travelling salesman problem
• The vehicle routing problem: An overview of exact and approximate algorithms
• An exact algorithm for the asymmetrical capacitated vehicle routing problem
• An Additive Bounding Procedure for Combinatorial Optimization Problems
• Exact algorithms for the vehicle routing problem, based on spanning tree and shortest path relaxations
• Optimal Solution of Vehicle Routing Problems Using Minimum K-Trees
• A Branch-and-Bound Algorithm for the Capacitated Vehicle Routing Problem on Directed Graphs
• Computer Solutions of the Traveling Salesman Problem
• An Effective Heuristic Algorithm for the Traveling-Salesman Problem