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

A Robust Optimisation Approach to Synchromodal Container Transportation

In: Optimisation in Synchromodal Logistics

Author

Listed:
  • I. Chiscop

    (TNO)

Abstract

This chapter addresses synchromodal planning at operational level from the perspective of a logistics service provider and studies an optimisation problem with simultaneous vehicle routing and container-to-mode assignment, having uncertain data. It is assumed that the release times of the containers belong to an uncertainty interval, and no further statistical information is available. This problem belongs to the fourth quadrant of Fig. 1.4 . The container routing problem is modelled as a mixed integer program with explicit time variables and lateness penalties. A robust formulation is then proposed to eliminate the uncertain parameters from the objective function and constraints. By solving the new model exactly, with the aid of an optimisation solver, robust solutions are obtained corresponding to transportation plans which remain feasible for any realisation of the release times within the pre-specified uncertainty interval. In order to introduce some flexibility in the transportation plan, the continuous time variables are modelled as affine functions of the uncertain parameters. The resulting two-stage decision model is tested for a small-sized instance in both situations, with high and low lateness penalties.

Suggested Citation

  • I. Chiscop, 2023. "A Robust Optimisation Approach to Synchromodal Container Transportation," Lecture Notes in Operations Research, in: Frank Phillipson (ed.), Optimisation in Synchromodal Logistics, chapter 0, pages 263-293, Springer.
  • Handle: RePEc:spr:lnopch:978-3-031-15655-7_16
    DOI: 10.1007/978-3-031-15655-7_16
    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_16. 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.