Filters








11 Hits in 3.1 sec

Berth allocation at indented berths for mega-containerships

Akio Imai, Etsuko Nishimura, Masahiro Hattori, Stratos Papadimitriou
2007 European Journal of Operational Research  
This paper addresses the berth allocation problem at a multi-user container terminal with indented berths for fast handling of mega-containerships.  ...  berths, where both mega-containerships and feeder ships are to be served for higher berth productivity.  ...  Optimizing ship berthing. Naval  ... 
doi:10.1016/j.ejor.2006.03.034 fatcat:ufrll6nkyzfu7b4j7ril6pg6w4

Berth allocation planning in Seville inland port by simulation and optimisation

Carlos Arango, Pablo Cortés, Jesús Muñuzuri, Luis Onieva
2011 Advanced Engineering Informatics  
We study the problems associated with allocating berths for containerships in the port of Seville. It is the only inland port in Spain and it is located on the Guadalquivir River.  ...  Allocation planning aims to minimise the total service time for each ship and considers a first-come-first-served allocation strategy.  ...  We can conclude that the port facilities are able to serve the new freight traffic but for this to be achieved current berths systems must be improved.  ... 
doi:10.1016/j.aei.2011.05.001 fatcat:sc3yagmijzdktfsr3okan3crke

Productivity of Multi-user Container Terminal in Partitioning Arrangements a Given Quay Space
岸壁空間の運用規模区分を考慮したマルチユーザターミナルの生産性に関する研究

