摘要
提出了一种基于油耗的带有车容限制的弧路径问题(Capacitated Arc RoutingProblem,CARP),建立了以降低油耗为目标的问题模型,构造了相应的遗传算法.基于标准测试问题,同传统以距离为优化目标的遗传算法求得的油耗进行比较,实验结果表明,此算法可以快速、有效的求得以油耗为优化目标的CARP问题的优化解,为实际中降低车辆运输服务成本提供了较好方案.
traditional capacitatecl arc routing problems, service cost is assumed to be objec- tive function to find optimal routes for vehicles only considered single factor such as distance or time. This paper proposes a new cost function based on distance and load of the vehicles for the CARP. Mathematic model based on oil consumption is established and a relevant genetic algorithm is proposed. The computational results of the proposed GA compared to those of traditional GA based on distance are reported. Experimental results indicate that this genetic algorithm can effectively and quickly obtain optimal solution and is proved to be an satisfactory method to reduce the service cost.
出处
《数学的实践与认识》
CSCD
北大核心
2012年第18期168-175,共8页
Mathematics in Practice and Theory
