Optimal sequencing in the presence of setup times for tow/barge traffic through a river lock
Queues of tow/barges form when a river lock is rendered inoperable due to lock malfunction, a tow/barge accident or adverse lock operating conditions. In this paper, we develop model formulations that allow the queue to be cleared using a number of differing objectives. Of particular interest is the presence of different setup times between successive passages of tow/barges through the lock. Dependent on the objective chosen, we are able to show that certain ordering protocols may be used to markedly reduce the sequencing search space for N tow/barges from the order of N! to 2N. We present accompanying linear and nonlinear integer programming formulations and carry out computational experiments on a representative set of problems.
integer programming scheduling with setup times combinatorial optimization transportation