Sciweavers

231 search results - page 35 / 47
» Dispersion-Based Population Initialization
Sort
View
COMPSAC
2000
IEEE
14 years 24 days ago
GAPS: A Genetic Programming System
Genetic programming tackles the issue of how to automatically create a working computer program for a given problem from some initial problem statement. The goal is accomplished i...
Michael D. Kramer, Du Zhang
IPPS
1998
IEEE
14 years 19 days ago
A Comparative Study of Five Parallel Genetic Algorithms Using the Traveling Salesman Problem
Parallel genetic algorithms (PGAs) have been developed to reduce the large execution times that are associated with serial genetic algorithms (SGAs). They have also been used to s...
Lee Wang, Anthony A. Maciejewski, Howard Jay Siege...
EMO
2006
Springer
122views Optimization» more  EMO 2006»
14 years 2 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
2006
Springer
188views Optimization» more  GECCO 2006»
14 years 1 days ago
Dynamic multi-objective optimization with evolutionary algorithms: a forward-looking approach
This work describes a forward-looking approach for the solution of dynamic (time-changing) problems using evolutionary algorithms. The main idea of the proposed method is to combi...
Iason Hatzakis, David Wallace
GECCO
2006
Springer
170views Optimization» more  GECCO 2006»
14 years 1 days ago
Combining simplex with niche-based evolutionary computation for job-shop scheduling
We propose a hybrid algorithm (called ALPINE) between Genetic Algorithm and Dantzig's Simplex method to approximate optimal solutions for the Flexible Job-Shop Problem. Local...
Syhlin Kuah, Joc Cing Tay