﻿ 基于改进遗传算法的快递路径优化问题的研究

# 基于改进遗传算法的快递路径优化问题的研究Study on Delivery Route Optimization Based on Improved Genetic Algorithm

Abstract: This passage reviewed the basic theory and algorithm of the delivery route optimization problem and established a mathematical model of the corresponding problem. This passage discussed the general steps of Genetic Algorithm and analyzed the defects and their reasons of Standard Genetic Algorithm in solving the problem. Aiming at the defects such as premature convergence, local convergence and dominant individual degradation, this passage improved the algorithm by using adaptive crossover probability and mutation probability and reserving dominant individuals. This passage combined a specific problem with its solution to verify the feasibility of the improved al-gorithm.

[1] 张强, 安大翔. 快递业城市配送路径优化研究[J]. 经营管理者, 2016(11): 183.

[2] 赖志柱, 戈冬梅, 张云艳. 求解TSP问题的改进最邻近法[J]. 贵州工程应用技术学院学报, 2016, 34(1): 139-142.

[3] 高海昌, 冯博琴, 朱利. 智能优化算法求解TSP问题[J]. 控制与决策, 2006, 21(3): 241-247, 252.

[4] 王岚. 基于自适应交叉和变异概率的遗传算法收敛性研究[J]. 云南师范大学学报(自然科学版), 2010, 30(3): 32-37.

[5] 肖华勇. 大学生数学建模竞赛指南[M]. 北京: 电子工业出版社, 2015.

[6] 唐世浩, 朱启疆. 遗传算法中初始种群与交叉、变异率对解的影响及其解决方案[J]. 科技通报, 2001, 17(3): 1-7.

[7] 刘世清, 杨孔雨. 求解TSP问题的遗传算法改进研究[J]. 北京信息科技大学学报(自然科学版), 2014(2): 46-50.

[8] 金晶, 苏勇. 一种改进的自适应遗传算法[J]. 计算机工程与应用, 2005, 41(18): 64-69.

[9] 刘帅, 马志强, 刘清雪, 陆林英. 基于自适应免疫遗传算法的多序列比对[J]. 信息技术, 2007(2): 15-17, 111.

Top