A Java Application for Optimization of Stock Allocation in Contingency Logistics Networks: Colonor

Abstract

Contingencies are unexpected events or crises that cause a major threat for security and safety of a particular population. Since they are unexpected events, the demand to perform contingency operations as well as the supply that can be provided for this can be modelled through probability distributions. Furthermore, before contingencies occur one may want to hold stocks beforehand. Based on interference theory between demand, supply and stocks, one can obtain a reliability of that site, i.e. probability that the site can perform the operations assigned based on the availability of resources for these operations. This study develops a software design as a java application, COLONOR, which optimizes the stock allocations, i.e. maximizes the reliability of contingency logistics networks with a given budget and total stocks to allocate. It assumes exponential demands and supplies, and the network structure is such that the sites are arranged either in series or parallel. The software can employ either genetic algorithm or total enumeration techniques to solve the resulting non-linear, non-separable and non-convex mathematical model and enables the users to specify the problem's parameters such as demand and supply rates, number of sites and network structure as well as the solution approach.