Optimally solving the generalized serial-lock scheduling problem from a graph-theory-based multi-commodity network perspective

Ji, Bin; Zhang, Dezhi; Yu, Shenglong; Zhang, Binqiao

doi:10.1016/j.ejor.2020.05.035

Cited by 10 publications

(9 citation statements)

References 23 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…These results are generalised for a sequence of locks by [9][10][11]13,17] . In [13] , a mathematical programming formulation for optimizing the schedule with respect to total flow time or total emission is presented.…”

Section: Lock Schedulingmentioning

confidence: 70%

“…Prandtstetter et al [17] introduce a heuristic to minimise the overall vessel travel times and test it against real-world vessel trajectories on the Danube River. The authors in [9][10][11] consider the problems of scheduling locks under general assumptions while minimizing the total flow time of the fleet.…”

Section: Lock Schedulingmentioning

confidence: 99%

“…Constraints ( 8) and ( 9) ensure that only vessels from one side can enter a lockage. The processing time of a lockage is modeled by Constraint (10) , while the capacity of a chamber is modeled by (11) . Constraints ( 12) and ( 13) ensure that each vessel is processed by all of its locks and that it arrives at each lock before its assigned lockage time.…”

Section: Locks Can Have Multiple Chambersmentioning

confidence: 99%

See 2 more Smart Citations

Optimizing fuel consumption on inland waterway networks: Local search heuristic for lock scheduling

Golak

Defryn

Grigoriev

2022

Omega

View full text Add to dashboard Cite

Fuel consumption and CO 2 emission are among the main criteria to assess the environmental and economical impact of vessels on inland waterways. Both criteria, however, are directly affected by the vessels' sailing speed. In this paper, we present a mathematical programming formulation of the speed optimization problem, which aims at minimizing the aggregated fuel consumption on an inland waterway network. The network can consist of multiple river segments, connected by a set of locks, without restrictions on the configuration. To allow scalability towards realistic waterway networks, we also propose a local-search based heuristic to optimize the speed for individual vessels. We evaluate the effectiveness of the heuristic by comparing it to solving the exact mathematical programming formulation. For all computational experiments, we make use of real AIS data from a section of the Dutch river network. We observe that the heuristic is able to construct a high quality solution in realistic problem settings within reasonable amount of computation time.

show abstract

Section: Lock Schedulingmentioning

confidence: 70%

Section: Lock Schedulingmentioning

confidence: 99%

Section: Locks Can Have Multiple Chambersmentioning

confidence: 99%

See 1 more Smart Citation

Optimizing fuel consumption on inland waterway networks: Local search heuristic for lock scheduling

Golak

Defryn

Grigoriev

2022

Omega

View full text Add to dashboard Cite

show abstract

“…To the best of our knowledge, only two published works report on combinatorial optimization methods for the GSLSP. Ji et al (2021a) mapped the GSLSP into a multi-commodity network, and a flow-based MILP model was proposed and considered complete two-dimensional ship placement restrictions. Subsequently, Ji et al (2021b) regarded the GSLSP as a variant of batch-processingbased flexible job-shop scheduling problem and presented another MILP model from this perspective.…”

Section: Lock Schedulingmentioning

confidence: 99%

The generalized serial-lock scheduling problem on inland waterway: A novel decomposition-based solution framework and efficient heuristic approach

Ji¹,

Zhang²,

Zhang³

et al. 2022

Transportation Research Part E: Logistics and Transportation Re

Self Cite

View full text Add to dashboard Cite

“…A solution to the problem combining a decision-making method to perform infrastructural modifications and dynamic lock scheduling is proposed in [21]. General serial-lock scheduling solutions using flexible job-shop scheduling and a two-dimensional binpacking problem on the one hand, and a multi-commodity network perspective on the other hand, are presented in [22] and [23], respectively. Arrival sequence of vessels at locks, lockage operation and service time are jointly considered in [24] using a mixed-integer programming (MIP) model, which is solved with large neighborhood search-based heuristics.…”

Section: Introductionmentioning

confidence: 99%

Scheduling Inland Waterway Transport Vessels and Locks Using a Switching Max-Plus-Linear Systems Approach

Segovia

Pesselse

Boom

et al. 2022

IEEE Open J. Intell. Transp. Syst.

View full text Add to dashboard Cite

This paper considers the inland waterborne transport (IWT) problem, and presents a scheduling approach for inland vessels and locks to generate optimal vessel and lock timetables. The scheduling strategy is designed in the switching max-plus-linear (SMPL) systems framework, as these are characterized by a number of features that make them well suited to represent the IWT problem. In particular, the resulting model is linear in the max-plus algebra, and SMPL systems can switch between modes, an interesting feature due to the presence of vessel routing and ordering constraints in the model. Moreover, SMPL systems can be transformed into mixed-integer linear programming (MILP) problems, for which efficient solvers are available. Finally, a realistic case study is used to test the approach and assess its effectiveness.

show abstract

Optimally solving the generalized serial-lock scheduling problem from a graph-theory-based multi-commodity network perspective

Cited by 10 publications

References 23 publications

Optimizing fuel consumption on inland waterway networks: Local search heuristic for lock scheduling

Optimizing fuel consumption on inland waterway networks: Local search heuristic for lock scheduling

The generalized serial-lock scheduling problem on inland waterway: A novel decomposition-based solution framework and efficient heuristic approach

Scheduling Inland Waterway Transport Vessels and Locks Using a Switching Max-Plus-Linear Systems Approach

Contact Info

Product

Resources

About