Using Simulated Annealing to Solve the Daily Drayage Problem with Hard Time Windows

被引：2

作者：

Escudero-Santana, Alejandro ^{[1
]}

Cuberos-Gallardo, Manuel ^{[1
]}

Munuzuri, Jesus ^{[1
]}

Cortes, Pablo ^{[1
]}

机构：

[1] Univ Seville, Escuela Tecn Super Ingn, Dept Org Ind & Gest Empresas 2, Avd Descubrimientos S-N, Seville 41092, Spain

来源：

NEW GLOBAL PERSPECTIVES ON INDUSTRIAL ENGINEERING AND MANAGEMENT | 2019年

关键词：

Drayage; Intermodality; Simulated annealing; Hard time windows;

D O I：

10.1007/978-3-319-93488-4_10

中图分类号：

T [工业技术];

学科分类号：

08 ;

摘要：

Drayage is the stage of the intermodal transport that deals with transport of freight on trucks among the intermodal terminal, and customers and suppliers that are located in its hinterland. This work proposes an algorithm based on simulated annealing heuristics to solve the operations of drayage. This algorithm has been used to solve battery problems, demonstrating the validity and suitability of its results, which were compared with exact method.

引用

页码：83 / 90

页数：8

共 12 条

[11] A tabu search heuristic for the local container drayage problem under a new operation mode [J].

Xue, Zhaojie ;

Zhang, Canrong ;

Lin, Wei-Hua ;

Miao, Lixin ;

Yang, Peng .

TRANSPORTATION RESEARCH PART E-LOGISTICS AND TRANSPORTATION REVIEW, 2014, 62 :136-150

[12] A reactive tabu search algorithm for the multi-depot container truck transportation problem [J].

Zhang, Ruiyou ;

Yun, Won Young ;

Moon, Ilkyeong .

TRANSPORTATION RESEARCH PART E-LOGISTICS AND TRANSPORTATION REVIEW, 2009, 45 (06) :904-914

← 1 2 →