Integer programming formulation for convoy movement problem

• Main Authors: Kumar, P. N. Ram., Narendran, T. T.
• Other Authors: School of Mechanical and Aerospace Engineering
• Format: Article
• Language: English
• Published: 2009
• Subjects: Engineering::Mechanical engineering; Military Convoys; Convoy Routing
• Online Access: https://hdl.handle.net/10356/93701; http://hdl.handle.net/10220/6153; http://inderscience.metapress.com/openurl.asp?genre=article&eissn=1755-1595&volume=1&issue=3&spage=177
• Institution: Nanyang Technological University

This paper reports a study of the strategic network problem of routing military convoys between specific origin and destination pairs. Known as the Convoy Movement Problem (CMP), this problem is formulated as an integer linear program. The proposed mathematical model is evaluated on the basis of average number of iterations and average CPU times. LP-based lower bounds and heuristic based upper bounds were generated and used for evaluating the proposed model, particularly for large problem instances for which optimal solutions could not be obtained.