{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,9,30]],"date-time":"2026-09-30T08:41:17Z","timestamp":1790757677211,"version":"4.1.0"},"reference-count":46,"publisher":"Springer Science and Business Media LLC","issue":"1-2","license":[{"start":{"date-parts":[[2018,10,1]],"date-time":"2018-10-01T00:00:00Z","timestamp":1538352000000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2018,10,1]],"date-time":"2018-10-01T00:00:00Z","timestamp":1538352000000},"content-version":"vor","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Ann Oper Res"],"published-print":{"date-parts":[[2020,7]]},"DOI":"10.1007\/s10479-018-3070-1","type":"journal-article","created":{"date-parts":[[2018,10,1]],"date-time":"2018-10-01T14:16:35Z","timestamp":1538403395000},"page":"783-811","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":56,"title":["A hybrid dynamic berth allocation planning problem with fuel costs considerations for container terminal port using chemical reaction optimization approach"],"prefix":"10.1007","volume":"290","author":[{"given":"Arijit","family":"De","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Saurabh","family":"Pratap","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Akhilesh","family":"Kumar","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"M. K.","family":"Tiwari","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2018,10,1]]},"reference":[{"issue":"4","key":"3070_CR1","doi-asserted-by":"crossref","first-page":"464","DOI":"10.1057\/mel.2014.20","volume":"17","author":"SAKI Babu","year":"2015","unstructured":"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\u2013492.","journal-title":"Maritime Economics and Logistics."},{"key":"3070_CR2","doi-asserted-by":"crossref","first-page":"962","DOI":"10.1016\/j.asoc.2014.08.048","volume":"24","author":"K Bhattacharjee","year":"2014","unstructured":"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\u2013976.","journal-title":"Applied Soft Computing"},{"issue":"12","key":"3070_CR3","doi-asserted-by":"crossref","first-page":"4536","DOI":"10.1016\/j.asoc.2013.07.018","volume":"13","author":"PC Chang","year":"2013","unstructured":"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\u20134547.","journal-title":"Applied Soft Computing"},{"key":"3070_CR4","doi-asserted-by":"crossref","first-page":"333","DOI":"10.1007\/978-3-540-78297-1_16","volume-title":"Advances of computational intelligence in industrial systems","author":"CY Cheong","year":"2008","unstructured":"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\u2013350). Berlin: Springer."},{"issue":"1","key":"3070_CR5","doi-asserted-by":"crossref","first-page":"63","DOI":"10.1007\/s10479-008-0493-0","volume":"180","author":"CY Cheong","year":"2010","unstructured":"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\u2013103.","journal-title":"Annals of Operations Research"},{"issue":"4","key":"3070_CR48","doi-asserted-by":"crossref","first-page":"526","DOI":"10.1287\/trsc.1050.0120","volume":"39","author":"JF Cordeau","year":"2005","unstructured":"Cordeau, J. F., Laporte, G., Legato, P., & Moccia, L. (2005). Models and tabu search heuristics for the\nberth-allocation problem. Transportation science, 39(4), 526\u2013538.","journal-title":"Transportation science"},{"issue":"3","key":"3070_CR7","doi-asserted-by":"crossref","first-page":"368","DOI":"10.1016\/j.ifacol.2015.06.109","volume":"48","author":"A De","year":"2015","unstructured":"De, A., Awasthi, A., & Tiwari, M. K. (2015). Robust formulation for optimizing sustainable ship routing and scheduling problem. IFAC-PapersOnLine,48(3), 368\u2013373.","journal-title":"IFAC-PapersOnLine"},{"key":"3070_CR8","first-page":"1","volume":"99","author":"A De","year":"2017","unstructured":"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\u201317.","journal-title":"IEEE Transactions on Engineering Management"},{"key":"3070_CR9","doi-asserted-by":"crossref","first-page":"77","DOI":"10.1016\/j.engappai.2017.02.012","volume":"61","author":"A De","year":"2017","unstructured":"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\u201395.","journal-title":"Engineering Applications of Artificial Intelligence"},{"key":"3070_CR10","doi-asserted-by":"crossref","first-page":"201","DOI":"10.1016\/j.cie.2016.04.002","volume":"96","author":"A De","year":"2016","unstructured":"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\u2013215.","journal-title":"Computers and Industrial Engineering"},{"issue":"5","key":"3070_CR11","doi-asserted-by":"crossref","first-page":"5499","DOI":"10.1016\/j.eswa.2011.11.072","volume":"39","author":"RM De Oliveira","year":"2012","unstructured":"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\u20135505.","journal-title":"Expert Systems with Applications"},{"issue":"4","key":"3070_CR12","doi-asserted-by":"crossref","first-page":"358","DOI":"10.1057\/mel.2009.12","volume":"11","author":"MM Golias","year":"2009","unstructured":"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\u2013377.","journal-title":"Maritime Economics and Logistics"},{"key":"3070_CR13","doi-asserted-by":"crossref","first-page":"75","DOI":"10.1007\/s00291-003-0140-8","volume":"26","author":"Y Guan","year":"2004","unstructured":"Guan, Y., & Cheung, R. K. (2004). The berth allocation problem: Models and solution methods. OR Spectrum,26, 75\u201392.","journal-title":"OR Spectrum"},{"issue":"3","key":"3070_CR14","doi-asserted-by":"crossref","first-page":"899","DOI":"10.1016\/j.ejor.2015.08.014","volume":"248","author":"J Guan","year":"2016","unstructured":"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\u2013909.","journal-title":"European Journal of Operational Research"},{"issue":"3","key":"3070_CR15","doi-asserted-by":"crossref","first-page":"636","DOI":"10.1016\/j.ejor.2006.12.057","volume":"191","author":"P Hansen","year":"2008","unstructured":"Hansen, P., O\u011fuz, C., & Mladenovi\u0107, N. (2008). Variable neighborhood search for minimum cost berth allocation. European Journal of Operational Research,191(3), 636\u2013649.","journal-title":"European Journal of Operational Research"},{"key":"3070_CR16","doi-asserted-by":"crossref","first-page":"441","DOI":"10.1007\/s00291-012-0305-4","volume":"35","author":"MPM Hendriks","year":"2013","unstructured":"Hendriks, M. P. M., Lefeber, E., & Udding, J. T. (2013). Simultaneous berth allocation and yard planning at tactical level. OR Spectrum,35, 441\u2013456.","journal-title":"OR Spectrum"},{"key":"3070_CR17","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1016\/j.cie.2014.01.003","volume":"70","author":"QM Hu","year":"2014","unstructured":"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\u201310.","journal-title":"Computers and Industrial Engineering"},{"issue":"1","key":"3070_CR18","doi-asserted-by":"crossref","first-page":"75","DOI":"10.1002\/atr.5670310107","volume":"31","author":"A Imai","year":"1997","unstructured":"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\u201394.","journal-title":"Journal of Advanced Transportation."},{"key":"3070_CR19","doi-asserted-by":"crossref","first-page":"579","DOI":"10.1016\/j.ejor.2006.03.034","volume":"179","author":"A Imai","year":"2007","unstructured":"Imai, A., Nishimura, E., Hattori, M., & Papadimitriou, S. (2007). Berth allocation at indented berths for mega-containerships. European Journal of Operational Research,179, 579\u2013593.","journal-title":"European Journal of Operational Research"},{"key":"3070_CR20","doi-asserted-by":"crossref","first-page":"401","DOI":"10.1016\/S0191-2615(99)00057-0","volume":"35","author":"A Imai","year":"2001","unstructured":"Imai, A., Nishimura, E., & Papadimitriou, S. (2001). The dynamic berth allocation for a container port. Transportation Research Part B,35, 401\u2013417.","journal-title":"Transportation Research Part B"},{"key":"3070_CR21","doi-asserted-by":"crossref","first-page":"75","DOI":"10.1016\/j.tre.2015.06.008","volume":"81","author":"C Iris","year":"2015","unstructured":"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\u201397.","journal-title":"Transportation Research Part E: Logistics and Transportation Review"},{"key":"3070_CR22","doi-asserted-by":"crossref","first-page":"541","DOI":"10.1016\/S0191-2615(02)00027-9","volume":"37","author":"KH Kim","year":"2003","unstructured":"Kim, K. H., & Moon, K. C. (2003). Berth scheduling by simulated annealing. Transportation Research Part B,37, 541\u2013560.","journal-title":"Transportation Research Part B"},{"key":"3070_CR23","doi-asserted-by":"crossref","first-page":"1001","DOI":"10.1016\/j.ejor.2015.10.021","volume":"250","author":"E Lalla-Ruiz","year":"2016","unstructured":"Lalla-Ruiz, E., Exp\u00f3sito-Izquierdo, C., Meli\u00e1n-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\u20131012.","journal-title":"European Journal of Operational Research"},{"key":"3070_CR24","doi-asserted-by":"crossref","first-page":"60","DOI":"10.1016\/j.asoc.2014.04.035","volume":"22","author":"E Lalla-Ruiz","year":"2014","unstructured":"Lalla-Ruiz, E., Gonz\u00e1lez-Velarde, J. L., Meli\u00e1n-Batista, B., & Moreno-Vega, J. M. (2014). Biased random key genetic algorithm for the tactical berth allocation problem. Applied Soft Computing,22, 60\u201376.","journal-title":"Applied Soft Computing"},{"issue":"3","key":"3070_CR25","doi-asserted-by":"crossref","first-page":"339","DOI":"10.1109\/TEVC.2011.2161091","volume":"16","author":"AY Lam","year":"2012","unstructured":"Lam, A. Y., Li, V. O., & James, J. Q. (2012). Real-coded chemical reaction optimization. IEEE Transactions on Evolutionary Computation,16(3), 339\u2013353.","journal-title":"IEEE Transactions on Evolutionary Computation"},{"issue":"3","key":"3070_CR26","doi-asserted-by":"crossref","first-page":"477","DOI":"10.1007\/s00291-009-0186-3","volume":"32","author":"N Lang","year":"2010","unstructured":"Lang, N., & Veenstra, A. (2010). A quantitative analysis of container vessel arrival planning strategies. OR Spectrum,32(3), 477\u2013499.","journal-title":"OR Spectrum"},{"issue":"6","key":"3070_CR27","doi-asserted-by":"crossref","first-page":"1017","DOI":"10.1016\/j.tre.2010.01.009","volume":"46","author":"DH Lee","year":"2010","unstructured":"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\u20131029.","journal-title":"Transportation Research Part E: Logistics and Transportation Review"},{"key":"3070_CR28","doi-asserted-by":"crossref","first-page":"525","DOI":"10.1016\/j.asoc.2015.06.036","volume":"35","author":"Z Li","year":"2015","unstructured":"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\u2013540.","journal-title":"Applied Soft Computing"},{"issue":"9","key":"3070_CR29","doi-asserted-by":"crossref","first-page":"2896","DOI":"10.1016\/j.asoc.2012.04.012","volume":"12","author":"JQ Li","year":"2012","unstructured":"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\u20132912.","journal-title":"Applied Soft Computing"},{"key":"3070_CR30","doi-asserted-by":"crossref","first-page":"63","DOI":"10.1016\/j.asoc.2014.07.005","volume":"24","author":"JQ Li","year":"2014","unstructured":"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\u201377.","journal-title":"Applied Soft Computing"},{"key":"3070_CR31","doi-asserted-by":"crossref","first-page":"105","DOI":"10.1016\/S0167-6377(98)00010-8","volume":"22","author":"A Lim","year":"1998","unstructured":"Lim, A. (1998). The berth planning problem. Operations Research Letters,22, 105\u2013110.","journal-title":"Operations Research Letters"},{"key":"3070_CR32","doi-asserted-by":"crossref","first-page":"140","DOI":"10.1016\/j.cor.2016.01.002","volume":"70","author":"GR Mauri","year":"2016","unstructured":"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\u2013154.","journal-title":"Computers and Operations Research"},{"key":"3070_CR33","doi-asserted-by":"crossref","first-page":"495","DOI":"10.1007\/s00291-006-0036-5","volume":"28","author":"R Moorthy","year":"2006","unstructured":"Moorthy, R., & Teo, C. P. (2006). Berth management in container terminal: The template design problem. OR Spectrum,28, 495\u2013518.","journal-title":"OR Spectrum"},{"issue":"2","key":"3070_CR34","doi-asserted-by":"crossref","first-page":"282","DOI":"10.1016\/S0377-2217(00)00128-4","volume":"131","author":"E Nishimura","year":"2001","unstructured":"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\u2013292.","journal-title":"European Journal of Operational Research"},{"key":"3070_CR35","doi-asserted-by":"publisher","unstructured":"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\u20131178). \nhttps:\/\/doi.org\/10.1109\/ieem.2015.7385833\n\n.","DOI":"10.1109\/ieem.2015.7385833"},{"issue":"3","key":"3070_CR36","doi-asserted-by":"crossref","first-page":"875","DOI":"10.1016\/j.ifacol.2015.06.193","volume":"48","author":"S Pratap","year":"2015","unstructured":"Pratap, S., Nayak, A., Cheikhrouhou, N., & Tiwari, M. K. (2015b). Decision support system for discrete robust berth allocation. IFAC-PapersOnLine,48(3), 875\u2013880.","journal-title":"IFAC-PapersOnLine"},{"key":"3070_CR37","doi-asserted-by":"crossref","first-page":"8","DOI":"10.1016\/j.cie.2016.03.005","volume":"96","author":"GM Ribeiro","year":"2016","unstructured":"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\u201315.","journal-title":"Computers and Industrial Engineering"},{"key":"3070_CR38","doi-asserted-by":"crossref","first-page":"109","DOI":"10.1016\/j.asoc.2014.07.013","volume":"24","author":"PK Roy","year":"2014","unstructured":"Roy, P. K., Bhui, S., & Paul, C. (2014). Solution of economic load dispatch using hybrid chemical reaction optimization approach. Applied Soft Computing,24, 109\u2013125.","journal-title":"Applied Soft Computing"},{"key":"3070_CR39","doi-asserted-by":"crossref","first-page":"34","DOI":"10.1016\/j.tre.2015.08.005","volume":"83","author":"Y Tao","year":"2015","unstructured":"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\u201350.","journal-title":"Transportation Research Part E: Logistics and Transportation Review"},{"issue":"4","key":"3070_CR40","doi-asserted-by":"crossref","first-page":"1543","DOI":"10.1016\/j.eswa.2013.08.051","volume":"41","author":"CJ Ting","year":"2014","unstructured":"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\u20131550.","journal-title":"Expert Systems with Applications"},{"key":"3070_CR41","doi-asserted-by":"crossref","first-page":"359","DOI":"10.1007\/3-540-46674-6_30","volume":"1742","author":"CJ Tong","year":"1999","unstructured":"Tong, C. J., Lau, H. C., & Lim, A. (1999). Ant colony optimization for the ship berthing problem. Lecture Notes in Computer Science,1742, 359\u2013370.","journal-title":"Lecture Notes in Computer Science"},{"issue":"4","key":"3070_CR42","doi-asserted-by":"crossref","first-page":"1774","DOI":"10.1016\/j.asoc.2012.11.048","volume":"13","author":"TK Truong","year":"2013","unstructured":"Truong, T. K., Li, K., & Xu, Y. (2013). Chemical reaction optimization with greedy strategy for the 0\u20131 knapsack problem. Applied Soft Computing,13(4), 1774\u20131780.","journal-title":"Applied Soft Computing"},{"key":"3070_CR43","doi-asserted-by":"crossref","first-page":"14","DOI":"10.1016\/j.tre.2013.03.003","volume":"54","author":"N Umang","year":"2013","unstructured":"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\u201331.","journal-title":"Transportation Research Part E: Logistics and Transportation Review"},{"key":"3070_CR44","unstructured":"UNCTAD and WTO. (2015). Review of maritime transport, 2015."},{"key":"3070_CR45","doi-asserted-by":"publisher","DOI":"10.1016\/j.tre.2016.10.011","author":"L Wu","year":"2017","unstructured":"Wu, L., & Ma, W. (2017). Quay crane scheduling with draft and trim constraints. Transportation Research Part: Logistics and Transportation Review. \nhttps:\/\/doi.org\/10.1016\/j.tre.2016.10.011\n\n.","journal-title":"Transportation Research Part: Logistics and Transportation Review"},{"issue":"3","key":"3070_CR46","doi-asserted-by":"crossref","first-page":"928","DOI":"10.1016\/j.ejor.2015.05.079","volume":"247","author":"L Zhen","year":"2015","unstructured":"Zhen, L. (2015). Tactical berth allocation under uncertainty. European Journal of Operational Research,247(3), 928\u2013944.","journal-title":"European Journal of Operational Research"}],"container-title":["Annals of Operations Research"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10479-018-3070-1.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10479-018-3070-1\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10479-018-3070-1.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,6,25]],"date-time":"2020-06-25T14:57:35Z","timestamp":1593097055000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10479-018-3070-1"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2018,10,1]]},"references-count":46,"journal-issue":{"issue":"1-2","published-print":{"date-parts":[[2020,7]]}},"alternative-id":["3070"],"URL":"https:\/\/doi.org\/10.1007\/s10479-018-3070-1","relation":{},"ISSN":["0254-5330","1572-9338"],"issn-type":[{"value":"0254-5330","type":"print"},{"value":"1572-9338","type":"electronic"}],"subject":[],"published":{"date-parts":[[2018,10,1]]},"assertion":[{"value":"1 October 2018","order":1,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}