1310 search results - page 119 / 262 » A parallel genetic algorithm to solve the set-covering probl... |
EC
2000
14 years 9 months ago
2000
Solving optimization problems with multiple (often conflicting) objectives is, generally, a very difficult goal. Evolutionary algorithms (EAs) were initially extended and applied ...
113
click to vote
GECCO
2009
Springer
15 years 4 months ago
2009
Springer
We revisit the roots of Genetic Programming (i.e. Natural Evolution), and conclude that the mechanisms of the process of evolution (i.e. selection, inheritance and variation) are ...
PPSN
2004
Springer
15 years 3 months ago
2004
Springer
Abstract. We introduce the concept of fruitful regions in a dynamic routing context: regions that have a high potential of generating loads to be transported. The objective is to m...
GECCO
2007
Springer
15 years 4 months ago
2007
Springer
The problem of production and delivery lot-sizing and scheduling of set of items in a two-echelon supply chain over a finite planning horizon is addressed in this paper. A single ...
116
click to vote
EOR
2007
14 years 10 months ago
2007
Crew scheduling problems at the planning level are typically solved in two steps: first, creating working patterns, and then assigning these to individual crew. The first step is ...