IDEAS home Printed from https://ideas.repec.org/h/spr/lnopch/978-3-031-15655-7_5.html
   My bibliography  Save this book chapter

Deterministic Operational Freight Planning

In: Optimisation in Synchromodal Logistics

Author

Listed:
  • D. Huizing

    (TNO)

Abstract

In this chapter, the final of three problems is presented. Now, there are no stochastic elements anymore; however, the decision-maker is given control over the vehicle timetables in addition to the control over container-to-mode assignments. This problem is argued to be a departure from classical optimisation problems, but shown to still be strongly NP-hard. An integer linear program is developed to solve the problem, but the results show that it scales too poorly to solve problems of “real life size” in an appropriate amount of time for decision support. The Greedy Gain heuristic and Compatibility Clustering heuristic are developed: they solve much more limited sub-problems with the ILP, but unfortunately, even these sub-problems require too much computational effort at the wished instance size.

Suggested Citation

  • D. Huizing, 2023. "Deterministic Operational Freight Planning," Lecture Notes in Operations Research, in: Frank Phillipson (ed.), Optimisation in Synchromodal Logistics, chapter 0, pages 89-117, Springer.
    • Handle: RePEc:spr:lnopch:978-3-031-15655-7_5
    DOI: 10.1007/978-3-031-15655-7_5
    as

    Download full text from publisher

    To our knowledge, this item is not available for download. To find whether it is available, there are three options:
    1. Check below whether another version of this item is available online.
    2. Check on the provider's web page whether it is in fact available.
    3. Perform a search for a similarly titled item that would be available.

    More about this item

    Statistics

    Access and download statistics

    Corrections

    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:lnopch:978-3-031-15655-7_5. See general information about how to correct material in RePEc.

    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.

    We have no bibliographic references for this item. You can help adding them by using 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.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: Sonal Shukla or Springer Nature Abstracting and Indexing (email available below). General contact details of provider: http://www.springer.com .

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

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.