We investigate the scheduling of series of consecutive locks. This setting occurs naturally along canals and waterways. Our contribution is to (i) provide two distinct mathematical programming formulations and compare them empirically, (ii) investigate the trade-off between reducing flow time and reducing emissions, and (iii) compare the results of the integrated model to those of a heuristic scheduling the locks separately. Our findings confirm that integrated scheduling of consecutive locks can reduce flow time significantly, and reveal that both model formulations have their merits when compared to each other.status: publishe
The Lock Scheduling Problem (LSP) is a combinatorial optimization problem that represents a real cha...
Barges travelling on a network of inland waterways often have to pass several locks before reaching ...
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...
We consider the problem of scheduling multiple locks arranged in a sequence on inland waterways. We ...
Locks constitute a bottleneck along many inland waterways. We consider the problem of scheduling a s...
Locks are typical bottlenecks along rivers and canals. We consider a system of multiple locks arrang...
hips must often pass one or more locks when entering or leaving a tide independent port. So do barge...
We discuss a problem inspired by the practical setting of scheduling a series of locks arranged in a...
ith the increasing share of waterbound multimodal transportation in the logistics chain, inland lock...
Waterborne multimodal transportation is becoming an increasingly important part of the logistics cha...
With the increasing share of waterbound multimodal transportation in the logistics chain, inland loc...
The present thesis introduces the lock scheduling problem and promising decompositions into sub prob...
In the present contribution we will show that scheduling a lock having at least two identical chambe...
AbstractIn the present contribution we will show that scheduling a lock having at least two identica...
The Lock Scheduling Problem (LSP) is a combinatorial optimization problem that represents a real cha...
Barges travelling on a network of inland waterways often have to pass several locks before reaching ...
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...
We consider the problem of scheduling multiple locks arranged in a sequence on inland waterways. We ...
Locks constitute a bottleneck along many inland waterways. We consider the problem of scheduling a s...
Locks are typical bottlenecks along rivers and canals. We consider a system of multiple locks arrang...
hips must often pass one or more locks when entering or leaving a tide independent port. So do barge...
We discuss a problem inspired by the practical setting of scheduling a series of locks arranged in a...
ith the increasing share of waterbound multimodal transportation in the logistics chain, inland lock...
Waterborne multimodal transportation is becoming an increasingly important part of the logistics cha...
With the increasing share of waterbound multimodal transportation in the logistics chain, inland loc...
The present thesis introduces the lock scheduling problem and promising decompositions into sub prob...
In the present contribution we will show that scheduling a lock having at least two identical chambe...
AbstractIn the present contribution we will show that scheduling a lock having at least two identica...
The Lock Scheduling Problem (LSP) is a combinatorial optimization problem that represents a real cha...
Barges travelling on a network of inland waterways often have to pass several locks before reaching ...
Freight transport on inland waterways has great potential as a reliable, inexpensive and environment...