This paper mainly research on the container tuck route optimization problem with the integrated loading and unloading operation. Considered the disperse-stacking of containers in yards and the loading/unloading operations of each berth, the objective function of scheduling problem is the optimal rout of the container truck. In order to solve this problem, the hybrid swarm intelligence algorithm (PSO-ACO) is proposed, which combined the particle swarm optimization algorithm with the ant colony optimization algorithm. The hybrid swarm intelligence algorithm takes advantage of strong local search ability of ant colony optimization algorithm and the ACO’s pheromone taxis, which can avoid the particle swarm optimization algorithm fall in the local optimum during the convergence. The results show that the mathematical model and hybrid algorithm have effective, reliability and stability in solving the container truck scheduling problem.
CITATION STYLE
Liu, Y., Feng, M., & Shahbazzade, S. (2017). The container truck route optimization problem by the hybrid PSO-ACO algorithm. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 10361 LNCS, pp. 640–648). Springer Verlag. https://doi.org/10.1007/978-3-319-63309-1_56
Mendeley helps you to discover research relevant for your work.