• Journal of the Korean Operations Research and Management Science Society
• /
• v.35 no.1
• /
• pp.47-65
• /
• 2010

In this study the artillery fire system is investigated in consideration of the characteristics of the troop and the target. Two kinds of decision are to be made on the target allocation with fire ammunition and the fire sequencing for the target with duties in charge. The objective is to minimize the completion time for all troops. Each target has the specified amount of load of fire, which can be accomplished by a single troop or the combination of the troops having different capabilities. Mathematical model is suggested, and the heuristic algorithm which yields a solution within a reasonable computation time is developed. The algorithm consists of iterative three steps : the initial solution generation, the division improvement, and the exchange improvement. The performance of the heuristic is evaluated through the computational experiment

• Journal of the military operations research society of Korea
• /
• v.29 no.2
• /
• pp.61-80
• /
• 2003

A fire sequencing problem is considered. Fire sequencing problem is a kind of scheduling problem that seeks to minimize the overall time span under a result of weapon­target allocation problem. The assigned weapons should impact a target simultaneously and a weapon cannot transfer the firing against another target before all planned rounds are consumed. The computational complexity of the fire sequencing problem is strongly NP­complete even if the number of weapons is two, so it is difficult to get the optimal solution in a reasonable time by the mathematical programming approach. Therefore, a genetic algorithm is adopted as a solution method, in which the representation of the solution, crossover and mutation strategies are applied on a specific condition. Computational results using randomly generated data are presented. We compared the solutions given by CPLEX and the genetic algorithm. Above $7(weapon){\times}15(target)$ size problems, CPLEX could not solve the problem even if we take enough time to solve the problem since the required memory size increases dramatically as the number of nodes expands. On the other hand, genetic algorithm approach solves all experimental problems very quickly and gives good solution quality.

• Journal of the Korean Operations Research and Management Science Society
• /
• v.28 no.3
• /
• pp.123-134
• /
• 2003

Fire Sequencing Problem (FSP) is to find a sequence of targets, where there exist a number of targets with different time units required to fire. Because of the weapon's specifications and the size of the targets, several weapons may fire on the same targets, and the time units required on firing for each weapon may be different from each other. The objective is to minimize the completion time of firing for given number of targets. Mathematical formulation is given, and the heuristic algorithm based on the paring of targets in advance is suggested. Performance of the heuristic is evaluated by comparison of heuristic appeared in the literature through the computational experiments.

• Journal of Korean Society of Industrial and Systems Engineering
• /
• v.35 no.2
• /
• pp.37-44
• /
• 2012

This paper focuses on scheduling problems arising in the military. In planned artillery attack operations, a large number of threatening enemy targets should be destroyed to minimize fatal loss to the friendly forces. We consider a situation in which the number of available weapons is smaller than the number of targets. Therefore it is required to develop a new sequencing algorithm for the unplanned artillery attack operation. The objective is to minimize the total loss to the friendly forces from the targets, which is expressed as a function of the fire power potential, after artillery attack operations are finished. We develop an algorithm considering the fire power potential and the time required to destroy the targets. The algorithms suggested in this paper can be used in real artillery attack operations if they are modified slightly to cope with the practical situations.

• Journal of the military operations research society of Korea
• /
• v.31 no.2
• /
• pp.28-44
• /
• 2005

The previous studies approach the field artillery fire scheduling problem as deterministic and do not explicitly include information on the potential scenario changes. Unfortunately, the effort used to optimize fire sequences and reduce the total time of engagement is often inefficient as the collected military intelligence changes. Instead of modeling the fire sequencing problem as deterministic model, we consider a stochastic artillery fire scheduling model and devise a solution methodology to integrate possible enemy attack scenarios in the evaluation of artillery fire sequences. The goal is to use that information to find robust solutions that withstand disruptions in a better way, Such an approach is important because we can proactively consider the effects of certain unique scheduling decisions. By identifying more robust schedules, cascading delay effects will be minimized. In this paper we describe our stochastic model for the field artillery fire sequencing problem and offer revised robust stochastic model which considers worst scenario first. The robust stochastic model makes the solution more stable than the general two-stage stochastic model and also reduces the computational cost dramatically. We present computational results demonstrating the effectiveness of our proposed method by EVPI, VSS, and Variances.

