[go: up one dir, main page]
More Web Proxy on the site http://driver.im/ Skip to main content
Springer Nature Link
Log in

A hybrid dynamic berth allocation planning problem with fuel costs considerations for container terminal port using chemical reaction optimization approach

  • S.I.: SOME
  • Published:
Annals of Operations Research Aims and scope Submit manuscript

Abstract

This paper investigates the dynamic ship berth allocation problem for a container handling port, focusing on vessel waiting time at the anchorage due to the unavailability of the berth and quay cranes. A mixed integer linear programming model considering the fuel cost associated with waiting time and operational time of the docked vessel is developed. The hiring of the quay cranes to load/unload the containers from the ship and arrangement of the vessels in different berths is taken into account. Fuel consumed by the vessels while performing their respective port operations is incorporated in the model for addressing the sustainability aspects in berth allocation problem. A chemical reaction optimization algorithm is proposed to solve the problem in a large-scale realistic environment and compared with the results with block-based genetic algorithm, genetic algorithm and particle swarm optimization. The computational experiment illustrates and validates the proposed model on a real case scenario of the port located in India. The case shows that the developed model achieves better utilization of port resources and available berths.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Log in via an institution

Subscribe and save

Springer+ Basic
£29.99 /Month
  • Get 10 units per month
  • Download Article/Chapter or eBook
  • 1 Unit = 1 Article or 1 Chapter
  • Cancel anytime
Subscribe now

Buy Now

Price includes VAT (United Kingdom)

Instant access to the full article PDF.

Institutional subscriptions

Fig. 1
Fig. 2
Fig. 3
Fig. 4
Fig. 5
Fig. 6
Fig. 7
Fig. 8
Fig. 9
Fig. 10
Fig. 11

Similar content being viewed by others

