摘要
在利用进化计算对多车场带有容量限制的弧路径规划问题(multiple depot capacitated arcrouting problem,MDCARP)进行研究的基础上,对其数学模型进行改进,以适应现实生活中洒水车路径优化问题的需要。针对此问题,将传统遗传算法的种群结构进行改进,采用有效的种群初始化策略并设计出新颖且高效的进化算子,通过进化计算对数据的求解,得到了满意的结果,从而证明了该算法能解决一定规模的MDCARP问题。
Based on the study of using the evolutionary computing to solve the Multiple Depot Capacitated Arc Routing Problem （MDCARP）, its mathematic model was improved, so as to satisfy the demand of the sprinkler routing problem in real world. To solve this problem, the population structure of the traditional genetic algorithm was modified by adopting effective strategy to initialize population. Some high efficient evolutionary operations were designed. With the help of the evolutionary computing to solve the data, satisfied results were gained. Thus, it proves that the algorithm can somehow solve MDCARP effectively.
出处
《交通与计算机》
2008年第3期55-59,64,共6页
Computer and Communications
基金
高校博士学科点专项科研基金项目(批准号:20030611016)资助