Etsuko NISHIMURA, Akio IMAI, Pierre CARIOU
2009 INFRASTRUCTURE PLANNING REVIEW  
at indented berths for mega-containership, European Journal of Operational Research 179 (2) Productivity of Multi-user Container Terminal in Partitioning Arrangements a Given Quay Space * By Etsuko  ...  ., The dynamic berth allocation for a container port, Transportation Research Part-B 35, 401-417, 2001 . } 1 , 0 { ∈ ijk x O k V j B i ∈ ∈ ∈ ∀ , , (15) [P2] i j k i k n N [P3] Minimize (16) ∑∑ ∈ ∈ N n  ... 
doi:10.2208/journalip.26.641 fatcat:htbwfsyvefaibfkz7enmd445ey

Berthing ships at a multi-user container terminal with a limited quay capacity

Akio Imai, Etsuko Nishimura, Stratos Papadimitriou
2008 Transportation Research Part E: Logistics and Transportation Review  
Kumara of Jaya Container Terminal at the port of Colombo, a graduate of the World Maritime University, for ship calling statistics of that terminal. This  ...  Kurihara, a former undergraduate student of Kobe University, for implementation of the algorithms, and to Mr.  ...  (in press) recently introduce the BAP for an indented terminal, which is considered as a possible efficient container terminal for prospective mega containerships.  ... 
doi:10.1016/j.tre.2006.05.002 fatcat:6y42xnvravfmbe5bn5ed7qn5qe

Modeling and solving the Tactical Berth Allocation Problem

Giovanni Giallombardo, Luigi Moccia, Matteo Salani, Ilaria Vacca
2010 Transportation Research Part B: Methodological  
In this paper we integrate at the tactical level two decision problems arising in container terminals: the berth allocation problem, which consists of assigning and scheduling incoming ships to berthing  ...  Acknowledgments We would like to thank Carmine Crudo and Vincenzo Perri at Medcenter Container Terminal S.p.a. in Gioia Tauro (Italy) for many helpful discussions on the subject. The work of G.  ...  In order to cut down transportation costs, container traffic asks for ultra-large containerships and thus for terminals with facilities and technologies able to handle them (mega-terminals), and for a  ... 
doi:10.1016/j.trb.2009.07.003 fatcat:fme27cyvqfhn7mcrqsh6nktvgi

Multi-period coordinated optimization on berth allocation and yard assignment in container terminals based on truck route (March 2021)

Wenwen Guo, Mingjun Ji, Huiling Zhu
2021 IEEE Access  
[36] proposed genetic algorithm to solve the berth allocation problem at indented berths for mega-containerships. Lalla-Ruiz et al.  ...  During the loading process, berths and yards, as the important places for container exchange and storage operations, mainly determine the allocation of berthing positions for vessels arriving at ports  ...  Guo was awarded the Port of Antwerp Maritime Awards in 2016 for an outstanding thesis award related to shipping, logistics and supply chain.  ... 
doi:10.1109/access.2021.3086185 fatcat:tbqxqviouzchnhhrr4f2ilg4ve

The simultaneous berth and quay crane allocation problem

Akio Imai, Hsieh Chia Chen, Etsuko Nishimura, Stratos Papadimitriou
2008 Transportation Research Part E: Logistics and Transportation Review  
Acknowledgements This research is partially supported by the Grant-in-Aid for Scientific Research of  ...  Imai et al. (2007) proposed the BAP with simultaneous berthing of multiple ships at the indented berth, which is potentially useful for fast turnaround of mega-containerships.  ...  Their solution procedure consists of two phases: one for berth allocation and the other for crane allocation.  ... 
doi:10.1016/j.tre.2007.03.003 fatcat:k26jpkuiqjcfbgrnqnnsuvtwyu

A genetic algorithm to solve the storage space allocation problem in a container terminal

Mohammad Bazzazi, Nima Safaei, Nikbakhsh Javadian
2009 Computers & industrial engineering  
The SSAP is defined as the temporary allocation of the inbound/outbound containers to the storage blocks at each time period with aim of balancing the workload between blocks in order to minimize the storage  ...  The extended SSAP is solved by an efficient GA for real-sized instances.  ...  Imai, Nishimura, Hattori, and Papadimitriou (2007) solved the berth allocation problem at indented berths for mega-containerships by GA (Imai et al., 2007) .  ... 
doi:10.1016/j.cie.2008.03.012 fatcat:2lwki5busbeepnbdkjm2xj4aqq

The strategic berth template problem

Akio Imai, Yukiko Yamakawa, Kuancheng Huang
2014 Transportation Research Part E: Logistics and Transportation Review  
The BTPS employs the subgradient optimization procedure, which is an improved version of the procedure that the authors developed for the operational berth allocation problem.  ...  For this situation, we propose a strategic berth template problem (BTPS) that selects the ships among the requesting ones to be served and arrange their berth-windows within a limited planning horizon.  ...  This research is supported by the JSPS Grant-in-Aid for Scientific Research-B Grant 25282093. Step 5.  ... 
doi:10.1016/j.tre.2014.09.013 fatcat:wscmt2b2azcb3ar7nbqsme5aja

ESTIMATING TIME REQUIRED FOR SHIP BERTHING AND QUAY CRANE WORKING WITH CONSIDERING TYPES OF MACHINE
荷役方式を考慮した本船と岸壁クレーンの荷役時間推定モデル構築に関する研究

Etsuko NISHIMURA, Liying CHEN
2011 Journal of Japan Society of Civil Engineers Ser D3 (Infrastructure Planning and Management)  
allocation at indented berths for mega-containership, European Journal of Operational Research, Vol.179, No.2, pp.579-593, 2007. 2) Nishimura, E., Imai, A., Janssens, G.  ...  At a terminal where mega-containerships are calling, most cargoes to be handled are transshipments from origin to destination ports via that terminal.  ... 
doi:10.2208/jscejipm.67.67_i_869 fatcat:xnhardkhknan5j5exvq3io66jq

The discrete and continuous berth allocation problem: models and algorithms

Michail D. Gkolias
2007
Container terminal operators seek for efficient BSPs that will reduce vessels turnaround time, increase port throughput, lead to higher revenues and increased competitiveness of the port, while at the  ...  same time keep customer satisfaction at desired levels.  ...  A new integer linear programming formulation was presented, which was then extended to model the berth allocation problem at a terminal with indented berths, where both mega-containerships and feeder vessels  ... 
doi:10.7282/t3db828q fatcat:sbhs2n5aw5e7nccudui7seww3u