A set-covering model for a bidirectional multi-shift full truckload vehicle routing problem
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...
| Main Authors: | , , , |
|---|---|
| Format: | Article |
| Published: |
Elsevier
2015
|
| Subjects: | |
| Online Access: | https://eprints.nottingham.ac.uk/47711/ |
| _version_ | 1848797610944495616 |
|---|---|
| author | Bai, Ruibin Xue, Ning Chen, Jianjun Roberts, Gethin Wyn |
| author_facet | Bai, Ruibin Xue, Ning Chen, Jianjun Roberts, Gethin Wyn |
| author_sort | Bai, Ruibin |
| building | Nottingham Research Data Repository |
| collection | Online Access |
| description | 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. |
| first_indexed | 2025-11-14T20:06:37Z |
| format | Article |
| id | nottingham-47711 |
| institution | University of Nottingham Malaysia Campus |
| institution_category | Local University |
| last_indexed | 2025-11-14T20:06:37Z |
| publishDate | 2015 |
| publisher | Elsevier |
| recordtype | eprints |
| repository_type | Digital Repository |
| spelling | nottingham-477112020-05-04T17:10:01Z https://eprints.nottingham.ac.uk/47711/ A set-covering model for a bidirectional multi-shift full truckload vehicle routing problem Bai, Ruibin Xue, Ning Chen, Jianjun Roberts, Gethin Wyn 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. Elsevier 2015-06-25 Article PeerReviewed Bai, Ruibin, Xue, Ning, Chen, Jianjun and Roberts, Gethin Wyn (2015) A set-covering model for a bidirectional multi-shift full truckload vehicle routing problem. Transportation Research Part B: Methodological, 79 . pp. 134-148. ISSN 0191-2615 Full truckload transport; Container transport; Vehicle routing; Set covering; Service network design http://www.sciencedirect.com/science/article/pii/S019126151500123X doi:10.1016/j.trb.2015.06.002 doi:10.1016/j.trb.2015.06.002 |
| spellingShingle | Full truckload transport; Container transport; Vehicle routing; Set covering; Service network design Bai, Ruibin Xue, Ning Chen, Jianjun Roberts, Gethin Wyn A set-covering model for a bidirectional multi-shift full truckload vehicle routing problem |
| title | A set-covering model for a bidirectional multi-shift full truckload vehicle routing problem |
| title_full | A set-covering model for a bidirectional multi-shift full truckload vehicle routing problem |
| title_fullStr | A set-covering model for a bidirectional multi-shift full truckload vehicle routing problem |
| title_full_unstemmed | A set-covering model for a bidirectional multi-shift full truckload vehicle routing problem |
| title_short | A set-covering model for a bidirectional multi-shift full truckload vehicle routing problem |
| title_sort | set-covering model for a bidirectional multi-shift full truckload vehicle routing problem |
| topic | Full truckload transport; Container transport; Vehicle routing; Set covering; Service network design |
| url | https://eprints.nottingham.ac.uk/47711/ https://eprints.nottingham.ac.uk/47711/ https://eprints.nottingham.ac.uk/47711/ |