A fast approximation of homogeneous stochastic combat

J. Yang and A. V. Gafarian

Naval Research Logistics (NRL), 1995, vol. 42, issue 3, 503-533

Abstract: The stochastic combat model with arbitrary interkiling time distribution is more general than the deterministic Lanchester model or the exponential model [3]. Unfortunately, the exact analytical solution of the more general combat model requires a huge amount of computation time, which makes it practically impossible to use for battles beyond 4 on 4. An approximate solution for a class of homogeneous stochastic combats with arbitrary interkilling time distribution is developed in this study. A large number of randomly generated battles from a very general population have been used to evaluate the approximation algorithm for accuracy and computation time. The results indicate that the approximation algorithm is highly accurate and its computation speed is about 100 to 1000 times faster than the corresponding simulation to reach the same level of accuracy. © 1995 John Wiley & Sons, Inc.

Date: 1995
References: View references in EconPapers View complete reference list from CitEc
Citations: View citations in EconPapers (2)

Downloads: (external link)
https://doi.org/10.1002/1520-6750(199504)42:33.0.CO;2-Z

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:wly:navres:v:42:y:1995:i:3:p:503-533

Access Statistics for this article

More articles in Naval Research Logistics (NRL) from John Wiley & Sons
Bibliographic data for series maintained by Wiley Content Delivery ().