Port truck scheduling on a dedicated transportation route at a container terminal
Résumé
This paper studies the problem of container truck scheduling on a dedicated transportation route, which connects the container yard and the outside of a container terminal. We consider two objectives to minimize the total waiting time of tasks and the total fuel consumption simultaneously. It is motivated by practical applications in some container terminals which are located at islands tens of miles away from continents and connect to the outsides via long distance bridges. Each container truck either sending an outbound container to the terminal yard or fetching an inbound container from the yard suffers halfway empty driving during the round trip. With the assumption that all the tasks of container transportation on the bridge segment are served by port trucks, we propose the vehicle scheduling problem which balances the trade-off between service quality and energy consumption. Our main contributions include the formulation of a bi-objective integer linear programming (ILP) model and an evolutionary heuristic which applies NSGA-II algorithm in searching non-dominated solutions for either objective. Experimental results show that the proposed heuristic algorithm efficiently solves the problem.
