In this section, aspects of TS particularly relevant to the SMMSP are discussed and an overview of historical TS applied to military combinatorial optimization problems is presented.
In addition to the SAP, the SMMSP solves the Strategic Sealift Problem at a macroscopic level.
The SMMSP is a large combinatorial optimization problem with partitioning, scheduling, and routing aspects.
A TPFDD stipulates all needed information for the transport of cargo for a given contingency and the solution of the SMMSP yields a redefinition of a TPFDD.
There are two SMMSP solution representations using either vehicle routing or RLN routing.
Typical problems address thousands of RLNs and the inherent complexity of the SMMSP precludes the use of classical optimization methods.