Decision Algorithm for Nuclear, Biological, and Chemical Decontamination Using Dynamic Programming

摘要

This thesis describes a decision algorithm developed to schedule land combat units for Nuclear, Biological, and/or Chemical (NBC) decontamination. It is an application of the Generalized Value System (GVS) of assigning unit value and power over time. The actual model is a PC based FORTRAN model that determines the optimal scheduling of contaminated units using a dynamic programming technique. Optimal in this application means minimal total time required for the decon operation. The schedule developed is based on the latest possible start time, thus allowing for the most flexibility. The model is a high resolution stand alone type. It depicts up to six units with three different vehicle types, ten or more decon sites, and one decon team. The terrain is modelled as an undirected network and has distance and trafficability attributes. Keywords: Decision theory, Computer programs. (AW)