Routing a Heterogeneous Fleet of Vehicles
Routing a Heterogeneous Fleet of Vehicles
复制标题
DOI：
10.1007/978-0-387-77778-8_1
复制
发表时间：
2008-01-01
期刊：
影响因子：
--
通讯作者：
Vigo, Daniele
中科院分区：
文献类型：
--
作者：
Baldacci, Roberto;Battarra, Maria;Vigo, Daniele
车辆路径问题（VehicleRoutingProblem，VRP）是一种基于车辆容量约束的车辆路径优化问题，当车辆容量和成本不同的车队可用于配送活动时，VRP的一个重要变体就出现了。该问题被称为混合车队车辆路径问题或异构车队车辆路径问题。本章概述了文献中解决异构车辆路径问题的方法。特别是，我们对文献中描述的不同变体进行了分类，由于没有精确的算法已经提出了异构VRP的任何变体，我们回顾了下界和提出的启发式算法。计算结果，比较性能的不同启发式算法的基准实例，也进行了讨论。
In the well-known Vehicle Routing Problem (VRP) a set of identical vehicles, based at a central depot, is to be optimally routed to supply customers with known demands subject to vehicle capacity constraints.An important variant of the VRP arises when a fleet of vehicles characterized by different capacities and costs is available for distribution activities. The problem is known as the Mixed Fleet VRP or as the Heterogeneous Fleet VRP.This chapter gives an overview of approaches from the literature to solve heterogeneous VRPs. In particular, we classify the different variants described in the literature and, as no exact algorithm has been presented for any variants of heterogeneous VRP, we review the lower bounds and the heuristic algorithms proposed. Computational results, comparing the performance of the different heuristic algorithms on benchmark instances, are also discussed.