Add to ORKGWe consider the operation of ship locks with one or more parallel chambers, which can transfer several ships in a single lockage operation. The corresponding lock scheduling problem consists of three strongly interconnected sub problems: lockage scheduling, chamber assignment, and ship positioning. An efficient Combinatorial Benders' decomposition is developed. Experiments on a large test set show that this decomposition method strongly outperforms an existing monolithic approach, especially for instances with a complex ship positioning sub problem.status: publishe
The present thesis introduces the lock scheduling problem and promising decompositions into sub prob...
Freight transport on inland waterways has great potential as a reliable, inexpensive and environment...
We investigate the scheduling of series of consecutive locks. This setting occurs naturally along ca...
Ships must often pass one or more locks when entering or leaving a tide independent port or when tra...
hips must often pass one or more locks when entering or leaving a tide independent port. So do barge...
\u3cp\u3eThe Lock Scheduling Problem (LSP) is a combinatorial optimization problem that represents a...
Barges travelling on a network of inland waterways often have to pass several locks before reaching ...
The present thesis introduces the lock scheduling problem and promising decompositions into sub prob...
AbstractIn the present contribution we will show that scheduling a lock having at least two identica...
With the increasing share of waterbound multimodal transportation in the logistics chain, inland loc...
In the present contribution we will show that scheduling a lock having at least two identical chambe...
The present paper introduces an integrated approach to solving the generalized lock scheduling probl...
Waterborne multimodal transportation is becoming an increasingly important part of the logistics cha...
The present paper introduces an integrated approach to solving the generalized lock scheduling probl...
In this paper, we explore problems and algorithms related to the optimisation of locks, as used in i...
The present thesis introduces the lock scheduling problem and promising decompositions into sub prob...
Freight transport on inland waterways has great potential as a reliable, inexpensive and environment...
We investigate the scheduling of series of consecutive locks. This setting occurs naturally along ca...
Ships must often pass one or more locks when entering or leaving a tide independent port or when tra...
hips must often pass one or more locks when entering or leaving a tide independent port. So do barge...
\u3cp\u3eThe Lock Scheduling Problem (LSP) is a combinatorial optimization problem that represents a...
Barges travelling on a network of inland waterways often have to pass several locks before reaching ...
The present thesis introduces the lock scheduling problem and promising decompositions into sub prob...
AbstractIn the present contribution we will show that scheduling a lock having at least two identica...
With the increasing share of waterbound multimodal transportation in the logistics chain, inland loc...
In the present contribution we will show that scheduling a lock having at least two identical chambe...
The present paper introduces an integrated approach to solving the generalized lock scheduling probl...
Waterborne multimodal transportation is becoming an increasingly important part of the logistics cha...
The present paper introduces an integrated approach to solving the generalized lock scheduling probl...
In this paper, we explore problems and algorithms related to the optimisation of locks, as used in i...
The present thesis introduces the lock scheduling problem and promising decompositions into sub prob...
Freight transport on inland waterways has great potential as a reliable, inexpensive and environment...
We investigate the scheduling of series of consecutive locks. This setting occurs naturally along ca...