Solving a class of facility location problems using genetic algorithms

Expert Systems

Volumn 20, Issue 2, 2003, Pages 86-91

  Chaudhry, Sohail S ^a   He, Shiwei ^b   Chaudhry, Peggy E ^a  

^a VILLANOVA UNIVERSITY   (United States)

^b BEIJING JIAOTONG UNIVERSITY   (China)

Author keywords

Facility location; Genetic algorithms; p median problem

Indexed keywords

ARTIFICIAL INTELLIGENCE; CONSTRAINT THEORY; GENETIC ALGORITHMS;

FACILITY LOCATION;

PROBLEM SOLVING;

EID: 0038266738     PISSN: 02664720     EISSN: None     Source Type: Journal    
DOI: 10.1111/1468-0394.00229     Document Type: Article

References (35)

1. BOOKER, L. B. (1987) Improving search in genetic algorithms, in Genetic Algorithms and Simulated Annealing, L. Davis (ed.), Los Altos, CA: Morgan Kauffmann, 61-73.
2. BOZKAYA, B., J. ZHANG and E. ERKUT (2000) An effective genetic algorithm for the p-median problem, Working Paper, Faculty of Business, University of Alberta.
3. CANÓS, M.J., C. IVORRA and V. LIERN (1999) An exact algorithm for the fuzzy p-median problem, European Journal of Operational Research, 116 (1), 80-86.
4. CAPTIVO, M.E. (1991) Fast primal and dual heuristic for the p-median location problem, European Journal of Operational Research, 52, 65-74.
5. CHAUDHRY, S.S., I.-C. CHOI and D.K. SMITH (1995) Facility location with and without maximum distance constraints through the p-median problem, International Journal of Operations and Production Management, 15 (10), 75-81.
6. CHAUDHRY, S.S., M.W. VARANO and L. XU (2000) Systems research, genetic algorithms, and information systems, Systems Research and Behavior Science, 17, 149-162.
7. CHIU, C. (2002) A case-based customer classification approach for direct marketing, Expert Systems with Applications, 22 (2), 163-168.
8. CHOI, I.-C. and S.S. CHAUDHRY (1993) The p-median problem with maximum distance constraints: a direct approach, Location Science, 1 (3), 235-243.
9. DASKIN, M. (1995) Network and Discrete Location Analysis, New York: Wiley.
10. DENSHAM, P.J. and G. RUSHTON (1992) A more efficient heuristic for solving large p-median problems, Papers in Regional Science, 71, 307-329.
11. ERKUT, E., T. MYROON and K. STRANGWAY (2000) TransAlta redesigns its service delivery network, Interfaces, 30 (2), 54-69.
12. ESTIVILL-CASTRO, V. and R. TORRES-VELAZQUEZ (1999) Hybrid genetic algorithm for solving the p-median problem, in SEAL'98, LNCS 1585, X. Yao et al. (eds), New York: Springer, 18-25.
13. FITZSIMMONS, J.A. and A.L. AUSTIN (1983) A warehouse location model helps Texas comptroller select out-of-state audit offices, Interfaces, 13 (5), 40-46.
14. GALVÃO, R.D. (1993) Use of Lagrangean relaxation in the solution of uncapacitated facility location problems, Location Science, 1 (1), 57-70.
15. GOLDBERG, D.E. (1989) Genetic Algorithms in Search, Optimization, and Machine Learning, Reading, MA: Addison-Wesley.
16. HAKIMI, S.L. (1965) Optimum distribution of switching centers in a communication network and some related graph theoretic problems, Operations Research, 13, 462-475.
17. HAYES-ROTH, F. and N. JACOBSTEIN (1994) The state of knowledge-based systems, Communications of the ACM, 37 (3), 27-39.
18. HOLLAND, J. (1975) Adaptation in Natural and Artificial Systems, Ann Arbor, MI: University of Michigan Press.
19. HOSAGE, C.M. and M.F. GOODCHILD (1986) Discrete space location-allocation solutions from genetic algorithms, Annals of Operations Research, 6, 35-46.
20. JARAMILLO, J.H., J. BHADURY and R. BATTA (2002) On the use of genetic algorithms to solve location problems, Computers and Operations Research, 29 (6), 761-779.
21. KHUMAWALA, B.M. (1972) Branch and bound algorithms for locating emergency service facilities, Working Paper 355, Krannert Graduate School of Industrial Administration, Purdue University, Lafayette, Indiana.
22. LI, F. and R.K. AGGARWAL (2000) Fast and accurate power dispatch using a relaxed genetic algorithm and a local gradient technique, Expert Systems with Applications, 19 (3), 159-165.
23. MANOLAS, D., G. EFTHIMEROS and D. TSAHALIS (2001) Development of an expert system shell based on genetic algorithms for the selection of the energy best available technologies and their optimal operating conditions for the process industry, Expert Systems, 18 (3), 124-130.
24. MICHALEWICZ, Z. (1994) Genetic Algorithms + Data Structures = Evolution Programs, 2nd edn, Berlin: Springer.
25. MIRCHANDANI, P.B. and R.L. FRANCIS (1990) Discrete Location Theory, New York: Wiley.
26. MOON, I.D. and S.S. CHAUDHRY (1984) An analysis of network location problems with distance constraints, Management Science, 30 (3), 290-307.
27. MURRAY, A.T. and R.L. CHURCH (1996) Applying simulated annealing to location-planning models, Journal of Heuristics, 2, 31-53.
28. NARULA, S.C., U.I. OGBU and H.M. SAMUELSSON (1977) An algorithm for the p-median problem, Operations Research, 25, 709-712.
29. PEREZ, J.A.M., J.L.R. GARCIA and J.M. MORENO-VEGA (1994) A parallel genetic algorithm for the discrete p-median problem, Studies in Locational Analysis, 7, 131-141.
30. RAHMAN, S. and D.K. SMITH (1991) A comparison of two heuristic methods for the p-median problem with and without maximum distance constraints, International Journal of Operations and Production Management, 11 (6), 76-84.
31. ROLLAND, E., D.A. SCHILLING and J.R. CURRENT (1996) An efficient tabu search procedure for the p-median problem, European Journal of Operational Research, 96, 329-342.
32. SHIN, K.-S. and I. HAN (1999) Case-based reasoning supported by genetic algorithms for corporate bond rating, Expert Systems with Applications, 16 (2), 85-95.
33. SHIN, K.-S. and Y.-J. LEE (2002) A genetic algorithm application in bankruptcy prediction modeling, Expert Systems with Applications, 23 (3), 321-328.
34. TEITZ, M.B. and P. BART (1968) Heuristic methods for estimating the vertex median of a weighted graph, Operations Research, 12 (3), 955-961.
35. TOREGAS, C., R. SWAIN, C. REVELLE and L. BERGMAN (1971) The location of emergency service facilities, Operations Research, 19, 1363-1373.