An application of the multiple knapsack problem: The self-sufficient marine

Self-Sufficiency (SS) is the ability to maintain capability without external support or aid. Operations in austere environments with limited functional infrastructure and logistical support, which are common in humanitarian assistance and disaster relief as well as military operations, must be self-sufficient. In this paper, we explore the challenges of SS in the United States Marine Corps (USMC). Marines engage in a wide variety of expeditionary operations, and must function without logistical support for long stretches of time. They face competing constraints, including the load that a squad can carry, mission requirements, resources required for sustainment, and the extent to which resources can be shared. We extend the knapsack problem in several ways to model a Marine squad's decisions regarding what items to carry and how to distribute them. The Office of Naval Research found the models and the results to be significant as baseline analysis for the resource demands of a self-sufficient squad. Though the data and scenarios are USMC-specific, the challenges of SS can be found in any expeditionary undertakings or operations in austere environments.

[1]  David Kendrick,et al.  GAMS, a user's guide , 1988, SGNM.

[2]  Frank Plastria,et al.  Static competitive facility location: An overview of optimisation approaches , 2001, Eur. J. Oper. Res..

[3]  Ralph L. Keeney,et al.  Decisions with multiple objectives: preferences and value tradeoffs , 1976 .

[4]  Paola Cappanera,et al.  A Local-Search-Based Heuristic for the Demand-Constrained Multidimensional Knapsack Problem , 2001, INFORMS J. Comput..

[5]  Lars Magnus Hvattum,et al.  Adaptive memory search for multidemand multidimensional knapsack problems , 2006, Comput. Oper. Res..

[6]  R. L. Keeney,et al.  Decisions with Multiple Objectives: Preferences and Value Trade-Offs , 1977, IEEE Transactions on Systems, Man, and Cybernetics.

[7]  Samuel P. Marin,et al.  Balancing and optimizing a portfolio of R&D projects , 2001 .

[8]  David Pisinger An exact algorithm for large multiple knapsack problems , 1999, Eur. J. Oper. Res..

[9]  Aruna Apte,et al.  Complexity and Self-Sustainment in Disaster Response Supply Chains , 2016, Decis. Sci..

[10]  Nicos Christofides,et al.  The Loading Problem , 1971 .

[11]  Craig W. Kirkwood,et al.  Strategic decision making : multiobjective decision analysis with spreadsheets : instructor's manual , 1996 .

[12]  Eva Regnier,et al.  The fuel multiplier in multi-stage supply chains , 2015 .

[13]  S. Salhi,et al.  A survey of effective heuristics and their application to a variety of knapsack problems , 2007 .

[14]  Paolo Toth,et al.  A Bound and Bound algorithm for the zero-one multiple knapsack problem , 1981, Discret. Appl. Math..

[15]  Lars Magnus Hvattum,et al.  Experiments Using Scatter Search for the Multidemand Multidimensional Knapsack Problem , 2007, Metaheuristics.

[16]  Joshua A Brindel,et al.  Defining Self-Sufficiency in the United States Marine Corps , 2013 .