scholarly journals A Comprehensive Modeling of the Discrete and Dynamic Problem of Berth Allocation in Maritime Terminals

Electronics ◽  
2021 ◽  
Vol 10 (21) ◽  
pp. 2684
Author(s):  
Sami Mansri ◽  
Malek Alrashidi
Keyword(s):  
Dynamic Problem ◽  
Numerical Experiments ◽  
Parallel Machines ◽  
Berth Allocation ◽  
Berth Allocation Problem ◽  
Resolution Method ◽  
Agent Interactions ◽  
Contract Net ◽  
Multi Agent ◽  
Comprehensive Modeling

In this study, the discrete and dynamic problem of berth allocation in maritime terminals, is investigated. The suggested resolution method relies on a paradigm of optimization with two techniques: heuristic and multi-agent. Indeed, a set of techniques such as the protocol of negotiation named contract net, the multi-agent interactions, and Worst-Fit arrangement technique, are involved. The main objective of the study is to propose a solution for attributing m parallel machines to a set of activities. The contribution of the study is to provide a detailed modeling of the discrete and dynamic berth allocation problem by establishing the corresponding models using a multi-agent methodology. A set of numerical experiments are detailed to prove the performance of the introduced multi-agent strategy compared with genetic algorithm and tabu search.

scholarly journals Berth Allocation and Quay Crane Assignment Under Uncertainties

2020 ◽  
Author(s):  
Caimao Tan ◽  
Junliang He ◽  
Yuancai Wang
Keyword(s):  
Stochastic Programming ◽  
Numerical Experiments ◽  
Programming Model ◽  
Berth Allocation ◽  
Berth Allocation Problem ◽  
Operations Planning ◽  
Proposed Model ◽  
Departure Time ◽  
Stochastic Programming Model ◽  
Quay Crane Assignment

The integration of berth allocation problem (BAP) and quay crane assignment problem (QCAP) is an cardinal seaside operations planning, which is susceptible to uncertainties, e.g. uncertain vessels arrival and maritime market. This paper addresses the integrated optimization of BAP and QCAP under uncertainties. A stochastic programming model is formulated for minimizing the waiting time and delay departure time of vessels. Besides, numerical experiments and scenario analysis are conducted to validate the effectiveness of the proposed model.

scholarly journals HADES: A Multi-Agent Platform to Reduce Congestion Anchoring Based on Temporal Coordination of Vessel Arrivals—Application to the Multi-Client Liquid Bulk Terminal in the Port of Cartagena (Spain)

2021 ◽  
Vol 11 (7) ◽  
pp. 3109
Author(s):  
Pilar Jiménez ◽  
José María Gómez-Fuster ◽  
Pablo Pavón-Mariño
Keyword(s):  
Mixed Integer ◽  
Berth Allocation ◽  
Limited Information ◽  
Key Factors ◽  
Berth Allocation Problem ◽  
Mixed Integer Linear Program ◽  
Agent Platform ◽  
Liquid Bulk ◽  
Multi Agent ◽  
Time Changes

Ports are key factors in international trade, and new port terminals are quite costly and time consuming to build. Therefore, it is necessary to optimize existing infrastructure to achieve sustainability in logistics. This problem is more complex in multi-client port terminals, where quay infrastructure is shared among terminal operators who often have conflicting interests. Moreover, the berth allocation problem in liquid bulk terminals implies demanding restrictions due to the reduced flexibility in berth allocation for these types of goods. In this context, this paper presents HADES, a multi-agent platform, and the experience of its pilot use in the Port of Cartagena. HADES is a software platform where agents involved in vessel arrivals share meaningful but limited information. This is done to alleviate potential congestion in multi-client liquid bulk terminals, promoting a consensus where overall congestion anchoring is reduced. A study is presented using a mixed integer linear program (MILP) optimization model to analyze the maximum theoretical reduction in congestion anchoring, depending on the flexibility of vessel arrival time changes. Results show that 6 h of flexibility is enough to reduce congestion anchoring by half, and 24 h reduces it to negligible values. This confirms the utility of HADES, which is also briefly described.

scholarly journals A Fuzzy Optimization Model for the Berth Allocation Problem and Quay Crane Allocation Problem (BAP + QCAP) with n Quays

2021 ◽  
Vol 9 (2) ◽  
pp. 152
Author(s):  
Edwar Lujan ◽  
Edmundo Vergara ◽  
Jose Rodriguez-Melquiades ◽  
Miguel Jiménez-Carrión ◽  
Carlos Sabino-Escobar ◽  
...  
Keyword(s):  
Optimization Model ◽  
Fuzzy Optimization ◽  
Optimal Solution ◽  
Allocation Problem ◽  
Berth Allocation ◽  
Triangular Fuzzy Numbers ◽  
Berth Allocation Problem ◽  
Arrival Times ◽  
Decision Variables ◽  
Short Time

