Application of BFO Based on Path Interaction in Yard Truck Scheduling and Storage Allocation Problem

Abstract

Nowadays, Yard Truck Scheduling (YTS) and Storage Allocation Problem (SAP) are still two main problems in container terminal operations. Based on the current situation of using double trailer and practical constricts (e.g. container sorting storage, shore bridge and field bridge processing time), this paper proposes a realistic YTS-SAP model (YTSSAP). Additionally, a path interaction bacterial foraging optimization algorithm (PIBFO) is applied to solve the YTSSAP according to the differential tumbling label method and path interaction strategy. In the two strategies, each individual is given a label. If an individual has been employed as one individual’s interaction object, it will not be selected by the other bacteria. The population is easy to find the optimal solution using the path interaction strategy. The experiment results illustrate that PIBFO performs superior in dealing with the YTSSAP compared with coevolutionary structure-redesigned-based BFO (CSRBFO), comprehensive learning particle swarm optimizer (CLPSO) and genetic algorithm (GA). CLPSO obtains the worst results in terms of the performance and convergence rate when using it to solve the YTSSAP.