-
摘要: 分析了配送网络规划复杂的非线性组合优化问题, 以配送网络中的运行费用、设施投资费用及可靠性费用之和最小为目标函数, 建立了配送网络规划的数学模型, 设计了相应的蚁群算法。应用结果表明该算法的计算结果与实际的配送网络规划线路相符, 是可行的。Abstract: Based on analysing the complicated, nonlinear combinatorial optimization problem of distribution network planning, this paper put forward a mathematic model of network planning and an ant colony algorithm taking the minimum sum of operation cost, reliability cost and investment cost as object. The computing result of the algorithm accords with the real situation of network planning, which shows the algorithm is feasible.
-
[1] 温文波, 杜维. 蚁群算法概述[J]. 石油化工自动化, 2002, 39 (1): 19—22. https://www.cnki.com.cn/Article/CJFDTOTAL-LYHG200201006.htmWEN Wen-bo, DU Wei. An abstract on the ant colony algorithms[J]. Automation in Petro Chemical Industry, 2002, 39(1): 19—22. (in Chinese) https://www.cnki.com.cn/Article/CJFDTOTAL-LYHG200201006.htm [2] 张纪会, 徐心和. 一种新的进化算法———蚁群算法[J]. 系统工程理论与实践, 1999, 19 (3): 84—87. https://www.cnki.com.cn/Article/CJFDTOTAL-XTLL903.012.htmZHANG Ji-hui, XU Xin-he. A new evoluationary algorithm—ant colony algorithm[J]. Systems Engineering Theory and Practice, 1999, 19(3): 84—87. (in Chinese) https://www.cnki.com.cn/Article/CJFDTOTAL-XTLL903.012.htm [3] 黎锁平, 张秀媛, 杨海波. 人工蚁群算法理论及其在经典TSP问题中的实现[J]. 交通运输系统工程与信息, 2002, 2 (1): 54—57. https://www.cnki.com.cn/Article/CJFDTOTAL-YSXT200201011.htmLI Suo-ping, ZHANG Xiu-yuan, YANG Hai-bo. Theory on artificial ant algorithm and its application in TSP problem[J]. Journal of Transportation Systems Engineering and Information Technology, 2002, 2(1): 54—57. (in Chinese) https://www.cnki.com.cn/Article/CJFDTOTAL-YSXT200201011.htm [4] 赵学峰. 一种求解TSP的混合型蚁群算法[J]. 西北师范大学学报, 2003, 39 (4): 31—34. https://www.cnki.com.cn/Article/CJFDTOTAL-XBSF200304011.htmZHAO Xue-feng. A hybrid ant colony algorithm for solving TSP[J]. Journal of NorthwestNormal University, 2003, 39(4): 31—34. (in Chinese) https://www.cnki.com.cn/Article/CJFDTOTAL-XBSF200304011.htm [5] 伍文城, 肖建. 基于蚁群算法的中国旅行商问题满意解[J]. 计算机与现代化, 2002, 18 (8): 6—11. https://www.cnki.com.cn/Article/CJFDTOTAL-JYXH200208001.htmWU Wen-cheng, XIAO Jian. Satisfactory solution of Chinese travelling salesman problem based on ant colony algorithm[J]. Computer and Modernization, 2002, 18(8): 6—11. (in Chinese) https://www.cnki.com.cn/Article/CJFDTOTAL-JYXH200208001.htm [6] 陈根军, 王磊, 唐国庆. 基于蚁群最优的配电网络重构算法[J]. 电力系统及其自动化学报, 2001, 13 (2): 48—53. https://www.cnki.com.cn/Article/CJFDTOTAL-DLZD200102013.htmCHEN Gen-jun, WANG Lei, TANG Guo-qing. An ant colony optimization based method for power distribution network planning[J]. Power System Technology, 2001, 13(2): 48—53. (in Chinese) https://www.cnki.com.cn/Article/CJFDTOTAL-DLZD200102013.htm [7] 赵强, 敬东, 李正. 蚁群算法在配电网规划中的应用[J]. 电力自动化设备, 2003, 23 (2): 52—54. https://www.cnki.com.cn/Article/CJFDTOTAL-DLZS200302016.htmZHAO Qiang, JING Dong, LI Zheng. Power distribution network planning based on ant colony algorithm[J]. Power Automation Equipment, 2003, 23(2): 52—54. (in Chinese) https://www.cnki.com.cn/Article/CJFDTOTAL-DLZS200302016.htm