IDEAS home Printed from https://ideas.repec.org/a/eee/ejores/v215y2011i1p149-160.html
   My bibliography  Save this article

Optimizing yard assignment in an automotive transshipment terminal

Author

Listed:
  • Cordeau, Jean-François
  • Laporte, Gilbert
  • Moccia, Luigi
  • Sorrentino, Gregorio

Abstract

This paper studies a yard management problem in an automotive transshipment terminal. Groups of cars arrive to and depart from the terminal in a given planning period. These groups must be assigned to parking rows under some constraints resulting from managerial rules. The main objective is the minimization of the total handling time. Model extensions to handle application specific issues such as a rolling horizon and a manpower leveling objective are also discussed. The main features of the problem are modeled as an integer linear program. However, solving this formulation by a state-of-the-art solver is impractical. In view of this, we develop a metaheuristic algorithm based on the adaptive large neighborhood search framework. Computational results on real-life data show the efficacy of the proposed metaheuristic algorithm.

Suggested Citation

  • Cordeau, Jean-François & Laporte, Gilbert & Moccia, Luigi & Sorrentino, Gregorio, 2011. "Optimizing yard assignment in an automotive transshipment terminal," European Journal of Operational Research, Elsevier, vol. 215(1), pages 149-160, November.
    • Handle: RePEc:eee:ejores:v:215:y:2011:i:1:p:149-160
    as

    Download full text from publisher

    File URL: http://www.sciencedirect.com/science/article/pii/S0377221711005376
    Download Restriction: Full text for ScienceDirect subscribers only
    ---><---

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

    References listed on IDEAS

    as
    1. Jean-François Cordeau & Gilbert Laporte & Pasquale Legato & Luigi Moccia, 2005. "Models and Tabu Search Heuristics for the Berth-Allocation Problem," Transportation Science, INFORMS, vol. 39(4), pages 526-538, November.
    2. Meisel, Frank & Bierwirth, Christian, 2009. "Heuristics for the integration of crane productivity in the berth allocation problem," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 45(1), pages 196-209, January.
    3. Marc Goetschalckx & H. Donald Ratliff, 1990. "Shared Storage Policies Based on the Duration Stay of Unit Loads," Management Science, INFORMS, vol. 36(9), pages 1120-1132, September.
    4. Bierwirth, Christian & Meisel, Frank, 2010. "A survey of berth allocation and quay crane scheduling problems in container terminals," European Journal of Operational Research, Elsevier, vol. 202(3), pages 615-627, May.
    5. Imahori, S. & Yagiura, M. & Ibaraki, T., 2005. "Improved local search algorithms for the rectangle packing problem with general spatial costs," European Journal of Operational Research, Elsevier, vol. 167(1), pages 48-67, November.
    6. Mattfeld, D. C. & Kopfer, H., 2003. "Terminal operations management in vehicle transshipment," Transportation Research Part A: Policy and Practice, Elsevier, vol. 37(5), pages 435-452, June.
    7. Dirk C. Mattfeld & Holger Orth, 2007. "The allocation of storage space for transshipment in vehicle distribution," Springer Books, in: Kap Hwan Kim & Hans-Otto Günther (ed.), Container Terminals and Cargo Systems, pages 267-289, Springer.
    8. Lodi, Andrea & Martello, Silvano & Monaci, Michele, 2002. "Two-dimensional packing problems: A survey," European Journal of Operational Research, Elsevier, vol. 141(2), pages 241-252, September.
    9. M Flavia Monaco & Luigi Moccia & Marcello Sammarra, 2009. "Operations Research for the management of a transhipment container terminal: The Gioia Tauro case," Maritime Economics & Logistics, Palgrave Macmillan;International Association of Maritime Economists (IAME), vol. 11(1), pages 7-35, March.
    10. Vis, Iris F. A. & de Koster, Rene, 2003. "Transshipment of containers at a container terminal: An overview," European Journal of Operational Research, Elsevier, vol. 147(1), pages 1-16, May.
    11. Giallombardo, Giovanni & Moccia, Luigi & Salani, Matteo & Vacca, Ilaria, 2010. "Modeling and solving the Tactical Berth Allocation Problem," Transportation Research Part B: Methodological, Elsevier, vol. 44(2), pages 232-245, February.
    Full references (including those not matched with items on IDEAS)

    Citations

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


    Cited by:

    1. Michael Görges & Michael Freitag, 2022. "Design and Evaluation of an Integrated Autonomous Control Method for Automobile Terminals," Logistics, MDPI, vol. 6(4), pages 1-27, October.
    2. Zhang, Di & Chen, Feng & Mei, Ziqiao, 2023. "Optimization on joint scheduling of yard allocation and transfer manpower assignment for automobile RO-RO terminal," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 177(C).
    3. Jiang, Xinjia & Lee, Loo Hay & Chew, Ek Peng & Han, Yongbin & Tan, Kok Choon, 2012. "A container yard storage strategy for improving land utilization and operation efficiency in a transshipment hub port," European Journal of Operational Research, Elsevier, vol. 221(1), pages 64-73.
    4. Wang, Yu & Chen, Feng & Chen, Zhi-Long, 2018. "Pickup and delivery of automobiles from warehouses to dealers," Transportation Research Part B: Methodological, Elsevier, vol. 117(PA), pages 412-430.
    5. Chen, Xiaojing & Li, Feng & Jia, Bin & Wu, Jianjun & Gao, Ziyou & Liu, Ronghui, 2021. "Optimizing storage location assignment in an automotive Ro-Ro terminal," Transportation Research Part B: Methodological, Elsevier, vol. 143(C), pages 249-281.
    6. Jone R. Hansen & Kjetil Fagerholt & Magnus Stålhane & Jørgen G. Rakke, 2020. "An adaptive large neighborhood search heuristic for the planar storage location assignment problem: application to stowage planning for Roll-on Roll-off ships," Journal of Heuristics, Springer, vol. 26(6), pages 885-912, December.
    7. H. L. Ma & S. H. Chung & H. K. Chan & Li Cui, 2019. "An integrated model for berth and yard planning in container terminals with multi-continuous berth layout," Annals of Operations Research, Springer, vol. 273(1), pages 409-431, February.
    8. Gharehgozli, Amir & Zaerpour, Nima, 2018. "Stacking outbound barge containers in an automated deep-sea terminal," European Journal of Operational Research, Elsevier, vol. 267(3), pages 977-995.
    9. Wang, Kai & Pesch, Erwin & Kress, Dominik & Fridman, Ilia & Boysen, Nils, 2022. "The Piggyback Transportation Problem: Transporting drones launched from a flying warehouse," European Journal of Operational Research, Elsevier, vol. 296(2), pages 504-519.
    10. Emil Karlsson & Elina Rönnberg & Andreas Stenberg & Hannes Uppman, 2021. "A matheuristic approach to large-scale avionic scheduling," Annals of Operations Research, Springer, vol. 302(2), pages 425-459, July.
    11. Iris, Çağatay & Pacino, Dario & Ropke, Stefan, 2017. "Improved formulations and an Adaptive Large Neighborhood Search heuristic for the integrated berth allocation and quay crane assignment problem," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 105(C), pages 123-147.
    12. Görges, Michael & Freitag, Michael, 2019. "Modeling autonomously controlled automobile terminal processes," Chapters from the Proceedings of the Hamburg International Conference of Logistics (HICL), in: Jahn, Carlos & Kersten, Wolfgang & Ringle, Christian M. (ed.), Digital Transformation in Maritime and City Logistics: Smart Solutions for Logistics. Proceedings of the Hamburg International Conference of Logistics, volume 28, pages 186-214, Hamburg University of Technology (TUHH), Institute of Business Logistics and General Management.

    Most related items

    These are the items that most often cite the same works as this one and are cited by the same works as this one.
    1. Ilaria Vacca & Matteo Salani & Michel Bierlaire, 2013. "An Exact Algorithm for the Integrated Planning of Berth Allocation and Quay Crane Assignment," Transportation Science, INFORMS, vol. 47(2), pages 148-161, May.
    2. Liu, Changchun, 2020. "Iterative heuristic for simultaneous allocations of berths, quay cranes, and yards under practical situations," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 133(C).
    3. Xiang, Xi & Liu, Changchun & Miao, Lixin, 2017. "A bi-objective robust model for berth allocation scheduling under uncertainty," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 106(C), pages 294-319.
    4. Zhen, Lu & Liang, Zhe & Zhuge, Dan & Lee, Loo Hay & Chew, Ek Peng, 2017. "Daily berth planning in a tidal port with channel flow control," Transportation Research Part B: Methodological, Elsevier, vol. 106(C), pages 193-217.
    5. Zhen, Lu & Zhuge, Dan & Wang, Shuaian & Wang, Kai, 2022. "Integrated berth and yard space allocation under uncertainty," Transportation Research Part B: Methodological, Elsevier, vol. 162(C), pages 1-27.
    6. Feng Li & Jiuh-Biing Sheu & Zi-You Gao, 2015. "Solving the Continuous Berth Allocation and Specific Quay Crane Assignment Problems with Quay Crane Coverage Range," Transportation Science, INFORMS, vol. 49(4), pages 968-989, November.
    7. Kai Wang & Lu Zhen & Shuaian Wang, 2018. "Column Generation for the Integrated Berth Allocation, Quay Crane Assignment, and Yard Assignment Problem," Transportation Science, INFORMS, vol. 52(4), pages 812-834, August.
    8. Zhen, Lu, 2015. "Tactical berth allocation under uncertainty," European Journal of Operational Research, Elsevier, vol. 247(3), pages 928-944.
    9. Lu Zhen & Ek Peng Chew & Loo Hay Lee, 2011. "An Integrated Model for Berth Template and Yard Template Planning in Transshipment Hubs," Transportation Science, INFORMS, vol. 45(4), pages 483-504, November.
    10. Changchun Liu & Xi Xiang & Li Zheng, 2020. "A two-stage robust optimization approach for the berth allocation problem under uncertainty," Flexible Services and Manufacturing Journal, Springer, vol. 32(2), pages 425-452, June.
    11. Iris, Çağatay & Pacino, Dario & Ropke, Stefan & Larsen, Allan, 2015. "Integrated Berth Allocation and Quay Crane Assignment Problem: Set partitioning models and computational results," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 81(C), pages 75-97.
    12. Robenek, Tomáš & Umang, Nitish & Bierlaire, Michel & Ropke, Stefan, 2014. "A branch-and-price algorithm to solve the integrated berth allocation and yard assignment problem in bulk ports," European Journal of Operational Research, Elsevier, vol. 235(2), pages 399-411.
    13. Giallombardo, Giovanni & Moccia, Luigi & Salani, Matteo & Vacca, Ilaria, 2010. "Modeling and solving the Tactical Berth Allocation Problem," Transportation Research Part B: Methodological, Elsevier, vol. 44(2), pages 232-245, February.
    14. H. L. Ma & S. H. Chung & H. K. Chan & Li Cui, 2019. "An integrated model for berth and yard planning in container terminals with multi-continuous berth layout," Annals of Operations Research, Springer, vol. 273(1), pages 409-431, February.
    15. Yi Ding & Shuai Jia & Tianyi Gu & Chung-Lun Li, 2016. "SGICT Builds an Optimization-Based System for Daily Berth Planning," Interfaces, INFORMS, vol. 46(4), pages 281-296, August.
    16. Xiang, Xi & Liu, Changchun, 2021. "An expanded robust optimisation approach for the berth allocation problem considering uncertain operation time," Omega, Elsevier, vol. 103(C).
    17. Türkoğulları, Yavuz B. & Taşkın, Z. Caner & Aras, Necati & Altınel, İ. Kuban, 2014. "Optimal berth allocation and time-invariant quay crane assignment in container terminals," European Journal of Operational Research, Elsevier, vol. 235(1), pages 88-101.
    18. Hsien-Pin Hsu & Tai-Lin Chiang & Chia-Nan Wang & Hsin-Pin Fu & Chien-Chang Chou, 2019. "A Hybrid GA with Variable Quay Crane Assignment for Solving Berth Allocation Problem and Quay Crane Assignment Problem Simultaneously," Sustainability, MDPI, vol. 11(7), pages 1-21, April.
    19. Jin, Jian Gang & Lee, Der-Horng & Hu, Hao, 2015. "Tactical berth and yard template design at container transshipment terminals: A column generation based approach," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 73(C), pages 168-184.
    20. Gharehgozli, A.H. & Roy, D. & de Koster, M.B.M., 2014. "Sea Container Terminals," ERIM Report Series Research in Management ERS-2014-009-LIS, Erasmus Research Institute of Management (ERIM), ERIM is the joint research institute of the Rotterdam School of Management, Erasmus University and the Erasmus School of Economics (ESE) at Erasmus University Rotterdam.

    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:eee:ejores:v:215:y:2011:i:1:p:149-160. 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.

    If CitEc recognized a bibliographic 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.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: Catherine Liu (email available below). General contact details of provider: http://www.elsevier.com/locate/eor .

    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.