IDEAS home Printed from
   My bibliography  Save this article

Truck routing and scheduling


  • Csongor Gy. Csehi

    () (Budapest University of Technology and Economics)

  • Márk Farkas

    () (Nexogen)


Abstract 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.

Suggested Citation

  • Csongor Gy. Csehi & Márk Farkas, 2017. "Truck routing and scheduling," Central European Journal of Operations Research, Springer;Slovak Society for Operations Research;Hungarian Operational Research Society;Czech Society for Operations Research;Österr. Gesellschaft für Operations Research (ÖGOR);Slovenian Society Informatika - Section for Operational Research;Croatian Operational Research Society, vol. 25(4), pages 791-807, December.
  • Handle: RePEc:spr:cejnor:v:25:y:2017:i:4:d:10.1007_s10100-016-0453-8
    DOI: 10.1007/s10100-016-0453-8

    Download full text from publisher

    File URL:
    File Function: Abstract
    Download Restriction: Access to the full text of the articles in this series is restricted.

    As the access to this document is restricted, you may want to search for a different version of it.

    References listed on IDEAS

    1. Miao, Zhaowei & Lim, Andrew & Ma, Hong, 2009. "Truck dock assignment problem with operational time constraint within crossdocks," European Journal of Operational Research, Elsevier, vol. 192(1), pages 105-115, January.
    2. E. L. Lawler & D. E. Wood, 1966. "Branch-and-Bound Methods: A Survey," Operations Research, INFORMS, vol. 14(4), pages 699-719, August.
    3. Zapfel, Gunther & Wasner, Michael, 2002. "Planning and optimization of hub-and-spoke transportation networks of cooperative third-party logistics providers," International Journal of Production Economics, Elsevier, vol. 78(2), pages 207-220, July.
    4. Chen, Lu & Langevin, André & Lu, Zhiqiang, 2013. "Integrated scheduling of crane handling and truck transportation in a maritime container terminal," European Journal of Operational Research, Elsevier, vol. 225(1), pages 142-152.
    Full references (including those not matched with items on IDEAS)


    Citations are extracted by the CitEc Project, subscribe to its RSS feed for this item.

    Cited by:

    1. repec:spr:cejnor:v:25:y:2017:i:4:d:10.1007_s10100-017-0482-y is not listed on IDEAS

    More about this item


    Routing; Logistics; Scheduling; Truck;


    Access and download statistics


    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:spr:cejnor:v:25:y:2017:i:4:d:10.1007_s10100-016-0453-8. See general information about how to correct material in RePEc.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: (Sonal Shukla) or (Rebekah McClure). General contact details of provider: .

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    If CitEc recognized a reference but did not link an item in RePEc to it, you can help with this form .

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service hosted by the Research Division of the Federal Reserve Bank of St. Louis . RePEc uses bibliographic data supplied by the respective publishers.