Solving the simple plant location problem by genetic algorithm
- 1 January 2001
- journal article
- research article
- Published by EDP Sciences in Rairo-Operations Research
- Vol. 35 (1) , 127-142
- https://doi.org/10.1051/ro:2001107
Abstract
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.Keywords
This publication has 15 references indexed in Scilit:
- A new genetic local search algorithm for graph coloringPublished by Springer Nature ,1998
- Obtaining test problems via InternetJournal of Global Optimization, 1996
- Uncapacitated facility location: General solution procedure and computational experienceEuropean Journal of Operational Research, 1994
- Lagrangean heuristics for location problemsEuropean Journal of Operational Research, 1993
- A projection method for the uncapacitated facility location problemMathematical Programming, 1990
- A Lagrangean dual ascent algorithm for simple plant location problemsEuropean Journal of Operational Research, 1988
- Facility location models for distribution planningEuropean Journal of Operational Research, 1985
- Location problemsOperations Research Letters, 1985
- Locational analysisEuropean Journal of Operational Research, 1983
- A Dual-Based Procedure for Uncapacitated Facility LocationOperations Research, 1978