Show/Hide Menu
Hide/Show Apps
Logout
Türkçe
Türkçe
Search
Search
Login
Login
OpenMETU
OpenMETU
About
About
Open Science Policy
Open Science Policy
Communities & Collections
Communities & Collections
Help
Help
Frequently Asked Questions
Frequently Asked Questions
Guides
Guides
Thesis submission
Thesis submission
MS without thesis term project submission
MS without thesis term project submission
Publication submission with DOI
Publication submission with DOI
Publication submission
Publication submission
Supporting Information
Supporting Information
General Information
General Information
Copyright, Embargo and License
Copyright, Embargo and License
Contact us
Contact us
Artillery target assignment problem with time dimension
Download
index.pdf
Date
2008
Author
Sapaz, Burçin
Metadata
Show full item record
Item Usage Stats
134
views
32
downloads
Cite This
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 the problem which reflects subproblems of the main problem. These sub-problems are investigated for possible solutions. For two of these sub-problems, genetic algorithm solutions with customized representations and genetic operators are developed. Experiments of these solutions and related results are presented in this thesis.
Subject Keywords
Computer engineering.
,
Computer hardware.
URI
http://etd.lib.metu.edu.tr/upload/12610273/index.pdf
https://hdl.handle.net/11511/18333
Collections
Graduate School of Natural and Applied Sciences, Thesis
Suggestions
OpenMETU
Core
Genetic algorithm for personnel assignment problem with multiple objectives
Arslanoğlu, Yılmaz; Toroslu, İsmail Hakkı; Department of Computer Engineering (2006)
This thesis introduces a multi-objective variation of the personnel assignment problem, by including additional hierarchical and team constraints, which put restrictions on possible matchings of the bipartite graph. Besides maximization of summation of weights that are assigned to the edges of the graph, these additional constraints are also treated as objectives which are subject to minimization. In this work, different genetic algorithm approaches to multi-objective optimization are considered to solve th...
Performance analysis of a power aware routing protocol for ad hoc networks
Yazıcı, Mehmet Akif; Bilgen, Semih; Department of Electrical and Electronics Engineering (2006)
In this thesis, performance of the Contribution Reward Routing Protocol with Shapley Value (CAP-SV), a power-aware routing protocol for ad hoc networking is analyzed. Literature study on ad hoc network routing and ower-awareness is given. The overhead induced by the extra packets of the redirection mechanism of CAP-SV is formulized and the factors affecting this overhead are discussed. Then, the power consumption of CAP-SV is analytically analized using a linear power consumption model. It is shown that CAP...
A genetic algorithm approach to the artillery target assignment problem
Sapaz, Burçin; Toroslu, İsmail Hakkı; Üçoluk, Göktürk (2010-11-12)
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. ©...
Design and implementation of a plug-in framework for distributed object technologies
Kadıoğlu, Koray; Doğru, Ali Hikmet; Department of Computer Engineering (2006)
This thesis presents a framework design and implementation that enables run-time selection of different remote call mechanisms. In order to implement an extendable and modular system with run-time upgrading facility, a plug-in framework design is used. Since such a design requires enhanced usage of run-time facilities of the programming language that is used to implement the framework, in this study Java is selected because of its reflection and dynamic class loading facilities. A sample usage of this frame...
Generating motion-economical plans for manual operations
Canan, Özgen; Birtürk, Ayşe Nur; Department of Computer Engineering (2005)
This thesis discusses applying AI planning tools for generating plans for manual operations. Expertise of motion economy domain is used to select good plans among feasible ones. Motion economy is a field of industrial engineering, which deals with observing, reporting and improving manual operations. Motion economy knowledge is organized in principles regarding the sequences and characteristics of motions, arrangement of workspace, design of tools etc. A representation scheme is developed for products, work...
Citation Formats
IEEE
ACM
APA
CHICAGO
MLA
BibTeX
B. Sapaz, “Artillery target assignment problem with time dimension,” M.S. - Master of Science, Middle East Technical University, 2008.