期刊文献+

双重容量约束的定位-路线问题的启发式算法 被引量:2

A heuristic algorithm for location-routing problems with double capacity constraints
下载PDF
导出
摘要 为了有效求解集成化物流中的双重容量约束的定位-路线问题,设计了两阶段的启发式算法。算法的第一阶段解决了配送中心定位和客户群分配问题,算法的第二阶段采用禁忌搜索算法优化车辆的行车路线,并通过算例验证了算法的可行性和有效性。 In order to solve the location-routing problem with double capacity constraints in the intergrated logistics, a two-phase heuristic algorithm was proposed. Firstly, the location of the depots and the assignment of the customer clusters were confirmed. And then, the vehicle routing was optimized by Tabu search algorithm. Finally, the proposed algorithm was tested by experiments. And the results show the proposed algorithm for locationrouting problem with double capacity constraints is feasible and efficient.
作者 蒋泰 杨海珺
出处 《广西工学院学报》 CAS 2007年第2期49-53,共5页 Journal of Guangxi University of Technology
基金 广西科技攻关项目(桂科攻0428006-9)
关键词 定位-路线安排问题 插入法 禁忌搜索算法 location-routing problem insertion method tabu search algorithm
  • 相关文献

参考文献7

  • 1Liu S C,Lin C C.A two-phase heuristic method for the multi-depot location routing problem taking inventory control decisions into consideration[J].International Journal of Advanced Manufacturing Technology,2003,22(11):941-950.
  • 2胡大伟,胡勇,朱志强.基于空间填充曲线和动态规划解的定位路线问题[J].长安大学学报(自然科学版),2006,26(3):80-83. 被引量:4
  • 3张长星,党延忠.定位—运输路线安排问题的遗传算法研究[J].计算机工程与应用,2004,40(12):65-68. 被引量:16
  • 4Hokey Min,Vaidyanathan Jayaraman,Rajesh srivastava.Combined location-routing problems:A synthesis and future research direction.European[J].Journal of Operational Research,1998,108:1-15.
  • 5Glover F.Tabu Search:part Ⅰ[J].ORSA Journal on Computing,1989,1:190-206.
  • 6J.Potvin,J.Rousseau.An exchange heuristic for routing problems with time windows[J].Journal of the Operational Research Society 1995,46(12):1433- 1466.
  • 7王凌.智能优化算法及其应用[M].北京:清华大学出版社,2004.

二级参考文献9

共引文献70

同被引文献17

  • 1彭海波,应保胜,陈馨.基于Petri网的柔性制造系统建模的调度算法[J].中国工程机械学报,2005,3(2):219-223. 被引量:4
  • 2郎茂祥.装卸混合车辆路径问题的模拟退火算法研究[J].系统工程学报,2005,20(5):485-491. 被引量:51
  • 3Haq A N, Karthikeyan T, Dinesh M. Scheduling Decisions in FMS Using a Heuristic approach [J]. The International Journal of Advanced Manufacturing Technology, 2003, 22 (5): 374-379.
  • 4Pezzella F, Morganti G, Ciaschetti G. A genetic algorithm for the flexible job-shop scheduling problem [J ]. Computer & Operations Research. 2008, 10(35 ):3202-3212.
  • 5Mastrolilli M, Gambardella L M. Effective neighbourhood functions for the flexible job shop problem[J]. Journal of scheduling. 2000, 3(l): 3-20.
  • 6Brandimarte P. Routing and scheduling in a flexible job shop by tabu search [J ]. Annals of Operations Research. 1993, 41 (3): 157- 183.
  • 7Chan T S, Chan H K, Kazerooni A. Real time fuzzy scheduling rules in FMS. Journal of Intelligent Manufacturing [J ], 2003, 14 (3): 341-350.
  • 8Kacem I, Hammadi S, Borne P. Approach by localization and muhiobjective evolutionary optimization for flexible job-shop scheduling problems [J]. IEEE Transactions on Systems, Man, and Cybernetics-Part C: Applications and Reviews, 2002, 32 ( 1 ): 1-13.
  • 9Wu Tai-his,Low Chin-yao,Bai Jiunn-Wei. Heuristics solutions to multi-depot location-routing problems[J].Computers and Operations Research,2002,(29):1393-1415.
  • 10林晖钢.MDLRPPD模型构建及其启发式组合优化算法研究[D]西安:长安大学,200846-56.

引证文献2

二级引证文献2

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

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