Please use this identifier to cite or link to this item: https://hdl.handle.net/10356/93701
Title: Integer programming formulation for convoy movement problem
Authors: Kumar, P. N. Ram.
Narendran, T. T.
Issue Date: 2008
Source: Kumar, P. N. R., & Narendran, T. T. (2008). Integer programming formulation for convoy movement problem. International Journal of Intelligent Defence Support Systems, 1(3), 177-188.
Series/Report no.: International journal of intelligent defence support systems
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.
URI: https://hdl.handle.net/10356/93701
http://hdl.handle.net/10220/6153
ISSN: 1755-1587
DOI: http://inderscience.metapress.com/link.asp?id=3r333h5187573580
Rights: © 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].
metadata.item.grantfulltext: open
metadata.item.fulltext: With Fulltext
Appears in Collections:MAE Journal Articles

Files in This Item:
File Description SizeFormat 
Integer programming formulation for convoy movement problem (2).pdf293.93 kBAdobe PDFThumbnail
View/Open

Google ScholarTM

Check

Altmetric

Items in DR-NTU are protected by copyright, with all rights reserved, unless otherwise indicated.