摘要
提出一种基于遗传算法的求解车辆路径问题的新算法,避免传统遗传算法处理不可行约束条件中惩罚项系数选取不当所出现的问题.同时,通过现实例子分析该算法的优劣性,实验结果表明该算法是一种有效的算法.
On the basis of genetic algorithm, a new algorithm, improved genetic algorithm, is proposed. It avoids some problems from choosing improper punishing coefficient when deal with infeasible constraining condition. Meanwhile, analyzed their prior and inferior by examples, indicate that it is an effective algorithm for vehicle routing problem.
出处
《数学的实践与认识》
CSCD
北大核心
2008年第13期123-129,共7页
Mathematics in Practice and Theory
基金
国家自然科学基金(10571046)
广西自然科学基金项目(桂科自0728260)
关键词
遗传算法
车辆路径问题
改进遗传算法
genetic algorithm
vehicle routing problem
improved genetic algorithm
