Central European Journal of Operations Research

, Volume 25, Issue 4, pp 791–807 | Cite as

Truck routing and scheduling

Original Paper


The problem is part of a complex software solution for truck itinerary construction for one of the largest public road transportation companies in the EU. In practice a minor improvement on the operational cost per tour can decide whether a freight services company is profitable or not. Thus the optimization of routes has key importance in the operation of such companies. Given an initial location and an asset state one must be able to calculate a cost optimal itinerary containing all Point of Interests. Such an itinerary is an executable plan which exactly specifies the location and activity of an asset during the whole timespan of the itinerary. If parking places and gas stations are included in the planning then it is NP hard to find an optimal solution. This means that for long range tours an approximately optimal solution for refueling has to be given within an acceptable running time. Also the corridoring of the trucks is an important problem so that we try to optimize the performance, hence tours cannot be recalculated at each data arrival. The vehicle assignment part of this work is already finished and applied with very good results. The remaining part is subject of an ongoing research which started at January 2014. The company started to apply and test our product in the beginning of 2015 under increased human supervision. As a consequence of the project a large cost saving is anticipated by the company.


Routing Logistics Scheduling Truck 



The project would not have been possible without the help of the people of Nexogen. We wish to thank András Recski for stimulating discussions and suggestions.


  1. Adamski A (2007) Integrated transportation and logistics systems. ITS ILS 7:46–53Google Scholar
  2. Carter MW, Price CC (2000) Operations research: a practical introduction. CRC Press, Boca RatonGoogle Scholar
  3. Chen L, Langevin A, Lu Z (2013) Integrated scheduling of crane handling and truck transportation in a maritime container terminal. Eur J Oper Res 225(1):142–152CrossRefGoogle Scholar
  4. Feng CW, Cheng TM, Wu HT (2004) Optimizing the schedule of dispatching RMC trucks through genetic algorithms. Autom Construct 13(3):327–340CrossRefGoogle Scholar
  5. Floyd RW (1962) Algorithm 97: shortest path. Commun ACM 5(6):345CrossRefGoogle Scholar
  6. Giaglis GM, Minis I, Tatarakis A, Zeimpekis V (2004) Minimizing logistics risk through real-time vehicle routing and mobile technologies: Research to date and future trends. Int J Phys Distrib Logist Manag 34(9):749–764CrossRefGoogle Scholar
  7. Kozan E, Preston P (1999) Genetic algorithms to schedule container transfers at multimodal terminals. Int Trans Oper Res 6:311–329CrossRefGoogle Scholar
  8. Lawler EL, Wood DE (1966) Branch-and-bound methods: a survey. Oper Res 14(4):699–719CrossRefGoogle Scholar
  9. Miao Z, Lim A, Ma H (2009) Truck dock assignment problem with operational time constraint within crossdocks. Eur J Oper Res 192:105–115CrossRefGoogle Scholar
  10. Schönsleben P (2011) Integral logistics management: operations and supply chain management within and across companies, 4th edn. Series on Resource ManagementGoogle Scholar
  11. Takeyasu K, Kainosho M (2014) Optimization technique by genetic algorithms for international logistics. J Intell Manuf 25(5):1043–1049CrossRefGoogle Scholar
  12. Toth P, Vigo D (2001) The vehicle routing problem. Society for Industrial and Applied MathematicsGoogle Scholar
  13. Warshall S (1962) A theorem on Boolean matrices. J ACM 9(1):11–12CrossRefGoogle Scholar
  14. Zäpfel G, Wasner M (2002) Planning and optimization of hub-and-spoke transportation networks of cooperative third-party logistics providers. Int J Prod Econ 78(2):207–220CrossRefGoogle Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2016

Authors and Affiliations

  1. 1.Budapest University of Technology and EconomicsBudapestHungary
  2. 2.NexogenBudapestHungary

Personalised recommendations