A genetic algorithm approach to the artillery target assignment problem

Date

2010-11-12

Author

Sapaz, Burçin
Toroslu, İsmail Hakkı
Üçoluk, Göktürk

Metadata

Show full item record

This work is licensed under a Creative Commons Attribution-NonCommercial-NoDerivatives 4.0 International License.

Item Usage Stats

142
views

0
downloads

In this work a new assignment problem with the name "Artillery Target Assignment Problem (ATAP)" is defined. ATAP is about assigning artillery guns to targets at different time instances while some objective functions are to be optimized. Since an assignment made for any time instance effect the value of the shooting ATAP is harder than the classical assignment problem. For two variations of ATAP genetic algorithm solutions with customized representations and genetic operators are developed and presented. © 2011 Springer Science+Business Media B.V.

Subject Keywords

Assignment Problem, Time Instance, Target Dimension, Genetic Algorithm Approach, Hierarchial Formation

URI

https://hdl.handle.net/11511/57611

DOI

https://doi.org/10.1007/978-90-481-9794-1_8

Conference Name

25th International Symposium on Computer and Information Sciences

Collections

Department of Computer Engineering, Conference / Seminar

Suggestions

OpenMETU
Core

Adaptation and Fine-Tuning of the Weighted Sum Method on Personnel Assignment Problem with Hierarchical Ordering and Team Constraints Arslanoglu, Yilmaz; Toroslu, İsmail Hakkı (2011-09-28) This work deals with the multi-objective optimization problem, Personnel Assignment Problem with Hierarchical Ordering and Team Constraints, which appears in personnel assignment of large hierarchical organizations, such as military. Weighted Sum Method, which is one of the pioneering approaches towards multi-objective optimization, is considered as the means of solution to the problem. The adaptation of this intuitive and successful method to the problem, and an analysis on fine-tuning of its various param...
Artillery target assignment problem with time dimension Sapaz, Burçin; Toroslu, İsmail Hakkı; Department of Computer Engineering (2008) In this thesis, we defined a new assignment problem and named it as the artillery target assignment problem(ATAP). The artillery target assignment problem is about assigning artillery weapons to targets at different time instances while optimizing some objectives. Since decisions at a time instance may affect decisions at other time instances, solving this assignment problem is harder than the classical assignment problem. For constructing a solution approach, we defined a base case and some variations of t...
A Standard Expert System For Weapon Target Assignment Problem Sahin, M. Alper; Leblebicioğlu, Mehmet Kemal (2009-07-16) Weapon target assignment (WTA) problem is the problem of assigning weapons to targets with the objective of minimizing the expected damage of targets. In this work, a standard expert system is proposed for the particular WTA problem. The idea is to build expert system using grid partitioning over a training set The proposed system is implemented and tested with a number of randomly generated WTA instances. The proposed system has a satisfactory performance.
A Probabilistic and interactive approach to multiple criteria sorting Mutlu, Sinem; Köksalan, Murat; Serin, Yaşar Yasemin; Department of Industrial Engineering (2015) In this thesis, we develop a method in order to assign alternatives that are evaluated by multiple criteria into preference ordered classes probabilistically. Our motivation is that; when there are large sets of alternatives, placement could be realized in a fast and effective way based on a reasonable misclassification ratio. We assume that the underlying utility function of Decision Maker (DM) is additive. We first ask DM to place reference alternatives into the classes. We develop an interactive probabil...
A robust Island Parallel Genetic Algorithm for the Quadratic Assignment Problem Tosun, Umut; Dokeroglu, Tansel; Coşar, Ahmet (2013-07-01) The Quadratic Assignment Problem (QAP) is a difficult and important problem studied in the domain of combinatorial optimisation. It is possible to solve QAP instances with 10--20 facilities using exhaustive parallel algorithms within a few days on a cluster machine. However, large QAP instances with more than 100 facilities are not solvable using exhaustive techniques. We have explored a variety of Genetic Algorithm crossover operators for this problem and verified its performance experimentally using well-...

Citation Formats

B. Sapaz, İ. H. Toroslu, and G. Üçoluk, “A genetic algorithm approach to the artillery target assignment problem,” presented at the 25th International Symposium on Computer and Information Sciences, 2010, Accessed: 00, 2020. [Online]. Available: https://hdl.handle.net/11511/57611.