IDEAS home Printed from https://ideas.repec.org/h/spr/lnechp/978-3-642-00939-6_6.html
   My bibliography  Save this book chapter

Variable Neighbourhood Descent for Planning Crane Operations in a Train Terminal

In: Metaheuristics in the Service Industry

Author

Listed:
  • Wouter Souffriau

    (Katholieke Universiteit Leuven, Centre for Industrial Management)

  • Pieter Vansteenwegen

    (Katholieke Universiteit Leuven, Centre for Industrial Management)

  • Greet Vanden Berghe

    (Katholieke Universiteit Leuven, Centre for Industrial Management)

  • Dirk Van Oudheusden

    (Katholieke Universiteit Leuven, Centre for Industrial Management)

Abstract

In recent years, a lot of work has been done for supporting the operational management of container handling operations in seaports. However, the train-to-train container transshipment problem, in which containers have to be interchanged between trains, has been largely ignored. Containers are handled by rail mounted cranes. The time needed for completing the transshipments using multiple cranes is to be minimised. The contribution of this paper is to put forward a metaheuristic approach to deal with this challenging problem that has not been tackled before. The problem is first decomposed into three subproblems: (1) the assignment of a destination to each train, (2) the determination of container positions on the train wagons and (3) the determination of the operations sequence for the different cranes that perform the actual transshipments. The first subproblem is solved in a heuristic manner while the second subproblem is solved to optimality. The third subproblem is tackled by a Variable NeighbourhoodDescentmetaheuristic procedure. This approach is validated on a set of generated test problems. Solutions are obtained in a reasonable amount of calculation time.

Suggested Citation

  • Wouter Souffriau & Pieter Vansteenwegen & Greet Vanden Berghe & Dirk Van Oudheusden, 2009. "Variable Neighbourhood Descent for Planning Crane Operations in a Train Terminal," Lecture Notes in Economics and Mathematical Systems, in: Kenneth Sörensen & Marc Sevaux & Walter Habenicht & Martin Josef Geiger (ed.), Metaheuristics in the Service Industry, chapter 6, pages 83-98, Springer.
    • Handle: RePEc:spr:lnechp:978-3-642-00939-6_6
    DOI: 10.1007/978-3-642-00939-6_6
    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.

    Citations

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


    Cited by:

    1. Alena Otto & Xiyu Li & Erwin Pesch, 2017. "Two-Way Bounded Dynamic Programming Approach for Operations Planning in Transshipment Yards," Transportation Science, INFORMS, vol. 51(1), pages 325-342, February.
    2. Stefan Fedtke & Nils Boysen, 2017. "Gantry crane and shuttle car scheduling in modern rail–rail transshipment yards," OR Spectrum: Quantitative Approaches in Management, Springer;Gesellschaft für Operations Research e.V., vol. 39(2), pages 473-503, March.
    3. Nils Boysen & Malte Fliedner & Florian Jaehn & Erwin Pesch, 2013. "A Survey on Container Processing in Railway Yards," Transportation Science, INFORMS, vol. 47(3), pages 312-329, August.

    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:lnechp:978-3-642-00939-6_6. 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.