The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
This research was partially supported by the Serbian Ministry of Science and Ecology under
project 144007. The authors are grateful to Ivana Ljubić for help in testing and to Vladimir Filipović for useful suggestions and comments.
In this paper a genetic algorithm (GA) for the task assignment
problem (TAP) is considered.An integer representation with standard genetic operators is used. Computational results are presented for instances
from the literature, and compared to optimal solutions...
The simple plant location problem (SPLP) is considered and a genetic algorithm is proposed to solve this problem. By using the developed algorithm it is possible to solve SPLP with more than 1000 facility sites and customers. Computational results are presented and compared to dual based algorithms.
The simple plant location problem (SPLP) is considered and
a genetic algorithm is
proposed to solve this problem. By using the developed
algorithm it is possible to solve SPLP
with more than 1000 facility sites and customers.
Computational results are presented and
compared to dual based algorithms.
Download Results (CSV)