97 search results - page 13 / 20 » Genetic algorithms for the sailor assignment problem |
CORR
2010
Springer
13 years 9 months ago
2010
Springer
Multiprocessor task scheduling is an important and computationally difficult problem. This paper proposes a comparison study of genetic algorithm and list scheduling algorithm. Bo...
GECCO
2003
Springer
14 years 2 months ago
2003
Springer
A network with restoration capability requires spare capacity to be used in the case of failure. Optimization of spare capacity is to find the minimum amount of spare capacity for ...
ENDM
2006
13 years 9 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...
ICAISC
2010
Springer
13 years 11 months ago
2010
Springer
The problem of finding optimal locations of base stations, their pilot powers and channel assignments in UMTS mobile networks belongs to a class of NP-hard problems, and hence, me...
AAAI
1997
13 years 10 months ago
1997
Cooperative distributed problem solving (CDPS) loosely-coupledagentscan be effectively modeledas a distributed constraint satisfaction problem(DCSP) whereeach agent has multiple l...