期刊文献+

基于并行遗传算法的车辆路径问题 被引量:1

Solution to Vehicle Routing Problem Based on Parellel Genetic Algorithm
下载PDF
导出
摘要 提出两种改进策略来提高遗传算法的性能,首先通过粗粒度并行机制以避免遗传算法在进化过程中易产生过早收敛现象,同时提出了一个主从式迁移策略来提高"优质"个体在交换过程的生存能力,有效的提高优化的速度和解的精度。最后,通过若干著名的车辆路径问题对该算法进行了验证,结果表明提出的并行遗传算法可以有效的提高优化速度和求解质量。 The paper proposes two improvement strategies for the genetic algorithm (GA) in logistics research. The first strategy is the coarse-grain parallel mechanism which can enhance the solution quality by exchanging high-quality genus among sub-colonies, thus avoiding premature convergence in the iteration process and the second one a primary-subordinate migration strategy which potently improves the speed of optimization and the accuracy of solution. Finally, through typical vehicle routing problems, the algorithm proposed in the paper is validated as effective in improving the speed and quality of GA.
出处 《物流技术》 2010年第5期64-66,共3页 Logistics Technology
基金 国家自然科学基金重点项目(50538010)
关键词 遗传算法 粗粒度并行机制 主从式迁移策略 GA coarse-grain parallel mechanism primary-subordinate migration strategy
  • 相关文献

参考文献11

二级参考文献20

  • 1邹燕明.小生境遗传算法的研究与应用[M].北京:北京理工大学,1999..
  • 2邢文川 谢金星.现代优化计算方法[M].北京:清华大学出版社,1999..
  • 3Laporte G, Mercure H, Nobert Y. An Exact Algorithm for the Asymmetrical Capacitated Vehicle Routing Problem[J].Networks, 1986,16:33~46.
  • 4谢秉磊 李军 郭耀煌.遗传算法在非满载车辆线路安排问题中的应用[J].中国学术期刊,1999,5(8):1068-1069.
  • 5Clark G.and Wright J..Scheduling of vehicles from a central depot to a number of delivery points[J].Opens.Res,1964,4.
  • 6Gillett B.E.and Miller L R..A Heuristic Algorithm for the Vehicle Dispatch Problem[J].Opens.Res., 1974,22.
  • 7Berthod Krger.Gillotineable Bin Packing:A Genetic Approach[J].European Journal of Operational Research,1995,84:645-661.
  • 8Malmborg,Charles.Genetic Algorithm for Service Level Based Vehicle Scheduling[J].European Journal of Operational Research,1996,93(1):121-134.
  • 9Ochi,Luiz S..Vianna,Parallel Evolutionary Algorithm for The Vehicle Routing Problem with Heterogeneous Fleet[J].Future Generation Computer Systems,1998,14(5-6):285-292.
  • 10W. L. Price. Global optimization by controlled random search[J] 1983,Journal of Optimization Theory and Applications(3):333~348

共引文献269

同被引文献11

  • 1刘晓平,安竹林,郑利平.基于MPI的主从式并行遗传算法框架[J].系统仿真学报,2004,16(9):1938-1940. 被引量:26
  • 2胡小兵,黄席樾.对一类带聚类特征TSP问题的并行遗传算法求解[J].计算机工程与应用,2004,40(35):66-68. 被引量:4
  • 3韩中华,吴成东,杨丽英,邓湘宁.基于并行遗传神经网络算法的动态路径选择方法[J].微计算机信息,2005,21(12Z):166-168. 被引量:8
  • 4张晓波,谢红薇.并行遗传算法求解应急系统最短路径的研究[D].太原:太原理工大学,2005.
  • 5Verma A, Llora X, Goldberg D E, et al. Scaling simple and compact genetic algorithms using MapReduce [ R ]. Urba- na-Illinois Genetic Algorithms Laboratory, University of Illinois ,2009 : 1-16.
  • 6Verma A, Llorh X, Goldberg D E, et al. Scaling genetic algorithms using MapReduce [ C ] //Proceedings of the Ninth International Conference on Intelligent Systems Design and Applications. Pisa : ISDA2009,2009 : 13-18.
  • 7Vijayalakahmi V, Akila A, Nagadivya S. The survey on MapReduce [J]. International Journal of Engineering Science and Technology ,2012,4 (7) :3335-3342.
  • 8Poka Laxmi, Jayant Umale, Sunita Mahajan. MoHPBGA : multi-objective hierarchical population balanced genetic algorithm using MapReduce [ J ]. International Journal of Computer Applications, 2012,40 ( 2 ) : 1-7.
  • 9Zhan Shao-bin, Huo Hong-ying. Improved PSO-based task scheduling algorithm in cloud computing [ J ]. Journal of Information & Computational Science ,2012,13 (9) :3821- 3829.
  • 10McCubbin Christopher, Perozzi Bryan, Levine Andrew, et al. Finding the ' needle' : locating interesting nodes using the K-shortest paths algorithm in MapReduce[ C ]//Pro- ceedings of the llth IEEE Intemational Conference on Data Mining Workshops. Vancouver: ICDMW,2011 : 180-187.

引证文献1

二级引证文献10

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

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