References

  • Babu, S. A. K. I., Pratap, S., Lahoti, G., Fernandes, K. J., Tiwari, M. K., Mount, M., et al. (2015). Minimizing delay of ships in bulk terminals by simultaneous ship scheduling, stockyard planning and train scheduling. Maritime Economics and Logistics.,17(4), 464–492.

    Google Scholar 

  • Bhattacharjee, K., Bhattacharya, A., & Dey, S. H. N. (2014). Real coded chemical reaction based optimization for short-term hydrothermal scheduling. Applied Soft Computing,24, 962–976.

    Google Scholar 

  • Chang, P. C., Chen, M. H., Tiwari, M. K., & Iquebal, A. S. (2013). A block-based evolutionary algorithm for flow-shop scheduling problem. Applied Soft Computing,13(12), 4536–4547.

    Google Scholar 

  • Cheong, C. Y., & Tan, K. C. (2008). A multi-objective multi-colony ant algorithm for solving the berth allocation problem. In Y. Liu, A. Sun, H. T. Loh, W. F. Lu, & E. P. Lim (Eds.), Advances of computational intelligence in industrial systems (pp. 333–350). Berlin: Springer.

    Google Scholar 

  • Cheong, C. Y., Tan, K. C., Liu, D. K., & Lin, C. J. (2010). Multi-objective and prioritized berth allocation in container ports. Annals of Operations Research,180(1), 63–103.

    Google Scholar 

  • Cordeau, J. F., Laporte, G., Legato, P., & Moccia, L. (2005). Models and tabu search heuristics for the berth-allocation problem. Transportation science, 39(4), 526–538.

    Google Scholar 

  • De, A., Awasthi, A., & Tiwari, M. K. (2015). Robust formulation for optimizing sustainable ship routing and scheduling problem. IFAC-PapersOnLine,48(3), 368–373.

    Google Scholar 

  • De, A., Choudhary, A., & Tiwari, M. K. (2017a). Multiobjective approach for sustainable ship routing and scheduling with draft restrictions. IEEE Transactions on Engineering Management, 99, 1–17.

    Google Scholar 

  • De, A., Kumar, S. K., Gunasekaran, A., & Tiwari, M. K. (2017b). Sustainable maritime inventory routing problem with time window constraints. Engineering Applications of Artificial Intelligence,61, 77–95.

    Google Scholar 

  • De, A., Mamanduru, V. K. R., Gunasekaran, A., Subramanian, N., & Tiwari, M. K. (2016). Composite particle algorithm for sustainable integrated dynamic ship routing and scheduling optimization. Computers and Industrial Engineering,96, 201–215.

    Google Scholar 

  • De Oliveira, R. M., Mauri, G. R., & Lorena, L. A. N. (2012). Clustering search for the berth allocation problem. Expert Systems with Applications,39(5), 5499–5505.

    Google Scholar 

  • Golias, M. M., Saharidis, G. K., Boile, M., Theofanis, S., & Ierapetritou, M. G. (2009). The berth allocation problem: Optimizing vessel arrival time. Maritime Economics and Logistics,11(4), 358–377.

    Google Scholar 

  • Guan, Y., & Cheung, R. K. (2004). The berth allocation problem: Models and solution methods. OR Spectrum,26, 75–92.

    Google Scholar 

  • Guan, J., & Lin, G. (2016). Hybridizing variable neighborhood search with ant colony optimization for solving the single row facility layout problem. European Journal of Operational Research,248(3), 899–909.

    Google Scholar 

  • Hansen, P., Oğuz, C., & Mladenović, N. (2008). Variable neighborhood search for minimum cost berth allocation. European Journal of Operational Research,191(3), 636–649.

    Google Scholar 

  • Hendriks, M. P. M., Lefeber, E., & Udding, J. T. (2013). Simultaneous berth allocation and yard planning at tactical level. OR Spectrum,35, 441–456.

    Google Scholar 

  • Hu, Q. M., Hu, Z. H., & Du, Y. (2014). Berth and quay-crane allocation problem considering fuel consumption and emissions from vessels. Computers and Industrial Engineering,70, 1–10.

    Google Scholar 

  • Imai, A., Nagaiwa, K., & Tat, C. W. (1997). Efficient planning of berth allocation for container terminals in Asia. Journal of Advanced Transportation.,31(1), 75–94.

    Google Scholar 

  • Imai, A., Nishimura, E., Hattori, M., & Papadimitriou, S. (2007). Berth allocation at indented berths for mega-containerships. European Journal of Operational Research,179, 579–593.

    Google Scholar 

  • Imai, A., Nishimura, E., & Papadimitriou, S. (2001). The dynamic berth allocation for a container port. Transportation Research Part B,35, 401–417.

    Google Scholar 

  • Iris, C., Pacino, D., Ropke, S., & Larsen, A. (2015). Integrated berth allocation and quay crane assignment problem: Set partitioning models and computational results. Transportation Research Part E: Logistics and Transportation Review,81, 75–97.

    Google Scholar 

  • Kim, K. H., & Moon, K. C. (2003). Berth scheduling by simulated annealing. Transportation Research Part B,37, 541–560.

    Google Scholar 

  • Lalla-Ruiz, E., Expósito-Izquierdo, C., Melián-Batista, B., & Moreno-Vega, J. M. (2016). A set-partitioning-based model for the berth allocation problem under time-dependent limitations. European Journal of Operational Research,250, 1001–1012.

    Google Scholar 

  • Lalla-Ruiz, E., González-Velarde, J. L., Melián-Batista, B., & Moreno-Vega, J. M. (2014). Biased random key genetic algorithm for the tactical berth allocation problem. Applied Soft Computing,22, 60–76.

    Google Scholar 

  • Lam, A. Y., Li, V. O., & James, J. Q. (2012). Real-coded chemical reaction optimization. IEEE Transactions on Evolutionary Computation,16(3), 339–353.

    Google Scholar 

  • Lang, N., & Veenstra, A. (2010). A quantitative analysis of container vessel arrival planning strategies. OR Spectrum,32(3), 477–499.

    Google Scholar 

  • Lee, D. H., Chen, J. H., & Cao, J. X. (2010). The continuous berth allocation problem: A greedy randomized adaptive search solution. Transportation Research Part E: Logistics and Transportation Review,46(6), 1017–1029.

    Google Scholar 

  • Li, Z., Nguyen, T. T., Chen, S., & Truong, T. K. (2015). A hybrid algorithm based on particle swarm and chemical reaction optimization for multi-object problems. Applied Soft Computing,35, 525–540.

    Google Scholar 

  • Li, J. Q., & Pan, Q. K. (2012). Chemical-reaction optimization for flexible job-shop scheduling problems with maintenance activity. Applied Soft Computing,12(9), 2896–2912.

    Google Scholar 

  • Li, J. Q., Pan, Q. K., & Wang, F. T. (2014). A hybrid variable neighborhood search for solving the hybrid flow shop scheduling problem. Applied Soft Computing,24, 63–77.

    Google Scholar 

  • Lim, A. (1998). The berth planning problem. Operations Research Letters,22, 105–110.

    Google Scholar 

  • Mauri, G. R., Ribeiro, G. M., Lorena, L. A. N., & Laporte, G. (2016). An adaptive large neighborhood search for the discrete and continuous berth allocation problem. Computers and Operations Research,70, 140–154.

    Google Scholar 

  • Moorthy, R., & Teo, C. P. (2006). Berth management in container terminal: The template design problem. OR Spectrum,28, 495–518.

    Google Scholar 

  • Nishimura, E., Imai, A., & Papadimitriou, S. (2001). Berth allocation planning in the public berth system by genetic algorithms. European Journal of Operational Research,131(2), 282–292.

    Google Scholar 

  • Pratap, S., Manoj Kumar B., Cheikhrouhou, N., & Tiwari, M.K. (2015a). The robust quay crane allocation for a discrete bulk material handling port. In 2015 IEEE international conference on industrial engineering and engineering management (IEEM), Singapore, 2015 (pp. 1174–1178). https://doi.org/10.1109/ieem.2015.7385833.

  • Pratap, S., Nayak, A., Cheikhrouhou, N., & Tiwari, M. K. (2015b). Decision support system for discrete robust berth allocation. IFAC-PapersOnLine,48(3), 875–880.

    Google Scholar 

  • Ribeiro, G. M., Mauri, G. R., de Beluco, S. C., Lorena, L. A. N., & Laport, G. (2016). Berth allocation in an ore terminal with demurrage, despatch and maintenance. Computers and Industrial Engineering,96, 8–15.

    Google Scholar 

  • Roy, P. K., Bhui, S., & Paul, C. (2014). Solution of economic load dispatch using hybrid chemical reaction optimization approach. Applied Soft Computing,24, 109–125.

    Google Scholar 

  • Tao, Y., & Lee, C.-Y. (2015). Joint planning of berth and yard allocation in transshipment terminals using multi-cluster stacking strategy. Transportation Research Part E: Logistics and Transportation Review,83, 34–50.

    Google Scholar 

  • Ting, C. J., Wu, K. C., & Chou, H. (2014). Particle swarm optimization algorithm for the berth allocation problem. Expert Systems with Applications,41(4), 1543–1550.

    Google Scholar 

  • Tong, C. J., Lau, H. C., & Lim, A. (1999). Ant colony optimization for the ship berthing problem. Lecture Notes in Computer Science,1742, 359–370.

    Google Scholar 

  • Truong, T. K., Li, K., & Xu, Y. (2013). Chemical reaction optimization with greedy strategy for the 0–1 knapsack problem. Applied Soft Computing,13(4), 1774–1780.

    Google Scholar 

  • Umang, N., Bierlaire, M., & Vacca, I. (2013). Exact and heuristic methods to solve the berth allocation problem in bulk ports. Transportation Research Part E: Logistics and Transportation Review,54, 14–31.

    Google Scholar 

  • UNCTAD and WTO. (2015). Review of maritime transport, 2015.

  • Wu, L., & Ma, W. (2017). Quay crane scheduling with draft and trim constraints. Transportation Research Part: Logistics and Transportation Review. https://doi.org/10.1016/j.tre.2016.10.011.

    Article  Google Scholar 

  • Zhen, L. (2015). Tactical berth allocation under uncertainty. European Journal of Operational Research,247(3), 928–944.

    Google Scholar 

