Two exact algorithms for the vehicle routing problem on trees

被引：0

作者：

Mbaraga, P

Langevin, A

Laporte, G

机构：

[1] Univ Montreal, Ctr Rech Transports, Montreal, PQ H3C 3J7, Canada

[2] Ecole Polytech, Dept Math & Genie Ind, Montreal, PQ H3C 3J7, Canada

[3] Gerad, Montreal, PQ H3T 2A7, Canada

[4] Ecole Hautes Etud Commerciales, Montreal, PQ H3T 2A7, Canada

来源：

NAVAL RESEARCH LOGISTICS | 1999年 / 46卷 / 01期

关键词：

vehicle routing problem on trees; bin packing; column generation; exact algorithms; heuristic;

D O I：

10.1002/(SICI)1520-6750(199902)46:1<75::AID-NAV5>3.3.CO;2-9

中图分类号：

C93 [管理学]; O22 [运筹学];

学科分类号：

070105 ; 12 ; 1201 ; 1202 ; 120202 ;

摘要：

This article describes a heuristic and two exact algorithms for several classes of vehicle routing problems defined on tree networks. These include capacitated and time-constrained vehicle routing problems. One of the exact algorithms is based on the computation of bin packing lower bounds. The other uses column generation. The first algorithm performs better on problems containing small customer demands and in which all vehicles are identical. Otherwise, the second algorithm is more powerful and more versatile. (C) 1999 John Wiley & Sons, Inc.

引用

页码：75 / 89

页数：15

共 8 条

[1]

[Anonymous], 1990, KNAPSACK PROBLEMS

[2] BRANCH-AND-BOUND ALGORITHMS FOR THE MULTIPRODUCT ASSEMBLY LINE BALANCING PROBLEM [J].