This work introduces a fuzzy optimization model, which solves in an integrated way the berth allocation problem (BAP) and the quay crane allocation problem (QCAP). The problem is solved for multiple quays, considering vessels’ imprecise arrival times. The model optimizes the use of the quays. The BAP + QCAP, is a NP-hard (Non-deterministic polynomial-time hardness) combinatorial optimization problem, where the decision to assign available quays for each vessel adds more complexity. The imprecise vessel arrival times and the decision variables—berth and departure times—are represented by triangular fuzzy numbers. The model obtains a robust berthing plan that supports early and late arrivals and also assigns cranes to each berth vessel. The model was implemented in the CPLEX solver (IBM ILOG CPLEX Optimization Studio); obtaining in a short time an optimal solution for very small instances. For medium instances, an undefined behavior was found, where a solution (optimal or not) may be found. For large instances, no solutions were found during the assigned processing time (60 min). Although the model was applied for n = 2 quays, it can be adapted to “n” quays. For medium and large instances, the model must be solved with metaheuristics.

scholarly journals The tactical berth allocation problem with time-variant specific quay crane assignments

2021 ◽  
pp. 107168
Author(s):  
Emmanouil Thanos ◽  
Tulio Toffolo ◽  
Haroldo Gambini Santos ◽  
Wim Vancroonenburg ◽  
Greet Vanden Berghe
Keyword(s):  
Allocation Problem ◽  
Berth Allocation ◽  
Berth Allocation Problem

The dynamic berth allocation problem for a container port

2001 ◽  
Vol 35 (4) ◽  
pp. 401-417 ◽  
Author(s):  
Akio Imai ◽  
Etsuko Nishimura ◽  
Stratos Papadimitriou
Keyword(s):  
Allocation Problem ◽  
Berth Allocation ◽  
Container Port ◽  
Berth Allocation Problem

scholarly journals Ant Colony Intelligence in Flexible Manufacturing Scheduling Using Contract-Net Model

2011 ◽  
Vol 2-3 ◽  
pp. 608-613
Author(s):  
Ying Zi Wei ◽  
Yi Jun Feng ◽  
Kan Feng Gu
Keyword(s):  
Flexible Manufacturing ◽  
Manufacturing Systems ◽  
Ant Colony ◽  
Contract Net Protocol ◽  
Agent Based ◽  
Contract Net ◽  
Multi Agent ◽  
Bidding Mechanism ◽  
Alternative Processes ◽  
Alternative Machines

This paper builds an efficient agent-based flexible scheduling for real-world manufacturing systems. Considering the alternative processes and alternative machines, the allocation of manufacturing resources is achieved through negotiation among the job and machine agents in a multi-agent system (MAS). Ant Colony Intelligence (ACI) is proposed to be combined with Contract Net Protocol (CNP) so as to make agents adaptive to changing circumstances. ACI is integrated into both machine agents and job agents to solve the task allocation and sequencing problem. CNP is introduced to allow the agents to cooperate and coordinate their local schedules in order to find globally near-optimal robust schedules. The negotiation protocol is an interactive bidding mechanism based on the hybrid contract net protocol. The implementation of the issues using CNP model is discussed. Experimental results verify the effectiveness and efficiency of the proposed algorithm integrated with ant-inspired coordination.

Optimal berth allocation under regular and emergent vessel arrivals

2020 ◽  
pp. 147509022093788
Author(s):  
Abbas Al-Refaie ◽  
Hala Abedalqader
Keyword(s):  
Waiting Time ◽  
Container Terminal ◽  
Allocation Problem ◽  
Container Terminals ◽  
Future Research ◽  
Satisfaction Level ◽  
Berth Allocation ◽  
Scheduling Problems ◽  
Berth Allocation Problem ◽  
Quay Crane Assignment

This research proposes two optimization models to deal with the berth allocation problem. The first model considers the berth allocation problem under regular vessel arrivals to minimize the flow time of vessels in the marine container terminal, minimize the tardiness penalty costs, and maximize the satisfaction level of vessels’ operators on preferred times of departure. The second model optimizes the berth allocation problem under emergency conditions by maximizing the number of assigned vessels, minimizing the vessel’s waiting time, and maximizing the satisfaction level on the served ships. Two real examples are provided for model illustration under regular and emergent vessel arrivals. Results show that the proposed models effectively provide optimal vessel scheduling in the terminal, reduce costs at an acceptable satisfaction level of vessels’ operators, decrease the waiting time of vessels, and shorten the delay in departures under both regular and emergent vessel arrivals. In conclusion, the proposed models may provide valuable assistance to decision-makers in marine container terminals on determining optimal berth allocation under daily and emergency vessel arrivals. Future research considers quay crane assignment and scheduling problems.

scholarly journals Modeling and solving the Tactical Berth Allocation Problem

2010 ◽  
Vol 44 (2) ◽  
pp. 232-245 ◽  
Author(s):  
Giovanni Giallombardo ◽  
Luigi Moccia ◽  
Matteo Salani ◽  
Ilaria Vacca
Keyword(s):  
Allocation Problem ◽  
Berth Allocation ◽  
Berth Allocation Problem
Sign in / Sign up

Export Citation Format

Share Document