In this paper, we study the Quay Crane Scheduling Problem (QCSP) in container terminals. We describe a new mathematical formulation for the QCSP and by addressing the structure of workload assignments we develop an easier way to handle non-crossing constraints. The proposed mathematical formulation is used in an exact solution framework based on logic-based Benders decomposition. The proposed approach decomposes the problem into a workload-assignment master problem and operation-sequence slave subproblems. Logic-based cuts are proposed to ensure the convergence of the approach. Computational results show the effectiveness of the proposed solution approach.
Sun, D., Tang, L., Baldacci, R. (2019). A Benders decomposition-based framework for solving quay crane scheduling problems. EUROPEAN JOURNAL OF OPERATIONAL RESEARCH, 273(2), 504-515 [10.1016/j.ejor.2018.08.009].
A Benders decomposition-based framework for solving quay crane scheduling problems
Baldacci, Roberto
2019
Abstract
In this paper, we study the Quay Crane Scheduling Problem (QCSP) in container terminals. We describe a new mathematical formulation for the QCSP and by addressing the structure of workload assignments we develop an easier way to handle non-crossing constraints. The proposed mathematical formulation is used in an exact solution framework based on logic-based Benders decomposition. The proposed approach decomposes the problem into a workload-assignment master problem and operation-sequence slave subproblems. Logic-based cuts are proposed to ensure the convergence of the approach. Computational results show the effectiveness of the proposed solution approach.File | Dimensione | Formato | |
---|---|---|---|
PP A Benders decomposition-based framework.pdf
Open Access dal 02/03/2021
Tipo:
Postprint
Licenza:
Licenza per Accesso Aperto. Creative Commons Attribuzione - Non commerciale - Non opere derivate (CCBYNCND)
Dimensione
849.13 kB
Formato
Adobe PDF
|
849.13 kB | Adobe PDF | Visualizza/Apri |
I documenti in IRIS sono protetti da copyright e tutti i diritti sono riservati, salvo diversa indicazione.