Sciweavers

16404 search results - page 462 / 3281
» A set coverage problem
Sort
View
ICNC
2009
Springer
15 years 11 months ago
Vehicle Routing Problem with Time Windows: A Hybrid Particle Swarm Optimization Approach
Vehicle routing problem (VRP) is a well-known combinatorial optimization and nonlinear programming problem seeking to service a number of customers with a fleet of vehicles. This ...
Xiaoxiang Liu, Weigang Jiang, Jianwen Xie
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
CEC
2007
IEEE
15 years 10 months ago
An ant system with steps counter for the job shop scheduling problem
In this paper, we present an ant system algorithm variant designed to solve the job shop scheduling problem. The proposed approach is based on a recent biological study which showe...
Emanuel Tellez-Emiquez, Efrén Mezura-Montes...
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
AAAI
2007
15 years 9 months ago
Restart Schedules for Ensembles of Problem Instances
The mean running time of a Las Vegas algorithm can often be dramatically reduced by periodically restarting it with a fresh random seed. The optimal restart schedule depends on th...
Matthew J. Streeter, Daniel Golovin, Stephen F. Sm...