A BRANCH AND BOUND ALGORITHM FOR THE MULTIPLE DEPOT VEHICLE SCHEDULING PROBLEM

被引:101
作者
CARPANETO, G [1 ]
DELLAMICO, M [1 ]
FISCHETTI, M [1 ]
TOTH, P [1 ]
机构
[1] UNIV BOLOGNA,DEIS,I-40126 BOLOGNA,ITALY
关键词
D O I
10.1002/net.3230190505
中图分类号
TP3 [计算技术、计算机技术];
学科分类号
0812 [计算机科学与技术];
摘要
引用
收藏
页码:531 / 548
页数:18
相关论文
共 11 条
[1]
ON SOME MATCHING PROBLEMS ARISING IN VEHICLE SCHEDULING MODELS [J].
BERTOSSI, AA ;
CARRARESI, P ;
GALLO, G .
NETWORKS, 1987, 17 (03) :271-281
[2]
BODIN L, 1978, J URBAN ANAL, V5, P47
[3]
BODIN L, 1983, COMPUT OPER RES, V10, P63, DOI 10.1016/0305-0548(83)90030-8
[4]
CLASSIFICATION IN VEHICLE-ROUTING AND SCHEDULING [J].
BODIN, L ;
GOLDEN, B .
NETWORKS, 1981, 11 (02) :97-108
[5]
SOME NEW BRANCHING AND BOUNDING CRITERIA FOR THE ASYMMETRIC TRAVELING SALESMAN PROBLEM [J].
CARPANETO, G ;
TOTH, P .
MANAGEMENT SCIENCE, 1980, 26 (07) :736-743
[6]
NETWORK MODELS FOR VEHICLE AND CREW SCHEDULING [J].
CARRARESI, P ;
GALLO, G .
EUROPEAN JOURNAL OF OPERATIONAL RESEARCH, 1984, 16 (02) :139-151
[7]
CARRARESI P, 1986, RICERCA OPERATIVA, V38, P121
[8]
A NEW DOMINANCE PROCEDURE FOR COMBINATORIAL OPTIMIZATION PROBLEMS [J].
FISCHETTI, M ;
TOTH, P .
OPERATIONS RESEARCH LETTERS, 1988, 7 (04) :181-187
[9]
FISCHETTI M, 1989, OPERATIONS RES, V37
[10]
Smith B. M., 1981, Computer Scheduling of Public Transport. Urban Passenger Vehicle and Crew Scheduling. Proceedings of an International Workshop, P97