多目标满载装卸货问题的蚁群算法研究

摘要

Full Load Pickup and Delivery Problem(FLPDP) is an important combinatorial optimization problem existed extensively in the transportation domain.In order to solve practical multiple-objective full load pickup and delivery problem, the bi-level Max-Min Ant algorithm (MMAS) is proposed. With the positive feedback and parallelism of the Max-Min ant colony algorithm, two objectives of the problem are optimized simultaneously through the pheromone exchanging between the two ant colonies.The simulative computational results demonstrate that the proposed algorithm is able to procedure feasible results for the large-scale problem.%满载装卸货问题是广泛存在于物流运输领域的重要组合优化难题.为了有效求解实际情况下多目标的满载协同运输问题.设计了双层最大最小蚁群算法.利用蚁群算法的正反馈和并行性,通过不同层次蚁群之间的信息素传递,实现对问题的两个优化目标同时优化.通过实验表明了该算法可行而有效.