期刊文献+

基于客户分组的城市物流配送线路问题研究

Study on Routing Problem in Urban Logistics Distribution Activities Based on Customer Grouping
下载PDF
导出
摘要 针对城市客户订单需求差异性,应用改进的凝聚型层次聚类算法计算客户订单属性相似度,以此为据提出了客户分组方法,并进行物流配送线路设计。对某物流配送中心的车辆调度问题进行分析计算,结果表明,基于分组策略的配送方案能够有效降低运输成本,并提高配送的准时性。 In this paper, in view of the difference between customer orders, we used the improved hierarchical agglomerative clustering algorithm to calculate the attribute likeliness of the customer orders, then accordingly proposed the customer grouping method and proceeded to design the logistics distribution route. Next, we analyzed and calculated the vehicle scheduling problem of a certain logistics distribution center to prove the validity of the distribution plan based on the group strategy.
作者 孟凡婷 丁勇
出处 《物流技术》 2015年第17期131-133,共3页 Logistics Technology
基金 国家自然科学基金"重大"项目课题"多式联运物流运营管理"(71390332)
关键词 物流配送 车辆调度 客户分组 改进的凝聚型层次聚类算法 logistics distribution vehicle scheduling customer grouping improved HAC
  • 相关文献

参考文献7

  • 1NanryW P,Barnes J W.Solving the pickup and delivery problem withtime windows using reactive tabu search[J].Transportation ResearchPart B,2000,34(2): 107-121.
  • 2LinC Y K.A cooperative strategy for a vehicle routing problem withpickup and delivery time windows[J].Computers & Industrial Engi-neering,2008,55(4):766-782.
  • 3于滨,靳鹏欢,杨忠振.两阶段启发式算法求解带时间窗的多中心车辆路径问题[J].系统工程理论与实践,2012,32(8):1793-1800. 被引量:43
  • 4韩世莲.带时间窗的多目标配送线路选择问题的目标规划模型[J].物流技术,2008,27(1):44-45. 被引量:9
  • 5GaneshK,Narendran T T Cloves.A Cluster-and-search Heuristic toSolve the Vehicle Routing Problem with Delivery and Pick-up[J].Eu-ropean Journal of Operational Research,2007,178(3):699-717.
  • 60stertagL’Doemer K F’Hart R F.A Variable Neighborhood Search In-tegrated in the POPMUSIC Framework for Solving large Scale VehicleRouting Problems[A].Proceedings of the 5th International workshop onHybrid Meta-heuristics[C].Mdlaga,Spain,2008.
  • 7Jiuh-Biing Sheu.A hybrid fuzzy- optimization approach to customergrouping-based logistics distribution operations[J].Applied Mathemati-.

二级参考文献25

  • 1李敏,郭强,刘红丽.多车场多配送中心的物流配送问题研究[J].计算机工程与应用,2007,43(8):202-204. 被引量:15
  • 2刘宝锭 赵瑞清.不确定规划及应用[M].北京:清华大学出版社,2003..
  • 3Bruno D B, Vincent F, Paul S, et al. Solving vehicle routing problems using constraint programming and meta heuristics [J]. Journal of Heuristics, 2000, 6(4):501-523.
  • 4Malandraki C, Daskin M. Time dependent vehicle routing problems: Formulations, properties and heuristic algorithms [J].Transportation Science, 1992,26(3): 185-199.
  • 5Hong S C, Park Y B. A heuristic for hi-objective vehicle routing with time window constraints [J]. International Journal of Production Economics, 1999, 62(2): 249-258.
  • 6Polacek M R, Hartl R F, Doerner K, et al. A variable neighborhood search for the multi depot vehicle routing problem with time windows[J]. Journal of Heuristics, 2004, 10(6): 613-627.
  • 7Cordeau J F, Laporte G, Mercier A. A unified tabu search heuristic for vehicle routing problems with time windows[J]. Journal of the Operational Research Society, 2001, 52(8): 928-936.
  • 8Cordeau J F, Laporte G, Mercier A. An improved tabu search algorithm for the handling of route duration constraints in vehicle routing problems with time windows[J]. Journal of the Operational Research Society, 2004, 55(5): 542 -546.
  • 9Renaud J, Laporte G, Boctor F F. A tabu search heuristic for the multi-depot vehicle routing problem[J]. Computers and Operations Research, 1996, 23(3): 229-235.
  • 10Cordeau J F, Gendreau M, Laporte G. A tabu search heuristic for periodic and multi-depot vehicle routing problems[J]. Networks, 1997, 30: 105-119.

共引文献50

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

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