| Issue |
RAIRO-Oper. Res.
Volume 35, Number 1, January March 2001
|
|
|---|---|---|
| Page(s) | 127 - 142 | |
| DOI | https://doi.org/10.1051/ro:2001107 | |
| Published online | 15 August 2002 | |
Solving the simple plant location problem by genetic algorithm
1
University of Belgrade, Serbian
Academy of Sciences and Arts, Institute of Mathematics,
Strumicka 92/5, 11 000 Belgrade, Yugoslavia.
2
University of Belgrade,
Faculty of Mathematics, Studentski trg 16, 11 000 Belgrade,
Yugoslavia.
3
Institute for Computer Graphics,
Faviritensstasse 9, Vienna, Austria.
Received:
February
2000
Accepted:
February
2001
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.
Mathematics Subject Classification: 90B80 / 90C27 / 90C59
Key words: Simple plant location problem / genetic algorithms / combinatorial optimization
© EDP Sciences, 2001
Current usage metrics show cumulative count of Article Views (full-text article views including HTML views, PDF and ePub downloads, according to the available data) and Abstracts Views on Vision4Press platform.
Data correspond to usage on the plateform after 2015. The current usage metrics is available 48-96 hours after online publication and is updated daily on week days.
Initial download of the metrics may take a while.