A set-covering model for a bidirectional multi-shift full truckload vehicle routing problem |
| |
| Affiliation: | 1. Instituto de Desarrollo y Diseño (INGAR, CONICET-UTN), Avellaneda 3657, S3002GJC Santa Fe, Argentina;2. Facultad de Ingeniería Química, Universidad Nacional del Litoral, Santiago del Estero 2829, Santa Fe, Argentina;3. Facultad de Ciencias Exactas, Ingeniería y Agrimensura, Universidad Nacional de Rosario, Rosario, Argentina;1. École Polytechnique de Montréal, C.P. 6079, succursale Centre-ville, Montréal H3C 3A7, Canada;2. GERAD, 3000 chemin de la Côte-Sainte-Catherine, Montréal H3T 2A7, Canada;3. Chair of Logistics Management, Gutenberg School of Management and Economics, Johannes Gutenberg University, Mainz D-55099, Germany;4. HEC Montréal, 3000 chemin de la Côte-Sainte-Catherine, Montréal H3T 2A7, Canada;5. CIRRELT, C.P. 6128, succursale Centre-ville, Montréal H3C 3J7, Canada |
| |
| 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. |
| |
| Keywords: | Full truckload transport Container transport Vehicle routing Set covering Service network design |
| 本文献已被 ScienceDirect 等数据库收录！ |
|
