Sciweavers

244 search results - page 41 / 49
» Chemical-Reaction-Inspired Metaheuristic for Optimization
Sort
View
HM
2007
Springer
155views Optimization» more  HM 2007»
13 years 11 months ago
A Hybrid ILS Heuristic to the Referee Assignment Problem with an Embedded MIP Strategy
Optimization in sports is a field of increasing interest. A novel problem in sports management is the Referee Assignment Problem, in which a limited number of referees with differe...
Alexandre R. Duarte, Celso C. Ribeiro, Sebasti&aac...
FLAIRS
2006
13 years 8 months ago
Which Dynamic Constraint Problems Can Be Solved By Ants?
There exist a number of algorithms that can solve dynamic constraint satisfaction/optimization problems (DynCSPs or DynCOPs). Because of the large variety in the characteristics o...
Koenraad Mertens, Tom Holvoet, Yolande Berbers
GECCO
2008
Springer
179views Optimization» more  GECCO 2008»
13 years 8 months ago
A hybrid method for tuning neural network for time series forecasting
This paper presents an study about a new Hybrid method GRASPES - for time series prediction, inspired in F. Takens theorem and based on a multi-start metaheuristic for combinatori...
Aranildo Rodrigues Lima Junior, Tiago Alessandro E...
CN
2007
148views more  CN 2007»
13 years 7 months ago
Using taxonomies for content-based routing with ants
Although the ant metaphor has been successfully applied to routing of data packets both in wireless and fixed networks, little is known yet about its appropriateness for search i...
Elke Michlmayr, Arno Pany, Gerti Kappel
CEC
2010
IEEE
13 years 5 months ago
The one-commodity traveling salesman problem with selective pickup and delivery: An ant colony approach
We introduce a novel combinatorial optimization problem: the one-commodity traveling salesman problem with selective pickup and delivery (1-TSP-SELPD), characterized by the fact th...
Rafael Falcón, Xu Li, Amiya Nayak, Ivan Sto...