{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,17]],"date-time":"2025-10-17T13:43:30Z","timestamp":1760708610155},"publisher-location":"Berlin, Heidelberg","reference-count":23,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642406263"},{"type":"electronic","value":"9783642406270"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2013]]},"DOI":"10.1007\/978-3-642-40627-0_64","type":"book-chapter","created":{"date-parts":[[2013,9,7]],"date-time":"2013-09-07T07:11:01Z","timestamp":1378537861000},"page":"880-896","source":"Crossref","is-referenced-by-count":22,"title":["The Berth Allocation and Quay Crane Assignment Problem Using a CP Approach"],"prefix":"10.1007","author":[{"given":"St\u00e9phane","family":"Zampelli","sequence":"first","affiliation":[]},{"given":"Yannis","family":"Vergados","sequence":"additional","affiliation":[]},{"given":"Rowan","family":"Van Schaeren","sequence":"additional","affiliation":[]},{"given":"Wout","family":"Dullaert","sequence":"additional","affiliation":[]},{"given":"Birger","family":"Raa","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"unstructured":"Drewry Shipping Consultants Annual Container Market Review and Forecast 2007\/08.A London, 250 p. (2007)","key":"64_CR1"},{"unstructured":"Drewry Shipping Consultants Container Forecaster 1Q08 London, 218 p. (2008)","key":"64_CR2"},{"doi-asserted-by":"crossref","unstructured":"Grossmann, H., Otto, A., Stiller, S., Wedemeier, J.: Growth Potential for Maritime Trade and Ports in Europe. Intereconomics, 226\u2013232 (2007)","key":"64_CR3","DOI":"10.1007\/s10272-007-0223-x"},{"key":"64_CR4","doi-asserted-by":"publisher","first-page":"615","DOI":"10.1016\/j.ejor.2009.05.031","volume":"202","author":"C. Bierwirth","year":"2010","unstructured":"Bierwirth, C., Meisel, F.: A survey of berth allocation and quay crane scheduling problems in container terminals. European Journal of Operational Research\u00a0202, 615\u2013627 (2010)","journal-title":"European Journal of Operational Research"},{"key":"64_CR5","doi-asserted-by":"publisher","first-page":"495","DOI":"10.1007\/s00291-006-0036-5","volume":"28","author":"R. Moorthy","year":"2006","unstructured":"Moorthy, R., Teo, C.-P.: Berth management in container terminal: the template design problem. OR Spectrum\u00a028, 495\u2013518 (2006)","journal-title":"OR Spectrum"},{"issue":"11","key":"64_CR6","first-page":"14136","volume":"38","author":"B. Raa","year":"2011","unstructured":"Raa, B., Dullaert, W., Van Schaeren, R.: An enriched model for the integrated berth allocation and quay crane assignment problem. Expert Systems with Applications\u00a038(11), 14136\u201314147 (2011)","journal-title":"Expert Systems with Applications"},{"key":"64_CR7","doi-asserted-by":"publisher","first-page":"40","DOI":"10.1016\/j.cie.2009.08.002","volume":"58","author":"C. Zhang","year":"2010","unstructured":"Zhang, C., Zheng, L., Zhang, Z., Shi, L., Armstrong, A.J.: The allocation of berths and quay cranes by using a sub-gradient optimization technique. Computers and Industrial Engineering\u00a058, 40\u201350 (2010)","journal-title":"Computers and Industrial Engineering"},{"key":"64_CR8","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"6","DOI":"10.1007\/978-3-540-68155-7_4","volume-title":"Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems","author":"T. Achterberg","year":"2008","unstructured":"Achterberg, T., Berthold, T., Koch, T., Wolter, K.: Constraint Integer Programming: A New Approach to Integrate CP and MIP. In: Trick, M.A. (ed.) CPAIOR 2008. LNCS, vol.\u00a05015, pp. 6\u201320. Springer, Heidelberg (2008)"},{"key":"64_CR9","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"417","DOI":"10.1007\/3-540-49481-2_30","volume-title":"Principles and Practice of Constraint Programming - CP98","author":"P. Shaw","year":"1998","unstructured":"Shaw, P.: Using constraint programming and local search methods to solve vehicle routing problems. In: Maher, M.J., Puget, J.-F. (eds.) CP 1998. LNCS, vol.\u00a01520, pp. 417\u2013431. Springer, Heidelberg (1998)"},{"key":"64_CR10","doi-asserted-by":"publisher","first-page":"159","DOI":"10.1016\/0191-2615(89)90001-5","volume":"23","author":"C.F. Daganzo","year":"1998","unstructured":"Daganzo, C.F.: The crane scheduling problem. Transportation Research Part B\u00a023, 159\u2013175 (1998)","journal-title":"Transportation Research Part B"},{"key":"64_CR11","doi-asserted-by":"publisher","first-page":"159","DOI":"10.1016\/0191-2615(90)90014-P","volume":"24","author":"R.I. Peterkofsky","year":"1990","unstructured":"Peterkofsky, R.I., Daganzo, C.F.: A branch and bound solution method for the crane scheduling problem. Transportation Research Part B\u00a024, 159\u2013172 (1990)","journal-title":"Transportation Research Part B"},{"key":"64_CR12","doi-asserted-by":"publisher","first-page":"60","DOI":"10.1002\/nav.20108","volume":"53","author":"J. Liu","year":"2006","unstructured":"Liu, J., Wan, Y.-W., Wang, L.: Quay Crane Scheduling at Container Terminals To Minimize the Maximum Relative Tardiness of Vessel Departures. Naval Research Logistics\u00a053, 60\u201374 (2006)","journal-title":"Naval Research Logistics"},{"key":"64_CR13","doi-asserted-by":"publisher","first-page":"243","DOI":"10.1016\/j.cie.2012.03.004","volume":"63","author":"C. Yang","year":"2012","unstructured":"Yang, C., Wang, X., Li, Z.: An optimization approach for coupling problem of berth allocation and quay crane assignment in container terminal. Computers & Industrial Engineering\u00a063, 243\u2013253 (2012)","journal-title":"Computers & Industrial Engineering"},{"key":"64_CR14","doi-asserted-by":"publisher","first-page":"119","DOI":"10.1016\/j.cie.2011.08.024","volume":"62","author":"L. Song","year":"2012","unstructured":"Song, L., Cherrett, T., Guan, W.: Study on berth planning problem in a container seaport: Using an integrated programming approach. Computers & Industrial Engineering\u00a062, 119\u2013128 (2012)","journal-title":"Computers & Industrial Engineering"},{"key":"64_CR15","doi-asserted-by":"publisher","first-page":"1327","DOI":"10.1016\/j.ejor.2010.07.018","volume":"207","author":"X. Han","year":"2010","unstructured":"Han, X., Lu, Z., Xi, L.: A proactive approach for simultaneous berth and quay crane scheduling problem with stochastic arrival and handling time. European Journal of Operational Research\u00a0207, 1327\u20131340 (2010)","journal-title":"European Journal of Operational Research"},{"key":"64_CR16","doi-asserted-by":"publisher","first-page":"975","DOI":"10.1016\/j.tre.2010.05.008","volume":"46","author":"D. Chang","year":"2010","unstructured":"Chang, D., Jiang, Z., Yan, W., He, J.: Integrating berth allocation and quay crane assignments. Transportation Research Part E\u00a046, 975\u2013990 (2010)","journal-title":"Transportation Research Part E"},{"key":"64_CR17","doi-asserted-by":"publisher","first-page":"196","DOI":"10.1016\/j.tre.2008.03.001","volume":"45","author":"F. Meisel","year":"2009","unstructured":"Meisel, F., Bierwirth, C.: Heuristics for the integration of crane productivity in the berth allocation problem. Transportation Research Part E\u00a045, 196\u2013209 (2009)","journal-title":"Transportation Research Part E"},{"key":"64_CR18","doi-asserted-by":"publisher","first-page":"1021","DOI":"10.1016\/j.cie.2008.09.024","volume":"56","author":"C. Liang","year":"2009","unstructured":"Liang, C., Huang, Y., Yang, Y.: A quay crane dynamic scheduling problem by hybrid evolutionary algorithm for berth allocation planning. Computers & Industrial Engineering\u00a056, 1021\u20131028 (2009)","journal-title":"Computers & Industrial Engineering"},{"key":"64_CR19","doi-asserted-by":"publisher","first-page":"900","DOI":"10.1016\/j.tre.2007.03.003","volume":"44","author":"A. Imai","year":"2008","unstructured":"Imai, A., Chen, H., Nishimura, E., Papadimitriou, S.: The simultaneous berth and quay crane allocation problem. Transportation Research Part E\u00a044, 900\u2013920 (2008)","journal-title":"Transportation Research Part E"},{"key":"64_CR20","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/s00291-002-0109-z","volume":"25","author":"Y. Park","year":"2003","unstructured":"Park, Y., Kim, K.: A scheduling method for Berth and Quay cranes. OR Spectrum\u00a025, 1\u201323 (2003)","journal-title":"OR Spectrum"},{"key":"64_CR21","doi-asserted-by":"publisher","first-page":"883","DOI":"10.1016\/S0191-2615(02)00089-9","volume":"37","author":"C.Q. Zhang","year":"2003","unstructured":"Zhang, C.Q., Liu, J.Y., Wan, Y.W., Murty, K.G.: Storage space allocation in container terminals. Transportation Research Part B\u00a037, 883\u2013903 (2003)","journal-title":"Transportation Research Part B"},{"key":"64_CR22","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"240","DOI":"10.1007\/978-3-642-23786-7_20","volume-title":"Principles and Practice of Constraint Programming \u2013 CP 2011","author":"A. Clercq De","year":"2011","unstructured":"De Clercq, A., Petit, T., Beldiceanu, N., Jussien, N.: Filtering Algorithms for Discrete Cumulative Problems with Overloads of Resource. In: Lee, J. (ed.) CP 2011. LNCS, vol.\u00a06876, pp. 240\u2013255. Springer, Heidelberg (2011)"},{"unstructured":"Zampelli, S., Vergados, Y., Van Schaeren, R., Dulleart, W., Birger, R.: The berth allocation and quay crane assignment problem using a CP approach Technical Report at Universiteit Antwerpen (2013), \n                    \n                      http:\/\/www.ua.ac.be\/main.aspx?c=wout.dullaert&n=9300&ct=005748","key":"64_CR23"}],"container-title":["Lecture Notes in Computer Science","Principles and Practice of Constraint Programming"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-40627-0_64","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,17]],"date-time":"2019-05-17T02:02:09Z","timestamp":1558058529000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-40627-0_64"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2013]]},"ISBN":["9783642406263","9783642406270"],"references-count":23,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-40627-0_64","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2013]]}}}