Sciweavers

8413 search results - page 176 / 1683
» Ordering Problem Subgoals
Sort
View
ARCS
2004
Springer
14 years 4 months ago
Ant Colony Optimization for dynamic Traveling Salesman Problems
: This paper addresses the optimization of a dynamic Traveling Salesman Problem using the Ant Colony Optimization algorithm. Ants are social insects with limited skills that live i...
Carlos A. Silva, Thomas A. Runkler
GECCO
2004
Springer
14 years 4 months ago
How to Overcome the Equivalent Mutant Problem and Achieve Tailored Selective Mutation Using Co-evolution
The use of Genetic Algorithms in evolution of mutants and test cases offers new possibilities in addressing some of the main problems of mutation testing. Most specifically the p...
Konstantinos Adamopoulos, Mark Harman, Robert M. H...
ICCSA
2003
Springer
14 years 4 months ago
A Comparison Study of Modern Heuristics for Solving the Partitioning Problem in Distributed Virtual Environment Systems
Fast Internet connections and the widespread use of high performance graphic cards are making Distributed Virtual Environment (DVE) systems very common nowadays. However, there are...
Pedro Morillo, Marcos Fernández, Juan M. Or...
SETN
2010
Springer
14 years 2 months ago
Genetic Algorithm Solution to Optimal Sizing Problem of Small Autonomous Hybrid Power Systems
The optimal sizing of a small autonomous hybrid power system can be a very challenging task, due to the large number of design settings and the uncertainty in key parameters. This ...
Yiannis A. Katsigiannis, Pavlos S. Georgilakis, Em...
EVOW
2008
Springer
14 years 15 days ago
Efficient Local Search Limitation Strategies for Vehicle Routing Problems
In this paper we examine five different strategies for limiting the local search neighborhoods in the context of vehicle routing problems. The vehicle routing problem deals with th...
Yuichi Nagata, Olli Bräysy