A tabu search method for the truck and trailer routing problem

被引：183

作者：

Chao, IM ^{[1
]}

机构：

[1] Chinese Mil Acad, Dept Management Sci, Fengshan, Taiwan

来源：

COMPUTERS & OPERATIONS RESEARCH | 2002年 / 29卷 / 01期

关键词：

tabu search; heuristic; truck and trailer routing; vehicle routing; deterministic annealing;

D O I：

10.1016/S0305-0548(00)00056-3

中图分类号：

TP39 [计算机的应用];

学科分类号：

081203 ; 0835 ;

摘要：

A solution construction method and a tabu search improvement heuristic coupled with the deviation concept found in deterministic annealing is developed to solve the truck and trailer routing problem. We test our tabu search method on 21 problems that have been converted from the basic vehicle routing problem. Our construction method always solves a problem (it always finds a feasible solution) and the tabu search improvement heuristic significantly improves an initial solution.

引用

页码：33 / 51

页数：19

共 25 条

[1]

[Anonymous], 1986, C NUM METH COMB OPT

[2]

[Anonymous], 1979, Computers and Intractablity: A Guide to the Theoryof NP-Completeness

[3]

[Anonymous], 1997, TABU SEARCH

[4]

Ball M. O., 1995, NETWORK ROUTING HDB, V8

[5]

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

[6]

Chao IM, 1998, OPERAT RES COMP SCI, P301

[7] AN IMPROVED HEURISTIC FOR THE PERIOD VEHICLE-ROUTING PROBLEM [J].

CHAO, IM ;

GOLDEN, BL ;

WASIL, E .

NETWORKS, 1995, 26 (01) :25-44

[8]

Chao IM, 1999, INFOR, V37, P319

[9]

Chao IM, 1993, AM J MATH MGMT SCI, V13, P371

[10]

Christofides N., 1979, Combinatorial optimization, P315

← 1 2 3 →