Convoy movement problem: a civilian perspective

Abstract

We study the convoy movement problem in peacetime from a civilian perspective by seeking to minimize civilian traffic disruptions. We develop an exact hybrid algorithm that combines the k-shortest path algorithm along with finding a minimum weighted k-clique in a k-partite graph. Through this coupling scheme, we are able to exactly solve large instances of the convoy movement problem without relaxing many of its complicating constraints. An experimental study is performed based on pseudo-transportation networks to illustrate the computational viability of the method as well as policy implications.

Keywords:

• convoy movement problem
• disjoint path
• k-shortest path
• k-clique

Notes

1 Relative optimality gap:

2 Feasibility ratio on each test problem is the percentage of time that a method can find a feasible solution for that problem.