Container movement by trucks in metropolitan networks: modeling and optimization

被引：106

作者：

Jula, H

Dessouky, M

Ioannou, P ^{[1
]}

Chassiakos, A

机构：

[1] Univ So Calif, Dept Elect Engn, Los Angeles, CA 90089 USA

[2] Penn State Univ, SSET, Middletown, PA 17057 USA

[3] Univ So Calif, Dept Ind & Syst Engn, Los Angeles, CA 90089 USA

[4] Calif State Univ Long Beach, Coll Engn, Long Beach, CA 90840 USA

来源：

TRANSPORTATION RESEARCH PART E-LOGISTICS AND TRANSPORTATION REVIEW | 2005年 / 41卷 / 03期

基金：

美国国家科学基金会;

关键词：

traveling salesman problem; time windows; dynamic programming; genetic algorithms; heuristic; container movement;

D O I：

10.1016/j.tre.2004.03.003

中图分类号：

F [经济];

学科分类号：

02 ;

摘要：

Container movement by trucks with time constraints at origins and destinations is modeled as an asymmetric "multi-Traveling Salesmen Problem with Time Windows" (m-TSPTW) with social constraints. A two-phase exact algorithm based on dynamic programming (DP) is proposed that finds the best routes for a fleet of trucks. Since the m-TSPTW problem is NP-hard, the computational time for optimally solving large size problems becomes prohibitive. For large size problems, we develop a hybrid methodology consisting of DP in conjunction with genetic algorithms. The developed algorithms are compared with an insertion heuristic method. Computational results demonstrate the efficiency of the developed algorithms. (c) 2004 Elsevier Ltd. All rights reserved.

引用

页码：235 / 259

页数：25

共 32 条

[1]

[Anonymous], LECT NOTES COMPUTER

[2]

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

[3]

Ascheuer N, 2000, NETWORKS, V36, P69, DOI 10.1002/1097-0037(200009)36:2<69::AID-NET1>3.0.CO

[4]

2-Q

[5]

BARBER D, 2001, 9910

[6]

BARTON ME, 2001, 24 7 OPERATION MARIN

[7] A genetic algorithm for the set covering problem [J].

Beasley, JE ;

Chu, PC .

EUROPEAN JOURNAL OF OPERATIONAL RESEARCH, 1996, 94 (02) :392-404

[8]

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

[9]

CAVO RW, 2000, TRANSPORT SCI, V34, P113

[10] A NEW OPTIMIZATION ALGORITHM FOR THE VEHICLE-ROUTING PROBLEM WITH TIME WINDOWS [J].

DESROCHERS, M ;

DESROSIERS, J ;

SOLOMON, M .

OPERATIONS RESEARCH, 1992, 40 (02) :342-354

← 1 2 3 4 →