A robust optimization approach for an artillery fire-scheduling problem under uncertain threat

Yong Baek Choi, Suk Ho Jin, Kyung Sup Kim, Byung Do Chung

Research output: Contribution to journalArticle

3 Citations (Scopus)

Abstract

In this study, the determination of an artillery firing sequence is considered in order to minimize the enemy threat to friendly forces prior to the conclusion of the firing operation. A deterministic model and robust counterpart are developed to deal with the deterministic and uncertain enemy threat levels, respectively. In both cases, the optimal strategy is demonstrated to be firing based on the threat removal rate per unit time. Moreover, a two-phase approach is developed based on the concept of cardinality-constrained uncertainty. In this approach, the firing sequence is determined in the first phase and then, in the second phase, the robustness of the uncertain factors is adjusted by using the modified problem to evaluate the total threat exposure of friendly units to the enemy. A set of problems is generated and tested using the proposed model and strategy. The results of numerical experiments demonstrate that the proposed strategy outperforms conventional fire-scheduling approaches. Additionally, the price of robustness is considered by adjusting the value of uncertain factors.

Original languageEnglish
Pages (from-to)23-32
Number of pages10
JournalComputers and Industrial Engineering
Volume125
DOIs
Publication statusPublished - 2018 Nov 1

Fingerprint

Fires
Scheduling
Experiments
Uncertainty

All Science Journal Classification (ASJC) codes

  • Computer Science(all)
  • Engineering(all)

Cite this

@article{dbb035dfec854be38e375010d929211d,
title = "A robust optimization approach for an artillery fire-scheduling problem under uncertain threat",
abstract = "In this study, the determination of an artillery firing sequence is considered in order to minimize the enemy threat to friendly forces prior to the conclusion of the firing operation. A deterministic model and robust counterpart are developed to deal with the deterministic and uncertain enemy threat levels, respectively. In both cases, the optimal strategy is demonstrated to be firing based on the threat removal rate per unit time. Moreover, a two-phase approach is developed based on the concept of cardinality-constrained uncertainty. In this approach, the firing sequence is determined in the first phase and then, in the second phase, the robustness of the uncertain factors is adjusted by using the modified problem to evaluate the total threat exposure of friendly units to the enemy. A set of problems is generated and tested using the proposed model and strategy. The results of numerical experiments demonstrate that the proposed strategy outperforms conventional fire-scheduling approaches. Additionally, the price of robustness is considered by adjusting the value of uncertain factors.",
author = "Choi, {Yong Baek} and Jin, {Suk Ho} and Kim, {Kyung Sup} and Chung, {Byung Do}",
year = "2018",
month = "11",
day = "1",
doi = "10.1016/j.cie.2018.08.015",
language = "English",
volume = "125",
pages = "23--32",
journal = "Computers and Industrial Engineering",
issn = "0360-8352",
publisher = "Elsevier Limited",

}

A robust optimization approach for an artillery fire-scheduling problem under uncertain threat. / Choi, Yong Baek; Jin, Suk Ho; Kim, Kyung Sup; Chung, Byung Do.

In: Computers and Industrial Engineering, Vol. 125, 01.11.2018, p. 23-32.

Research output: Contribution to journalArticle

TY - JOUR

T1 - A robust optimization approach for an artillery fire-scheduling problem under uncertain threat

AU - Choi, Yong Baek

AU - Jin, Suk Ho

AU - Kim, Kyung Sup

AU - Chung, Byung Do

PY - 2018/11/1

Y1 - 2018/11/1

N2 - In this study, the determination of an artillery firing sequence is considered in order to minimize the enemy threat to friendly forces prior to the conclusion of the firing operation. A deterministic model and robust counterpart are developed to deal with the deterministic and uncertain enemy threat levels, respectively. In both cases, the optimal strategy is demonstrated to be firing based on the threat removal rate per unit time. Moreover, a two-phase approach is developed based on the concept of cardinality-constrained uncertainty. In this approach, the firing sequence is determined in the first phase and then, in the second phase, the robustness of the uncertain factors is adjusted by using the modified problem to evaluate the total threat exposure of friendly units to the enemy. A set of problems is generated and tested using the proposed model and strategy. The results of numerical experiments demonstrate that the proposed strategy outperforms conventional fire-scheduling approaches. Additionally, the price of robustness is considered by adjusting the value of uncertain factors.

AB - In this study, the determination of an artillery firing sequence is considered in order to minimize the enemy threat to friendly forces prior to the conclusion of the firing operation. A deterministic model and robust counterpart are developed to deal with the deterministic and uncertain enemy threat levels, respectively. In both cases, the optimal strategy is demonstrated to be firing based on the threat removal rate per unit time. Moreover, a two-phase approach is developed based on the concept of cardinality-constrained uncertainty. In this approach, the firing sequence is determined in the first phase and then, in the second phase, the robustness of the uncertain factors is adjusted by using the modified problem to evaluate the total threat exposure of friendly units to the enemy. A set of problems is generated and tested using the proposed model and strategy. The results of numerical experiments demonstrate that the proposed strategy outperforms conventional fire-scheduling approaches. Additionally, the price of robustness is considered by adjusting the value of uncertain factors.

UR - http://www.scopus.com/inward/record.url?scp=85051363582&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=85051363582&partnerID=8YFLogxK

U2 - 10.1016/j.cie.2018.08.015

DO - 10.1016/j.cie.2018.08.015

M3 - Article

AN - SCOPUS:85051363582

VL - 125

SP - 23

EP - 32

JO - Computers and Industrial Engineering

JF - Computers and Industrial Engineering

SN - 0360-8352

ER -