Genetic algorithm for personnel assignment problem with multiple objectives

Download

index.pdf

Date

2006

Author

Arslanoğlu, Yılmaz

Metadata

Show full item record

Item Usage Stats

208
views

139
downloads

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 the problem. Weighted Sum ا a classical approach, VEGA - a non-elitist multi-objective evolutionary algorithm, and SPEA ا a popular elitist multi-objective evolutionary algorithm, are considered as means of solution to the problem, and their performances are compared with respect to a number of multi-objective optimization criteria.

Subject Keywords

Electronic computers.

URI

http://etd.lib.metu.edu.tr/upload/12606880/index.pdf
https://hdl.handle.net/11511/15589

Collections

Graduate School of Natural and Applied Sciences, Thesis

Suggestions

OpenMETU
Core

New montgomery modular multıplier architecture Çiftçibaşı, Mehmet Emre; Yücel, Melek D; Department of Electrical and Electronics Engineering (2005) This thesis is the real time implementation of the new, unified field, dualا radix Montgomery modular multiplier architecture presented by Savaş et al, for performance comparison with standard Montgomery multiplication algorithms. The unified field architecture operates in both GF(p) and GF(2n). The dual radix capability enables processing of two bits of the multiplier in every clock cycle in GF(2n) mode, while one bit of the multiplier is processed in GF(p) mode. The new architecture is implemented in a Xi...
Assignment problem and its variations Gülek, Mehmet; Toroslu, İsmail Hakkı; Department of Computer Engineering (2007) We investigate the assignment problem, which is the problem of matching two sets with each other, optimizing a given function on the possible matchings. Among different definitions, a graph theoretical definition of the linear sum assignment problem is as follows: Given a weighted complete bipartite graph, find a maximum (or minimum) one-to-one matching between the two equal-size sets of the graph, where the score of a matching is the total weight of the matched edges. We investigate extensions and variatio...
Architecture specification of service-oriented systems through semantic web technologies Biçer, Veli; Doğru, Ali Hikmet; Department of Computer Engineering (2007) This thesis presents a semantic-based modeling approach for describing Service-Oriented Architectures (SOA). Ontologies are utilized as a major representation mechanism for describing various elements available in the architecture. The methodology proposes an architecture specification mechanism to constuct a unified ontology that enables transition from design concerns to the modeling elements. A multi-level modeling is also achieved by employing Model-Driven Engineering (MDE) techniques to describe variou...
On an architecture for a parallel finite field multiplier with low complexity based on composite fields Kındap, Nihal; Özbudak, Ferruh; Department of Cryptography (2004) In this thesis, a bit parallel architecture for a parallel finite field multiplier with low complexity in composite fields GF((2n)m) with k = n · m (k 32) is investigated. The architecture has lower complexity when the Karatsuba-Ofman algorithm is applied for certain k. Using particular primitive polynomials for composite fields improves the complexities. We demonstrated for the values m = 2, 4, 8 in details. This thesis is based on the paper أA New Architecture for a Parallel Finite Field Multiplier with ...
Analysis of extended feature models with constraint programming Karataş, Ahmet Serkan; Oğuztüzün, Mehmet Halit S.; Department of Computer Engineering (2010) In this dissertation we lay the groundwork of automated analysis of extended feature models with constraint programming. Among different proposals, feature modeling has proven to be very effective for modeling and managing variability in Software Product Lines. However, industrial experiences showed that feature models often grow too large with hundreds of features and complex cross-tree relationships, which necessitates automated analysis support. To address this issue we present a mapping from extended fe...

Citation Formats

Y. Arslanoğlu, “Genetic algorithm for personnel assignment problem with multiple objectives,” M.S. - Master of Science, Middle East Technical University, 2006.