Convoy movement problem: a civilian perspective

Convoy movement problem: a civilian perspective

0.00 Avg rating0 Votes
Article ID: iaor2017208
Volume: 68
Issue: 1
Start Page Number: 14
End Page Number: 33
Publication Date: Jan 2017
Journal: J Oper Res Soc
Authors: , ,
Keywords: vehicle routing & scheduling, military & defence, graphs, combinatorial optimization, heuristics, simulation, government
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.

Reviews

Required fields are marked *. Your email address will not be published.