• Management Science and Financial Engineering
• /
• v.5 no.2
• /
• pp.55-59
• /
• 1999

In this note, we introduce the Fire Sequencing Problem, which arises in military operations. Given m weapons, n fixed targets nad required duration of firing of the weapons on the targets, we want to determine the start time of firing on each target so that makespan is miniized while satisfying various operational constraints. We show that the decision problem of the Fire Sequencing problem is strongly NP-complete and remains strongly NP-complete even if the number of weapons is two. We also briefly discuss the results with respect to the complexities of several well-known scheduling models.

• Journal of the military operations research society of Korea
• /
• v.36 no.1
• /
• pp.15-27
• /
• 2010

Fire sequencing problem is to find a sequence of firing on the targets. The latest, because the korea artillery force is inferior in number as compared with north korea force. It is an important question to give a fatal damage to the enemy force by using prompt and accurate fire in order to overcome the lack of artillery force. Minimizing the fire finishing time will secure the adapt ability in tactical operation. In this paper, we developed a mathematical model to do allocation the fire on the targets to decrease to total fire operation time. In order to work out the fire sequencing problem, MIP is developed and the optimum solution is obtained by using ILOG OPL. If this analytical model is applied to the field artillery unit, it will improve the artillery fire force enhancement.

• Journal of the military operations research society of Korea
• /
• v.33 no.1
• /
• pp.105-115
• /
• 2007

It is essential to give a fatal damage to the enemy force by using prompt and accurate fire in order to overcome the lack of artillery force. During the artillery fire operations, minimizing the firing time will secure the adapt ability in tactical operation. In this paper, we developed a mathematical model to schedule the artillery fire on the multiple targets to decrease total fire operation time. To design a program to describe a real firing situation, we consider many possible circumstances of changes such as commander's intention, firing constraints, target priority, and contingency plan to make a fire plan in an artillery unit. In order to work out the target sequencing problem, MIP is developed and the optimum solution is obtained by using ILOG OPL. If this analytical model is applied to a field artillery unit, it will improve the efficiency of the artillery fire force operations.

• Journal of Korean Society of Industrial and Systems Engineering
• /
• v.33 no.3
• /
• pp.154-161
• /
• 2010

This paper considers the simultaneously firing model for the artillery operations. The objective of this paper is to find the optimal fire sequence minimizing the final completion time of the firing missions of multiple artillery units for multiple targets. In the problem analysis, we derive several solution properties to reduce the solution space. Moreover, two lower bounds of objective are derived and tested along with the derived properties within a branch-and-bound scheme. Two efficient heuristic algorithms are also developed. The overall performances of the proposed branch-and-bound and heuristic algorithms are evaluated through various numerical experiments.

• The Plant Pathology Journal
• /
• v.37 no.4
• /
• pp.404-412
• /
• 2021

Despite the plant microbiota plays an important role in plant health, little is known about the potential interactions of the flower microbiota with pathogens. In this study, we investigated the microbial community of apple blossoms when infected with Erwinia amylovora. The long-read sequencing technology, which significantly increased the genome sequence resolution, thus enabling the characterization of fire blight-induced changes in the flower microbial community. Each sample showed a unique microbial community at the species level. Pantoea agglomerans and P. allii were the most predominant bacteria in healthy flowers, whereas E. amylovora comprised more than 90% of the microbial population in diseased flowers. Furthermore, gene function analysis revealed that glucose and xylose metabolism were enriched in diseased flowers. Overall, our results showed that the microbiome of apple blossoms is rich in specific bacteria, and the nutritional composition of flowers is important for the incidence and spread of bacterial disease.