{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,7]],"date-time":"2026-03-07T12:21:31Z","timestamp":1772886091966,"version":"3.50.1"},"reference-count":24,"publisher":"EDP Sciences","issue":"3","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["RAIRO-Oper. Res."],"published-print":{"date-parts":[[2015,7]]},"DOI":"10.1051\/ro\/2014039","type":"journal-article","created":{"date-parts":[[2015,1,7]],"date-time":"2015-01-07T13:55:50Z","timestamp":1420638950000},"page":"473-494","source":"Crossref","is-referenced-by-count":19,"title":["The Dynamic Berth Allocation Problem: A linearized formulation"],"prefix":"10.1051","volume":"49","author":[{"given":"Ahmed","family":"Simrin","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Ali","family":"Diabat","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"250","published-online":{"date-parts":[[2015,2,6]]},"reference":[{"key":"R1","doi-asserted-by":"crossref","unstructured":"N. Al-Dhaheri and A. Diabat, The quay crane scheduling problem.J. Manuf. Syst., in press, 2015.","DOI":"10.1016\/j.jmsy.2015.02.010"},{"key":"R2","doi-asserted-by":"crossref","unstructured":"Bierwirth C. and Meisel F., A survey of berth allocation and quay crane scheduling problems in container terminals.Eur. J. Oper. Res.202(2010) 615\u2013627.","DOI":"10.1016\/j.ejor.2009.05.031"},{"key":"R3","unstructured":"Cordeau J.-F., Laporte G., Legato P. and Moccia L., Models and tabu search heuristics for the berth-allocation problem.Transp. Sci.39(2005) 526\u2013538."},{"key":"R4","unstructured":"Diabat A., Fu Y.-M., A Lagrangian relaxation approach for solving the integrated quay crane assignment and scheduling problem.Appl. Math. Modell.32(2015) 1194\u20131201."},{"key":"R5","unstructured":"Diabat A., Theodorou E., An integrated quay crane assignment and scheduling problem.Comput. Ind. Eng.73(2014) 115\u2013123."},{"key":"R6","unstructured":"Fu Y.-M., Diabat A., Tsai I.-T., A multi-vessel quay crane assignment and scheduling problem: Formulation and heuristic solution approach.Exp. Syst. Appl.41(2014) 6959\u20136965."},{"key":"R7","doi-asserted-by":"crossref","unstructured":"M. Han, P. Li and J. Sun. The algorithm for berth scheduling problem by the hybrid optimization strategy GASA, inProc. of the ninth international conference on Control, automation, robotics and vision (ICARCV\u201906). IEEE Comput. Soc., Washington DC (2006) 1\u20134.","DOI":"10.1109\/ICARCV.2006.345455"},{"key":"R8","first-page":"1","volume":"30","author":"Hansen","year":"2003","journal-title":"Les Cahiers du GERAD"},{"key":"R9","doi-asserted-by":"crossref","unstructured":"Hansen P. and Oguz C., Mladenovic N., Variable neighborhood search for minimum cost berth allocation.Eur. J. Operat. Res.191(2008) 636\u2013649.","DOI":"10.1016\/j.ejor.2006.12.057"},{"key":"R10","doi-asserted-by":"crossref","unstructured":"Imai A., Chen H.C., Nishimura E. and Papadimitriou S., The simultaneous berth and quay crane allocation problem.Transp. Res. Part E44(2008) 900\u2013920.","DOI":"10.1016\/j.tre.2007.03.003"},{"key":"R11","doi-asserted-by":"crossref","unstructured":"Imai A., Nagaiwa K. and Tat C.W., Efficient planning of berth allocation for container terminals in Asia.J. Adv. Transp.31(1997) 75\u201394.","DOI":"10.1002\/atr.5670310107"},{"key":"R12","doi-asserted-by":"crossref","unstructured":"Imai A., Nishimura E. and Papadimitriou S., The dynamic berth allocation problem for a container port.Transp. Res. Part B35(2001) 401\u2013417.","DOI":"10.1016\/S0191-2615(99)00057-0"},{"key":"R13","doi-asserted-by":"crossref","unstructured":"Imai A., Nishimura E. and Papadimitriou S., Berth allocation with service priority.Transp. Res. Part B37(2003) 437\u2013457.","DOI":"10.1016\/S0191-2615(02)00023-1"},{"key":"R14","doi-asserted-by":"crossref","unstructured":"Imai A., Nishimura E. and Papadimitriou S., Berthing ships at a multi-user container terminal with a limited quay capacity.Transp. Res. Part E44(2008) 136\u2013151.","DOI":"10.1016\/j.tre.2006.05.002"},{"key":"R15","doi-asserted-by":"crossref","unstructured":"Imai A., Zhang J.-T., Nishimura E. and Papadimitriou S., The berth allocation problem with service time and delay time objectives.Marit. Econ. Logist.9(2007b) 269\u2013290.","DOI":"10.1057\/palgrave.mel.9100186"},{"key":"R16","unstructured":"D.-H. Lee, L. Song and H. Wang, Bilevel programming model and solutions of berth allocation and quay crane scheduling, inProc. of 85th annual meeting of Transportation research board(CD-ROM), Washington DC (2006)."},{"key":"R17","doi-asserted-by":"crossref","unstructured":"G.R. Mauri, A.C.M. Oliveira and L.A.N. Lorena, A hybrid column generation approach for the berth allocation problem, in Eighth European conference on Evolutionary computation in combinatorial optimisation EvoCOP, edited by J. van Hemert, C. Cotta.Lect. Note Comput. Sci.,4972, Springer, Berlin (2008) 110\u2013122.","DOI":"10.1007\/978-3-540-78604-7_10"},{"key":"R18","unstructured":"Monaco M.F. and Sammarra M., The berth allocation problem: a strong formulation solved by a Lagrangean approach.Transp. Sci.41(2007) 265\u2013280."},{"key":"R19","doi-asserted-by":"crossref","unstructured":"S. Theofanis, M. Boile and M. Golias, An optimization based genetic algorithm heuristic for the berth allocation problem, in Proc. of IEEE congress on Evolutionary computation (CEC 2007).IEEE Computer Society, Washington DC (2007) 4439\u20134445.","DOI":"10.1109\/CEC.2007.4425052"},{"key":"R20","doi-asserted-by":"crossref","unstructured":"Liang C., Huang Y. and Yang Y., A quay crane dynamic scheduling problem by hybrid evolutionary algorithm for berth allocation planning,Comput. Ind. Engrg.56(2008) 1021\u22121028.","DOI":"10.1016\/j.cie.2008.09.024"},{"key":"R21","unstructured":"G. Giallombardo, L. Moccia, M. Salani and I. Vacca, The tactical berth allocation problem with quay crane assignment and transshipment-related quadratic yard costs, inProc. of the European Transport Conference(ETC) (2008) 1\u201327."},{"key":"R22","unstructured":"A. Popov, Genetic algorithms for optimization, User Manual (2005)."},{"key":"R23","doi-asserted-by":"crossref","unstructured":"E. Theodorou, A. Diabat, A joint quay crane assignment and scheduling problem: formulation, solution algorithm and computational results.Optim. Lett., in press, 2014.","DOI":"10.1007\/s11590-014-0787-x"},{"key":"R24","doi-asserted-by":"crossref","unstructured":"P. Zhou, H. Kang and L. Lin, A dynamic berth allocation model based on stochastic consideration, inProc. of the Sixth World Congress on Intelligent Control and Automation WCICA, IEEE Comput. Soc. Vol. 2, Washington DC (2006) 7297\u20137301.","DOI":"10.1109\/WCICA.2006.1714503"}],"container-title":["RAIRO - Operations Research"],"original-title":[],"link":[{"URL":"http:\/\/www.rairo-ro.org\/10.1051\/ro\/2014039\/pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,5,16]],"date-time":"2025-05-16T11:36:02Z","timestamp":1747395362000},"score":1,"resource":{"primary":{"URL":"http:\/\/www.rairo-ro.org\/10.1051\/ro\/2014039"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2015,2,6]]},"references-count":24,"journal-issue":{"issue":"3"},"alternative-id":["ro140039"],"URL":"https:\/\/doi.org\/10.1051\/ro\/2014039","relation":{},"ISSN":["0399-0559","1290-3868"],"issn-type":[{"value":"0399-0559","type":"print"},{"value":"1290-3868","type":"electronic"}],"subject":[],"published":{"date-parts":[[2015,2,6]]}}}