Modelling and solving the multi-day container drayage problem

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:

• http://hdl.handle.net/11368/2926618

• http://xplorestaging.ieee.org/ielx7/8244402/8256062/08256108.pdf?arnumber=8256108,

http://dx.doi.org/10.1109/coase.2017.8256108

• https://dblp.uni-trier.de/db/conf/case/case2017.html#ClementeFNSU17,

https://arts.units.it/handle/11368/2926618,

https://core.ac.uk/display/158823993,

https://academic.microsoft.com/#/detail/2782578837