Abstract

The efficiency of transportation requests fulfillment can be increased through extending the problem of vehicle routing and scheduling by the possibility of subcontracting a part of the requests to external carriers. This problem extension transforms the usual vehicle routing and scheduling problems to the more general integrated operational transportation problems. In this contribution, we analyze the motivation, the chances, the realization, and the challenges of the integrated operational planning and report on experiments for extending the plain Vehicle Routing Problem to a corresponding problem combining vehicle routing and request forwarding by means of different sub-contraction types. The extended problem is formalized as a mixed integer linear programming model and solved by a commercial mathematical programming solver. The computational results show tremendous costs savings even for small problem instances by allowing subcontracting. Additionally, the performed experiments for the operational transportation planning are used for an analysis of the decision on the optimal fleet size for own vehicles and regularly hired vehicles.

주제어

#VRP with Subcontracting   #Own Fleet   #External Carriers   #Balancing Different Modes of Fulfillment   #Truck Fleet Size   #Cherry-Picking  

참고문헌 (13)

1. Krajewska, M. A. (2008), Potentials for efficiency increase in modern freight forwarding, Gabler Edition Wissenschaft, Wiesbaden, Germany 
2. Krajewska, M. A. and Kopfer, H. (2009), Transportation planning in freight forwarding companies-Tabu search algorithm fort the integrated operational transportation planning problem, European Journal of Operational Research, to appear. 
3. Pankratz, G. (2002), Speditionelle Transportdisposition, Deutscher Universit$\"{a}$tsverlag (DUV), Wiesbaden, Germany 
4. Savelsberg, M. and Sol, M. (1998), Drive : Dynamic routing of independent vehicles, Operations Research, 46, 474-490 
5. Schönberger, J. and Kopfer, H. (2009), Online decision making and automatic decision model adaptation, Computers and Operations Research, to appear 
6. Bolduc, M.-C., Renaud, J. and Boctor, F. (2007), A heuristic for the routing and carrier selection problem, European Journal of Operational Research, 183, 926-932 
7. Stumpf, P. (1998), Tourenplanung im speditionellen G$\"{u}$terfernverkehr, Schriftreihe der Gesellschaft f$\"{u}$r Verkehrsbetriebswirtschaft, N$\"{u}$rnberg, Germany 
8. Ball, M. O., Golden, B. L., Assad, A. A. and Bodin, L. D. (1983), Planning for truck fleet size in the presence of a common-carrier option, Decision Science, 14(1), 103-120 
9. Dantzig, G. and Ramser, J. (1959), The truck dispatching problem, Management Science, 6, 80-91 
10. Kopfer, H. and Krajewska, M. A. (2007), Approaches for modelling and solving the integrated transportation and forwarding problem. In : Corsten, H. and Missbauer, H. (Eds.) : Produktionsund Logistikmanagement, Springer, Berlin Heidelberg New York, 439-458 
11. Schonberger, J. (2005), Operational freight carrier planning, Springer, Berlin Heidelberg New York 
12. Chu, C. (2005), A heuristic algorithm fort he truckload and less than truckload problem, European Journal of Operational Research, 165, 657-667 
13. Kopfer, H. and Schonberger, J. (2009), Logistics : The complexity of operational transport optimization. In : Lucas, P. and Roosen, P. (Eds.) : Emerge Analysis and optimization of structures-concepts and strategies across disciplines, Springer, Berlin Heidelberg New York, to appear 

이 논문을 인용한 문헌 (0)

1. 이 논문을 인용한 문헌 없음