Sciweavers

38 search results - page 3 / 8
» Local search for multiobjective function optimization: paret...
Sort
View
EOR
2006
148views more  EOR 2006»
13 years 7 months ago
Pareto ant colony optimization with ILP preprocessing in multiobjective project portfolio selection
One of the most important, common and critical management issues lies in determining the "best" project portfolio out of a given set of investment proposals. As this dec...
Karl F. Doerner, Walter J. Gutjahr, Richard F. Har...
SCIA
2009
Springer
161views Image Analysis» more  SCIA 2009»
14 years 2 months ago
A Fast Optimization Method for Level Set Segmentation
Abstract. Level set methods are a popular way to solve the image segmentation problem in computer image analysis. A contour is implicitly represented by the zero level of a signed ...
Thord Andersson, Gunnar Läthén, Reiner...
GECCO
2008
Springer
186views Optimization» more  GECCO 2008»
13 years 8 months ago
A pareto following variation operator for fast-converging multiobjective evolutionary algorithms
One of the major difficulties when applying Multiobjective Evolutionary Algorithms (MOEA) to real world problems is the large number of objective function evaluations. Approximate...
A. K. M. Khaled Ahsan Talukder, Michael Kirley, Ra...
CEC
2007
IEEE
14 years 1 months ago
Indicator-based multi-objective local search
— This paper presents a simple and generic indicator-based multi-objective local search. This algorithm is a direct extension of the IBEA algorithm, an indicatorbased evolutionar...
Matthieu Basseur, Edmund K. Burke
GECCO
2004
Springer
101views Optimization» more  GECCO 2004»
14 years 27 days ago
A Novel Multi-objective Orthogonal Simulated Annealing Algorithm for Solving Multi-objective Optimization Problems with a Large
In this paper, a novel multi-objective orthogonal simulated annealing algorithm MOOSA using a generalized Pareto-based scale-independent fitness function and multi-objective intell...
Li-Sun Shu, Shinn-Jang Ho, Shinn-Ying Ho, Jian-Hun...