New exact methods for the time-invariant berth allocation and quay crane assignment problem

Correcher, Juan Francisco; Álvarez-Valdés, Ramón; Tamarit, José Manuel

doi:10.1016/j.ejor.2018.11.007

Cited by 39 publications

(25 citation statements)

References 26 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Meanwhile, it is an obvious tendency that the berth and quay crane both are taken into account simultaneously. Correcher et al [24] focused on the berth allocation problem and the quay crane assignment problem in an integrated way, and proposed a new mixed integer linear model to solve. Agra et al [25] investigated an integrated berth allocation, quay crane assignment, and scheduling problem in which a heterogeneous set of cranes was considered, and a rolling horizon metaheuristic was introduced to solve hard instances.…”

Section: Literature Reviewmentioning

confidence: 99%

Container Terminal Logistics Generalized Computing Architecture and Green Initiative Computational Pattern Performance Evaluation

Song

2019

Information

View full text Add to dashboard Cite

Container terminals are the typical representatives of complex supply chain logistics hubs with multiple compound attributes and multiple coupling constraints, and their operations are provided with the strong characteristics of dynamicity, nonlinearity, coupling, and complexity (DNCC). From the perspective of computational logistics, we propose the container terminal logistics generalized computing architecture (CTL-GCA) by the migration, integration, and fusion of the abstract hierarchy, design philosophy, execution mechanism, and automatic principles of computer organization, computing architecture, and operating system. The CTL-GCA is supposed to provide the problem-oriented exploration and exploitation elementary frameworks for the abstraction, automation, and analysis of green production at container terminals. The CTL-GCA is intended to construct, evaluate, and improve the solution to planning, scheduling, and decision at container terminals, which all are nondeterministic polynomial hard problems. Subsequently, the logistics generalized computational pattern recognition and performance evaluation of a practical container terminal service case study is launched by the qualitative and quantitative approach from the sustainable perspective of green production. The case study demonstrates the application, utilization, exploitation, and exploration of CTL-GCA preliminarily, and finds the unsustainable patterns of production at the container terminal. From the above, we can draw the following conclusions. For one thing, the CTL-GCA makes a definition of the abstract and automatic running architecture of logistics generalized computation for container terminals (LGC-CT), which provides an original framework for the design and implementation of control and decision mechanism and algorithm. For another, the CTL-GCA can help us to investigate the roots of DNCC thoroughly, and then the CTL-GCA makes for conducting the efficient and sustainable running pattern recognition of LGC-CT. It is supposed to provide a favorable guidance and supplement to define, design, and implement the agile, efficient, sustainable, and robust task scheduling and resource allocation for container terminals by computational logistics whether in the strategy level or the tactical one.

show abstract

Section: Literature Reviewmentioning

confidence: 99%

Container Terminal Logistics Generalized Computing Architecture and Green Initiative Computational Pattern Performance Evaluation

Song

2019

Information

View full text Add to dashboard Cite

show abstract

“…Whenever a metaheuristic procedure is used, coding and decoding the solution of mathematical problem is required [18][19][20][21]. Due to page limitation, the encoding scheme is refferd to the literature [12][13][14].…”

Section: Red Deer Algorithm (Rda)mentioning

confidence: 99%

“…They considered a case study in United Arabia Emarates to validate the proposed model. At the last but not the least, Correcher et al [14] developed some exact methods to address a berth allocation problem and quay crane assignment scheduling.…”

Section: Introduction and Literature Reviewmentioning

confidence: 99%

“…Similar to the constraint (12), the indexing of contractors and ships is arranged in ascending order according to their position. Constraint (14) indicates that if the contractor q is not assigned to the vessel m, there is no possibility of assigning cranes of contractor q to the vessel m, and if the contractor q is assigned to the vessel m, the cranes of the contractor q can be assigned to the vessel m. Constraint (15) indicates that each contractor can be assigned to at most one vessel, and constraint (16) ensures that each vessel is assigned exactly to one contractor for servicing. Constraints (17) and (18) compute the completion time of each bay.…”

mentioning

confidence: 99%

See 1 more Smart Citation

Addressing a Coordinated Quay Crane Scheduling and Assignment Problem by Red Deer Algorithm

Fazli

Fathollahi-Fard

Tian

2019

IJE

View full text Add to dashboard Cite

