The generalized lock scheduling problem: An exact approach

doi:10.1016/J.TRE.2013.12.010

Home
/
Papers
/
The generalized lock scheduling problem: An exact approach

Journal Article•DOI•

The generalized lock scheduling problem: An exact approach

Jannes Verstichel¹, Patrick De Causmaecker¹, Frits C. R. Spieksma¹, Greet Van den Berghe¹•Institutions (1)

Katholieke Universiteit Leuven¹

01 May 2014-Transportation Research Part E-logistics and Transportation Review (Pergamon)-Vol. 65, pp 16-34

TL;DR: An integrated approach to solving the generalized lock scheduling problem using a mixed integer linear programming model and showing that small instances incorporating a wide range of real-life constraints can be solved to optimality.

read less

Abstract: The present paper introduces an integrated approach to solving the generalized lock scheduling problem. Three interrelated sub problems can be discerned: ship placement, chamber assignment and lockage operation scheduling. In their turn, these are closely related to the 2D bin packing problem, the assignment problem and the (parallel) machine scheduling problem respectively. In previous research, the three sub problems mentioned were considered separately, often using (heuristic) interaction between them to obtain better solutions. A mixed integer linear programming model is presented and applied to instances from both inland locks and locks in a tide independent port. The experiments show that small instances incorporating a wide range of real-life constraints can be solved to optimality.

...read moreread less

Citations

PDF

Open Access

More filters

Journal Article•DOI•

The waterway ship scheduling problem

[...]

Eduardo Lalla-Ruiz¹, Xiaoning Shi¹, Stefan Voß², Stefan Voß¹•Institutions (2)

University of Hamburg¹, Pontifical Catholic University of Valparaíso²

28 Oct 2016-Transportation Research Part D-transport and Environment

TL;DR: In this paper, the Waterway Ship Scheduling Problem (WSPP) is proposed to schedule incoming and outgoing ships through different waterways for accessing or leaving the port in such a way that the ships' waiting time is minimized.

...read moreread less

Abstract: One of the most important issues in port connectivity refers to the availability of accessible waterways and their traffic management This puts a lot of pressure especially into capacity restricted transport corridors, where their inefficient use may not only result in a loss of the port competitiveness but also in an increase of the volume of ship emissions polluting the environment In this context, the Waterway Ship Scheduling Problem is proposed; its goal is to schedule incoming and outgoing ships through different waterways for accessing or leaving the port in such a way that the ships’ waiting time is minimized This objective allows, on the one hand, to avoid bottlenecks or congestions through scheduling the waterway traffic, and on the other hand, reduce vessel emissions while they are waiting at the anchorage either for entering or leaving A mathematical model and heuristics are proposed Real scenarios based on the Yangtze Delta (Shanghai) are tackled for assessing the performance of the heuristic and the improvement upon real-world terminal operations

...read moreread less

83 citations

Journal Article•DOI•

A Combinatorial Benders' decomposition for the lock scheduling problem

[...]

Jannes Verstichel¹, Joris Kinable¹, P. De Causmaecker¹, G. Vanden Berghe¹•Institutions (1)

Katholieke Universiteit Leuven¹

01 Feb 2015-Computers & Operations Research

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

...read moreread less

50 citations

Cites background or methods or result from "The generalized lock scheduling pro..."

...For each group of instances the performance of the different feasibility cuts and initial cuts is evaluated, and a comparison of the Benders’ procedure against the Branch-and-Bound (B&B) approach from Verstichel et al. (2013b) is presented....
[...]
...Later, in Verstichel et al. (2013b) a mathematical model for the generalized LSP applicable to both inland and port settings was presented, along with an exact branch-and-bound procedure....
[...]
...In Figure 1 (c), the results obtained using the Benders’ approach in combination with initial order cuts are plotted against the Branch-and-Bound (B&B) procedure presented in Verstichel et al. (2013b) for a large number of instances....
[...]
...In short, verifying whether a set of ships can be assigned to the same lockage operation, amounts to solving a complex rectangle packing problem, where each rectangle represents a ship Verstichel et al. (2013a)....
[...]
...Constraints (9), (10) perform the actual scheduling of the lockages per chamber (see (Verstichel et al., 2013b) for a detailed discussion of these scheduling constraints)....
[...]

A Combinatorial Benders' decomposition for the lock scheduling problem

[...]

Jannes Verstichel, Joris Kinable, Patrick De Causmaecker, Greet Van den Berghe

01 Jan 2014

