Integer programming formulation for convoy movement problem

Autor:	P.N. Ram Kumar, T. T. Narendran
Přispěvatelé:	School of Mechanical and Aerospace Engineering
Rok vydání:	2008
Předmět:	Mathematical optimization Linear programming Computer science Military Convoys Mechanical engineering [Engineering] Heuristics Integer programming Convoy Routing Scheduling (computing)
Zdroj:	International Journal of Intelligent Defence Support Systems. 1:177
ISSN:	1755-1595 1755-1587
DOI:	10.1504/ijidss.2008.023006
Popis:	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.
Databáze:	OpenAIRE
Externí odkaz:	https://explore.openaire.eu/search/publication?articleId=doi_dedup___::0dfb9a383a8e41832127b2dfb2bddbde https://doi.org/10.1504/ijidss.2008.023006 Zobrazit plný text záznamu