16504 search results - page 6 / 3301 » New Problems, New Solutions |
117
Voted
IDA
2005
Springer
15 years 7 months ago
2005
Springer
In this paper we introduce a simple ant based algorithm for solving a copper mine planning problem. In the last 10 years this realworld problem has been tackled using linear intege...
132
Voted
JAMDS
2002
15 years 1 months ago
2002
We propose a new heuristic for the solution of the quadratic assignment problem. The heuristic combines ideas from tabu search and genetic algorithms. Run times are very short comp...
110
Voted
EUROCAST
2009
Springer
15 years 8 months ago
2009
Springer
In this paper we present new local search algorithms for the Probabilistic Traveling Salesman Problem (PTSP) using sampling and ad-hoc approximation. These algorithms improve both...
87
Voted
ISICA
2007
Springer
15 years 8 months ago
2007
Springer
In this paper the authors point out that the Pareto Optimality is unfair, unreasonable and imperfect for Many-objective Optimization Problems (MOPs) underlying the hypothesis that ...
86
Voted
GECCO
2004
Springer
15 years 7 months ago
2004
Springer
In this paper, a new genetic mating scheme called Controlled Content Crossover (CCC) is proposed and applied to solve the optical network component allocation problem. In order to ...