Communication Dans Un Congrès Année : 2018

New Valid Inequalities and Combinatorial Benders' Cuts Algorithm for the Quayside Operation Optimization Problem Without Big-M Coefficient

Résumé

This paper studies the quayside operation problem, in which three seaside planning decisions are integrated, with the objective of minimizing the maximum relative tardiness. A refinement of the state-of-the-art formulation is presented in this work, and an improved exact combinatorial Benders decomposition algorithm is devised for the problem at container terminals which used to be typically modeled by mixed-integer linear programming problems containing a large number of 'big-M' coefficients.
Fichier non déposé

Dates et versions

hal-04746436 , version 1 (21-10-2024)

Identifiants

Citer

Ming Liu, Bian Liang, Chengbin Chu, Feng Chu. New Valid Inequalities and Combinatorial Benders' Cuts Algorithm for the Quayside Operation Optimization Problem Without Big-M Coefficient. 15th International Conference on Service Systems and Service Management (ICSSSM 2018), Jul 2018, Hangzhou, China. pp.1-6, ⟨10.1109/ICSSSM.2018.8465073⟩. ⟨hal-04746436⟩
11 Consultations
0 Téléchargements

Altmetric

Partager

More