Next Article in Journal
Pipeline Damage Identification Based on Additional Virtual Masses
Next Article in Special Issue
Accelerated Simulation of Discrete Event Dynamic Systems via a Multi-Fidelity Modeling Framework
Previous Article in Journal
An Integrated Risk Index Model Based on Hierarchical Fuzzy Logic for Underground Risk Assessment
Previous Article in Special Issue
Strategies to Automatically Derive a Process Model from a Configurable Process Model Based on Event Data
Article Menu
Issue 10 (October) cover image

Export Article

Open AccessArticle
Appl. Sci. 2017, 7(10), 1038; doi:10.3390/app7101038

Deterministic and Robust Optimization Approach for Single Artillery Unit Fire Scheduling Problem

Department of Industrial Engineering, Yonsei University, 50 Yonsei-ro, Seodaemun-gu, Seoul 03722, Korea
*
Author to whom correspondence should be addressed.
Received: 28 August 2017 / Revised: 22 September 2017 / Accepted: 9 October 2017 / Published: 11 October 2017
(This article belongs to the Special Issue Modeling, Simulation, Operation and Control of Discrete Event Systems)
View Full-Text   |   Download PDF [749 KB, uploaded 11 October 2017]   |  

Abstract

In this study, deterministic and robust optimization models for single artillery unit fire scheduling are developed to minimize the total enemy threat to friendly forces by considering the enemy target threat level, enemy target destruction time, and target firing preparation time simultaneously. Many factors in war environments are uncertain. In particular, it is difficult to evaluate the threat levels of enemy targets definitively. We consider the threat level of an enemy target to be an uncertain parameter and propose a robust optimization model that minimizes the total enemy threat to friendly forces. The robust optimization model represents a semi-infinite problem that has infinitely many constraints. Therefore, we reformulate the robust optimization model into a tractable robust counterpart formulation with a finite number of constraints. In the robust counterpart formulation with cardinality-constrained uncertainty, the conservativeness and robustness of the solution can be adjusted with an uncertainty degree, Γ. Further, numerical experiments are conducted to verify that the robust counterpart formulation with cardinality-constrained uncertainty can be made equivalent to the deterministic optimization model and the robust counterpart formulation with box uncertainty by setting Γ accordingly. View Full-Text
Keywords: deterministic optimization; robust optimization; single artillery unit fire scheduling; threat level deterministic optimization; robust optimization; single artillery unit fire scheduling; threat level
Figures

Figure 1

This is an open access article distributed under the Creative Commons Attribution License which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited. (CC BY 4.0).

Scifeed alert for new publications

Never miss any articles matching your research from any publisher
  • Get alerts for new papers matching your research
  • Find out the new papers from selected authors
  • Updated daily for 49'000+ journals and 6000+ publishers
  • Define your Scifeed now

SciFeed Share & Cite This Article

MDPI and ACS Style

Choi, Y.B.; Jin, S.H.; Kim, K.S. Deterministic and Robust Optimization Approach for Single Artillery Unit Fire Scheduling Problem. Appl. Sci. 2017, 7, 1038.

Show more citation formats Show less citations formats

Note that from the first issue of 2016, MDPI journals use article numbers instead of page numbers. See further details here.

Related Articles

Article Metrics

Article Access Statistics

1

Comments

[Return to top]
Appl. Sci. EISSN 2076-3417 Published by MDPI AG, Basel, Switzerland RSS E-Mail Table of Contents Alert
Back to Top