An exact algorithm for the unidirectional quay crane scheduling problem with vessel stability
| Autor: | Lixin Tang, Andrew Lim, Roberto Baldacci, Defeng Sun |
|---|---|
| Přispěvatelé: | Sun, Defeng, Tang, Lixin, Baldacci, Roberto, Lim, Andrew |
| Jazyk: | angličtina |
| Rok vydání: | 2021 |
| Předmět: |
050210 logistics & transportation
Mathematical optimization 021103 operations research Information Systems and Management General Computer Science Job shop scheduling Quay crane Computer science 05 social sciences 0211 other engineering and technologies Stability (learning theory) 02 engineering and technology Management Science and Operations Research Benders' decomposition Industrial and Manufacturing Engineering OR in maritime industry Quay crane scheduling Vessel stability constraints Logic-based Benders decomposition Task (computing) Exact algorithm Modeling and Simulation 0502 economics and business Container (abstract data type) Benchmark (computing) |
| Popis: | This paper addresses the quay crane scheduling problem (QCSP) with vessel stability constraints. Vessel stability is essential to improve quay crane operations in container terminals, but it significantly complicates the basic QCSP and the corresponding solutions methods. We describe a novel mathematical formulation for the unidirectional QCSP with vessel stability, and we propose an exact algorithm based on logic-based Benders decomposition to solve the problem efficiently. The problem is decomposed into two subproblems, e.g., a task-assignment master problem without vessel stability constraints, and a time-allocation problem, aimed at determining the operation time of each task under the premise of the vessel stability requirements. The proposed algorithm is tested on benchmark instances derived from the literature, and the effectiveness of the proposed model and solution approach is demonstrated. |
| Databáze: | OpenAIRE |
| Externí odkaz: |
|