Vehicle compounds, especially at large seaports, are essential hubs for finished vehicle logistics. They serve as a link between different traffic carriers, i.e. vessels, trains and lorries. At the same time, they offer large storage areas, which act as a buffer for the inbound and outbound logistics. The increasing capacity of vessels and a decreasing number of lay days challenges the compounds to implement an efficient inter-terminal logistic to keep up with the resulting time restrictions. As vehicles have to be loaded/unloaded by drivers (roll-on/roll-off) and shuttles are used to transfer drivers to these vehicles, an efficient shuttle routing is crucial for picking up and dropping off drivers in appropriate time. A high productivity has to be ensured by proceeding many vehicles. While we formulate the assignment of vehicles to drivers as orders and optional usage of shuttles in an assignment problem, we separate the routing problem for the shuttles to attenuate the computational effort. While this separation allows for flexibility to choose different routing algorithms, they affect the overall performance, i.e. the number of completed orders. We implement a FIFO and a Branch and Bound routing algorithm. For the latter, we introduce penalty parameters to weight a fast execution of orders against an efficient shuttle routing. The parameters are explored in a full-factorial sampling to evaluate the performance.
Read full abstract