全部 标题 作者
关键词 摘要

OALib Journal期刊
ISSN: 2333-9721
费用:99美元

查看量下载量

相关文章

更多...

最小最大车辆路径问题的动态自适应蚁群优化算法*

DOI: 10.16451/j.cnki.issn1003-6059.201510008, PP. 930-938

Keywords: 动态最大最小蚂蚁系统,最小最大车辆路径问题,灰色模型预测,信息素关联累积,车辆距离约束

Full-Text   Cite this paper   Add to My Lib

Abstract:

为求解最小最大车辆路径问题,提出动态自适应蚁群优化算法.该算法采用动态最大最小蚂蚁系统策略调整最优解,每次迭代更新τmin,将τmin作为当前信息素矩阵最大值的函数,根据当前最优弧调整选择弧的概率.采用一种灰色模型预测及控制信息素矩阵的边界,以增强蚁群算法参数的自适应性能.对信息素浓度相对较高的多个节点及其附近的边,利用信息素关联累积规则进行信息素更新.将文中算法进行场景的实例测试,仿真结果表明,该算法与线性规划、其他相关的蚁群算法相比,收敛速度更快,具有更好的优化性能和应用效果.

References

[1]  Dantzing G, Ramser J H. The Truck Dispatching Problem. Management Science, 1959, 10(6): 80-91
[2]  Colorni A, Dorigo M, Maffioli F, et al. Heuristics from Nature for Hard Combinatorial Optimization Problems. International Transactions in Operational Research, 1996, 3(1): 1-21
[3]  Dorigo M,Gambardella L M. Ant Colony System:A Cooperative Learning Approach to the Traveling Salesman Problem. IEEE Trans on Evolutionary Computation, 1997, 1(1): 53-66
[4]  Stützle T, Hoos H H. MAX-MIN Ant System. Future Generation Computer Systems, 2000, 16(9): 889-914
[5]  Dorigo M, Birattari M, Stützle T. Ant Colony Optimization: Artificial Ants as a Computational Intelligence Technique. IEEE Computational Intelligence Magazine, 2006, 1(4): 28-39
[6]  Favaretto D, Moretti E, Pellegrini P. On the Explorative Behavior of MAX-MIN Ant System // Proc of the 2nd International Workshop on Engineering Stochastic Local Search Algorithms, Designing, Implementing and Analyzing Effective Heuristics. Brussels, Belgium, 2009: 115-119
[7]  Crawford B, Soto R, Johnson F, et al. A Max-Min Ant System Algorithm to Solve the Software Project Scheduling Problem. Expert Systems with Applications, 2014, 41(15): 6634-6645
[8]  Benavent E, Corberán , Sanchis J M. A Metaheuristic for the Min-Max Windy Rural Postman Problem with k Vehicles. Computational Management Science, 2010, 7(3): 269-287
[9]  Liu X, Qi H. Tabu Search Algorithm of Min-Max Vehicle Routing Problem. Journal of Systems Engineering, 2007, 25(1): 49-52 (in Chinese) (刘 霞,齐 欢.最小-最大车辆路径问题的禁忌搜索算法.系统工程学报, 2007, 25(1): 49-52)
[10]  Liu X, Yang C. Min-Max Vehicle Routing Problem Based on Ant Colony Algorithm. Journal of PLA University of Science and Technology: Natural Science Edition, 2012, 13(3): 336-341 (in Chinese)(刘 霞,杨 超.最小-最大车辆路径问题的蚁群算法.解放军理工大学学报:自然科学版, 2012, 13(3): 336-341)
[11]  Su C, Tu J. An Adaptive Max-Min Ant Colony Algorithm. Pattern Recognition and Artificial Intelligence, 2007, 20(5): 688-691(in Chinese)(苏 畅,徒 君.一种自适应最大最小蚁群算法.模式识别与人工智能, 2007, 20(5): 688-691)
[12]  Bai J, Yang G K, Chen Y W, et al. A Model Induced Max-Min Ant Colony Optimization for Asymmetric Traveling Salesman Pro-blem. Applied Soft Computing, 2013, 13(3): 1365-1375
[13]  Yu J P, Wang C G. A Max-Min Ant Colony System for Assembly Sequence Planning. International Journal of Advanced Manufac-turing Technology, 2013, 67(9/10/11/12): 2819-2835
[14]  Ren C Y. Solving Min-Max Vehicle Routing Problem. Journal of Software, 2011, 6(9): 1851-1856
[15]  Mavrovouniotis M, Yang S X. Ant Colony Optimization with Immi-grants Schemes for the Dynamic Travelling Salesman Problem with Traffic Factors. Applied Soft Computing, 2013, 13(10): 4023-4037
[16]  Tang J F, Ma Y Y, Guan J, et al. A Max-Min Ant System for the Split Delivery Weighted Vehicle Routing Problem. Expert Systems with Applications, 2013, 40(18): 7468-7477
[17]  Christofides N, Mingozzi A, Toth P. Contributions to the Quadratic Assignment Problem. European Jonrnal of Operational Research, 1980, 4(4): 243-247
[18]  Zhang Y, Liu Y C. An Improved Ant Colony Optimisation and Its Application on Multicast Routing Problem. International Journal of Wireless and Mobile Computing, 2011, 5(1): 18-23
[19]  Deng X Y, Zhang L M, Lin H W, et al. Pheromone Mark Ant Colony Optimization with a Hybrid Node-Based Pheromone Update Strategy. Neurocomputing, 2014, 148: 46-53
[20]  Krynicki K, Jaen J, Mocholi J A. Ant Colony Optimization for Resource Searching in Dynamic Peer-to-Peer Grids. International Journal of Bio-inspired Computation, 2014, 6(3): 153-165
[21]  Wang C, Chen Z Q. Parallel Ant Colony Optimisation Algorithm for Continuous Domains on Graphics Processing Unit. International Journal of Computing Science and Mathematics, 2013, 4(3): 231-241
[22]  Geng J Q, Weng L P, Liu S H. An Improved Ant Colony Optimization Algorithm for Nonlinear Resource-Leveling Problems. Computer & Mathematics with Applications, 2011, 61(8): 2300-2305
[23]  Saenphon T, Phimoltares S, Lursinsap C. Combining New Fast Opposite Gradient Search with Ant Colony Optimization for Solving Travelling Salesman Problem. Engineering Application of Artificial Intelligence, 2014, 35: 324-334
[24]  Chen L, Sun H Y, Wang S. A Parallel Ant Colony Algorithm on Massively Parallel Processors and Its Convergence Analysis for the Travelling Salesman Problem. Information Sciences, 2012, 199: 31-42
[25]  Narasimha K S V, Kumar M. Ant Colony Optimization Technique to Solve the Min-Max Single Depot Vehicle Routing Problem // Proc of the American Control Conference. San Francisco, USA,2011: 3257-3262
[26]  Carlsson J G, Armbruster B, Ye Y Y. Finding Equitable Convex Partitions of Points in a Polygon Efficiently

Full-Text

Contact Us

service@oalib.com

QQ:3279437679

WhatsApp +8615387084133