期刊
TRANSPORTATION RESEARCH PART B-METHODOLOGICAL
卷 79, 期 -, 页码 134-148出版社
PERGAMON-ELSEVIER SCIENCE LTD
DOI: 10.1016/j.trb.2015.06.002
关键词
Full truckload transport; Container transport; Vehicle routing; Set covering; Service network design
类别
资金
- National Natural Science Foundation of China [NSFC 71471092, NSFC-RS 71311130142]
- Ningbo SciTech Bureau [2011B81006, 2012B10055]
- Internal Doctoral Innovation Centre programme
This paper introduces a bidirectional multi-shift full truckload transportation problem with operation dependent service times. The problem is different from the previous container transport problems and the existing approaches for container transport problems and vehicle routing pickup and delivery are either not suitable or inefficient. In this paper, a set covering model is developed for the problem based on a novel route representation and a container-flow mapping. It was demonstrated that the model can be applied to solve real-life, medium sized instances of the container transport problem at a large international port. A lower bound of the problem is also obtained by relaxing the time window constraints to the nearest shifts and transforming the problem into a service network design problem. Implications and managerial insights of the results by the lower bound results are also provided. (C) 2015 Elsevier Ltd. All rights reserved.
作者
我是这篇论文的作者
点击您的名字以认领此论文并将其添加到您的个人资料中。
推荐
暂无数据