期刊文献+

多车场多车型装卸混合车辆路径问题研究 被引量:23

Study on multi-depot and multi-type vehicles vehicle routing problem with backhauls
原文传递
导出
摘要 为满足电子商务客户多样化和个性化的需求,建立了多车场、多车型的装卸混合车辆调度模型,并使用混合遗传启发式算法求解.首先采用混合编码,使问题变得更简洁;利用个体数量控制选择策略,以保证群体的多样性;引入2-交换变异策略,并结合爬山算法,加强染色体的局部搜索能力.然后,对混合遗传算法求得的精英种群进行禁忌搜索,提高了搜索效率.最后,通过实例计算表明了上述模型和算法的有效性. In order to satisfy with the individual and various demand of customer under e-commerce, the vehicle scheduling model of picking-delivery for multi-depot and multi-type vehicles is established. Hybrid genetic heuristic algorithm is used to get the optimization solution. Firstly, b^ybrid coding is used to simplify the problem. The individual amount control choice strategy is applied to guard the diversity of group. By introducing 2- exchange mutation operator and combining with hill-climbing algorithm, the partial searching ability of chromosome is increased. Then stock elite derived from the hybrid genetic algorithm is searched with taboo, which improves the searching efficiency of algorithm. Finally, an example shows the effectiveness of the models and methods.
出处 《控制与决策》 EI CSCD 北大核心 2009年第12期1769-1774,共6页 Control and Decision
基金 国家自然科学基金项目(70801022) 黑龙江省科技攻关项目(GB05D202-3)
关键词 装卸混合的车辆路径问题 多车场 多车型 混合遗传启发式算法 Vehicle routing problem with backhauls Multi-depot Multi-type vehicles Hybrid genetic heuristic algorithm
  • 相关文献

参考文献11

  • 1Hipolito, Hernandez Perez. A branch and-cut algorithm for a traveling salesman problem with pickup and delivery[J]. Discrete Applied Mathematics, 2004, 145 (1): 126-139.
  • 2Deif L, Bodin L. Extension of the clarke and wright algorithm for solving the vehicle routing problem with backhauling[C]. Proc of the Babson Conf on Software Uses in Transportation and Logistics Management. Babson Park, 1984: 75-96.
  • 3Casco Do, Golden B L, Wasil E A. Vehicle routing with backhauls: Models algorithms and case studies [M]. Amsterdam: Elsevier Science, 1988: 127-147.
  • 4Goetschalckx M, Jacobs-Blecha C. The vehicle routing problem with backhauls[J]. European J of Operational Research, 1989, 42(1) : 39-51.
  • 5Duhamel C, Jean-Yves P, Jean-Mare R. A tabu search heuristic for the vehicle routing problem with backhauls and time windows[J]. Transportation Science, 1997, 31 (1) : 49-60.
  • 6Hasama T, Kokubugata H, Kawashima H. A heuristic approach based on the string model to solve vehicle routing problem with backhauls[C]. The 5th World Congress on Intelligent Transport Systems. Seoul: The Korea Highway Corporation, 1998: 25-32.
  • 7Potvin J Y, Duhaumel C, Guerin F. A genetic algorithm for vehicle routing with backhauling [J]. Applied Intelligence, 1996, 6(4): 345-355.
  • 8Salhi S, Nagy G. A cluster insertion heuristic for single and multiple depot vehicle routing problems with backhauling[J]. J of the Operational Research Society, 1999, 50(10): 1034-1042.
  • 9Gabor Nagy, Said Salhi. Heuristic algorithms for single and multiple depot vehicle routing problems with pickups and deliveries [J]. European J of Operational Research, 2005, 162(1): 126-141.
  • 10胡大伟,陈诚,郭晓汾.带集货和配送的多站点VRP优化算法研究[J].数学的实践与认识,2007,37(2):98-104. 被引量:12

二级参考文献22

  • 1吴璟莉,李陶深.有时间窗物流配送车路由问题的改进遗传算法[J].小型微型计算机系统,2004,25(10):1792-1795. 被引量:5
  • 2陈湘州,杨勇,王俊年.一种改进的自然数编码遗传算法在非满载时间窗车辆优化调度问题中的应用[J].长沙电力学院学报(自然科学版),2004,19(2):56-59. 被引量:7
  • 3刘志硕,柴跃廷,申金升.蚁群算法及其在有硬时间窗的车辆路径问题中的应用[J].计算机集成制造系统,2006,12(4):596-602. 被引量:15
  • 4[1]Laporte G.,Norbert Y..Exact Algorithm for the vehicle routing problem[M].Amsterdam:North-Holland Publishing,1987:47-84.
  • 5[2]Fisher M.L..Vehicle routine with time windows:Two optimization algorithms[J].Operations Research,1997,45(3):488-492.
  • 6[3]Kontoravdis G.,Band J.F..A GRASP for the vehicle routine problem with time windows[J].ORSA Journal on Computing,1995,7:10-23.
  • 7[4]LaporteG..The vehicle routine problem:An overview of exact and approximate algorithm[J].European Journal of Operational Research,1992,59(3):345 358.
  • 8[6]Osman I.H..Meta-strategy simulated annealing and Tabu search algorithms for the vehicle routine problem[J].Operations Research,1993,41(3):77-86.
  • 9[8]REIMANNM,DORENERK,HARTLRF.Insertion based ants for vehicle routing problems with backhauls and time windows[A].Ant Algorithms[C].Berlin/Heidelberg,Germany:Springer LNCS2463,2002:135-147.
  • 10[10]Joe L.and Rover L..Multiple Vehicle Routing with Time and Capacity Constraints Using Genetic Algorithms[C].Proceedings of the Fifth InternationaI Conference on Genetic Algorithms,1993:452-459.

共引文献19

同被引文献274

引证文献23

二级引证文献230

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

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