Abstract: The Lock Scheduling Problem (LSP) is a combinatorial optimization problem that represents a real challenge for many harbours and waterway operators. The LSP consists of three strongly interconnected subproblems: scheduling lockages, assigning ships to chambers, and positioning the ships inside the chambers. These should be interpreted respectively as a scheduling, an assignment, and a packing problem. By combining the first two problems into a master problem and using the packing problem as a subproblem, a decomposition is achieved that can be solved efficiently by a Combinatorial Benders' approach. The master problem is solved first, thereby sequencing the ships into a number of lockages. Next, for each lockage, a packing subproblem is checked for feasibility, possibly returning a number of combinatorial inequalities (cuts) to the master problem. The result is an exact approach to the LSP. Experiments are conducted on a set of instances that were generated in correspondence with real world data. The results indicate that the decomposition approach significantly outperforms other exact approaches presented in the literature, in terms of solution quality and computation time.

...read moreread less

49 citations

Journal Article•DOI•

Managing Navigation Channel Traffic and Anchorage Area Utilization of a Container Port

[...]

Shuai Jia¹, Chung Lun Li¹, Zhou Xu¹•Institutions (1)

Hong Kong Polytechnic University¹

26 Apr 2019-Transportation Science

TL;DR: A navigation channel is a fairway for vessels to travel in and out of the terminal basin of a container port that is restricted by the number of traffic lanes and the capacity of the channel.

...read moreread less

Abstract: Navigation channels are fairways for vessels to travel in and out of the terminal basin of a container port. The capacity of a navigation channel is restricted by the number of traffic lanes and sa...

...read moreread less

42 citations

Cites background from "The generalized lock scheduling pro..."

...Petersen and Taylor (1988), Nauss (2008), Verstichel et al. (2014), and Passchyn et al. (2016) model and solve lock scheduling problems for inland waterways....
[...]

Journal Article•DOI•

Mathematical programming models for lock scheduling with an emission objective

[...]

Ward Passchyn¹, Dirk Briskorn², Frits C. R. Spieksma¹•Institutions (2)

Katholieke Universiteit Leuven¹, University of Wuppertal²

01 Feb 2016-European Journal of Operational Research

TL;DR: It is confirmed that integrated scheduling of consecutive locks can reduce flow time significantly, and revealed that both model formulations have their merits when compared to each other.

...read moreread less

41 citations

1
2
3
4
…
5
6
7
8
9
10
11

Collapse

References

PDF

Open Access

More filters

Journal Article•DOI•

Operations research at container terminals: a literature update

[...]

Robert Stahlbock¹, Stefan Voß¹•Institutions (1)

University of Hamburg¹

10 Oct 2007-OR Spectrum

TL;DR: An earlier survey which proved to be of utmost importance for the community is updated and extended to provide the current state of the art in container terminal operations and operations research.

...read moreread less

Abstract: The current decade sees a considerable growth in worldwide container transportation and with it an indispensable need for optimization. Also the interest in and availability of academic literatures as well as case reports are almost exploding. With this paper an earlier survey which proved to be of utmost importance for the community is updated and extended to provide the current state of the art in container terminal operations and operations research.

...read moreread less

1,016 citations

Additional excerpts

...For an overview, we refer to Stahlbock and Voß (2008)....
[...]

Journal Article•DOI•

Integrating Berth Allocation and Quay Crane Assignments

[...]

Daofang Chang¹, Daofang Chang², Zuhua Jiang², Wei Yan¹, Junliang He¹ - Show less +1 more•Institutions (2)

Shanghai Maritime University¹, Shanghai Jiao Tong University²

01 Nov 2010-Transportation Research Part E-logistics and Transportation Review

TL;DR: In this paper, a dynamic allocation model using objective programming for berth allocation and quay crane assignments was preliminarily developed based on rolling-horizon approach Afterwards, a hybrid parallel genetic algorithm (HPGA), which combined parallel GA and heuristic algorithm, was employed to resolve the proposed model Furthermore, a simulation was conducted to evaluate the HPGA and to execute relevant gene repair techniques.

...read moreread less

Abstract: In this study, a dynamic allocation model using objective programming for berth allocation and quay crane assignments was preliminarily developed based on rolling-horizon approach Afterwards, a hybrid parallel genetic algorithm (HPGA), which combined parallel genetic algorithm (PGA) and heuristic algorithm, was employed to resolve the proposed model Furthermore, a simulation was conducted to evaluate the HPGA and to execute relevant gene repair techniques Eventually, the numerical experiments on a specific container terminal were applied to illustrate the proposed models and algorithms In so doing, the effectiveness of the proposed approach was verified

...read moreread less

143 citations

Journal Article•DOI•

The two-dimensional bin packing problem with variable bin sizes and costs

[...]

David Pisinger¹, Mikkel M. Sigurd¹•Institutions (1)

University of Copenhagen¹

01 Jun 2005-Discrete Optimization

TL;DR: An integer-linear formulation of the 2DVSBPP is presented and several lower bounds for the problem are introduced, by using Dantzig-Wolfe decomposition, to obtain lower bounds of very good quality.

...read moreread less

141 citations

"The generalized lock scheduling pro..." refers background or methods in this paper

