期刊文献+

Optimized vehicle scheduling and filling model based on effective space and integrated solving algorithm

Optimized vehicle scheduling and filling model based on effective space and integrated solving algorithm
在线阅读 下载PDF
导出
摘要 We established an integrated and optimized model of vehicle scheduling problem and vehicle filling problem for solving an extremely complex delivery mode-multi-type vehicles, non-full loads, pickup and delivery in logistics and delivery system. The integrated and optimized model is based on our previous research result-effective space method. An integrated algorithm suitable for the integrated and optimized model was proposed and corresponding computer programs were designed to solve practical problems. The results indicates the programs can work out optimized delivery routes and concrete loading projects. The model and algorithm have many virtues and are valuable in practice. We established an integrated and optimized model of vehicle scheduling problem and vehicle filling problem for solving an extremely complex delivery mode—multi-type vehicles, non-full loads, pickup and delivery in logistics and delivery system. The integrated and optimized model is based on our previous research result—effective space method. An integrated algorithm suitable for the integrated and optimized model was proposed and corresponding computer programs were designed to solve practical problems. The results indicates the programs can work out optimized delivery routes and concrete loading projects. The model and algorithm have many virtues and are valuable in practice.
作者 赵鹏
出处 《Journal of Chongqing University》 CAS 2007年第3期172-176,共5页 重庆大学学报(英文版)
基金 the Natural Science Foundation of China (No. 70572028).
关键词 vehicle scheduling vehicle filling integration and optimization solving algorithm 交通调度 运输容量 整合优化 解决方法
作者简介 ZHAO Peng(赵鹏): Male; Born 1964; Asst. Prof.; Research interests: modern logistics management and management information systems; E-mail: zhaopeng@cqu.edu.cn.
  • 相关文献

参考文献3

二级参考文献10

  • 1Sol M,Savelsbergh M.The general pickup and delivery problem[J]. Transportation Science, 1995 ;29( 1 ) : 17-29.
  • 2Solomon M M ,Desrosiers J.Time window constrained routing and scheduling problems[J].Transportation Science, 1988 ; 22 ( 1 ) : 1 - 13.
  • 3Salhi S,Nagy G.A cluster insertion heuristic for single and multiple depot depot vehicle routing problems with backhauling[J].Joumal of Operational Research Society, 1999 ;50(10) : 1034-1042.
  • 4Toth P,Vigo D.A heuristic algorithm for the symmetric and asymmetric vehicle routing problems with hackhauls[J].European Journal of Operational Research, 1999 ; 113 (3) : 528-543.
  • 5Van der Bruggen L J J,Lenstra J K,Schuur P C.Variable-Depth Search for the Single-Vehicle Pickup and Delivery Problem with Time Windows[J].Transportation Science, 1993 - 27 (3) : 298-311.
  • 6Ioachim I,Desrosiers J,Dumas Y et al.A request clustering algorithm for door-to-door handicapped transportation[J].Transportation Science, 1995;29(2) :63-78.
  • 7Nanry W P,Bames J W.Solving the pickup and delivery problem with time windows using reactive tabu search[J].Transportation Research Part B : Methodological, 2000; 34 (2) : 107- 121.
  • 8Caricato P,Ghiani G,Gfieco A et al.Parallel tabu search for a pickup and delivery problem under track contention[J].Parallel Computing, 2003 ; 29 (5) :631 -639.
  • 9Toth P,Vigo D.The vehicle routing problem[M].Philadelphia:Society for Industrial and Applied Mathematics,2002.
  • 10Abdou G, E1-Masry M. Three-dimensional random stacking of weakly heterogeneous palletization with demand requirements and stability measures [J]. International Journal of Production Research ,2000,38(14) :3149~3163

共引文献65

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

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