IDEAS home Printed from https://ideas.repec.org/a/wly/navres/v48y2001i5p363-385.html
   My bibliography  Save this article

Analysis of a new vehicle scheduling and location problem

Author

Listed:
  • Ebru K. Bish
  • Thin‐Yin Leong
  • Chung‐Lun Li
  • Jonathan W. C. Ng
  • David Simchi‐Levi

Abstract

We consider a container terminal discharging containers from a ship and locating them in the terminal yard. Each container has a number of potential locations in the yard where it can be stored. Containers are moved from the ship to the yard using a fleet of vehicles, each of which can carry one container at a time. The problem is to assign each container to a yard location and dispatch vehicles to the containers so as to minimize the time it takes to download all the containers from the ship. We show that the problem is NP‐hard and develop a heuristic algorithm based on formulating the problem as an assignment problem. The effectiveness of the heuristic is analyzed from both worst‐case and computational points of view. © 2001 John Wiley & Sons, Inc. Naval Research Logistics 48: 363–385, 2001

Suggested Citation

  • Ebru K. Bish & Thin‐Yin Leong & Chung‐Lun Li & Jonathan W. C. Ng & David Simchi‐Levi, 2001. "Analysis of a new vehicle scheduling and location problem," Naval Research Logistics (NRL), John Wiley & Sons, vol. 48(5), pages 363-385, August.
    • Handle: RePEc:wly:navres:v:48:y:2001:i:5:p:363-385
    DOI: 10.1002/nav.1024
    as

    Download full text from publisher

    File URL: https://doi.org/10.1002/nav.1024
    Download Restriction: no
    File URL: https://libkey.io/10.1002/nav.1024?utm_source=ideas
    LibKey link: if access is restricted and if your library uses this service, LibKey will redirect you to where you can use your library subscription to access this item
    ---><---

    References listed on IDEAS

    as
    1. Co, Christine G. & Tanchoco, J. M. A., 1991. "A review of research on AGVS vehicle management," Engineering Costs and Production Economics, Elsevier, vol. 21(1), pages 35-42, February.
    2. Kap Hwan Kim & Ki Young Kim, 1999. "An Optimal Routing Algorithm for a Transfer Crane in Port Container Terminals," Transportation Science, INFORMS, vol. 33(1), pages 17-33, February.
    3. Kim, Kap Hwan & Park, Young Man & Ryu, Kwang-Ryul, 2000. "Deriving decision rules to locate export containers in container yards," European Journal of Operational Research, Elsevier, vol. 124(1), pages 89-101, July.
    4. Carlos F. Daganzo, 1990. "The Productivity of Multipurpose Seaport Terminals," Transportation Science, INFORMS, vol. 24(3), pages 205-216, August.
    5. De Castilho, Bernardo & Daganzo, Carlos F., 1993. "Handling Strategies for Import Containers at Marine Terminals," University of California Transportation Center, Working Papers qt5gr4622f, University of California Transportation Center.
    6. Peterkofsky, Roy I. & Daganzo, Carlos F., 1990. "A branch and bound solution method for the crane scheduling problem," Transportation Research Part B: Methodological, Elsevier, vol. 24(3), pages 159-172, June.
    7. Easa, Said M., 1987. "Approximate queueing models for analyzing harbor terminal operations," Transportation Research Part B: Methodological, Elsevier, vol. 21(4), pages 269-286, August.
    8. Jean-François Cordeau & Paolo Toth & Daniele Vigo, 1998. "A Survey of Optimization Models for Train Routing and Scheduling," Transportation Science, INFORMS, vol. 32(4), pages 380-404, November.
    9. de Castillo, Bernardo & Daganzo, Carlos F., 1993. "Handling strategies for import containers at marine terminals," Transportation Research Part B: Methodological, Elsevier, vol. 27(2), pages 151-166, April.
    10. Hwan Kim, Kap & Bae Kim, Hong, 1999. "Segregating space allocation models for container inventories in port container terminals," International Journal of Production Economics, Elsevier, vol. 59(1-3), pages 415-423, March.
    11. Nathalie Bostel & Pierre Dejax, 1998. "Models and Algorithms for Container Allocation Problems on Trains in a Rapid Transshipment Shunting Yard," Transportation Science, INFORMS, vol. 32(4), pages 370-379, November.
    12. Young Kim, Ki & Hwan Kim, Kap, 1999. "A routing algorithm for a single straddle carrier to load export containers onto a containership," International Journal of Production Economics, Elsevier, vol. 59(1-3), pages 425-433, March.
    13. Daganzo, Carlos F., 1989. "The crane scheduling problem," Transportation Research Part B: Methodological, Elsevier, vol. 23(3), pages 159-175, June.
    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. Chenhao Zhou & Qitong Zhao & Haobin Li, 2021. "Simulation optimization iteration approach on traffic integrated yard allocation problem in transshipment terminals," Flexible Services and Manufacturing Journal, Springer, vol. 33(3), pages 663-688, September.
    2. Katta G. Murty & Yat-wah Wan & Jiyin Liu & Mitchell M. Tseng & Edmond Leung & Kam-Keung Lai & Herman W. C. Chiu, 2005. "Hongkong International Terminals Gains Elastic Capacity Using a Data-Intensive Decision-Support System," Interfaces, INFORMS, vol. 35(1), pages 61-75, February.
    3. Lotte Berghman & Roel Leus & Frits Spieksma, 2014. "Optimal solutions for a dock assignment problem with trailer transportation," Annals of Operations Research, Springer, vol. 213(1), pages 3-25, February.
    4. Nabil Nehme & Bacel Maddah & Isam A. Kaysi, 2021. "An integrated multi-ship crane allocation in Beirut Port container terminal," Operational Research, Springer, vol. 21(3), pages 1743-1761, September.
    5. Andrew Lim & Brian Rodrigues & Zhou Xu, 2007. "A m‐parallel crane scheduling problem with a non‐crossing constraint," Naval Research Logistics (NRL), John Wiley & Sons, vol. 54(2), pages 115-127, March.
    6. Jonas Ahmt & Jonas Skott Sigtenbjerggaard & Richard Martin Lusby & Jesper Larsen & David Ryan, 2016. "A new approach to the Container Positioning Problem," Flexible Services and Manufacturing Journal, Springer, vol. 28(4), pages 617-643, December.
    7. Andrew Lim & Brian Rodrigues & Fei Xiao & Yi Zhu, 2004. "Crane scheduling with spatial constraints," Naval Research Logistics (NRL), John Wiley & Sons, vol. 51(3), pages 386-406, April.
    8. Saurabh Pratap & Manoj Kumar B & Divyanshu Saxena & M.K. Tiwari, 2016. "Integrated scheduling of rake and stockyard management with ship berthing: a block based evolutionary algorithm," International Journal of Production Research, Taylor & Francis Journals, vol. 54(14), pages 4182-4204, July.
    9. Anne Ehleiter & Florian Jaehn, 2018. "Scheduling crossover cranes at container terminals during seaside peak times," Journal of Heuristics, Springer, vol. 24(6), pages 899-932, December.

    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. 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.
    2. Briskorn, Dirk & Drexl, Andreas & Hartmann, Sönke, 2005. "Inventory based dispatching of automated guided vehicles on container terminals," Manuskripte aus den Instituten für Betriebswirtschaftslehre der Universität Kiel 596, Christian-Albrechts-Universität zu Kiel, Institut für Betriebswirtschaftslehre.
    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.
    4. Hartmann, Sönke, 2002. "Generating scenarios for simulation and optimization of container terminal logistics," Manuskripte aus den Instituten für Betriebswirtschaftslehre der Universität Kiel 564, Christian-Albrechts-Universität zu Kiel, Institut für Betriebswirtschaftslehre.
    5. Amir Hossein Gharehgozli & Gilbert Laporte & Yugang Yu & René de Koster, 2015. "Scheduling Twin Yard Cranes in a Container Block," Transportation Science, INFORMS, vol. 49(3), pages 686-705, August.
    6. Kim, Kap Hwan & Park, Kang Tae, 2003. "A note on a dynamic space-allocation method for outbound containers," European Journal of Operational Research, Elsevier, vol. 148(1), pages 92-101, July.
    7. Zhang, Chuqian & Wan, Yat-wah & Liu, Jiyin & Linn, Richard J., 2002. "Dynamic crane deployment in container storage yards," Transportation Research Part B: Methodological, Elsevier, vol. 36(6), pages 537-555, July.
    8. Ng, W. C., 2005. "Crane scheduling in container yards with inter-crane interference," European Journal of Operational Research, Elsevier, vol. 164(1), pages 64-78, July.
    9. Bish, Ebru K., 2003. "A multiple-crane-constrained scheduling problem in a container terminal," European Journal of Operational Research, Elsevier, vol. 144(1), pages 83-107, January.
    10. 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.
    11. Anne V. Goodchild & Carlos F. Daganzo, 2006. "Double-Cycling Strategies for Container Ships and Their Effect on Ship Loading and Unloading Operations," Transportation Science, INFORMS, vol. 40(4), pages 473-483, November.
    12. Niraj Ramesh Dayama & Andreas Ernst & Mohan Krishnamoorthy & Vishnu Narayanan & Narayan Rangaraj, 2017. "New models and algorithms for the container stack rearrangement problem by yard cranes in maritime ports," EURO Journal on Transportation and Logistics, Springer;EURO - The Association of European Operational Research Societies, vol. 6(4), pages 307-348, December.
    13. Hartmann, Sönke, 2002. "A general framework for scheduling equipment and manpower on container terminals," Manuskripte aus den Instituten für Betriebswirtschaftslehre der Universität Kiel 566, Christian-Albrechts-Universität zu Kiel, Institut für Betriebswirtschaftslehre.
    14. 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.
    15. Feng, Yuanjun & Song, Dong-Ping & Li, Dong, 2022. "Smart stacking for import containers using customer information at automated container terminals," European Journal of Operational Research, Elsevier, vol. 301(2), pages 502-522.
    16. Hyun Ji Park & Sung Won Cho & Abhilasha Nanda & Jin Hyoung Park, 2023. "Data-driven dynamic stacking strategy for export containers in container terminals," Flexible Services and Manufacturing Journal, Springer, vol. 35(1), pages 170-195, March.
    17. Silva, Marcos de Melo da & Erdoğan, Güneş & Battarra, Maria & Strusevich, Vitaly, 2018. "The Block Retrieval Problem," European Journal of Operational Research, Elsevier, vol. 265(3), pages 931-950.
    18. Goodchild, Anne V. & Daganzo, Carlos F., 2005. "Crane Double Cycling in Container Ports: Affect on Ship Dwell Time," Institute of Transportation Studies, Research Reports, Working Papers, Proceedings qt9qp7p7jq, Institute of Transportation Studies, UC Berkeley.
    19. Voß, Andre & Guckenbiehl, Gabriel & Schütt, Holger & Buer, Tobias, 2016. "A storage strategy with dynamic bay reservations for container terminals," Bremen Computational Logistics Group Working Papers 4, University of Bremen, Computational Logistics Junior Research Group.
    20. Shawn Choo & Diego Klabjan & David Simchi-Levi, 2010. "Multiship Crane Sequencing with Yard Congestion Constraints," Transportation Science, INFORMS, vol. 44(1), pages 98-115, February.

    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:wly:navres:v:48:y:2001:i:5:p:363-385. 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: Wiley Content Delivery (email available below). General contact details of provider: https://doi.org/10.1002/(ISSN)1520-6750 .

    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.