A Combinatorial Benders’ Cuts Algorithm for the Local Container Drayage Problem
Joint Authors
Miao, Lixin
Xue, Zhaojie
Zhang, Canrong
Yang, Peng
Source
Mathematical Problems in Engineering
Issue
Vol. 2015, Issue 2015 (31 Dec. 2015), pp.1-7, 7 p.
Publisher
Hindawi Publishing Corporation
Publication Date
2015-02-25
Country of Publication
Egypt
No. of Pages
7
Main Subjects
Abstract EN
This paper examines the local container drayage problem under a special operation mode in which tractors and trailers can be separated; that is, tractors can be assigned to a new task at another location while trailers with containers are waiting for packing or unpacking.
Meanwhile, the strategy of sharing empty containers between different customers is also considered to improve the efficiency and lower the operation cost.
The problem is formulated as a vehicle routing and scheduling problem with temporal constraints.
We adopt combinatorial benders’ cuts algorithm to solve this problem.
Numerical experiments are performed on a group of randomly generated instances to test the performance of the proposed algorithm.
American Psychological Association (APA)
Xue, Zhaojie& Zhang, Canrong& Yang, Peng& Miao, Lixin. 2015. A Combinatorial Benders’ Cuts Algorithm for the Local Container Drayage Problem. Mathematical Problems in Engineering،Vol. 2015, no. 2015, pp.1-7.
https://search.emarefa.net/detail/BIM-1072968
Modern Language Association (MLA)
Xue, Zhaojie…[et al.]. A Combinatorial Benders’ Cuts Algorithm for the Local Container Drayage Problem. Mathematical Problems in Engineering No. 2015 (2015), pp.1-7.
https://search.emarefa.net/detail/BIM-1072968
American Medical Association (AMA)
Xue, Zhaojie& Zhang, Canrong& Yang, Peng& Miao, Lixin. A Combinatorial Benders’ Cuts Algorithm for the Local Container Drayage Problem. Mathematical Problems in Engineering. 2015. Vol. 2015, no. 2015, pp.1-7.
https://search.emarefa.net/detail/BIM-1072968
Data Type
Journal Articles
Language
English
Notes
Includes bibliographical references
Record ID
BIM-1072968