Solving the simple plant location problem by genetic algorithm
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.
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