A Combinatorial Benders' decomposition for the lock scheduling problem

TLDR: The results indicate that the decomposition approach significantly outperforms other exact approaches presented in the literature, in terms of solution quality and computation time.

About: This article is published in Computers & Operations Research.The article was published on 2015-02-01 and is currently open access. It has received 50 citations till now. The article focuses on the topics: Generalized assignment problem & Optimization problem.

Figures

Table 3: Attributes of the chambers.

Table 2: Traffic data.

Figure 8: Comparison of the computation time of different cut generation methods for a large parallel chamber lock under a FCFS policy.

Figure 7: Comparison of the computation time of different cut generation methods for a small parallel chamber lock under a FCFS policy.

Figure 3: Visualization of the thirteen subset cuts for the example in Figure 2.

Figure 2: An example where the MP result puts ships 1 through 7 in a single lockage, and the feasible (after removing the red ships) first-come-first-served based lockages.

Frequently asked questions

Q1. What contributions have the authors mentioned in the paper "A combinatorial benders’ decomposition for the lock scheduling problem" ?

In this paper, the authors proposed a new exact approach to the lock scheduling problem ( LSP ) based on a combinatorial Benders ' decomposition approach. 

Q2. What future works have the authors mentioned in the paper "A combinatorial benders’ decomposition for the lock scheduling problem" ?

Future work may be aimed at improving the MP ’ s procedure, which is currently the main bottleneck of the decomposition approach.