Sciweavers

14548 search results - page 317 / 2910
» The Optimal Path-Matching Problem
Sort
View
GECCO
1999
Springer
145views Optimization» more  GECCO 1999»
15 years 11 months ago
Three Ways to Grow Designs: A Comparison of Embryogenies for an Evolutionary Design Problem
This paper explores the use of growth processes, or embryogenies, to map genotypes to phenotypes within evolutionary systems. Following a summary of the significant features of em...
Peter J. Bentley, Sanjeev Kumar
GECCO
2006
Springer
282views Optimization» more  GECCO 2006»
15 years 10 months ago
A genetic algorithm for the longest common subsequence problem
A genetic algorithm for the longest common subsequence problem encodes candidate sequences as binary strings that indicate subsequences of the shortest or first string. Its fitnes...
Brenda Hinkemeyer, Bryant A. Julstrom
GECCO
2000
Springer
225views Optimization» more  GECCO 2000»
15 years 10 months ago
Solving Large Binary Quadratic Programming Problems by Effective Genetic Local Search Algorithm
A genetic local search (GLS) algorithm, which is a combination technique of genetic algorithm and local search, for the unconstrained binary quadratic programming problem (BQP) is...
Kengo Katayama, Masafumi Tani, Hiroyuki Narihisa
EOR
2006
78views more  EOR 2006»
15 years 6 months ago
A hybrid multistart heuristic for the uncapacitated facility location problem
We present a multistart heuristic for the uncapacitated facility location problem, based on a very successful method we originally developed for the p-median problem. We show exte...
Mauricio G. C. Resende, Renato Fonseca F. Werneck
ENGL
2007
121views more  ENGL 2007»
15 years 6 months ago
A Comparison between Genetic Algorithms and Evolutionary Programming based on Cutting Stock Problem
—Genetic Algorithms (GA) and Evolutionary Programming (EP) are two well-known optimization methods that belong to the class of Evolutionary Algorithms (EA). Both methods have gen...
Raymond Chiong, Ooi Koon Beng