Title: Integer programming formulation for convoy movement problem

Authors: P.N. Ram Kumar, T.T. Narendran

Addresses: Department of Management Studies, Indian Institute of Technology Madras, Chennai – 600 036, India. ' Department of Management Studies, Indian Institute of Technology Madras, Chennai – 600 036, India

Abstract: 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.

Keywords: military convoys; convoy routing; scheduling; integer program; heuristics; convoy movement problem; integer programming; mathematical modelling.

DOI: 10.1504/IJIDSS.2008.023006

International Journal of Intelligent Defence Support Systems, 2008 Vol.1 No.3, pp.177 - 188

Available online: 06 Feb 2009 *

Full-text access for editors Access for subscribers Purchase this article Comment on this article