期刊文献+

CARP问题的构造型启发式算法研究 被引量:1

Constructive Heuristic Algorithms for the CARP Problem
下载PDF
导出
摘要 全面综述了国内外用于求解容量约束弧路径问题(CARP问题)的构造型启发式算法的研究现状,指出了构造型启发式算法与元启发式算法相比而言的优点所在.将求解算法分为3类并且分别进行简要介绍,最后展望了构造型启发式算法的研究前景. The constructive heuristic algorithms of the capacitated arc routing problems(CARP problem) comprehensively in research status at home and abroad.This paper points out the advantages of the constructive heuristic algorithms in comparison with the meta-heuristic.These algorithms are divided into three categories and are briefly introduced.Eventually,it is the looking forward to the prospects of constructive heuristic algorithms.
作者 李庆华 林丹
机构地区 天津大学理学院
出处 《河南师范大学学报(自然科学版)》 CAS CSCD 北大核心 2011年第3期148-152,共5页 Journal of Henan Normal University(Natural Science Edition)
关键词 CARP问题 构造型启发式算法 综述 Capacitated Arc Routing Problem constructive heuristic algorithms review
  • 相关文献

参考文献17

  • 1梅一.基于元启发式方法对限量弧路由问题的求解[D]中国科学技术大学,中国科学技术大学2010.
  • 2Philippe Lacomme,Christian Prins,Wahiba Ramdane-Cherif.Competitive Memetic Algorithms for Arc Routing Problems[J]. Annals of Operations Research . 2004 (1-4)
  • 3Beltrami E,Bodin L.Networks and vehicle routing for municipal waste collection. Networks . 1994
  • 4Eglese R W.Routing winter gritting vehicles. DAM . 1994
  • 5Dan Z G,Cai L N,Lv X Fet al.Small cycle heu-ristics of CARP. Journal of Systems Engineering . 2006
  • 6Golden B L,Wong R T.Capacitated arc routing problems. Networks . 1981
  • 7Ulusoy G.The fleet size and mix problemfor capacitated arc routing. E J of O R . 1985
  • 8Benavene,Campos V,Corberàn,et al.The capacitated arc routing problem. A heuristic algorithm . 1990
  • 9Gloden B L,Dearmon J S,Baker E K.Computational experi ments with algorithms for a class of routing problems. Computer and Op-erations Research . 1983
  • 10Belenguer J M,Benavent E.Directory of UCARPinstances. http://www.uv.es/belengue/carp.ht ml . 2010

同被引文献25

  • 1Mariam Tagmouti, Michel Gendreau. Arc routing problems with time-dependent service costs[J]. European Journal of Operational Research, 2007,181:30-39.
  • 2Mariam 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.
  • 3I.M. Monroy, C.A. Amaya. The periodic capacitated arc routing problem with irregular services[J]. Discrete Ap- plied Mathematics, 2013,161:691-701.
  • 4Richard 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.
  • 5Alberto Amaya, Andr6 Langevin. The capacitated arc routing problem with refill points[J]. Operations Research Letters, 2007,35:45-53.
  • 6M. 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.
  • 7Claudia Archetti, Dominique Feillet. The undirected ca- pacitated arc routing problem with profits[J]. Computers & Operations Research, 2010,37:1860-1869.
  • 8E.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.
  • 9Pieter 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.
  • 10Fa'bio, Luiz Usberti, Paulo Morelato Franca. The open capacitated arc routing problem[J]. Computers & Opera- tions Research, 2011,38:1543-1555.

引证文献1

二级引证文献3

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

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