期刊文献+

基于组件式蚁群算法的车辆路径问题研究 被引量:1

Component-Based Ant Colony Algorithm for Solving Vehicle Routing Problems
下载PDF
导出
摘要 现有方法仅从蚁群算法的基本结构出发设计软件,缺少软件设计模型的有效指导,很难用来求解不同种类的优化问题.鉴于此,应用组件软件设计方法,提出了一种组件武蚁群算法.该方法力求在结构上直接反映蚁群的本质思想和关键概念;最大程度降低与问题的相关性;强调以接口为中心的设计理念.大量车辆路径问题的验证结果表明,组件式蚁群算法性能优良,能够有效地求解车辆路径问题.该方法易于理解和使用,具有很强的可重用性和可扩展性,为求解各类优化问题提供了很好的起点和可持续发展的框架. Existing ant colony algorithm (ACA) software was designed only based on its basic structure. Due to lack the guidance of software design model, it is very difficult to design some practicable ACA software for solving different optimization problems. For this purpose, it presents a component-based ant colony agorithm (CACA) by applying the component-based software engineering thoughtway. This CACA emphasizes the direct correspondence of ACA concepts with its software architecture, the minimal coupling with specific problem structure and the interface-centered design. The experiment results of many vehicle routing problems (VRP) sLNgest that the CACA is feasible and valid for VRP. This proposed approach is very easy to understand and employ, it has a very robust reusage and expansibility; it indeed provides a good start point and a framework that can continually improve for solving different optimization problems.
作者 温蕴
出处 《微电子学与计算机》 CSCD 北大核心 2008年第6期151-155,共5页 Microelectronics & Computer
基金 国家自然科学基金项目(70678015)
关键词 车辆路径问题 组件式蚁群算法 组件软件框架 可重用性 可扩展性 vehicle routing problem component-based ant colony algorithm component-based framework reusage expansibility
  • 相关文献

参考文献6

  • 1Dorigo M,Maniezzo V,Colomi A.The ant system:optimization by a colony of cooperating agents[J].IEEE Transactions on Systems,Man,and Cybernetics,Part B:Cybernetics,1996,26(1):29-41.
  • 2Gambardella L M,Dorigo M.Hybrid ant system HASSOP:an ant colony system hybridized with a new local search for the sequential ordering problem[J].INFORMS Journal on Computing,2000,12(3):237-255.
  • 3Lehman M M,Ramil J F.Software evolution in the age of component-based software enginecring[J].IEE Proceedings:Software,2000,147(6):249-255.
  • 4Chaudet C,Grenwood R M,Oquendo E.Architecture driven software engineering:specifying,gerevating and evolving component based software systews[J].IEEE Software,2000,147(6):203-214.
  • 5Pastofer U,Bellosa F.Component based software engineering for distributed embedded realtime systems[J].IEEE software,2001,148(3):99-103.
  • 6刘志硕,申金升,柴跃廷.基于自适应蚁群算法的车辆路径问题研究[J].控制与决策,2005,20(5):562-566. 被引量:59

二级参考文献10

  • 1Laport G.The vehicle routing problem:An overview of exact and approximate algorithms[J].European J of Operational Research,1992,59(1):345-358.
  • 2Dorigo M,Maniezzo V,Colorni A.Ant system:Optimization by a colony of cooperating agents[J].IEEE Trans on System,Man,and Cybernetics,1996,26(1):29-41.
  • 3Maniezzo V,Colorni A.An ANTS heuristic for the frequency assignment problem[J].Future Generation Computer Systems,2000,16(8):927-935.
  • 4Colorni A,Dorigo M.Ant system for job shop scheduling[J].Operation Research,1994,34(1):39-53.
  • 5Costa D.Ant can color graphs[J].J of the Operations Research Society,1997,48(3):295-305.
  • 6Dorigo M,Luca M.A study of some properties of ant-Q[A].Proc of 4th Int Conf on Parallel Problem Solving form Nature(PPSN)[C].Berlin:Springer Verlag,1996:656-665.
  • 7Stutzle T.MAX-MIN ant system[J].Future Generation Computer Systems J,2000,16(8):889-914.
  • 8Gambardella L M,Dorigo M.An ant colony system hybridized with a new local search for the ordering problem[J].Informs J on Computing,2000,12(3):237-255.
  • 9Zhang J H,Xu X H.A new evolutionary algorithm-ant conoly algorithm[J].System Engineering Theory and Application,1999,36(3):84-87.
  • 10Clarck G,Wright J W.Scheduling of vehicles form a central depot to a number of delivery points[J].Operations Research,1964,12(4):568-581.

共引文献58

同被引文献5

引证文献1

二级引证文献3

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

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