Heuristics for Convoy Movement Problem

Autor:	P.N. Ram Kumar, T. T. Narendran
Rok vydání:	2009
Předmět:	Operations research business.industry Computer science Political Science and International Relations Artificial intelligence business Heuristics Safety Research Scheduling (computing)
Zdroj:	Strategic Analysis. 33:590-606
ISSN:	1754-0054 0970-0161
DOI:	10.1080/09700160902907126
Popis:	Convoy movement problem involves routing and scheduling military convoys across a limited route network, adhering to certain strategic constraints. This article suggests using heuristics for solving the dynamic version of the problem where the network changes over time. The performance of heuristics evaluated against lower bounds, when applied to a number of hypothetical data-sets, is found to be encouraging.
Databáze:	OpenAIRE
Externí odkaz:	https://explore.openaire.eu/search/publication?articleId=doi_________::cb7b47eb47d8f21b7e080cd8c81d5a98 https://doi.org/10.1080/09700160902907126 Zobrazit plný text záznamu