An application of the multiple knapsack problem: The self-sufficient marine
详细信息 查看全文
- 作者：Jay Simona ; jaysimon@american.edu" class="auth_mail" title="E-mail the corresponding author ; jay.simon@gmail.com" class="auth_mail" title="E-mail the corresponding author ; Aruna Apteb ; auapte@nps.edu" class="auth_mail" title="E-mail the corresponding author ; Eva Regnierb ; eregnier@nps.edu" class="auth_mail" title="E-mail the corresponding author
- 关键词：OR in defense ; Multiple knapsack problem ; Integer programming ; Self-sufficiency ; Marine corps
- 刊名：European Journal of Operational Research
- 出版年：2017
- 出版时间：1 February 2017
- 年：2017
- 卷：256
- 期：3
- 页码：868-876
- 全文大小：375 K
文摘
- •
We model the load of a Marine squad as a multiple knapsack problem.
- •
Marines are able to share and transfer some of the items carried.
- •
Self-sufficiency is easier to achieve with larger squads and shorter durations.
- •
Duration of self-sufficiency is approximately linear in individual load limit.
- •
We also obtain specific numerical results for standard mission scenarios.