计算机工程与应用
計算機工程與應用
계산궤공정여응용
COMPUTER ENGINEERING AND APPLICATIONS
2009年
31期
227-229,244
,共4页
最大最小蚁群算法%多目标%满载装卸货问题
最大最小蟻群算法%多目標%滿載裝卸貨問題
최대최소의군산법%다목표%만재장사화문제
Max-Min Ant algorithm (MMAS)%multi-objective%Full Load Pickup and Delivery Problem(FLPDP)
满载装卸货问题是广泛存在于物流运输领域的重要组合优化难题.为了有效求解实际情况下多目标的满载协同运输问题.设计了双层最大最小蚁群算法.利用蚁群算法的正反馈和并行性,通过不同层次蚁群之间的信息素传递,实现对问题的两个优化目标同时优化.通过实验表明了该算法可行而有效.
滿載裝卸貨問題是廣汎存在于物流運輸領域的重要組閤優化難題.為瞭有效求解實際情況下多目標的滿載協同運輸問題.設計瞭雙層最大最小蟻群算法.利用蟻群算法的正反饋和併行性,通過不同層次蟻群之間的信息素傳遞,實現對問題的兩箇優化目標同時優化.通過實驗錶明瞭該算法可行而有效.
만재장사화문제시엄범존재우물류운수영역적중요조합우화난제.위료유효구해실제정황하다목표적만재협동운수문제.설계료쌍층최대최소의군산법.이용의군산법적정반궤화병행성,통과불동층차의군지간적신식소전체,실현대문제적량개우화목표동시우화.통과실험표명료해산법가행이유효.
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.
