期刊文献+

一类新的车辆路径问题及其两阶段算法(英文) 被引量:4

A New Vehicle Routing Problem and It's Two Stage Algorithm
下载PDF
导出
摘要 本文结合汽车零部件第三方物流业的实际背景,提出了一类新的车辆路径问题,它是一种带时间窗约束的分车运输同时收发车辆路径问题(简称SVRPSPDTW).接着给出了问题的模型,并提出求解问题的启发式算法:两阶段算法.最后在改进的Solomn的算例的基础上,进行了数值试验. In this paper,a new vehicle routing problem,split and simultaneous pickup and delivery vehicle routing problem with time windows constraints(SVRPSPDTW), was provided for the first time under the actual background in the third party logistics of auto parts.Then the mathematic model of this problem and the heuristic algorithm to solve the problem,i.e.two stage algorithm,was given.In the end,the computational experiment was done based on the modified Solomn's benchmark.
出处 《运筹学学报》 CSCD 2010年第3期55-63,共9页 Operations Research Transactions
基金 Supported by the Nature Science Foundation of China(Grant numbers:20710015,70731160015) Shanghai Key Discipline Construction Project(Grant numbers:S30504) Specialized Research Fund for the Doctoral Program of Higher Education(Grant numbers:20093120110008) The Innovation Fund Project For Graduate Student of Shanghai(Grant numbers:JWCXSL1001)
关键词 运筹学 车辆路径问题 时间窗口 分车运输 两阶段算法 Operations research VRP Time Window Split Two Stage algorithm
  • 相关文献

参考文献9

  • 1Ho S.C., Haugland D. A tabu search heuristic for the vehicle routing problem with time windows and split deliveries[J]. Computers and Operations Research, 2004, 31(12): 1947-1964.
  • 2Tang F.A., Galvao R.D. A tabu search algorithm for the vehicle routing problem with simultaneous pick-up and delivery service[J]. Computers and Operations Research, 2006, 33(3): 595-619.
  • 3Dethloff J. Vehicle Routing and Reverse Logistics:the Vehicle Routing Problem with Simultaneous Delivery and pick-up[J]. OR Spectrum, 2001, 23: 79-96.
  • 4Tang G.Ch. New Transportation Path Problem[C]. Yuan Y X. Collected Papers of the Ninth Academic Exchanges for ORSC[C] (ISBN 962-8286-38-2). Hongkong: Global- Link Informatics Limited, 2008: 269-277.
  • 5Mitra S. An Algorithm for the Generalized Vehicle Routing Problem with Backhauling [J]. Journal of Operational Research, 2005, 22(2): 153-169.
  • 6Mitra S. A Parallel Clustering Technique for the Vehicle Routing Problem with Deliveries and Pickups[J]. Operational Research Society, 2008, 59: 1532-1546.
  • 7LAI M, Cao Er. An improved differential evolution algorithm for vehicle routing problem with simultaneous pickups and deliveries and time windows[J]. Engineering Applications of Artificial Intelligence, 2010, 23: 188-195.
  • 8Angelelli E., Mansini R. The Vehicle Routing Problem with Time Windows and Simultaneous Pickup and Delivery [M]. Speranza MG, Klose A, Van Wassenhove LN (eds). Quantitative approaches to distribution logistics and supply chain management. Berlin: Springer, 2002: 249-267.
  • 9Solomon M.M. Algorithm for the Vehicle Routing and Scheduling Problems with Time Window Constraints[J]. Operations Research, 1987, 35(2): 254-265. (The instances is available online: http://w.cba.neu.edu/~msolomon/problems.htm).

同被引文献96

  • 1宁爱兵,马良.竞争决策算法及其在车辆路径问题中的应用[J].管理科学学报,2005,8(6):10-18. 被引量:27
  • 2郎茂祥.多配送中心车辆调度问题的模型与算法研究[J].交通运输系统工程与信息,2006,6(5):65-69. 被引量:35
  • 3Dantzig G B and Ramser J H. The truck dispatching problem. Management Seience, 1959, 6(1): 80-91.
  • 4Mitra S. An algorithm for the generalized vehicle routing problem with backhauling. Asia-Pacific Journal of Operational Research, 2005, 22(2): 153-169.
  • 5Mitra S. A parallel clustering technique for the vehicle routing problem with split deliveries and pickups. Journal of the Operational Research Society, 2008, 59: 1532-1546.
  • 6唐国春.新的车辆路径问题.中国运筹学会第九届学术交流会论文集,袁亚湘编,香港,Global-Link Informatics Limited,2008.
  • 7Tang G C, Ning A B, Wang K F and Qi X T. A practical split vehicle routing problem with simutaneous pickup and delivery. Proceedings IEEE 16th International Conference on Industrial Engineering and Engineering Management, Qi E S, Beijing, IEEE, 2009, (1): 006-814.
  • 8Wang K F, Ye C M and Ning A B. Competitive decision algorithm for the split vehicle routing problem with simultaneous pickup and delivery and time windows. International Conference on Future Information Technology and Management Engineering, Zhou Q Y, Chang Zhou, IEEE, 2010, (2): 371-375.
  • 9Archetti C, Mansini R and Speranza M G. Complexity and reducibility of the skip delivery problem. Transportation Science, 2005, 39(2): 182-187.
  • 10Archetti C, Savelsbergh M W P and Grazia M. Worst-case analysis for split delivery vehicle routing problems. Transportation Science, 2006, 40(2): 226-234.

引证文献4

二级引证文献50

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

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