A 3-OPT BASED SIMULATED ANNEALING ALGORITHM FOR VEHICLE-ROUTING PROBLEMS

被引：40

作者：

ALFA, AS ^{[1
]}

HERAGU, SS ^{[1
]}

CHEN, MY ^{[1
]}

机构：

[1] UNIV MANITOBA, INST TRANSPORT, WINNIPEG R3T 2N2, MANITOBA, CANADA

来源：

COMPUTERS & INDUSTRIAL ENGINEERING | 1991年 / 21卷 / 1-4期

关键词：

D O I：

10.1016/0360-8352(91)90165-3

中图分类号：

TP39 [计算机的应用];

学科分类号：

081203 ; 0835 ;

摘要：

Simulated Annealing is combined with the 3-opt heuristic to solve the vehicle routing problem. The results are encouraging; two examples out of three large size problems gave results as good as the best known 3-opt solution. Preliminary results with the heuristic algorithm are presented.

引用

页码：635 / 639

页数：5

共 18 条

[1]

Aarts E., 1989, SIMULATED ANNEALING

[2]

ASSAD A, 1988, VEHICLE ROUTING METH

[3] TRAVELING SALESMAN PROBLEM - A SURVEY [J].

BELLMORE, M ;

NEHAUSE.GL .

OPERATIONS RESEARCH, 1968, 16 (03) :538-&

[4]

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

[5] AN ALGORITHM FOR VEHICLE-DISPATCHING PROBLEM [J].

CHRISTOF.N ;

EILON, S .

OPERATIONAL RESEARCH QUARTERLY, 1969, 20 (03) :309-&

[6] ALGORITHMS FOR LARGE-SCALE TRAVELLING SALESMAN PROBLEMS [J].

CHRISTOFIDES, N ;

EILON, S .

OPERATIONAL RESEARCH QUARTERLY, 1972, 23 (04) :511-+

[7] SCHEDULING OF VEHICLES FROM CENTRAL DEPOT TO NUMBER OF DELIVERY POINTS [J].

CLARKE, G ;

WRIGHT, JW .

OPERATIONS RESEARCH, 1964, 12 (04) :568-&

[8] AN IMPROVED ANNEALING SCHEME FOR THE QAP [J].

CONNOLLY, DT .

EUROPEAN JOURNAL OF OPERATIONAL RESEARCH, 1990, 46 (01) :93-100

[9] INTEGER PROGRAMMING APPROACH TO VEHICLE SCHEDULING PROBLEM [J].

FOSTER, BA ;

RYAN, DM .

OPERATIONAL RESEARCH QUARTERLY, 1976, 27 (02) :367-384

[10] USING SIMULATED ANNEALING TO SOLVE ROUTING AND LOCATION-PROBLEMS [J].

GOLDEN, BL ;

SKISCIM, CC .

NAVAL RESEARCH LOGISTICS, 1986, 33 (02) :261-279

← 1 2 →