# Constructive heuristics for the uncapacitated continuous location-allocation problem

@article{Gamal2001ConstructiveHF, title={Constructive heuristics for the uncapacitated continuous location-allocation problem}, author={M. Gamal and S. Salhi}, journal={Journal of the Operational Research Society}, year={2001}, volume={52}, pages={821-829} }

The multisource location-allocation problem in continuous space is investigated. Two constructive heuristic techniques are proposed to solve this problem. Both methods are based on designing suitable schemes for the generation of the initial solutions. The first considers the furthest distance rule and is enhanced by schemes borrowed from tabu search such as constructing the forbidden regions and freeing strategy. The second considers the discrete solutions found when solving the p-median… CONTINUE READING

#### Topics from this paper.

41 Citations

A Continuous Location-Allocation Problem with Zone-Dependent Fixed Cost

- Computer Science, Mathematics
- Ann. Oper. Res.
- 2005

35

A cellular heuristic for the multisource Weber problem

- Mathematics, Computer Science
- Comput. Oper. Res.
- 2003

41

A greedy heuristic algorithm for solving the capacitated planar multi-facility location-allocation problem

- Mathematics
- 2016

2

New heuristic methods for the single-source capacitated multi facility Weber problem

- Computer Science
- 2013

6 Highly Influenced- PDF

A perturbation-based heuristic for the capacitated multisource Weber problem

- Mathematics, Computer Science
- Eur. J. Oper. Res.
- 2007

34- PDF

A hierarchical algorithm for the planar single-facility location routing problem

- Mathematics, Computer Science
- Comput. Oper. Res.
- 2012

29 Highly Influenced

A new GA based solution for capacitated multi source Weber problem

- Mathematics, Computer Science
- Int. J. Comput. Intell. Syst.
- 2010

18- PDF

Region-rejection based heuristics for the capacitated multi-source Weber problem

- Mathematics, Computer Science
- Comput. Oper. Res.
- 2009

39 Highly Influenced

Combined Location-Arc Routing Problems: A survey and suggestions for future research

- Computer Science
- 2008 IEEE International Conference on Service Operations and Logistics, and Informatics
- 2008

9

#### References

SHOWING 1-10 OF 15 REFERENCES

A computation procedure for the exact solution of location-allocation problems with rectangular distances

- Mathematics
- 1975

67

Improvement and Comparison of Heuristics for Solving the Uncapacitated Multisource Weber Problem

- Computer Science, Mathematics
- Oper. Res.
- 2000

208- PDF

Exact and approximate solutions to the multisource weber problem

- Mathematics, Computer Science
- Math. Program.
- 1972

133

Heuristic solution of the multisource Weber problem as a p-median problem

- Computer Science, Mathematics
- Oper. Res. Lett.
- 1998

107- PDF

A projection method forlp norm location-allocation problems

- Mathematics, Computer Science
- Math. Program.
- 1994

82

Comparison of genetic algorithms, random restart and two-opt switching for solving large location-allocation problems

- Mathematics, Computer Science
- Comput. Oper. Res.
- 1996

174