IDEAS home Printed from https://ideas.repec.org/h/spr/sprchp/978-0-387-27744-8_17.html
   My bibliography  Save this book chapter

Rail Container Service Planning: A Constraint-Based Approach

In: Multidisciplinary Scheduling: Theory and Applications

Author

Listed:
  • Nakorn Indra-Payoong

    (University of Leeds)

  • Raymond S K Kwan

    (University of Leeds)

  • Les Proll

    (University of Leeds)

Abstract

This paper considers a container rail service planning problem, in which customer demands are known in advance. The existing rail freight optimisation models are complex and not demand responsive. This paper focuses on constructing profitable schedules, in which service supply matches customer demands and optimises on booking preferences whilst satisfying regulatory constraints. A constraint satisfaction approach is used, in which optimisation criteria and operational requirements are formulated as soft and hard constraints respectively. We present a constraint-based search algorithm capable of handling problems of realistic size. It employs a randomised strategy for the selection of constraints and variables to explore, and uses a predictive choice model to guide and intensify the search within more promising regions of the space. Experimental results, based on real data from the Royal State Railway of Thailand, have shown good computational performance of the approach and suggest significant benefits can be achieved for both the rail company and its customers.

Suggested Citation

  • Nakorn Indra-Payoong & Raymond S K Kwan & Les Proll, 2005. "Rail Container Service Planning: A Constraint-Based Approach," Springer Books, in: Graham Kendall & Edmund K. Burke & Sanja Petrovic & Michel Gendreau (ed.), Multidisciplinary Scheduling: Theory and Applications, pages 343-368, Springer.
    • Handle: RePEc:spr:sprchp:978-0-387-27744-8_17
    DOI: 10.1007/0-387-27744-7_17
    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.

    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:sprchp:978-0-387-27744-8_17. 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.