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
Open Access Guideline
Open Access Guideline
Postgraduate Thesis Guideline
Postgraduate Thesis Guideline
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
A Favorable Weight-Based Evolutionary Algorithm for Multiple Criteria Problems
Date
2010-04-01
Author
SOYLU, Banu
Köksalan, Mustafa Murat
Metadata
Show full item record
This work is licensed under a
Creative Commons Attribution-NonCommercial-NoDerivatives 4.0 International License
.
Item Usage Stats
181
views
0
downloads
Cite This
In this paper, we present a favorable weight-based evolutionary algorithm for multiple criteria problems. The algorithm tries to both approximate the Pareto frontier and evenly distribute the solutions over the frontier. These two goals are common for many multiobjective evolutionary algorithms. To achieve these goals in our algorithm, each member selects its own weights for a weighted Tchebycheff distance function to define its fitness score. The fitness scores favor solutions that are closer to the Pareto frontier and that are located at underrepresented regions. We compare the performance of the algorithm with two leading evolutionary algorithms on various continuous test problems having different number of criteria.
Subject Keywords
Theoretical Computer Science
,
Computational Theory and Mathematics
,
Software
URI
https://hdl.handle.net/11511/57962
Journal
IEEE TRANSACTIONS ON EVOLUTIONARY COMPUTATION
DOI
https://doi.org/10.1109/tevc.2009.2027357
Collections
Department of Industrial Engineering, Article
Suggestions
OpenMETU
Core
Genetic algorithm solution of the TSP avoiding special crossover and mutation
Üçoluk, Göktürk (Computers, Materials and Continua (Tech Science Press), 2002-01-01)
Ordinary representations of permutations in Genetic Algorithms (GA) is handicapped with producing offspring which are not permutations at all. The conventional solution for crossover and mutation operations of permutations is to device 'special' operators. Unfortunately these operators suffer from violating the nature of crossover. Namely, considering the gene positions on the chromosome, these methods do not allow n-point crossover techniques which are known to favour building-block formations. In this wor...
A Probabilistic approach to sparse multi scale phase based stereo
ULUSOY PARNAS, İLKAY; Halıcı, Uğur; HANCOCK, EDWIN (2004-04-30)
In this study, a multi-scale phase based sparse disparity algorithm and a probabilistic model for matching are proposed. The disparity algorithm and the probabilistic approach are verified on various stereo image pairs.
A DRBEM approximation of the Steklov eigenvalue problem
Türk, Önder (Elsevier BV, 2021-01-01)
In this study, we propose a novel approach based on the dual reciprocity boundary element method (DRBEM) to approximate the solutions of various Steklov eigenvalue problems. The method consists in weighting the governing differential equation with the fundamental solutions of the Laplace equation where the definition of interior nodes is not necessary for the solution on the boundary. DRBEM constitutes a promising tool to characterize such problems due to the fact that the boundary conditions on part or all...
The static stochastic knapsack problem with normally distributed item sizes
Merzifonluoglu, Yasemin; Geunes, Joseph; Romeijn, H. Edwin (Springer Science and Business Media LLC, 2012-09-01)
This paper develops exact and heuristic algorithms for a stochastic knapsack problem where items with random sizes may be assigned to a knapsack. An item's value is given by the realization of the product of a random unit revenue and the random item size. When the realization of the sum of selected item sizes exceeds the knapsack capacity, a penalty cost is incurred for each unit of overflow, while our model allows for a salvage value for each unit of capacity that remains unused. We seek to maximize the ex...
A nested iterative scheme for computation of incompressible flows in long domains
Manguoğlu, Murat; Tezduyar, Tayfun E.; Sathe, Sunil (Springer Science and Business Media LLC, 2008-12-01)
We present an effective preconditioning technique for solving the nonsymmetric linear systems encountered in computation of incompressible flows in long domains. The application category we focus on is arterial fluid mechanics. These linear systems are solved using a nested iterative scheme with an outer Richardson scheme and an inner iteration that is handled via a Krylov subspace method. Test computations that demonstrate the robustness of our nested scheme are presented.
Citation Formats
IEEE
ACM
APA
CHICAGO
MLA
BibTeX
B. SOYLU and M. M. Köksalan, “A Favorable Weight-Based Evolutionary Algorithm for Multiple Criteria Problems,”
IEEE TRANSACTIONS ON EVOLUTIONARY COMPUTATION
, pp. 191–205, 2010, Accessed: 00, 2020. [Online]. Available: https://hdl.handle.net/11511/57962.