A Genetic Algorithm Based Approach for the Uncapacitated Continuous Location-Allocation Problem

Annals of Operations Research

Volumn 123, Issue 1-4, 2003, Pages 203-222

  Salhi, S ^a   Gamal, M D H ^b  

^a UNIVERSITY OF BIRMINGHAM   (United Kingdom)

^b UNIVERSITY OF RIAU   (Indonesia)

Author keywords

Continuous space; GA heuristic; Location

Indexed keywords

EID: 0346496060     PISSN: 02545330     EISSN: 15729338     Source Type: Journal    
DOI: 10.1023/A:1026131531250     Document Type: Article

References (21)

1. p-Norm Location-Allocation Problems." Mathematical Programming 66, 283-312.
2. Brimberg, J., P. Hansen, N. Mladenović, and E.D. Taillard. (2000). "Improvements and Comparison of Heuristics for Solving the Uncapacitated Multisource Weber Problem." Operations Research 48, 444-460.
3. Brimberg, J. and N. Mladenović. (1996a). "Variable Neighbourhood Algorithm for Solving the Continuous Location-Allocation Problem." Studies in Locational Analysis 10, 1-10.
4. Brimberg, J. and N. Mladenović. (1996b). "Solving the Continuous Location-Allocation Problem with Tabu Search." Studies in Locational Analysis 8, 23-32.
5. Cooper, L. (1963). "Location-Allocation Problem." Operations Research 11, 331-343.
6. Cooper, L. (1964). "Heuristic Methods for Location-Allocation Problems." SIAM Review 6, 37-53.
7. Drezner, Z. (1984). "The Planar Two-Center and Two-Median Problems." Transportation Science 18, 351-361.
8. Eilon, S., C.D.T. Watson-Gandy, and N. Christofides. (1971). Distribution Management. New York: Hafner.
9. Gamal, M. (2001). "Constructive and Population Based Heuristics for the Continuous Location-Allocation Problem." Ph.D. Diss., School of Mathematics and Statistics, University of Birmingham .
10. Gamal, M.D.H. and S. Salhi. (2001). "Constructive Heuristics for the Uncapacitated Location-Allocation Problem." Journal of the Operational Research Society 51, 1233-1240.
11. Gamal, M.D.H. and S. Salhi. (2002). "A Cellular Type Heuristic for the Multi-Weber Problem." Computers and Operations Research 30.
12. Hansen, P., N. Mladenović, and E. Taillard. (1998). "Heuristic Solution of the Multisource Weber Problem as a p-Median Problem." Operations Research Letters 22, 55-62.
13. Hodgson, H. and S. Salhi. (2003). "A Quadtree Method to Eliminate Aggregation Error in Point to Point Allocation." Environment and Planning B (revised).
14. Houck, C.R., J.A. Joines, and M.G. Kay. (1996). "Comparison of Genetic Algorithms, Random Restart and Two-Opt Switching for Solving Large Location-Allocation Problems Problem." European Journal of Operational Research 20, 387-396.
15. Kuenne, R.E. and R.M. Solland. (1972). "Exact and Approximate Solutions to the Multisource Weber Problem." Mathematical Programming 3, 193-209.
16. Lindley and Scott. (1989). Cambridge Statistical Tables. London: Cambridge Press.
17. Love, R.F. and H. Juel. (1982). "Properties and Solution Methods for Large Location-Allocation Problems." Journal of the Operational Research Society 33, 443-452.
18. Love, R.F. and J.G. Morris. (1975). "A Computational Procedure for the Exact Solution of Location-Allocation Problems with Rectangular Distances." Naval Research Logistics Quarterly 22, 441-453.
19. Michalewicz, Z. (1992). Genetic Algorithms + Data Structures - Evaluation Programs. New York: Springer.
20. Petch, R.J. (2001). "Constructive and GA Based Heuristics for the Vehicle Routing Problem with Multiple Trips." Ph.D. Diss., School of Mathematics and Statistics, University of Birmingham.
21. Rosing, K.E. (1992). "An Optimal Method for Solving the (Generalized) Multi-Weber Problem." European Journal of Operational Research 58, 414-426.