Road transportation represents the most used transportation mode to cover short distances. However, structural lack of planning and optimization in road transportation creates negative effects both for companies and for the social community, such as environmental pollution, economic loss and road congestion. These effects are mainly due to the fact that a lack of planning can yield the necessity of a huge number of empty trips. Usually trucks that pick up or deliver a full container in a port must return back the empty container to the place where the trip started, so performing one leg of the total trip without payload. The aim of the present paper is to propose a mathematical approach for combining multiple trips in a port environment (specifically, import, export and inland trips) by considering the opportunity of carrying two 20 ft containers simultaneously on the same truck and by using the same load unit if possible. In this way, in the same route, more than two nodes can be visited with the same vehicle thus significantly reducing the number of total empty movements. Time windows constraints related to companies and terminal opening hours as well as to ship departures are considered in the problem formulation. Moreover driving hours restrictions and trips deadlines are taken into account, together with goods compatibility for matching different trips. An experimental campaign based on real data is discussed in the paper.
|Titolo:||Combining multiple trips in a port environment for empty movements minimization|
|Data di pubblicazione:||2015|
|Appare nelle tipologie:||04.01 - Contributo in atti di convegno|