关键词: 改进蚁群算法, 集装箱装卸顺序, FJSP, 组合优化问题

Abstract:

We apply improved Ant Colony Algorithm to combinatorial optimization problem in order to shorten port waiting time and improve port efficiency. We initially constructed a mathematical model based on flexible job shop scheduling theory and the real situation of the ship and container crane. We then updated the pheromone of every path based on new updating rule to jump out of its local optimism through dynamically improving pheromone volatility and pheromone intensity. We eventually performed simulation and steps analysis with C#.NET to verify its effectiveness. Experimental results show that it can optimize the sequence of container loading and unloading and shorten operation time.

Key words: improved Ant Colony Algorithm, container handling sequence, FJSP, combinatorial optimization problem