...Each ship must be placed within the dimensions of the chamber type in which it will be transferred, which is modeled by constraints (7)–(9) (Pisinger and Sigurd, 2005)....
[...]
...Constraints (2)–(4) ensure that two ships transferred in the same lockage do not overlap (Pisinger and Sigurd, 2005)....
[...]
...Constraints (2)–(4) ensure that two ships transferred in the same lockage do not overlap (Pisinger and Sigurd, 2005). leftij þ leftji þ bij þ bji þ ð1 f ikÞ þ ð1 f jkÞP 1 ð2Þ 8i < j; i; j 2 N; k 2 M xi xj þWleftij 6W wi; 8i; j 2 N ð3Þ yi yj þ Lbij 6 L li; 8i; j 2 N ð4Þ In constraint (5) we model…...
[...]
...X k2M f ik ¼ 1; 8i 2 N ð12Þ Constraint (13) models that each lockage that transfers a ship must be used (Pisinger and Sigurd, 2005). f ik 6 zk; 8i 2 N; k 2 M ð13Þ We now present the lock scheduling specific mooring constraints (14)–(31)....
[...]
...The ship placement and chamber type assignment parts are based on the model for 2D bin packing with multiple bin sizes of Pisinger and Sigurd (2005)....
[...]

Journal Article•DOI•

Early/tardy scheduling with sequence dependent setups on uniform parallel machines

[...]

Nagraj Balakrishnan¹, John J. Kanet¹, Sri V. Sridharan¹•Institutions (1)

Clemson University¹

01 Feb 1999-Computers & Operations Research

TL;DR: For this complex problem, a mixed integer formulation is presented that has substantially fewer zero–one variables than typical formulations for scheduling problems of this type, and the computational experience in using this model to solve small sized problems is described.

...read moreread less

117 citations

"The generalized lock scheduling pro..." refers background or methods in this paper

...…of lockage operation l are taken into account. skl P setupt þ X i2N f ikposti þ X i2N f ilprei 8l – k; k; l 2 Mt ; t 2 TYPES ð36Þ Constraint (37) ensures that every used lockage is assigned to one of the physical chambers corresponding to the lockage’s chamber type (Balakrishnan et al., 1999)....
[...]
...Constraint (38) ensures that two lockages can be sequenced after each other iff they are processed by the same physical chamber (Balakrishnan et al., 1999)....
[...]
...…8k 2 Mt; t 2 TYPES ð37Þ Constraint (38) ensures that two lockages can be sequenced after each other iff they are processed by the same physical chamber (Balakrishnan et al., 1999). procku þ X v2Ut ;v–u proclv þ seqkl 6 2; 8l > k; k; l 2 Mt ; u 2 Ut ; t 2 TYPES ð38Þ The completion times of lockages…...
[...]
...Constraint (37) ensures that every used lockage is assigned to one of the physical chambers corresponding to the lockage’s chamber type (Balakrishnan et al., 1999)....
[...]
...…by the same physical chamber (Balakrishnan et al., 1999). procku þ X v2Ut ;v–u proclv þ seqkl 6 2; 8l > k; k; l 2 Mt ; u 2 Ut ; t 2 TYPES ð38Þ The completion times of lockages that are processed by the same physical chamber are modeled using constraints (39) and (40) (Balakrishnan et al., 1999)....
[...]

Journal Article•DOI•

The integrated yard truck and yard crane scheduling problem: Benders’ decomposition-based methods

[...]

Jin Xin Cao¹, Der-Horng Lee¹, Jiang Hang Chen¹, Qixin Shi²•Institutions (2)

National University of Singapore¹, Tsinghua University²

01 May 2010-Transportation Research Part E-logistics and Transportation Review

TL;DR: In this article, a mixed-integer programming model for loading operations in container terminal is proposed. And two efficient solution methods, based on Benders' decomposition, are developed for problem solution.

...read moreread less

Abstract: This paper proposes a novel integrated model for yard truck and yard crane scheduling problems for loading operations in container terminal. The problem is formulated as a mixed-integer programming model. Due to the computational intractability, two efficient solution methods, based on Benders’ decomposition, are developed for problem solution; namely, the general Benders’ cut-based method and the combinatorial Benders’ cut-based method. Computational experiments are conducted to evaluate the effectiveness of the proposed solution methods.

...read moreread less

115 citations

"The generalized lock scheduling pro..." refers background in this paper

...A wide range of port related operations has been researched, such as berth or quay crane related problems (Chang et al., 2010; Chen et al., 2012; Lee et al., 2012) and yard operations (Cao et al., 2010; Lee and Kim, 2010; Petering, 2011), but the lock operations attracted only a limited interest....
[...]
..., 2012) and yard operations (Cao et al., 2010; Lee and Kim, 2010; Petering, 2011), but the lock operations attracted only a limited interest....
[...]