Economic Choice of the Transportation Routes for Logistics Materiels.

摘要

Light Vehicle Battalions are used to transport logistic materiels from supply depots to combat units, on orders from high level logistics command. This thesis develops a linear programming model to determine which LVB should take which route, how much materiel it should take, and within what specific time it should travel to minimize transportation and storage costs. The linear programming model is derived from a peacetime scenario where each combat unit's demand varies seasonly. We report computational experience on a realistic problem using GAMS (the General Algebraic Modeling System).