Swarm intelligence algorithms for yard truck scheduling and storage allocation problems

摘要

In this paper we focus on two scheduling problems in container terminal: (i) the Yard Truck Scheduling Problem (YTSP) which assigns a fleet of trucks to transport containers between the QCs and the storage yard to minimize the makespan, (ii) the integrated Yard Truck Scheduling Problem and Storage Allocation Problem (YTS-SAP) which extends the first problem to consider storage allocation strategy for discharging containers. Its object is to minimize the total delay for all jobs. The second model is improved to consider the truck ready time. Due to the computational intractability, two recently developed solution methods, based on swarm intelligence technique, are developed for problem solution, namely, particle swarm optimization (PSO) and bacterial colony optimization (BCO). As these two algorithms are originally designed for continuous optimization problems, we proposed a particular mapping method to implement them for YTSP and YTS-SAP, both of which are discrete optimization problems. Through comparing the PSO algorithms and BCO algorithm with GA by an experiment conducted on different scale instances, we can draw a conclusion that LPSO perform best in YTSP while BCO perform best in YTS-SAP.