Vehicle Routing and Scheduling for Trunk Haulage

  • Petra Stumpf
Conference paper
Part of the Lecture Notes in Economics and Mathematical Systems book series (LNE, volume 460)


The paper deals with the daily control of the vehicles in a network of less-than-truckload carriers. The operations in such a network consist of the regional pick-up and delivery traffic around the depots, regular line service between the depots, possibly through one or several hubs, and additional transports of partial loads between customers. The regional traffic planning, which is closely related to the classical vehicle scheduling problem, is not considered here. However, scheduling the trunk haulage tours is a quite different problem which has found little attention in literature, so far. We analyze various problem settings encountered in practice, present a new heuristic algorithm for a basic problem and report on computational tests with real-life data.


Vehicle Rout Problem Transportation Mode Partial Load Rolling Horizon Transport Order 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. AIF-Projekt 9767 “Güterverkehrsnetze” (1995): Literaturrecherche und Algorithmenentwicklung zur Modellierung und Optimierung von Güterverkehrsnetzen. Zwischenbericht.Google Scholar
  2. AIF-Projekt 131/96 “Fuhrpark-Disposition” (1996): Pflichtenheft.Google Scholar
  3. Brown, G.G./Ronen, D. (1997): Consolidation of Customer Orders into Truckloads at a Large Manufacturer. In: Journal of the Operational Research Society 48, 779 – 785.Google Scholar
  4. Dargel, W. (1983): Ein Problem der Fahrzeug-Einsatzplanung im Getränkevertrieb. Studienarbeit an der Universität Hamburg.Google Scholar
  5. Dejax, P.J./Crainic, T.G. (1987): A Review of Empty Flows and Fleet Management Models in Freight Transportation. In: Transportation Science, Vol. 21, No. 4, 227 – 247.Google Scholar
  6. Deutsche Gesellschaft für Mittelstandsberatung mbH (Eds.) (1995): Transport- und Speditionswesen: Positionen, Perspektiven, Strategien. NeuIsenburg.Google Scholar
  7. Dumas, Y./Desrosiers, J./Soumis, F. (1991): The pickup and delivery problem with time windows. In: EJOR 54, 7 – 22.Google Scholar
  8. Ebner, G. (1997): Controlling komplexer Logistiknetzwerke. GVB Schriftenreihe 34.Google Scholar
  9. Erdmann, J. (1993): Servicezeitorientierte Distributionslogistik. Logistik und Verkehr 45, Vandenhoeck & Ruprecht.Google Scholar
  10. Feige, D. (1983): Untersuchungen zur rechnergestützten Kfz-Einsatzplanung. Habilitationsschrift Dresden.Google Scholar
  11. Fleischmann, B. (1997): Design of Freight Traffic Networks. In: Stähl, P et al. (Eds.). Advances in Distribution Logistics. Springer Verlag.Google Scholar
  12. Hemming, H./Ebner, G./Kraus, S./Wicek, H. (1997): Kosten-und umweltorientierte Optimierung von Güterverkehrsnetzen. Projektbericht.Google Scholar
  13. Ioachim, I./Desrosiers, J./Dumas, Y./Solomon, M./Villeneuve, D. (1995): A Request Clustering Algorithm for Door-to-Door Handicapped Transportation. Transportation Science, Vol. 29, No. 1, 63 – 78.CrossRefGoogle Scholar
  14. Leung, J.M.Y./Magnanti, T.L./Singhal, V. (1990): Routing in Point-To-Point Delivery Systems: Formulations and Solution Heuristics. In: Transportation Science, Vol. 24, No. 4, 245 – 260.Google Scholar
  15. Paessens, H. (1988): The savings algorithm for the vehicle routing problem. In: EJOR 34, 336 – 344.Google Scholar
  16. Powell, W.B. (1983): The Load Planning Problem of Motor Carriers: Problem Description and a Proposed Solution Approach. In: Transportation Research A, Vol. 17 A, No. 6, 471 – 480.Google Scholar
  17. Powell, W.B. (1986): A Local Improvement Heuristic of Less-than-Truckload Motor Carrier Networks. In: Transportation Science, Vol. 20, No. 4, 256 – 257.Google Scholar
  18. Powell, W.B. (1987): Dynamic Vehicle Allocation Problem with Uncertain Demands. In: Transportation Research, Vol. 21 B, No. 3, 217 – 232.Google Scholar
  19. Powell, W.B. (1996): A Stochastic Formulation of the Dynamic Assignment Problem, with an Application to Truckload Motor Carriers. In: Transportation Science, Vol. 30, Nr. 3, 195 – 219.Google Scholar
  20. Rego, C./Roucairol, C. (1995): Using Tabu Search for Solving a Dynamic Multi-Terminal Truck Dispatching Problem. In: EJOR 83, 411 – 429.Google Scholar
  21. Savelsbergh/M. W. P., Sol, M. (1995): The General Pickup- and Delivery Problem. Transportation Science, Vol. 29, No. 1, 17 – 29.CrossRefGoogle Scholar
  22. Schmidt, J. (1994): Die Fahrzeugeinsatzplanung im gewerblichen Güterfernverkehr. Verlag Peter Lang.Google Scholar
  23. Söllig, M. (1989): LKW-Einsatzplanung für den Fernverkehr in einem Speditionsunternehmen. Diplomarbeit an der Universität Hamburg.Google Scholar
  24. Solomon, M. (1987): Algorithms for the vehicle routing and scheduling problems with time window constraints. Operations Research, Vol. 35, No. 2, 254 – 265.CrossRefGoogle Scholar
  25. Wlcek, H. (1997): Local Search Heuristics for the Design of Freight Carrier Networks. In: Stähly et al. (Eds.). Advances in Distribution Logistics. Springer Verlag.Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 1998

Authors and Affiliations

  • Petra Stumpf
    • 1
  1. 1.Lehrstuhl für Produktion und LogistikUniversität AugsburgAugsburgGermany

Personalised recommendations