Sciweavers

92 search results - page 15 / 19
» Evolving heuristically difficult instances of combinatorial ...
Sort
View
CEC
2010
IEEE
14 years 1 months ago
A hybrid genetic algorithm for rescue path planning in uncertain adversarial environment
— Efficient vehicle path planning in hostile environment to carry out rescue or tactical logistic missions remains very challenging. Most approaches reported so far relies on key...
Jean Berger, Khaled Jabeur, Abdeslem Boukhtouta, A...
IJHPCA
2006
99views more  IJHPCA 2006»
14 years 9 months ago
A Pragmatic Analysis Of Scheduling Environments On New Computing Platforms
Today, large scale parallel systems are available at relatively low cost. Many powerful such systems have been installed all over the world and the number of users is always incre...
Lionel Eyraud
GECCO
2005
Springer
139views Optimization» more  GECCO 2005»
15 years 3 months ago
A genetic algorithm for unmanned aerial vehicle routing
Genetic Algorithms (GAs) can efficiently produce high quality results for hard combinatorial real world problems such as the Vehicle Routing Problem (VRP). Genetic Vehicle Represe...
Matthew A. Russell, Gary B. Lamont
GECCO
2008
Springer
179views Optimization» more  GECCO 2008»
14 years 10 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...
TSMC
2010
14 years 4 months ago
Optimizing Discounted Cash Flows in Project Scheduling - An Ant Colony Optimization Approach
Abstract--The multimode resource-constrained projectscheduling problem with discounted cash flows (MRCPSPDCF) is important and challenging for project management. As the problem is...
Wei-neng Chen, Jun Zhang, Henry Shu-Hung Chung, Ru...