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.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
