期刊文献+

多车场洒水车路径问题的双层遗传算法 被引量:3

A Double-layer Genetic Algorithm for Sprinkle Car Routing Problem Based on Multiple Depots
下载PDF
导出
摘要 论文提出了一种新的遗传算法对有多个加水点的洒水车服务路线问题进行优化求解,给出了一种多车场车辆弧路径问题的数学模型,并对传统遗传算法的染色体编码机制和种群结构进行了改进,设计了一种解决多车场车辆弧路径问题的双层遗传算法,可以表示出各车场出动的车辆及路径,与人工安排的方案进行比较,安排效率高,总行驶路程缩短15%以上,车辆行驶路线更为合理,有效地实现多车场车辆弧路径问题的优化。 This paper presents a new genetic algorithm (GA) to solve the sprinkle car routing problem based on multiple depots and proposes a mathematical model of multiple-depot Vehicle Arc Routing Problem (MDVARP). In this paper, we improve the chromosome coding mode and population structure of the traditional genetic algorithm and devise a double-layer genetic algorithm to solve the MDVARP. Using the new GA, the vehicles and routes in different depots can be assigned. Compared with the manual assignments, the effectiveness of our algorithm is higher, the whole driving distances can be saved by 15 percent above, and the vehicle driving routes are more reasonable, the optimization of MDVARP can be realized effectively.
出处 《微型电脑应用》 2008年第6期1-3,共3页 Microcomputer Applications
基金 高等学校博士学科点专项科研基金资助课题(20030611016) 重庆大学骨干教师计划基金项目(2003A33)
关键词 多车场 弧路径 车辆路径 遗传算法 洒水车 Multiple-depot Arc routing VARP Genetic algorithm Sprinkle car
  • 相关文献

参考文献9

  • 1A. A. Assad, B. L. Golden. Arc routing methods and applications [ Z ]. in:M.O.Balletal. (Eds.), Handbooks in OR and MS, 8, Elsevier, Amsterdam, 1995. 375-483.
  • 2R. Hirabayashi, Y. Saruwatari, N. Nishida. Tour construction algorithm for the capacitated arc routing problem [J ]. Asia - Pacific Journal of Operational Research, 1992, (9): 155 -175.
  • 3A. Hertz, G. Laporte, M. Mittaz. A tabu search heuristic for the capacitated arc routing problem[J ]. Operations Research, 2000,48 (1): 129-135.
  • 4P. Beullens, L. Muyldermans, D. Cattrysse, D. Van Oudheus - den. A guided local search heuristic for the capadtated arc routing problem [ J ]. European Journal of Operational Research, 2003,147, (3): 629-643.
  • 5P. Lacomme, C. Prins, W. Ramdane - Cherif. Competitive memetic algorithms for arc routing problems [ C ]. Working Paper 1, LOSI, Univ. Tecnologie de Troyes, France, 2001 (accepted for publicationin Annals of Operations Re-search).
  • 6P. Lacomme, C.Prins, W, Ramdane-Cherif. Fast algorithm for general arc routing problems [ C ]. IFORS 2002 Conference, Edinburgh, UK.
  • 7B.L.Golden, R.T.Wong. Capacitated arc routing problems[J ]. Networks, 1981, (11): 305-315.
  • 8邹彤,李宁,孙德宝,李菁.多车场车辆路径问题的遗传算法[J].计算机工程与应用,2004,40(21):82-83. 被引量:32
  • 9王丽丽,罗可,杨光军.基于双层遗传算法的混合属性数据分类[J].计算机工程与应用,2006,42(30):155-156. 被引量:3

二级参考文献13

共引文献32

同被引文献30

  • 1李庆华,林丹.CARP问题的构造型启发式算法研究[J].河南师范大学学报(自然科学版),2011,39(3):148-152. 被引量:1
  • 2Mariam Tagmouti, Michel Gendreau. Arc routing problems with time-dependent service costs[J]. European Journal of Operational Research, 2007,181:30-39.
  • 3Mariam Tagmouti, Michel Gendreau. A variable neighbor- hood descent heuristic for arc routing problems with time-dependent service costs[J]. Computers & Industrial Engineering, 2010,59:954-963.
  • 4I.M. Monroy, C.A. Amaya. The periodic capacitated arc routing problem with irregular services[J]. Discrete Ap- plied Mathematics, 2013,161:691-701.
  • 5Richard Y.K. Fung, Ran Liu. A memetic algorithm for the open capacitated arc routing problem[J]. Transporta- tion Research Part E, 2013,50:53-67.
  • 6Alberto Amaya, Andr6 Langevin. The capacitated arc routing problem with refill points[J]. Operations Research Letters, 2007,35:45-53.
  • 7M. Angelica Salazar-Aguilar, Andre' Langevin. The syn- chronized arc and node routing problem: Application to road marking [J]. Computers & Operations Research, 2013,40:1708-1715.
  • 8Claudia Archetti, Dominique Feillet. The undirected ca- pacitated arc routing problem with profits[J]. Computers & Operations Research, 2010,37:1860-1869.
  • 9E.E. Zachariadis, C.T. Kiranoudis. Local search for the undirected capacitated arc routing problem with profits [J]. European Journal of Operational Research, 2011,210: 358-367.
  • 10Pieter Vansteen wegen, Wouter Souffriau. Solving the mobile mapping van problem: A hybrid metaheuristic for capacitated arc routing with soft time windows[J]. Com- puters & Operations Research, 2010,37:1870-1876.

引证文献3

二级引证文献3

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

内容加载中请稍等...
;
使用帮助 返回顶部