The k-Allocation Problem and Its Variants

2007 ◽  
pp. 253-264 ◽  
Author(s):  
Dorit S. Hochbaum ◽  
Asaf Levin
Keyword(s):  
Allocation Problem

Location and allocation problem for spare parts depots on integrated logistics support

2019 ◽  
Vol 30 (6) ◽  
pp. 1252-1259
Author(s):  
Meilin WEN ◽  
Bohan LU ◽  
Shuyu LI ◽  
Rui KANG
Keyword(s):  
Spare Parts ◽  
Allocation Problem ◽  
Integrated Logistics

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

Optimization and estimation in system reliability allocation problem

2021 ◽  
Vol 212 ◽  
pp. 107620
Author(s):  
Umar Muhammad Modibbo ◽  
Mohd. Arshad ◽  
Omer Abdalghani ◽  
Irfan Ali
Keyword(s):  
System Reliability ◽  
Allocation Problem ◽  
Reliability Allocation
Sign in / Sign up

Export Citation Format

Share Document