2244 search results - page 3 / 449 » A new heuristic approach for non-convex optimization problem... |
GECCO
2011
Springer
12 years 11 months ago
2011
Springer
The generalized traveling salesman problem (GTSP) is an NPhard problem that extends the classical traveling salesman problem by partitioning the nodes into clusters and looking fo...
Publication
Hyper-heuristics are new approaches which aim at raising the level of abstraction when solving combinatorial optimisation problems. In this paper we introduce a new hyper-heuristi...
HM
2010
Springer
13 years 8 months ago
2010
Springer
Dynamic Resource-Constrained Project Scheduling Problem (DRCPSP) is a scheduling problem that works with an uncommon kind of resources: the Dynamic Resources. They increase and dec...
INFORMATICALT
2002
13 years 7 months ago
2002
Abstract. Real life scheduling problems are solved by heuristics with parameters defined by experts, as usual. In this paper a new approach is proposed where the parameters of vari...
IWANN
2001
Springer
13 years 11 months ago
2001
Springer
This paper looks upon the standard genetic algorithm as an artificial self-organizing process. With the purpose to provide concepts that make the algorithm more open for scalabili...