Adaptation and Fine-Tuning of the Weighted Sum Method on Personnel Assignment Problem with Hierarchical Ordering and Team Constraints

Date

2011-09-28

Author

Arslanoglu, Yilmaz
Toroslu, İsmail Hakkı

Metadata

Show full item record

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

Item Usage Stats

225
views

0
downloads

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 parameters are discussed in this paper.

Subject Keywords

Genetic algorithm

URI

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

DOI

https://doi.org/10.1007/978-1-4471-2155-8_73

Collections

Department of Computer Engineering, Conference / Seminar

Suggestions

OpenMETU
Core

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. ©...
Using genetic algorithms for single-machine bicriteria scheduling problems Köksalan, Mustafa Murat; Keha, AB (2003-03-16) We consider two bicriteria scheduling problems on a single machine: minimizing flowtime and number of tardy jobs, and minimizing flowtime and maximum earliness. Both problems are known to be NP-hard. For the first problem, we developed a heuristic that produces an approximately efficient solution (AES) for each possible value the number of tardy jobs can take over the set of efficient solutions. We developed a genetic algorithm (GA) that further improves the AESs. We then adapted the GA for the second probl...
Hybrid heuristic algorithms for the multi objective load balancing of 2D bin packing problems Muhammet, Beyaz; Dökeroğlu, Tansel; Coşar, Ahmet (null; 2015-09-23) 2D Bin packing problem (2DBPP) is an NP-hard combinatorial optimization problem. Multiobjective versions of this well-known industrial engineering problem can occur frequently in real world application. Recently, Hybrid Evolutionary Algorithms have appear as a new area of research with their ability to combine alternative heuristics and local search mechanisms together for higher quality solutions. In this study, we propose a set of novel multiobjective hybrid genetic and memetic algorithms that make use of...
Optimization of the array geometry for direction finding Özaydın, Seval; Koç, Seyit Sencer; Tanık, Yalçın; Department of Electrical and Electronics Engineering (2003) In this thesis, optimization of the geometry of non-uniform arrays for direction finding yielding unambiguous results is studied. A measure of similarity between the array response vectors is defined. In this measure, the effects of antenna array geometry, source placements and antenna gains are included as variable parameters. Then, assuming that the antenna gains are known and constant, constraints on the similarity function are developed and described to result in unambiguous configurations and maximum r...
Integrating multi-period quantity flexibility contracts with a capacitated production and inventory planning Kayhan, Mehmet; Kayalıgil, Sinan; Department of Industrial Engineering (2008) This research introduces a general approach for integrating a probabilistic model of the changes in the committed orders with an analytical model of production and inventory planning under multi-period Quantity Flexibility contracts. We study a decentralized structure where a capacitated manufacturer, capable of subcontracting, serves multiple contract buyers who actually perform forecasts on a rolling horizon basis. We model the evolution of buyers' commitments as a multiplicative forecast evolution proces...

Citation Formats

Y. Arslanoglu and İ. H. Toroslu, “Adaptation and Fine-Tuning of the Weighted Sum Method on Personnel Assignment Problem with Hierarchical Ordering and Team Constraints,” 2011, Accessed: 00, 2020. [Online]. Available: https://hdl.handle.net/11511/34693.