优化的单亲遗传算法解算复杂VRP问题  

Optimized Partheno Genetic Algorithm Solving the Cost of VRP

作　　者：吴成宾[1] 刘新跃[1] 

机构地区：[1]成都大学现代教育技术中心,成都610106

出　　处：《电脑编程技巧与维护》2012年第16期14-16,共3页Computer Programming Skills & Maintenance

摘　　要：车辆在非空载和空载状态下单位成本支出不同,提出了优化的单亲遗传算法求解最小配送成本。通过改进适应度以及染色体重组的计算方法,在提高效率的同时,算法不失全局和局部并重的寻优能力。实例计算表明,优化的算法比传统的算法效果更佳,而且收敛时间短,算法系统的运用能使物流企业有效降低配送成本,减轻流动资金压力。The unit costs are different for vehicle in load or empty condition,this article proposed optimized partheno genetic algorithm for the minimum distribution costs.By improving the calculation for fitness,as well as chromosomal rearrangements,this algorithm can both remain the optimization ability in the scope of global or local areas while improving efficiency.The practical example shows that the optimized algorithm is better than traditional algorithm,and the convergence time is also short,the logistics corporations using this algorithm system can reduce distribution costs effectively,and the liquidity pressure is greatly reduced.

关 键 词：车辆路径问题 单位成本 优化 单亲遗传算法 

分 类 号：TP18[自动化与计算机技术—控制理论与控制工程]