| Abstract: | To reflect a realistic, changing front line, wartime logistics are illustrated by a dynamic location–allocation model. In this paper, a mixed integer programming (MIP) model is developed for use in deciding the timing of unit relocation for continuous resupply, safe locations for support units, and delivery amounts that minimize total risk to the logistics service. Total risk in wartime logistics is represented by unsatisfied demand, hazard at the support site, and the number of relocations. The proposed MIP model reflects realistic factors in battle situations, such as maximum distance, vehicle capacity, basic load carried by combat units, and limited supplies during unit relocation. Furthermore, special operators for crossover and mutation are developed to maintain feasibility of possible solutions, and an efficient hybrid genetic algorithm is proposed to find optimal and near‐optimal solutions. |
