Sciweavers

331 search results - page 46 / 67
» Initial Population for Genetic Algorithms: A Metric Approach
Sort
View
GECCO
2007
Springer
158views Optimization» more  GECCO 2007»
14 years 15 days ago
A GP neutral function for the artificial ANT problem
This paper introduces a function that increases the amount of neutrality (inactive code in Genetic Programming) for the Artificial Ant Problem. The objective of this approach is t...
Esteban Ricalde, Katya Rodríguez-Váz...
EOR
2007
76views more  EOR 2007»
13 years 8 months ago
Multicriteria tour planning for mobile healthcare facilities in a developing country
A multiobjective combinatorial optimization (MOCO) formulation for the following location-routing problem in healthcare management is given: For a mobile healthcare facility, a cl...
Karl Doerner, Axel Focke, Walter J. Gutjahr
EMO
2006
Springer
122views Optimization» more  EMO 2006»
14 years 9 days ago
Substitute Distance Assignments in NSGA-II for Handling Many-objective Optimization Problems
Many-objective optimization refers to optimization problems with a number of objectives considerably larger than two or three. In this paper, a study on the performance of the Fast...
Mario Köppen, Kaori Yoshida
GECCO
2003
Springer
14 years 1 months ago
Methods for Evolving Robust Programs
Many evolutionary computation search spaces require fitness assessment through the sampling of and generalization over a large set of possible cases as input. Such spaces seem par...
Liviu Panait, Sean Luke
RSS
2007
134views Robotics» more  RSS 2007»
13 years 10 months ago
A Fast and Practical Algorithm for Generalized Penetration Depth Computation
— We present an efficient algorithm to compute the generalized penetration depth (PDg) between rigid models. Given two overlapping objects, our algorithm attempts to compute the...
Liangjun Zhang, Young J. Kim, Dinesh Manocha