Constructive heuristics for the uncapacitated continuous location-allocation problem

Journal of the Operational Research Society

Volumn 52, Issue 7, 2001, Pages 821-829

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

^a UNIVERSITY OF BIRMINGHAM   (United Kingdom)

Author keywords

Continuous space; Heuristics; Location

Indexed keywords

GENETIC ALGORITHMS; HEURISTIC METHODS; OPERATIONS RESEARCH;

CONSTRUCTIVE HEURISTICS; DISCRETE SOLUTIONS;

MANAGEMENT SCIENCE;

EID: 0035393968     PISSN: 01605682     EISSN: None     Source Type: Journal    
DOI: 10.1057/palgrave.jors.2601176     Document Type: Article

References (15)

1. An optimal method for solving the (generalized) multi-Weber problem
2. Location-allocation problem
3. The transportation-location problem
4. Heuristic methods for location-allocation problems
5. Exact and approximate solutions to the multisource Weber problem
6. A computational procedure for the exact solution of location-allocation problems with rectangular distances
7. Properties and solution methods for large location-allocation problems
8. p norm location-allocation problems
9. Solving the continuous location-allocation problem with tabu search
10. Heuristic solution of the multisource Weber problem as a p-median problem
11. Comparison of genetic algorithms, random restart and two-opt switching for solving large location-allocation problems
12. Variable neighbourhood algorithm for solving the continuous location-allocation problem
13. Improvements and comparison of heuristics for solving the uncapacitated multisource weber problem
14. A perturbation heuristic for a class of location problems