LAGRANGIAN-RELAXATION METHODS FOR SOLVING THE MINIMUM FLEET SIZE MULTIPLE TRAVELING SALESMAN PROBLEM WITH TIME WINDOWS

被引：50

作者：

DESROSIERS, J

SAUVE, M

SOUMIS, F

机构：

[1] GRP ETUD & RECH ANAL DECIS, MONTREAL H3T 1V6, QUEBEC, CANADA

[2] ECOLE POLYTECH, OPERAT RES, MONTREAL H3C 3A7, QUEBEC, CANADA

[3] CTR RECH TRANSPORTS, MONTREAL H3C 3A7, QUEBEC, CANADA

来源：

关键词：

D O I：

10.1287/mnsc.34.8.1005

中图分类号：

C93 [管理学];

学科分类号：

12 ; 1201 ; 1202 ; 120202 ;

摘要：

引用

页码：1005 / 1022

页数：18

共 40 条

[1] AN EXACT ALGORITHM FOR THE TIME-CONSTRAINED TRAVELING SALESMAN PROBLEM
BAKER, EK
[J]. OPERATIONS RESEARCH, 1983, 31 (05) : 938 - 945
[2] Bertsekas D. P., 1982, CONSTRAINED OPTIMIZA
[3] BODIN L, 1983, COMPUT OPER RES, V10, P63, DOI 10.1016/0305-0548(83)90030-8
[4] Bodin L. D., 1979, Transportation Science, V13, P113, DOI 10.1287/trsc.13.2.113
[5] STATE-SPACE RELAXATION PROCEDURES FOR THE COMPUTATION OF BOUNDS TO ROUTING-PROBLEMS
CHRISTOFIDES, N
MINGOZZI, A
TOTH, P
[J]. NETWORKS, 1981, 11 (02) : 145 - 164
[6] DECOMPOSITION PRINCIPLE FOR LINEAR-PROGRAMS
DANTZIG, GB
WOLFE, P
[J]. OPERATIONS RESEARCH, 1960, 8 (01) : 101 - 111
[7] DESROCHERS M, 1985, PUBLICATION U MONT A, V394
[8] DESROCHERS M, 1986, PUBLICATION U MONT A, V421
[9] DESROCHERS M, 1988, IN PRESS EUROPEAN J, V35, P242
[10] DESROSIERS J, 1983, RAIRO-RECH OPER, V17, P357