Integer programming formulation for convoy movement problem
Kumar, P. N. Ram.
Narendran, T. T.
Date of Issue2008
School of Mechanical and Aerospace Engineering
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.
International journal of intelligent defence support systems
© 2008 Inderscience Publishers This is the author created version of a work that has been peer reviewed and accepted for publication by International journal of intelligent defence support systems, Inderscience Publishers. It incorporates referee’s comments but changes resulting from the publishing process, such as copyediting, structural formatting, may not be reflected in this document. The published version is available at: [DOI: http://dx.doi.org/10.1504/IJIDSS.20 2008.023006].