Sciweavers

895 search results - page 76 / 179
» An Indirect Genetic Algorithm for Set Covering Problems
Sort
View
TASE
2010
IEEE
14 years 5 months ago
Coverage of a Planar Point Set With Multiple Robots Subject to Geometric Constraints
This paper focuses on the assignment of discrete points among K robots and determining the order in which the points should be processed by the robots, in the presence of geometric...
Nilanjan Chakraborty, Srinivas Akella, John T. Wen
EOR
2002
99views more  EOR 2002»
14 years 11 months ago
Network cost minimization using threshold-based discounting
We present a genetic algorithm for heuristically solving a cost minimization problem applied to communication networks with threshold based discounting. The network model assumes t...
Hrvoje Podnar, Jadranka Skorin-Kapov, Darko Skorin...
MONET
2008
85views more  MONET 2008»
14 years 11 months ago
Population Adaptation for Genetic Algorithm-based Cognitive Radios
Genetic algorithms are best suited for optimization problems involving large search spaces. The problem space encountered when optimizing the transmission parameters of an agile or...
Timothy R. Newman, Rakesh Rajbanshi, Alexander M. ...
ESWA
2010
105views more  ESWA 2010»
14 years 8 months ago
A numerical comparison between simulated annealing and evolutionary approaches to the cell formation problem
The Cell Formation Problem is a crucial component of a cell production design in a manufacturing system. This problem consists of a set of product parts to be manufactured in a gr...
Andres Pailla, Athila R. Trindade, Victor Parada, ...
IPCO
2007
108views Optimization» more  IPCO 2007»
15 years 14 days ago
Robust Combinatorial Optimization with Exponential Scenarios
Following the well-studied two-stage optimization framework for stochastic optimization [15, 18], we study approximation algorithms for robust two-stage optimization problems with ...
Uriel Feige, Kamal Jain, Mohammad Mahdian, Vahab S...