Sciweavers

269 search results - page 23 / 54
» Optimal Randomized Algorithms for Local Sorting and Set-Maxi...
Sort
View
HIS
2009
13 years 5 months ago
On Some Properties of the lbest Topology in Particle Swarm Optimization
: Particle Swarm Optimization (PSO) is arguably one of the most popular nature- inspired algorithms for real parameter optimization at present. The existing theoretical research on...
Sayan Ghosh, Debarati Kundu, Kaushik Suresh, Swaga...
TSMC
1998
78views more  TSMC 1998»
13 years 7 months ago
Automata learning and intelligent tertiary searching for stochastic point location
—Consider the problem of a robot (learning mechanism or algorithm) attempting to locate a point on a line. The mechanism interacts with a random environment which essentially inf...
B. John Oommen, Govindachari Raghunath
EOR
2010
116views more  EOR 2010»
13 years 7 months ago
Speeding up continuous GRASP
Continuous GRASP (C-GRASP) is a stochastic local search metaheuristic for finding cost-efficient solutions to continuous global optimization problems subject to box constraints (Hi...
Michael J. Hirsch, Panos M. Pardalos, Mauricio G. ...
GECCO
2006
Springer
187views Optimization» more  GECCO 2006»
13 years 11 months ago
The gregarious particle swarm optimizer (G-PSO)
This paper presents a gregarious particle swarm optimization algorithm (G-PSO) in which the particles explore the search space by aggressively scouting the local minima with the h...
Srinivas Pasupuleti, Roberto Battiti
COR
2008
111views more  COR 2008»
13 years 7 months ago
An optimization algorithm for the inventory routing problem with continuous moves
The typical inventory routing problem deals with the repeated distribution of a single product from a single facility with an unlimited supply to a set of customers that can all b...
Martin W. P. Savelsbergh, Jin-Hwa Song