Hostname: page-component-cd9895bd7-fscjk Total loading time: 0 Render date: 2024-12-25T07:38:10.311Z Has data issue: false hasContentIssue false
  • English
  • Français

Solving the simple plant location problem by genetic algorithm

Published online by Cambridge University Press:  15 August 2002

Jozef Kratica ,
Dušan Tošic ,
Vladimir Filipović  and
Ivana Ljubić
Jozef Kratica
Affiliation:
University of Belgrade, Serbian Academy of Sciences and Arts, Institute of Mathematics, Strumicka 92/5, 11 000 Belgrade, Yugoslavia.
Dušan Tošic
Affiliation:
University of Belgrade, Faculty of Mathematics, Studentski trg 16, 11 000 Belgrade, Yugoslavia.
Vladimir Filipović
Affiliation:
University of Belgrade, Faculty of Mathematics, Studentski trg 16, 11 000 Belgrade, Yugoslavia.
Ivana Ljubić
Affiliation:
Institute for Computer Graphics, Faviritensstasse 9, Vienna, Austria.
Get access

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

Simple plant location problemgenetic algorithmscombinatorial optimization
Type
Research Article
Information
RAIRO - Operations Research , Volume 35 , Issue 1 , January 2001 , pp. 127 - 142
Copyright
© EDP Sciences, 2001

Access options

Get access to the full version of this content by using one of the access options below. (Log in options will check for institutional or personal access. Content may require purchase if you do not have access.)

References

Aikens, C.H., Facility Location Models for Distribution Planning. European J. Oper. Res . 22 (1985) 263-279. CrossRef
M.L. Alves and M.T. Almeida, Simulated Annealing Algorithm for the Simple Plant Location Problem: A Computational Study. Rev. Invest. 12 (1992).
A.A. Aqeev, V.S. Beresnev, Polynomially Solvable Cases of the Simple Plant Location Problem, in Proc. of the First Integer Programming and Combinatorial Optimization Conference, edited by R. Kannan and W.R. Pulleyblank. University of Waterloo Press, ON, Canada (1990) 1-6.
Beasley, D., Bull, D.R. and Martin, R.R., Overview, An of Genetic Algorithms. Univ. Computing 15 (1993) 170-181.
J.E. Beasley, Obtaining Test Problems via Internet. J. Global Optim. 8 (1996) 429-433, http://mscmga.ms.ic.ac.uk/info.html
Beasley, J.E., Lagrangean Heuristic for Location Problems. European J. Oper. Res. 65 (1993) 383-399. CrossRef
Conn, A.R. and Cornuejols, G., Projection Method, A for the Uncapacitated Facility Location Problem. Math. Programming 46 (1990) 273-298. CrossRef
G. Cornuejols, G.L. Nemhauser and L.A. Wolsey, The Uncapacitated Facility Location Problem, in Discrete Location Theory, edited by P.B. Mirchandani and R.L. Francis. John Wiley & Sons (1990), Chapter 3, pp. 120-171.
Dearing, P.M., Location Problems. Oper. Res. Lett. 4 (1985) 95-98. CrossRef
K.E. De Jong and W.M. Spears, Using Genetic Algorithms to Solve NP-Complete Problems, in Proc. of the Third International Conference on Genetic Algorithms. Morgan Kaufmann, San Mateo, CA (1989) 124-132.
C. De Simone and C. Mannino, Easy Instances of the Plant Location Problem, Technical Report R-427. Gennaio, University of Roma, Italy (1996).
R. Dorne and J.K. Hao, A New Genetic Local Search Algorithm for Graph Coloring, in Proc. of the 5th Conference on Parallel Problem Solving from Nature - PPSN V. Springer-Verlag, Lecture Notes in Comput. Sci. 1498 (1998) 745-754.
Erlenkotter, D., Dual-Based Procedure, A for Uncapacitated Facility Location. Oper. Res. 26 (1978) 992-1009. CrossRef
Francis, R.L., McGinnis, L.F. and White, J.A., Locational Analysis. European J. Oper. Res. 12 (1983) 220-252. CrossRef
B. Freisleben and P. Merz, New Genetic Local Search Operators for the Traveling Salesman Problem, in Proc. of the 4th Conference on Parallel Problem Solving from Nature - PPSN IV. Springer-Verlag Lecture Notes in Comput. Sci. 1141 (1996) 890-899.
Gao, L.L., Robinson, E. and Powell, Jr., Uncapacitated Facility Location: General Solution Procedure and Computational Experience. European J. Oper. Res. 76 (1994) 410-427. CrossRef
V.P. Grishukhin, On Polynomial Solvability Conditions for the Simplest Plant Location Problem, in Selected topics in discrete mathematics, edited by A.K. Kelmans and S. Ivanov. American Mathematical Society, Providence, RI (1994) 37-46.
Guignard, M., Lagrangean Du, Aal Ascent Algorithm for Simple Plant Location Problems. European J. Oper. Res. 35 (1988) 193-200. CrossRef
K. Holmberg, Experiments with Primal-Dual Decomposition and Subgradient Methods for the Uncapacitated Facility Location Problem, Research Report LiTH-MAT/OPT-WP-1995-08, Optimization. Department of Mathematics, Linkoping Institute of Technology, Sweden (1995).
S. Khuri, T. Back and J. Heitkotter, An Evolutionary Approach to Combinatorial Optimization Problems, in Proc. of CSC'94. Phoenix, Arizona (1994).
Koerkel, M., On the Exact Solution of Large-Scale Simple Plant Location Problems. European J. Oper. Res . 39 (1989) 157-173. CrossRef
Krarup, J. and Pruzan, P.M., The Simple Plant Location Problem: Survey and Synthesis. European J. Oper. Res . 12 (1983) 36-81. CrossRef
Kratica, J., Improving Performances of the Genetic Algorithm by Caching. Comput. Artificial Intelligence 18 (1999) 271-283.
P. Merz and B. Freisleben, A Genetic Local Search Approach to the Quadratic Assignment Problem, in Proc. of the Seventh International Conference on Genetic Algorithms. Morgan Kaufmann (1997) 465-472.
P. Merz and B. Freisleben, Genetic Local Search for the TSP: New Results, in Proc. of the 1997 IEEE International Conference on Evolutionary Computation. IEEE Press (1997) 159-164.
C. Ryu and M. Guignard, An Exact Algorithm for the Simple Plant Location Problem with an Aggregate Capacity Constraint, TIMS/ORSA Meeting. Orlando, FL (1992) 92-04-09.
Simao, H.P. and Thizy, J.M., Dual Simplex Al, Agorithm for the Canonical Representation of the Uncapacitated Facility Location Problem. Oper. Res. Lett . 8 (1989) 279-286. CrossRef
G. Syswerda, Uniform Crossover in Genetic Algorithms, in Proc. of the Third International Conference on Genetic Algorithms. Morgan Kaufmann, San Mateo, CA (1989) 2-9.
D. Whitley, The GENITOR Algorithm and Selection Pressure: Why Rank-Based Allocation of Reproductive Trials is Best, in Proc. of the Third International Conference on Genetic Algorithms. Morgan Kaufmann, San Mateo, CA (1989) 116-123.