摘要 : <![CDATA[<ce:abstract xmlns:ce="http://www.elsevier.com/xml/common/dtd" xmlns="http://www.elsevier.com/xml/ja/dtd" class="author-highlights" id="absh001" view="all"><ce:section-title id="sectt0001">Highlights</ce:section-title><ce... 展开 <![CDATA[<ce:abstract xmlns:ce="http://www.elsevier.com/xml/common/dtd" xmlns="http://www.elsevier.com/xml/ja/dtd" class="author-highlights" id="absh001" view="all"><ce:section-title id="sectt0001">Highlights</ce:section-title><ce:abstract-sec id="abssec0001" view="all"><ce:simple-para id="spara0001" view="all"><ce:list id="celist0002"><ce:list-item id="celistitem0001"><ce:label>?</ce:label><ce:para id="para0001" view="all">Two new combinatorial optimization that arise at container terminals are introduced.</ce:para></ce:list-item><ce:list-item id="celistitem0002"><ce:label>?</ce:label><ce:para id="para0002" view="all">Proofs of NP-Hardness are provided for both problems.</ce:para></ce:list-item><ce:list-item id="celistitem0003"><ce:label>?</ce:label><ce:para id="para0003" view="all">Exact and heuristic solution algorithms are developed for both problems.</ce:para></ce:list-item><ce:list-item id="celistitem0004"><ce:label>?</ce:label><ce:para id="para0004" view="all">The solution algorithms are tested on instances adapted from the literature.</ce:para></ce:list-item></ce:list></ce:simple-para></ce:abstract-sec></ce:abstract><ce:abstract xmlns:ce="http://www.elsevier.com/xml/common/dtd" xmlns="http://www.elsevier.com/xml/ja/dtd" id="abs0001" class="author" view="all"><ce:section-title id="sectt0002">Abstract</ce:section-title><ce:abstract-sec id="abssec0002" view="all"><ce:simple-para id="spara0002" view="all">Retrieving containers from a bay in a port terminal yard is a time consuming activity. The<ce:italic>Block Retrieval Problem</ce:italic>(BRTP) aims at minimizing the number of<ce:italic>relocations</ce:italic>, the unproductive moves of hindering containers, while retrieving target containers belonging to a customer. The choice of relocations leads to alternative bay configurations, some of which would minimize the relocations of forthcoming retrievals. The Bi-objective Block Retrieval Problem (2BRTP) includes a secondary objective, the minimization of the expe 收起