<?xml version="1.0" encoding="ISO-8859-1"?><article xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink" xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance">
<front>
<journal-meta>
<journal-id>1405-7743</journal-id>
<journal-title><![CDATA[Ingeniería, investigación y tecnología]]></journal-title>
<abbrev-journal-title><![CDATA[Ing. invest. y tecnol.]]></abbrev-journal-title>
<issn>1405-7743</issn>
<publisher>
<publisher-name><![CDATA[Universidad Nacional Autónoma de México, Facultad de Ingeniería]]></publisher-name>
</publisher>
</journal-meta>
<article-meta>
<article-id>S1405-77432017000200169</article-id>
<title-group>
<article-title xml:lang="es"><![CDATA[Un análisis de los factores que afectan la productividad de los sitios de atraque en una terminal de contenedores]]></article-title>
<article-title xml:lang="en"><![CDATA[An Analysis of the Factors Affecting the Productivity of Berths at Container Terminals]]></article-title>
</title-group>
<contrib-group>
<contrib contrib-type="author">
<name>
<surname><![CDATA[Mar-Ortiz]]></surname>
<given-names><![CDATA[Julio]]></given-names>
</name>
<xref ref-type="aff" rid="Aff"/>
</contrib>
<contrib contrib-type="author">
<name>
<surname><![CDATA[Gracia D.]]></surname>
<given-names><![CDATA[María]]></given-names>
</name>
<xref ref-type="aff" rid="Aff"/>
</contrib>
</contrib-group>
<aff id="Af1">
<institution><![CDATA[,Universidad Autónoma de Tamaulipas Facultad de Ingeniería ]]></institution>
<addr-line><![CDATA[ ]]></addr-line>
<country>Mexico</country>
</aff>
<aff id="Af2">
<institution><![CDATA[,Universidad Autónoma de Tamaulipas Facultad de Ingeniería ]]></institution>
<addr-line><![CDATA[ ]]></addr-line>
<country>Mexico</country>
</aff>
<pub-date pub-type="pub">
<day>00</day>
<month>06</month>
<year>2017</year>
</pub-date>
<pub-date pub-type="epub">
<day>00</day>
<month>06</month>
<year>2017</year>
</pub-date>
<volume>18</volume>
<numero>2</numero>
<fpage>169</fpage>
<lpage>181</lpage>
<copyright-statement/>
<copyright-year/>
<self-uri xlink:href="http://www.scielo.org.mx/scielo.php?script=sci_arttext&amp;pid=S1405-77432017000200169&amp;lng=en&amp;nrm=iso"></self-uri><self-uri xlink:href="http://www.scielo.org.mx/scielo.php?script=sci_abstract&amp;pid=S1405-77432017000200169&amp;lng=en&amp;nrm=iso"></self-uri><self-uri xlink:href="http://www.scielo.org.mx/scielo.php?script=sci_pdf&amp;pid=S1405-77432017000200169&amp;lng=en&amp;nrm=iso"></self-uri><abstract abstract-type="short" xml:lang="es"><p><![CDATA[Resumen Este artículo estudia uno de los problemas de optimización portuaria de mayor relevancia en el contexto de una terminal de contenedores: el problema de asignación de sitios de atraque. Este problema consiste en asignar los buques que llegan a una terminal de contenedores a los sitios de atraque, de manera tal que se optimice cierta función de costo. Específicamente, se describe el desarrollo de un análisis computacional del problema dinámico de asignación de sitios atraque que busca identificar el conjunto de factores operacionales y estratégicos que influyen tanto en la productividad de los sitios de atraque como en la complejidad del problema de decisión asociado. La principal motivación para desarrollar este estudio surge del supuesto de que cuando el operador de una terminal conoce cómo ciertos factores afectan un indicador de rendimiento determinado, y entiende donde radica la complejidad del problema de decisión que enfrenta, es capaz de formular mejores estrategias de operación para maximizar la competitividad de una terminal. Se propone un estudio de diseño factorial completo con el fin de apreciar la significancia de factores tales como la demanda de buques y la configuración de los arribos sobre las variables de respuesta. A partir de los resultados del análisis estadístico, el artículo concluye con la discusión de algunas implicaciones prácticas para la formulación de estrategias de operación.]]></p></abstract>
<abstract abstract-type="short" xml:lang="en"><p><![CDATA[Abstract This paper addresses one of the main port optimization problems in the context of a container terminal: the berth allocation problem. This problem consist on assigning the arriving vessels to the berths of the terminal aiming to optimize a given cost function. Specifically, this paper describes the development of a computational study for the dynamic berth allocation problem, aiming to identify the set of operational and strategic factors that influence not only the productivity of berths, but also the computational complexity of the associated decision problem. The main motivation to develop this study arises from the assumption that when the operator of a terminal knows how certain factors affect a given performance indicator, and understand where lies the complexity of the decision problem it faces, it is able to formulate better operational strategies to maximize the competitiveness of a terminal. A full factorial design study is proposed in order to appraise the significance of factors such as demand of ships and the configuration of the arrivals on the response variables. From the statistical analysis results, this article concludes with a discussion of some practical implications for the formulation of operational strategies.]]></p></abstract>
<kwd-group>
<kwd lng="es"><![CDATA[problema de asignación de sitios atraque]]></kwd>
<kwd lng="es"><![CDATA[logística portuaria]]></kwd>
<kwd lng="es"><![CDATA[optimización en terminales de contenedores]]></kwd>
<kwd lng="es"><![CDATA[cadenas de suministro]]></kwd>
<kwd lng="es"><![CDATA[análisis estadístico]]></kwd>
<kwd lng="en"><![CDATA[berth allocation problem]]></kwd>
<kwd lng="en"><![CDATA[port logistics]]></kwd>
<kwd lng="en"><![CDATA[container terminals optimization]]></kwd>
<kwd lng="en"><![CDATA[supply chain]]></kwd>
<kwd lng="en"><![CDATA[statistical analysis]]></kwd>
</kwd-group>
</article-meta>
</front><back>
<ref-list>
<ref id="B1">
<nlm-citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Bierwirth]]></surname>
<given-names><![CDATA[C.]]></given-names>
</name>
<name>
<surname><![CDATA[Meisel]]></surname>
<given-names><![CDATA[F.]]></given-names>
</name>
</person-group>
<article-title xml:lang=""><![CDATA[A follow-up survey of berth allocation and quay crane scheduling problems in container terminals]]></article-title>
<source><![CDATA[European Journal of Operational Research]]></source>
<year>2015</year>
<volume>244</volume>
<numero>3</numero>
<issue>3</issue>
<page-range>675-89</page-range></nlm-citation>
</ref>
<ref id="B2">
<nlm-citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Bierwirth]]></surname>
<given-names><![CDATA[C.]]></given-names>
</name>
<name>
<surname><![CDATA[Meisel]]></surname>
<given-names><![CDATA[F.]]></given-names>
</name>
</person-group>
<article-title xml:lang=""><![CDATA[A survey of berth allocation and quay crane scheduling problems in container terminals]]></article-title>
<source><![CDATA[European Journal of Operational Research]]></source>
<year>2010</year>
<volume>202</volume>
<numero>3</numero>
<issue>3</issue>
<page-range>615-27</page-range></nlm-citation>
</ref>
<ref id="B3">
<nlm-citation citation-type="book">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Böse]]></surname>
<given-names><![CDATA[J.W.]]></given-names>
</name>
</person-group>
<source><![CDATA[Handbook of terminal planning]]></source>
<year>2011</year>
<edition>1a</edition>
<publisher-loc><![CDATA[Berlin ]]></publisher-loc>
<publisher-name><![CDATA[Springer-Verlag]]></publisher-name>
</nlm-citation>
</ref>
<ref id="B4">
<nlm-citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Carlo]]></surname>
<given-names><![CDATA[H.J.]]></given-names>
</name>
<name>
<surname><![CDATA[Vis]]></surname>
<given-names><![CDATA[I.F.]]></given-names>
</name>
<name>
<surname><![CDATA[Roodbergen]]></surname>
<given-names><![CDATA[K.J.]]></given-names>
</name>
</person-group>
<article-title xml:lang=""><![CDATA[Seaside operations in container terminals: Literature overview, trends, and research directions]]></article-title>
<source><![CDATA[Flexible Services and Manufacturing Journal]]></source>
<year>2015</year>
<volume>27</volume>
<numero>2-3</numero>
<issue>2-3</issue>
<page-range>224-62</page-range></nlm-citation>
</ref>
<ref id="B5">
<nlm-citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Carlo]]></surname>
<given-names><![CDATA[H.J.]]></given-names>
</name>
<name>
<surname><![CDATA[Vis]]></surname>
<given-names><![CDATA[I.F.]]></given-names>
</name>
<name>
<surname><![CDATA[Roodbergen]]></surname>
<given-names><![CDATA[K.J.]]></given-names>
</name>
</person-group>
<article-title xml:lang=""><![CDATA[Storage yard operations in container terminals: Literature overview, trends, and research directions]]></article-title>
<source><![CDATA[European Journal of Operational Research]]></source>
<year>2014</year>
<volume>235</volume>
<numero>2</numero>
<issue>2</issue>
<page-range>412-30</page-range></nlm-citation>
</ref>
<ref id="B6">
<nlm-citation citation-type="">
<collab>Comisión Económica para América Latina y el Caribe (CEPAL)</collab>
<source><![CDATA[]]></source>
<year>2015</year>
</nlm-citation>
</ref>
<ref id="B7">
<nlm-citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Cordeau]]></surname>
<given-names><![CDATA[J.F.]]></given-names>
</name>
</person-group>
<article-title xml:lang=""><![CDATA[Models and tabu search heuristics for the berth-allocation problem]]></article-title>
<source><![CDATA[Transportation Science]]></source>
<year>2005</year>
<volume>39</volume>
<numero>4</numero>
<issue>4</issue>
<page-range>526-38</page-range></nlm-citation>
</ref>
<ref id="B8">
<nlm-citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Derpich]]></surname>
<given-names><![CDATA[I.]]></given-names>
</name>
<name>
<surname><![CDATA[Vera]]></surname>
<given-names><![CDATA[R.]]></given-names>
</name>
</person-group>
<article-title xml:lang=""><![CDATA[Improving the efficiency of the Branch and Bound algorithm for integer programming based on flatness information]]></article-title>
<source><![CDATA[European Journal of Operational Research]]></source>
<year>2006</year>
<volume>174</volume>
<numero>1</numero>
<issue>1</issue>
<page-range>92-101</page-range></nlm-citation>
</ref>
<ref id="B9">
<nlm-citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Du]]></surname>
<given-names><![CDATA[Y.]]></given-names>
</name>
</person-group>
<article-title xml:lang=""><![CDATA[Modeling the impacts of tides and the virtual arrival policy in berth allocation]]></article-title>
<source><![CDATA[Transportation Science]]></source>
<year>2015</year>
<volume>49</volume>
<numero>4</numero>
<issue>4</issue>
<page-range>939-56</page-range></nlm-citation>
</ref>
<ref id="B10">
<nlm-citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Frojan]]></surname>
<given-names><![CDATA[P.]]></given-names>
</name>
</person-group>
<article-title xml:lang=""><![CDATA[The continuous Berth Allocation Problem in a container terminal with multiple quays]]></article-title>
<source><![CDATA[Expert Systems with Applications]]></source>
<year>2015</year>
<volume>42</volume>
<numero>21</numero>
<issue>21</issue>
<page-range>7356-66</page-range></nlm-citation>
</ref>
<ref id="B11">
<nlm-citation citation-type="book">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Garey]]></surname>
<given-names><![CDATA[M.R.]]></given-names>
</name>
<name>
<surname><![CDATA[Johnson]]></surname>
<given-names><![CDATA[D.S.]]></given-names>
</name>
</person-group>
<source><![CDATA[Computers and intractability: a guide to the theory of NP-completeness]]></source>
<year>1979</year>
<edition>1a</edition>
<publisher-loc><![CDATA[San Francisco, L.A ]]></publisher-loc>
<publisher-name><![CDATA[Freeman]]></publisher-name>
</nlm-citation>
</ref>
<ref id="B12">
<nlm-citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Giallombardo]]></surname>
<given-names><![CDATA[G.]]></given-names>
</name>
<name>
<surname><![CDATA[Moccia]]></surname>
<given-names><![CDATA[L.]]></given-names>
</name>
<name>
<surname><![CDATA[Salani]]></surname>
<given-names><![CDATA[M.]]></given-names>
</name>
<name>
<surname><![CDATA[Vacca]]></surname>
<given-names><![CDATA[I.]]></given-names>
</name>
</person-group>
<article-title xml:lang=""><![CDATA[Modeling and solving the tactical berth allocation problem]]></article-title>
<source><![CDATA[Transportation Research Part B: Methodological]]></source>
<year>2010</year>
<volume>44</volume>
<numero>2</numero>
<issue>2</issue>
<page-range>232-45</page-range></nlm-citation>
</ref>
<ref id="B13">
<nlm-citation citation-type="book">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Günther]]></surname>
<given-names><![CDATA[H.O.]]></given-names>
</name>
<name>
<surname><![CDATA[Kim]]></surname>
<given-names><![CDATA[K.H]]></given-names>
</name>
</person-group>
<source><![CDATA[Container terminals and automated transport systems: logistics control issues and quantitative decision support]]></source>
<year>2005</year>
<edition>1a</edition>
<publisher-loc><![CDATA[Heidelberg ]]></publisher-loc>
<publisher-name><![CDATA[Springer-Verlag]]></publisher-name>
</nlm-citation>
</ref>
<ref id="B14">
<nlm-citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Hansen]]></surname>
<given-names><![CDATA[P.]]></given-names>
</name>
<name>
<surname><![CDATA[Oguz]]></surname>
<given-names><![CDATA[C.]]></given-names>
</name>
<name>
<surname><![CDATA[Mladenovic]]></surname>
<given-names><![CDATA[N.]]></given-names>
</name>
</person-group>
<article-title xml:lang=""><![CDATA[Variable neighborhood search for minimum cost berth allocation]]></article-title>
<source><![CDATA[European Journal of Operational Research]]></source>
<year>2008</year>
<volume>191</volume>
<numero>3</numero>
<issue>3</issue>
<page-range>636-49</page-range></nlm-citation>
</ref>
<ref id="B15">
<nlm-citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Hansen]]></surname>
<given-names><![CDATA[P.]]></given-names>
</name>
<name>
<surname><![CDATA[Oguz]]></surname>
<given-names><![CDATA[C.]]></given-names>
</name>
</person-group>
<article-title xml:lang=""><![CDATA[A note on formulations of the static and dynamic berth allocation problems]]></article-title>
<source><![CDATA[Les Cahiers du GERAD, HEC Montréal]]></source>
<year>2003</year>
</nlm-citation>
</ref>
<ref id="B16">
<nlm-citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Hu]]></surname>
<given-names><![CDATA[Z.H.]]></given-names>
</name>
</person-group>
<article-title xml:lang=""><![CDATA[Heuristics for solving continuous berth allocation problem considering periodic balancing utilization of cranes]]></article-title>
<source><![CDATA[Computers and Industrial Engineering]]></source>
<year>2015</year>
<volume>85</volume>
<numero>1</numero>
<issue>1</issue>
<page-range>216-26</page-range></nlm-citation>
</ref>
<ref id="B17">
<nlm-citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Imai]]></surname>
<given-names><![CDATA[A.]]></given-names>
</name>
<name>
<surname><![CDATA[Nagaiwa]]></surname>
<given-names><![CDATA[K.]]></given-names>
</name>
<name>
<surname><![CDATA[Tat]]></surname>
<given-names><![CDATA[C.W.]]></given-names>
</name>
</person-group>
<article-title xml:lang=""><![CDATA[Efficient planning of berth allocation container terminals in Asia]]></article-title>
<source><![CDATA[Journal of Advanced Transportation]]></source>
<year>1997</year>
<volume>31</volume>
<numero>1</numero>
<issue>1</issue>
<page-range>75-94</page-range></nlm-citation>
</ref>
<ref id="B18">
<nlm-citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Iris]]></surname>
<given-names><![CDATA[Ç.]]></given-names>
</name>
</person-group>
<article-title xml:lang=""><![CDATA[Integrated berth allocation and quay crane assignment problem: set partitioning models and computational results]]></article-title>
<source><![CDATA[Transportation Research Part E: Logistics and Transportation Review]]></source>
<year>2015</year>
<volume>81</volume>
<numero>1</numero>
<issue>1</issue>
<page-range>75-97</page-range></nlm-citation>
</ref>
<ref id="B19">
<nlm-citation citation-type="book">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Kim]]></surname>
<given-names><![CDATA[K.H.]]></given-names>
</name>
<name>
<surname><![CDATA[Günther]]></surname>
<given-names><![CDATA[H.O.]]></given-names>
</name>
</person-group>
<source><![CDATA[Container terminals and cargo systems: design, operations management, and logistics control issues]]></source>
<year>2007</year>
<edition>1a</edition>
<publisher-loc><![CDATA[Berlin ]]></publisher-loc>
<publisher-name><![CDATA[Springer-Verlag]]></publisher-name>
</nlm-citation>
</ref>
<ref id="B20">
<nlm-citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Lim]]></surname>
<given-names><![CDATA[A.]]></given-names>
</name>
</person-group>
<article-title xml:lang=""><![CDATA[The berth planning problem]]></article-title>
<source><![CDATA[Operations Research Letters]]></source>
<year>1998</year>
<volume>22</volume>
<numero>2-3</numero>
<issue>2-3</issue>
<page-range>105-10</page-range></nlm-citation>
</ref>
<ref id="B21">
<nlm-citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Macharis]]></surname>
<given-names><![CDATA[C.]]></given-names>
</name>
<name>
<surname><![CDATA[Bontekoning]]></surname>
<given-names><![CDATA[Y.M.]]></given-names>
</name>
</person-group>
<article-title xml:lang=""><![CDATA[Opportunities for OR in intermodal freight transport research: a review]]></article-title>
<source><![CDATA[European Journal of Operational Research]]></source>
<year>2004</year>
<volume>153</volume>
<numero>2</numero>
<issue>2</issue>
<page-range>400-16</page-range></nlm-citation>
</ref>
<ref id="B22">
<nlm-citation citation-type="book">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Mar-Ortiz]]></surname>
<given-names><![CDATA[J.]]></given-names>
</name>
<name>
<surname><![CDATA[Gracia]]></surname>
<given-names><![CDATA[M.D.]]></given-names>
</name>
<name>
<surname><![CDATA[González-Ramírez]]></surname>
<given-names><![CDATA[R.G.]]></given-names>
</name>
</person-group>
<article-title xml:lang=""><![CDATA[A Framework for Improving Logistics Operations at Container Terminals]]></article-title>
<source><![CDATA[Handbook of Research on Managerial Strategies for Achieving Optimal Performance in Industrial Processes]]></source>
<year>2016</year>
<edition>1st</edition>
<page-range>1-23</page-range><publisher-loc><![CDATA[Hershey PA, USA ]]></publisher-loc>
<publisher-name><![CDATA[IGI Global]]></publisher-name>
</nlm-citation>
</ref>
<ref id="B23">
<nlm-citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Meisel]]></surname>
<given-names><![CDATA[F.]]></given-names>
</name>
<name>
<surname><![CDATA[Bierwirth]]></surname>
<given-names><![CDATA[C.]]></given-names>
</name>
</person-group>
<article-title xml:lang=""><![CDATA[A framework for integrated berth allocation and crane operations planning in seaport container terminals]]></article-title>
<source><![CDATA[Transportation Science]]></source>
<year>2013</year>
<volume>47</volume>
<numero>2</numero>
<issue>2</issue>
<page-range>131-47</page-range></nlm-citation>
</ref>
<ref id="B24">
<nlm-citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Meisel]]></surname>
<given-names><![CDATA[F.]]></given-names>
</name>
<name>
<surname><![CDATA[Bierwirth]]></surname>
<given-names><![CDATA[C.]]></given-names>
</name>
</person-group>
<article-title xml:lang=""><![CDATA[Heuristics for the integration of crane productivity in the berth allocation problem]]></article-title>
<source><![CDATA[Transportation Research Part E: Logistics and Transportation Review]]></source>
<year>2009</year>
<volume>45</volume>
<numero>1</numero>
<issue>1</issue>
<page-range>196-209</page-range></nlm-citation>
</ref>
<ref id="B25">
<nlm-citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Nishimura]]></surname>
<given-names><![CDATA[E.]]></given-names>
</name>
<name>
<surname><![CDATA[Imai]]></surname>
<given-names><![CDATA[A.]]></given-names>
</name>
<name>
<surname><![CDATA[Papadimitriou]]></surname>
<given-names><![CDATA[S.]]></given-names>
</name>
</person-group>
<article-title xml:lang=""><![CDATA[Berth allocation planning in the public berth system by genetic algorithms]]></article-title>
<source><![CDATA[European Journal of Operational Research]]></source>
<year>2001</year>
<volume>131</volume>
<numero>2</numero>
<issue>2</issue>
<page-range>282-92</page-range></nlm-citation>
</ref>
<ref id="B26">
<nlm-citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Park]]></surname>
<given-names><![CDATA[K.T.]]></given-names>
</name>
<name>
<surname><![CDATA[Kim]]></surname>
<given-names><![CDATA[K.H.]]></given-names>
</name>
</person-group>
<article-title xml:lang=""><![CDATA[Berth scheduling for container terminals by using sub-gradient optimization technique]]></article-title>
<source><![CDATA[Journal of the Operational Research Society]]></source>
<year>2002</year>
<volume>53</volume>
<numero>9</numero>
<issue>9</issue>
<page-range>1054-62</page-range></nlm-citation>
</ref>
<ref id="B27">
<nlm-citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Steenken]]></surname>
<given-names><![CDATA[D.]]></given-names>
</name>
<name>
<surname><![CDATA[Voß]]></surname>
<given-names><![CDATA[S.]]></given-names>
</name>
<name>
<surname><![CDATA[Stahlbock]]></surname>
<given-names><![CDATA[R.]]></given-names>
</name>
</person-group>
<article-title xml:lang=""><![CDATA[Container terminal operation and operations research- a classification and literature review]]></article-title>
<source><![CDATA[OR Spectrum]]></source>
<year>2004</year>
<volume>26</volume>
<numero>1</numero>
<issue>1</issue>
<page-range>3-49</page-range></nlm-citation>
</ref>
<ref id="B28">
<nlm-citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Tao]]></surname>
<given-names><![CDATA[Y.]]></given-names>
</name>
<name>
<surname><![CDATA[Lee]]></surname>
<given-names><![CDATA[C.Y.]]></given-names>
</name>
</person-group>
<article-title xml:lang=""><![CDATA[Joint planning of berth and yard allocation in transshipment terminals using multi-cluster stacking strategy]]></article-title>
<source><![CDATA[Transportation Research Part E: Logistics and Transportation Review]]></source>
<year>2015</year>
<volume>83</volume>
<numero>34-50</numero>
<issue>34-50</issue>
<page-range>34-50</page-range></nlm-citation>
</ref>
<ref id="B29">
<nlm-citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Vis]]></surname>
<given-names><![CDATA[I.F.A.]]></given-names>
</name>
<name>
<surname><![CDATA[de Koster]]></surname>
<given-names><![CDATA[R.]]></given-names>
</name>
</person-group>
<article-title xml:lang=""><![CDATA[Transshipment of containers at a container terminal: an overview]]></article-title>
<source><![CDATA[European Journal of Operational Research]]></source>
<year>2003</year>
<volume>147</volume>
<numero>1</numero>
<issue>1</issue>
<page-range>1-16</page-range></nlm-citation>
</ref>
<ref id="B30">
<nlm-citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Zhen]]></surname>
<given-names><![CDATA[L.]]></given-names>
</name>
</person-group>
<article-title xml:lang=""><![CDATA[Tactical berth allocation under uncertainty]]></article-title>
<source><![CDATA[European Journal of Operational Research]]></source>
<year>2015</year>
<volume>247</volume>
<numero>3</numero>
<issue>3</issue>
<page-range>928-44</page-range></nlm-citation>
</ref>
</ref-list>
</back>
</article>
