A BRANCH AND BOUND ALGORITHM FOR A CLASS OF ASYMMETRICAL VEHICLE ROUTEING PROBLEMS

被引：17

作者：

LAPORTE, G ^{[1
]}

MERCURE, H ^{[1
]}

NOBERT, Y ^{[1
]}

机构：

[1] UNIV QUEBEC, MONTREAL H3C 3P8, QUEBEC, CANADA

来源：

JOURNAL OF THE OPERATIONAL RESEARCH SOCIETY | 1992年 / 43卷 / 05期

关键词：

VEHICLE ROUTEING; INTEGER PROGRAMMING;

D O I：

10.2307/2583566

中图分类号：

C93 [管理学];

学科分类号：

12 ; 1201 ; 1202 ; 120202 ;

摘要：

This paper describes a branch and bound algorithm for a general class of asymmetrical vehicle routeing problems. Vehicle routes start and end at a central depot. Visits are made to nodes grouped into clusters: every cluster must receive a minimum number of visits. But not all nodes must be visited: there are specified nodes and non-specified nodes. Vehicle routes are also constrained by capacity and distance restrictions. The problem is formulated as an integer linear program. It is then solved by a branch and bound algorithm which exploits the unimodular structure of the subproblems. Computational results are reported.

引用

页码：469 / 481

页数：13

共 17 条

[1]

BODIN L, 1983, COMPUT OPER RES, V10, P63, DOI 10.1016/0305-0548(83)90030-8

[2] SOME NEW BRANCHING AND BOUNDING CRITERIA FOR THE ASYMMETRIC TRAVELING SALESMAN PROBLEM [J].