(Created page with " == Abstract == This paper deals with a general Multi-Day Container Drayage Problem (MDCDP) that consists in assigning trucks to container transportation orders during severa...") |
m (Scipediacontent moved page Draft Content 562675898 to Clemente et al 2017a) |
(No difference)
| |
Latest revision as of 19:30, 3 February 2021
Abstract
This paper deals with a general Multi-Day Container Drayage Problem (MDCDP) that consists in assigning trucks to container transportation orders during several days. To this aim, a Mixed Integer Linear Programming problem is formulated: the model describes real problems taking into account the orders to be planned for several days, the types of the containers and the rest periods of drivers. In order to address real scenarios, a heuristic algorithm based on the rolling horizon approach is proposed. Some randomly generated MDCDP instances validate the heuristic algorithm and a case study of real dimensions shows the effectiveness of the proposed solution technique.
Original document
The different versions of the original document can be found in:
Document information
Published on 01/01/2017
Volume 2017, 2017
DOI: 10.1109/coase.2017.8256108
Licence: CC BY-NC-SA license
Share this document
claim authorship
Are you one of the authors of this document?