New heuristics for the fleet size and mix vehicle routing problem with time windows

被引：38

作者：

Dullaert, W

Janssens, GK

Sörensen, K

Vernimmen, B

机构：

[1] Univ Antwerp, Ufsia Ruca Fac Appl Econ, B-2000 Antwerp, Belgium

[2] Limburgs Univ Centrum, Diepenbeek, Belgium

来源：

JOURNAL OF THE OPERATIONAL RESEARCH SOCIETY | 2002年 / 53卷 / 11期

关键词：

vehicle routing; heuristics; time windows; heterogeneous fleet;

D O I：

10.1057/palgrave.jors.2601422

中图分类号：

C93 [管理学];

学科分类号：

12 ; 1201 ; 1202 ; 120202 ;

摘要：

In the Fleet Size and Mix Vehicle Routing Problem with Time Windows (FSMVRPTW) customers need to be serviced in their time windows at minimal costs by a heterogeneous fleet. In this paper new heuristics for the FSMVRPTW are developed. The performance of the heuristics is shown to be significantly higher than that of any previous heuristic approach and therefore likely to achieve better solutions to practical routing problems.

引用

页码：1232 / 1238

页数：7

共 24 条

[1]

BLAUWENS G, 2002, HDB TRANSPORT EC

[2] A tabu search algorithm for the multi-trip vehicle routing and scheduling problem [J].