An exact algorithm for the container drayage problem under a separation mode
Authors:
- Yujian SongYSYujian Song
- Jiantong ZhangJZJiantong Zhang
- Zhe LiangZLZhe Liang
- Chunming YeCYChunming Ye
- 1 October 2017
- journal article
- Published by Elsevier in Transportation Research Part E: Logistics and Transportation Review
- Vol. 106, 231-254
Abstract
No abstract availableThis publication has 35 references indexed in Scilit:
- A model for a multi-size inland container transportation problemTransportation Research Part E: Logistics and Transportation Review, 2016
- A branch-and-price approach for a multi-period vehicle routing problemComputers & Operations Research, 2015
- Dynamic approach to solve the daily drayage problem with transit time uncertaintyComputers in Industry, 2013
- Integrated planning of loaded and empty container movementsOR Spectrum, 2012
- A branch-and-cut-and-price algorithm for the multi-depot heterogeneous vehicle routing problem with time windowsTransportation Research Part C: Emerging Technologies, 2011
- A deterministic annealing algorithm for the pre- and end-haulage of intermodal container terminalsInternational Journal of Computer Aided Engineering and Technology, 2010
- A local search heuristic for the pre- and end-haulage of intermodal container terminalsComputers & Operations Research, 2009
- An attribute–decision model for cross-border drayage problemTransportation Research Part E: Logistics and Transportation Review, 2008
- Development of mathematical models for the container road transportation in Korean trucking industriesComputers & Industrial Engineering, 2007
- Static pickup and delivery problems: a classification scheme and surveyTOP, 2007