Download references

Acknowledgment

The authors would like to thank the EU Commission for funding the research within the “EU - India Research and Innovation Partnership for Efficient and Sustainable Freight Transportation (REINVEST)” project (ICI+/2014/342-800).

Author information

Authors and Affiliations

  1. Newcastle University Business School, Newcastle University, Newcastle upon Tyne, NE1 4SE, UK

    Arijit De

  2. Department of Mechanical Engineering, Indian Institute of Information Technology, Design and Manufacturing Jabalpur, Jabalpur, India

    Saurabh Pratap

  3. Department of Industrial and Systems Engineering, Indian Institute of Technology Kharagpur, Kharagpur, India

    Akhilesh Kumar & M. K. Tiwari

Authors
  1. Arijit De
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Saurabh Pratap
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Akhilesh Kumar
    View author publications

    You can also search for this author in PubMed Google Scholar

  4. M. K. Tiwari
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Akhilesh Kumar.

Rights and permissions

Reprints and permissions

About this article

Check for updates. Verify currency and authenticity via CrossMark

Cite this article

De, A., Pratap, S., Kumar, A. et al. A hybrid dynamic berth allocation planning problem with fuel costs considerations for container terminal port using chemical reaction optimization approach. Ann Oper Res 290, 783–811 (2020). https://doi.org/10.1007/s10479-018-3070-1

Download citation

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s10479-018-3070-1

Keywords

Search

Navigation