IDEAS home Printed from https://ideas.repec.org/a/spr/joinma/v29y2018i2d10.1007_s10845-015-1108-7.html
   My bibliography  Save this article

Rule based optimization for a bulk handling port operations

Author

Listed:
  • Saurabh Pratap

    (Indian Institute of Technology)

  • Yash Daultani

    (Indian Institute of Management)

  • M. K. Tiwari

    (Indian Institute of Technology)

  • Biswajit Mahanty

    (Indian Institute of Technology)

Abstract

In this paper a study on the operations of a bulk material port is carried out to develop a decision support model, which deals with the dynamics of port and aids in better decision making at different scenarios. Here, we describe various decisions taken by port authorities pertaining to the import of coal at the terminal. We optimize these decisions with the aim of minimizing the unloading time of ships at the port, congestion in the stockyard, and loading time of the rakes. A practice-oriented decision support model is proposed to assist port planners in making these decisions. Various operational rules are embedded within the model, for carrying out the modelling of various port operations. The utility of the developed model is demonstrated using a case study which helps in achieving efficient utilization of berths, stockyard and rake loading stations.

Suggested Citation

  • Saurabh Pratap & Yash Daultani & M. K. Tiwari & Biswajit Mahanty, 2018. "Rule based optimization for a bulk handling port operations," Journal of Intelligent Manufacturing, Springer, vol. 29(2), pages 287-311, February.
    • Handle: RePEc:spr:joinma:v:29:y:2018:i:2:d:10.1007_s10845-015-1108-7
    DOI: 10.1007/s10845-015-1108-7
    as

    Download full text from publisher

    File URL: http://link.springer.com/10.1007/s10845-015-1108-7
    File Function: Abstract
    Download Restriction: Access to the full text of the articles in this series is restricted.
    File URL: https://libkey.io/10.1007/s10845-015-1108-7?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
    ---><---

    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. Singh, Gaurav & Sier, David & Ernst, Andreas T. & Gavriliouk, Olena & Oyston, Rob & Giles, Tracey & Welgama, Palitha, 2012. "A mixed integer programming model for long term capacity expansion planning: A case study from The Hunter Valley Coal Chain," European Journal of Operational Research, Elsevier, vol. 220(1), pages 210-224.
    2. Zhen, Lu, 2014. "Container yard template planning under uncertain maritime market," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 69(C), pages 199-217.
    3. Akio Imai & Jin-Tao Zhang & Etsuko Nishimura & Stratos Papadimitriou, 2007. "The Berth Allocation Problem with Service Time and Delay Time Objectives," Maritime Economics & Logistics, Palgrave Macmillan;International Association of Maritime Economists (IAME), vol. 9(4), pages 269-290, December.
    4. 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.
    5. Lee, Yusin & Chen, Chuen-Yih, 2009. "An optimization heuristic for the berth scheduling problem," European Journal of Operational Research, Elsevier, vol. 196(2), pages 500-508, July.
    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. Cao, Zhen & Wang, Wenyuan & Jiang, Ying & Xu, Xinglu & Xu, Yunzhuo & Guo, Zijian, 2022. "Joint berth allocation and ship loader scheduling under the rotary loading mode in coal export terminals," Transportation Research Part B: Methodological, Elsevier, vol. 162(C), pages 229-260.
    2. Jia Hao & Mengying Zhou & Guoxin Wang & Liangyue Jia & Yan Yan, 2020. "Design optimization by integrating limited simulation data and shape engineering knowledge with Bayesian optimization (BO-DK4DO)," Journal of Intelligent Manufacturing, Springer, vol. 31(8), pages 2049-2067, December.
    3. Dhirendra Prajapati & Yash Daultani & Naoufel Cheikhrouhou & Saurabh Pratap, 2020. "Identification and ranking of key factors impacting efficiency of Indian shipping logistics sector," OPSEARCH, Springer;Operational Research Society of India, vol. 57(3), pages 765-786, September.

    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. 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.
    2. Matthew E. H. Petering & Yong Wu & Wenkai Li & Mark Goh & Robert Souza & Katta G. Murty, 2017. "Real-time container storage location assignment at a seaport container transshipment terminal: dispersion levels, yard templates, and sensitivity analyses," Flexible Services and Manufacturing Journal, Springer, vol. 29(3), pages 369-402, December.
    3. Wang, Mengyao & Zhou, Chenhao & Wang, Aihu, 2022. "A cluster-based yard template design integrated with yard crane deployment using a placement heuristic," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 160(C).
    4. 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.
    5. Yuquan Du & Qiushuang Chen & Jasmine Siu Lee Lam & Ya Xu & Jin Xin Cao, 2015. "Modeling the Impacts of Tides and the Virtual Arrival Policy in Berth Allocation," Transportation Science, INFORMS, vol. 49(4), pages 939-956, November.
    6. 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).
    7. Xu, Dongsheng & Li, Chung-Lun & Leung, Joseph Y.-T., 2012. "Berth allocation with time-dependent physical limitations on vessels," European Journal of Operational Research, Elsevier, vol. 216(1), pages 47-56.
    8. Zhen, Lu, 2015. "Tactical berth allocation under uncertainty," European Journal of Operational Research, Elsevier, vol. 247(3), pages 928-944.
    9. Xiang, Xi & Liu, Changchun, 2021. "An expanded robust optimisation approach for the berth allocation problem considering uncertain operation time," Omega, Elsevier, vol. 103(C).
    10. 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.
    11. Shih-Wei Lin & Ching-Jung Ting & Kun-Chih Wu, 2018. "Simulated annealing with different vessel assignment strategies for the continuous berth allocation problem," Flexible Services and Manufacturing Journal, Springer, vol. 30(4), pages 740-763, December.
    12. Guo, Liming & Zheng, Jianfeng & Du, Haoming & Du, Jian & Zhu, Zhihong, 2022. "The berth assignment and allocation problem considering cooperative liner carriers," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 164(C).
    13. Ursavas, Evrim & Zhu, Stuart X., 2016. "Optimal policies for the berth allocation problem under stochastic nature," European Journal of Operational Research, Elsevier, vol. 255(2), pages 380-387.
    14. 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.
    15. Jiayin Pan & Yinfeng Xu & Guiqing Zhang, 2018. "Online integrated allocation of berths and quay cranes in container terminals with 1-lookahead," Journal of Combinatorial Optimization, Springer, vol. 36(2), pages 617-636, August.
    16. Zhen, Lu, 2016. "Modeling of yard congestion and optimization of yard template in container ports," Transportation Research Part B: Methodological, Elsevier, vol. 90(C), pages 83-104.
    17. Zhen, Lu & Shen, Tao & Wang, Shuaian & Yu, Shucheng, 2016. "Models on ship scheduling in transshipment hubs with considering bunker cost," International Journal of Production Economics, Elsevier, vol. 173(C), pages 111-121.
    18. Wang, Xiaoping & Zhao, Yunliang & Sun, Peng & Wang, Xiaobin, 2013. "An analysis on convergence of data-driven approach to ship lock scheduling," Mathematics and Computers in Simulation (MATCOM), Elsevier, vol. 88(C), pages 31-38.
    19. Chen, Rong & Gao, Ge & Kang, Liu-Jiang & Zhang, Li-Ye, 2024. "Efficiency and equity analysis on parking reservation," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 187(C).
    20. Benjamin T. Hazen & Joseph B. Skipper & Christopher A. Boone & Raymond R. Hill, 2018. "Back in business: operations research in support of big data analytics for operations and supply chain management," Annals of Operations Research, Springer, vol. 270(1), pages 201-211, November.

    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:joinma:v:29:y:2018:i:2:d:10.1007_s10845-015-1108-7. 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: 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.