期刊文献+

带二维装载约束的团队定向问题

The Team Orienteering Problem with Two-dimensional Loading Constraint
下载PDF
导出
摘要 在车辆服务资源有限、货物的特殊装载要求和其他因数影响下,为获得最大效益,而采取特殊物流配送的问题,即带二维装箱约束的团队定向问题。针对这个问题,在对其进行明确定义的基础之上,提出了基于IBL(improved bottom-left)算法二维装箱算法,使用遗传算法,在Chao测试算例中进行验算求解。 The team orienteering problem with two-dimensional loading constraint is a special logistics distributions problem. This problem under the influences of limited vehicle service resources, loading requirements of special goods and other factors, get the maximizing profit. To solve the problem, two-dimensional bin packing algorithm that is based on IBL (improved bottom-left)algorithm were presented after an explicit problem definition. GA was using in Chao's instances .
作者 宋其勤
出处 《物流工程与管理》 2014年第2期52-53,共2页 Logistics Engineering and Management
关键词 团队定向问题 二维装箱约束 遗传算法 the team orienteering problem two-dimensional loading constraint GA
  • 相关文献

参考文献9

  • 1CHAO I M, GOLDEN B L, WASIL E A. The team orienteering problem[J]. European Journal of Operational Research, 1996, 88, (3): 464-474.
  • 2Tang H, Miller-Hooks E. A TABU search heuristic for the team orienteering problem[j]. Computer & Operations Research, 2005, 32, (6): 1379-1407.
  • 3Boussier S, Feillet D, Gendreau M. An exact algorithm for team orienteering problems[J]. 4OR: A Quarterly Journal of Operations Research, 2007, 5, (3): 211-230.
  • 4Duc-Cuo Dang, Rym Nesrine Guibad], Aziz Moukrim. An effective PSO-inspired algorithm for the team orienteering problem[J]. European Journal of Operational Research, 2013, 229:332-344.
  • 5Byung-In Kim, Hong Li, Andrew L.Johnson. An augmented large neighborhood search method for solving the team orienreering problem[J]. Expert Systems with Applicaions, 2013, 40: 3065-3072.
  • 6B.S. Baker, E.G. Coffman packing in two dimensions[J] 1980, 9: 846-855..
  • 7Jr., R.L. Rivest. Orthogonal SIAM Journal on Computing, DJ. Brown. An improved BL lower bound[J]. Information Processing Letters, 1980, 11:37-39.
  • 8武晓今,朱仲英.二维装箱问题的一种实现方法[J].微型电脑应用,2003,19(4):20-23. 被引量:17
  • 9王征,胡祥培,王旭坪.带二维装箱约束的物流配送车辆路径问题[J].系统工程理论与实践,2011,31(12):2328-2341. 被引量:25

二级参考文献24

  • 1[1]B. S. Baker. E. G. Coffman Jr., R. L. Rivest,Orthogonal packing in two dimensions, SIAM Journal on Computing 9 (1980) pp. 846-855.
  • 2[2]Chazelle, "The Bottom-- Left Bin Packing Heuristic: An Efficient Implementation", { IEEE } Transactions on Computers 32 (1983), pp. 697-707
  • 3[3]C. S. Chen, S. M. Lee, Q.S. Shen, A analytical model for the container loading problem, European Journal of Operational Research 80 (1995) pp. 68- 76.
  • 4[4]S. Jakobs, On the genetic algorithms for the packing of polygons, European Journal of Operational Research 88(1996) pp. 165-181.
  • 5[7]Goldberg, D. and R. Lingle, Alleles, loci and the traveling salesman problem, in Grefenstette, (1995) pp.154-159
  • 6[8]Davis, L. , Applying adaptive algorithms to domains, In Proceedings of International Joint Conference on Artificial Intelligence, (1985) pp. 162-164.
  • 7[9]Patrick Healy, Marcus Creavin, Ago Kuusik, An optimal algorithm for rectangle placement, Operations Research Letters 24 (1999) pp. 73-80.
  • 8Zachariadis E E, Tarantilis C D, Kiranoudis C T. A guided Tabu search for the vehicle routing problem with two-dimensional loading constraints[J]. European Journal of Operational Research, 2009, 195(3): 729-743.
  • 9Fhellerera G, Karl F D, Hartl R F, et al. Ant colony optimization for the two-dimensional loading vehicle routing problem[J]. Computers & Operations Research, 2009, (36): 655-673.
  • 10Wang F, Tao Y, Shi N. A survey on vehicle routing problem with loading constraints[C]//Proceedings of the 2009 International Joint Conference on Computational Sciences and Optimization, Washington D-C, USA: IEEE Computer Society, 2009: 602-606.

共引文献38

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

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