期刊文献+
任意字段
题名或关键词
题名
关键词
文摘
作者
第一作者
机构
刊名
分类号
参考文献
作者简介
基金资助
栏目信息

一个改进的变邻域搜索方法求解k-card问题 被引量：3

An improved variable neighborhood search based solution to the k-cardinality tree problem
在线阅读 下载PDF
导出
摘要 本文将变邻域搜索算法应用到k-card问题求解中,重新定义了一种邻域结构,改进了算法,使得邻域内可行解的搜索速度得以加快,并提高了近似解的质量。对几个实际问题进行了数值实验,并与现有邻域结构的变邻域搜索算法进行了对比,实验结果证明了改进变邻域搜索算法对k-card问题的有效性。 This paper applied variable neighborhood search （VNS） algorithm to the solution of k-card problem. This paper also defined a new neighborhood structure for the solution space, and improved the algorithm. This increased the search speed of feasible solutions in the neighborhood, and improved the quality of the approximate solutions. This algorithm was compared with the present neighborhood structure based VNS algorithm. Experimental results show its effectiveness for the k-card problem.
作者 董伟
机构地区 辽宁工程技术大学数学与系统科学研究所
出处 《山东科学》 CAS 2011年第1期93-96,共4页 Shandong Science
关键词 变邻域搜索 k-card问题 启发式算法 variable neighborhood search k- card problem metaheuristic
分类号 TP301.6 [自动化与计算机技术—计算机系统结构]
  • 相关文献

参考文献8

  • 1FISCHETTl M,HAMACHER H,J(O)RNSTEN,K,et al.Weighted k-cardinality trees:complexity and polyhedral structure[J]Networks,1994,24:11-21.
  • 2JORNSTEN,K,LDKKEPANGEN A.Tabu search for weighted k-cardinality trees[J].Asia Pac J Oper Res,1997,14(2):9-26.
  • 3BRIMBERG P,MLADENOVIC'N,UROSEVIC'D.Local and variable neighborhood search for the k-cardinality subgraph problem[J].J Heuristics,2008,14:501-517.
  • 4HANSEN P,MLADENOVIC'N.Variable neighborhood search:principles and applications[J].Eur J Oper Res,2001,130:449-467.
  • 5BLUM C,EHRGOTT M.Local search algorithms for the k-cardinality tree problem[J].Discrete Appl Math,2003,128(2-3):511-540.
  • 6URO(S)EVIC'D,BRIMBERG J,MLADENOVIC'N.Variable neighborhood decomposition search for the edge weighted k-cardinality tree problem[J].Comput Oper Res,2004,31,1205-1213.
  • 7WEST D B.Introduction to grahp theory[M].第2版.北京:机械工业出版社,2006:51-80.
  • 8吴仆,蒋建林,文杰.求解推广k-CARD问题的一种变邻域搜索方法[J].贵州大学学报（自然科学版）,2009,26(5):23-27. 被引量：3

二级参考文献10

  • 1Blum C, Ehrgott M. Local search algorithms for the k -cardinality tree problem[ R]. IRIDIA : ULB, 12, 2001.
  • 2Fischetti M, Hamacher H, JJornsten K, et al. Weighted k - cardinality trees: complexity and polyhedral structure[J]. Networks, 1994(24) :11 -21.
  • 3Jomsten K, Lokketangen A. Tabu search for weightedk -cardinality trees[J]. Asia - Pacific Journal of Operational Research, 1997 (14) :9 -26.
  • 4Mladenovic N, Urosevic D. Variable neighborhood search for the k -cardinality tree[ C]. Proceedings of the Fourth Metaheuristics International Conference, Porto, 2001:743 - 747.
  • 5Blum C, Ehrgott M, Local search algorithms for the k -cardinality tree problem[ J]. Discrete Applied Mathematics, 2003, 128 (2 - 3) : 511 -540.
  • 6Mladenovic N, Hansen P. Variable neighborhood search [ J ]. Computers & Operations Research, 2007 (24) : 1097 -1100.
  • 7Hansen P, Mladenovic N. Variable neighborhood search: principies and applications [ J ]. European Journal of Operational Research,2001, 130 (3) :449 -579.
  • 8Hansen P, Mladenovic N, Perez D. Variable neighborhood decomposition search[J]. Journal of Heuristics, 2001 (7) : 335 -350.
  • 9Urosevic D, Brimberg J, Mladenovic N. Variable neighborhood decomposition search for the edge weighted k -cardinality tree problem[ J]. Computers and Operations Research, 2004 ( 3 ) : 1205 - 1213.
  • 10Ehrgott M, Freitag J, Hamacher H W, et al. Heuristics for the the k -cardinality trees and subgraph problems [ J ]. Asia-Pacific Journal of Operational Research, 1997 (14) :87 - 11.

共引文献2

同被引文献17

  • 1Pierre Hansen,Nenad Mladenovi?,José A. Moreno?Pérez.Variable neighbourhood search: methods and?applications[J].Annals of Operations Research.2010(1)
  • 2Jack Brimberg,Nenad Mladenovi?,Dragan Uro?evi?.Local and variable neighborhood search for?the?k-cardinality subgraph problem[J].Journal of Heuristics.2008(5)
  • 3MONTEMANNI R,GAMBARDELLA L. M,RIZZOLI A. E,DONATIA.V.Ant Colony Optimization for Vehicle Routing Problem from theory toapplications[].Optimize.2005
  • 4Clarke G,Wright JW.Scheduling of vehicles from a central depot to a number of delivery points[].Operations Research.1964
  • 5Hongtao Lei,Gilbert Laporte,Bo Guo.A generalized variable neighborhoodsearch heuristic for the capacitated vehicle routing problem with stochasticservicetimes[OL][]..2011
  • 6R. Montemanni,L. Gambardella,A. Rizzoli,A. Donati.A new algorithm for a dynamic vehicle routing problem based on ant colony system[].Proceedings of ODYSSEUS : Second International Workshop on Freight Transportation and Logistics.2003
  • 7Kemenade C H M.Building block filtering and mixing[].SENR.1998
  • 8Hansen P,Mladenovi′c N.Variable neighborhood search[]..2005
  • 9Kilby P,Prosser P,Shaw P.Dynamic VRPS:a study of scenarios[]..1998
  • 10Recende M G C,Rebeiro C C.Greedy randomized adaptive search procedures[].Handbook of Metaheuristic.2003

引证文献3

二级引证文献15

山东科学
2011年 第1期

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

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