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

Journal of Marine Science and Engineering

Carlos Sabino-Escobar¹  Edmundo Vergara²  Edwar Lujan²  Jose Rodriguez-Melquiades²  Flabio Gutierrez³  Miguel Jiménez-Carrión³ 

[1] Faculty of Economic Sciences, Universidad Nacional de Tumbes, Tumbes 24001, Peru;Faculty of Physical and Mathematical Sciences, Universidad Nacional de Trujillo, Trujillo 13011, Peru;Science Faculty and Faculty of Industrial Engineering, Universidad Nacional de Piura, Piura 20002, Peru;

关键词: berth allocation problem;    BAP;    quay cranes assignment problem;    QCAP;    fuzzy optimization;    fully fuzzy linear programing;   

DOI  :  10.3390/jmse9020152

来源: DOAJ

【 摘 要 】

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.

【 授权许可】

Unknown