A set-covering model for a bidirectional multi-shift full truckload vehicle routing problem. (September 2015)

• Record Type: Journal Article
• Authors: Bai, Ruibin; Xue, Ning; Chen, Jianjun; Roberts, Gethin Wyn
• Is Part Of: Transportation research. Volume 79(2015)
• Page Start: 134
• Page End: 148
• Publication Date: 2015-09
• Subjects: Full truckload transport -- Container transport -- Vehicle routing -- Set covering -- Service network design; Transportation -- Research -- Periodicals; Transportation -- Mathematical models -- Periodicals
• DOI: 10.1016/j.trb.2015.06.002
• Languages: English
• ISSNs: 0191-2615

Abstract

Highlights: A novel set covering model is developed for a real-life multi-shift full truckload problem. The proposed three-stage hybrid method through node combination produces better quality solutions than existing approaches. A lower bound is developed for this problem based on a relaxed service network design model. Experimental results show that temporal and spatial load imbalance causes transportation inefficiency. Abstract: 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.