895 search results - page 84 / 179 » An Indirect Genetic Algorithm for Set Covering Problems |
ENDM
2006
14 years 11 months ago
2006
We consider a dynamic planning problem for paratransit transportation. The focus is on a decision to take one day ahead: which requests to serve with own vehicles, and which reque...
EVOW
2004
Springer
15 years 4 months ago
2004
Springer
This paper introduces a new social metaheuristic for the Max-Cut problem applied to a weighted undirected graph. This problem consists in finding a partition of the nodes into two ...
IJON
2008
14 years 11 months ago
2008
In this paper, an approach to solving the classical Traveling Salesman Problem (TSP) using a recurrent network of linear threshold (LT) neurons is proposed. It maps the classical ...
GECCO
2004
Springer
15 years 4 months ago
2004
Springer
Abstract. The usual approach to deal with noise present in many realworld optimization problems is to take an arbitrary number of samples of the objective function and use the samp...
101
click to vote
ISNN
2009
Springer
15 years 5 months ago
2009
Springer
In real-world applications, it has been observed that class imbalance (significant differences in class prior probabilities) may produce an important deterioration of the classifie...