期刊文献+

求解卸装一体化车辆路径问题的改进导向局部搜索算法

An Improved Guided Local Search Algorithm for Vehicle Routing Problem with Simultaneous Delivery and Pickup
下载PDF
导出
摘要 针对卸装一体化车辆路径问题,提出一种变惩罚函数的导向局部搜索算法(IGLS)。在传统导向局部搜索算法的基础上加入了新的惩罚效用函数,当传统导向局部搜索算法陷入局部最优时,变换惩罚策略后重新搜索,从而扩展搜索的邻域。通过和传统导向局部搜索算法以及TS_GLS算法在不同算例上的仿真结果比较,验证了所提算法在解决卸装一体化车辆路径问题上的有效性和稳定性。 This Paper proposes a Improved Guided Local Search Algorithm (IGLS) based on variable penalty function to solve vehicle routing problem with simultaneous delivery and pickup. We propose a new penalty utility function to guided local search algorithm, change the penalty strategy and search again to extended search neighborhood when the traditional guided local search algorithm fall into a local optimum. Through comparison on several examples with the traditional guided local search algorithm and TS_GLS algorithm , the simulation results illustrate that IGLS is an effective and stabilize method for Vehicle Routing Problem with Simultaneous Delivery and Pickup.
出处 《科学技术与工程》 北大核心 2015年第18期66-70,共5页 Science Technology and Engineering
基金 国家高技术研究发展计划(863)(2013AA040606) 四川省科技支撑计划项目(2014GZ0142)资助
关键词 卸装一体化车辆路径问题 变惩罚函数 导向局部搜索 惩罚策略 vehicle routing problem with simultaneous delivery and pickup variable penalty function guided local search penalty strategy
  • 相关文献

参考文献11

  • 1Cordeau J F, Gendreau M, Hertz A, et al. New heuristics for the ve- hicle muting problem. Springer US, 2005.
  • 2Gajpal Y, Abad P. An ant colony system (ACS) fur vehicle routing problem with simultaneous delivery and pickup. Computers & Opera- tions Research, 2009; 36(12): 3215-3223.
  • 3Ai T J, Kachitvichyanukul V. A particle swarm optimization for the vehicle muting problem with simultaneous pickup and delivery. Com- puters & Operations Research, 2009 ; 36 (5) : 1693-1702.
  • 4Tasan A S, Gen M. A genetic algorithm based approach to vehicle routing problem with simultaneous pick-up and deliveries. Computers & Industrial Engineering, 2012 ; 62 (3) : 755-761.
  • 5Alfredo Tang Montane F, Galvao R D. A tabu search algorithm for the vehicle muting problem with simultaneous pick-up and delivery service. Computers & Operations Research, 2006; 33 (3):595-619.
  • 6Ganesh K, Narendran T T. CLOVES: a cluster-and-search heuristic to solve the vehicle routing problem with delivery and pick-up. Euro- pean Journal of Operational Research, 2007; 178(3) : 699-717.
  • 7Cfispim J, Brandao J. Metaheuristics applied to mixed and simultane- ous extensions of vehicle routing problems with baekhauls. Journal of the Operational Research Society, 2005 ;56( 11 ) : 1296-1302.
  • 8Zachariadis E E, Tarantilis C D, Kiranoudis C T. A hybrid metaheu- ristic algorithm for the vehicle routing problem with simultaneous de- livery and pick-up service. Expert Systems with Applications, 2009; 36(2) : 1070-1081.
  • 9Chtistofides N, Mingozzi A, Toth P. State - space relaxation proce- dures for the computation of bounds to routing problems. Networks, 1981; 11(2): 145-164.
  • 10Voudouris C, Tsang E P K, Alsheddy A. Guided Local Search. Handbook of Metaheuristics. Springer US, 2010:321-361.

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

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