Multi-objective combinatorial optimization using evolutionary algorithms

Download

index.pdf

Date

2009

Author

Özsayın, Burcu

Metadata

Show full item record

Item Usage Stats

252
views

251
downloads

Due to the complexity of multi-objective combinatorial optimization problems (MOCO), metaheuristics like multi-objective evolutionary algorithms (MOEA) are gaining importance to obtain a well-converged and well-dispersed Pareto-optimal frontier approximation. In this study, of the well-known MOCO problems, single-dimensional multi-objective knapsack problem and multi-objective assignment problem are taken into consideration. We develop a steady-state and elitist MOEA in order to approximate the Pareto-optimal frontiers. We utilize a territory concept in order to provide diversity over the Pareto-optimal frontiers of various problem instances. The motivation behind the territory definition is to attach the algorithm the advantage of fast execution by eliminating the need for an explicit diversity preserving operator. We also develop an interactive preference incorporation mechanism to converge to the regions that are of special interest for the decision maker by interacting with him/her during the optimization process.

Subject Keywords

Industrial engineering., Interactive Method .

URI

http://etd.lib.metu.edu.tr/upload/2/12610866/index.pdf
https://hdl.handle.net/11511/18748

Collections

Graduate School of Natural and Applied Sciences, Thesis

Suggestions

OpenMETU
Core

Galois structure of modular forms of even weight Gurel, E. (Elsevier BV, 2009-10-01) We calculate the equivariant Euler characteristics of powers of the canonical sheaf on certain modular curves over Z which have a tame action of a finite abelian group. As a consequence, we obtain information on the Galois module structure of modular forms of even weight having Fourier coefficients in certain ideals of rings of cyclotomic algebraic integers. (c) 2009 Elsevier Inc. All rights reserved.
Application of genetic algorithms to geometry optimization of microclusters: A comparative study of empirical potential energy functions for silicon Erkoc, S; Leblebicioğlu, Mehmet Kemal; Halıcı, Uğur (Informa UK Limited, 2003-01-01) Evolutionary computation techniques (in particular, genetic algorithms) have been applied to optimize the structure of microclusters. Various empirical potential energy functions have been used to describe the interactions among the atoms in the clusters. A comparative study of silicon microclusters has been performed.
Stochastic modelling of biochemical networks and inference of modelparameters Purutçuoğlu Gazi, Vilda (null, Springer, 2018-01-01) There are many approaches to model the biochemical systems deterministically or stochastically. In deterministic approaches, we aim to describe the steady-state behaviours of the system, whereas, under stochastic models, we present the random nature of the system, for instance, during transcription or translation processes. Here, we represent the stochastic modelling approaches of biological networks and explain in details the inference of the model parameters within the Bayesian framework.
Implementation Studies of Robot Swarm Navigation Using Potential Functions and Panel Methods Merheb, Abdel-Razzak; GAZİ, VEYSEL; Sezer Uzol, Nilay (2016-10-01) This paper presents a practical swarm navigation algorithm based on potential functions and properties of inviscid incompressible flows. Panel methods are used to solve the flow equations around complex shaped obstacles and to generate the flowlines, which provide collision-free paths to the goal position. Safe swarm navigation is achieved by following the generated streamlines. Potential functions are used to achieve and maintain group cohesion or a geometric formation during navigation. The algorithm is i...
Value sets of Lattes maps over finite fields Küçüksakallı, Ömer (Elsevier BV, 2014-10-01) We give an alternative computation of the value sets of Dickson polynomials over finite fields by using a singular cubic curve. Our method is not only simpler but also it can be generalized to the non-singular elliptic case. We determine the value sets of Lattes maps over finite fields which are rational functions induced by isogenies of elliptic curves with complex multiplication.

Citation Formats

B. Özsayın, “Multi-objective combinatorial optimization using evolutionary algorithms,” M.S. - Master of Science, Middle East Technical University, 2009.