A B S T R A C TNowadays, there is much attention for planning of container terminals in the global trade centers. The high cost of quay cranes motivates both scholars and industrial practitioners especially in the last decade to develop novel optimization models to address this dilemma. This study proposes a coordinated optimization model to cover both Quay Crane Scheduling Problem (QCSP) and Quay Crane Assignment Problem (QCAP) as among the first attempts in this area. Another main contribution of this paper is to apply a recent nature-inspired algorithm called Red Deer Algorithm (RDA). The RDA revealed its performance for a variety of combinatorial optimization problems in different real-world applications. This is the first attempt in the literature to employ this recent metaheuristic to solve the proposed Coordinated Quay Crane Scheduling and Assignment Problem (CQCSAP). Finally, an extensive comparison discussion is considered to reveal the main benefits of the proposed optimization model and solution algorithm.

show abstract

“…As a result, cost, profit or time varies in the implementation of different activities. The problem, therefore, is how allocations should be made to improve the specific goal of completing a number of jobs by a number of resources (Khaled, et al, 2017) (Correcher, et al, 2019). The AP in the general form can be stated as follows:"Given n facilities, n jobs and the effectiveness of each facility for each job, the problem is to assign each facility to one and only one job in such a way that the measure of effectiveness is optimized (maximized or minimized) (Berends & Aken, 2018).…”

Section: Artículomentioning

confidence: 99%

New Systematic Heuristic Based Approach to Cope With Unbalanced Assignment Problem Efficiently

2019

JAUS

View full text Add to dashboard Cite

The assignment subject is always an old renewed problem that attracts the researchers for its fundamental relationship with productivity, efficiency, cost reduction and optimal utilization of resources in an age of competition and globalization. Assignment problem arises in diverse situations, where one needs to determine an optimal way to assign subjects to subjects in the best possible way. The assignment signifies the underlying combinatorial structure, while the objective function reflects the desires to be optimized as much as possible. In fact, this is a well-studied topic in combinatorial optimization problems under optimization or industrial engineering branches. A new heuristic innovative method is proposed to tackle the assignment problem in a clear systematic stepwise procedure, easy to follow without needing to initiate dummy activities in case of an unbalanced problem. The main aim of the developed procedure is to raise the efficiency of resource usage based on optimizing the objectives as loads are distributed to machines to the least possible variation to carry out all the work with the least possible time and almost to reach overall equilibrium loading. The procedure is enforced by illustration examples with complex relation between n and m. Keywords: Assignment Problem, Unbalance problem, Hungarian Method, Combinatorial Optimization, Efficiency RESUMEN/ El tema de la tarea es siempre un viejo problema renovado que atrae a los investigadores por su relación fundamental con la productividad, la eficiencia, la reducción de costos y la utilización óptima de los recursos en una era de competencia y globalización. El problema de asignación surge en diversas situaciones, donde uno necesita determinar una manera óptima de asignar sujetos a sujetos de la mejor manera posible. La asignación significa la estructura combinatoria subyacente, mientras que la función objetivo refleja los deseos de ser optimizados tanto como sea posible. De hecho, este es un tema bien estudiado en problemas de optimización combinatoria en las ramas de optimización o ingeniería industrial. Se propone un nuevo método innovador heurístico para abordar el problema de asignación en un procedimiento paso a paso claro y sistemático, fácil de seguir sin necesidad de iniciar actividades ficticias en caso de un problema desequilibrado. El objetivo principal del procedimiento desarrollado es aumentar la eficiencia del uso de los recursos basado en la optimización de los objetivos, ya que las cargas se distribuyen a las máquinas con la menor variación posible para llevar a cabo todo el trabajo con el menor tiempo posible y casi para alcanzar la carga de equilibrio general. El procedimiento se aplica mediante ejemplos de ilustración con una relación compleja entre n y m. Palabras clave: problema de asignación, problema de desequilibrio, método húngaro, optimización combinatoria, eficiencia Nuevo enfoque sistemático basado en la heurística para hacer frente al problema de asignación desequilibrada de manera eficiente  Publicación /28-08-2019...

show abstract

New exact methods for the time-invariant berth allocation and quay crane assignment problem

Cited by 39 publications

References 26 publications

Container Terminal Logistics Generalized Computing Architecture and Green Initiative Computational Pattern Performance Evaluation

Container Terminal Logistics Generalized Computing Architecture and Green Initiative Computational Pattern Performance Evaluation

Addressing a Coordinated Quay Crane Scheduling and Assignment Problem by Red Deer Algorithm

New Systematic Heuristic Based Approach to Cope With Unbalanced Assignment Problem Efficiently

Contact Info

Product

Resources

About