An efficient solution method for Weber problems with barriers based on genetic algorithms

@article{Bischoff2007AnES,
  title={An efficient solution method for Weber problems with barriers based on genetic algorithms},
  author={Martin Bischoff and Kathrin Klamroth},
  journal={European Journal of Operational Research},
  year={2007},
  volume={177},
  pages={22-41}
}
In this paper we consider the problem of locating one new facility with respect to a given set of existing facilities in the plane and in the presence of convex polyhedral barriers. It is assumed that a barrier is a region where neither facility location nor travelling are permitted. The resulting nonconvex optimization problem can be reduced to a finite series of convex subproblems, which can be solved by the Weiszfeld algorithm in case of the Weber objective function and Euclidean distances… CONTINUE READING

Citations

Publications citing this paper.
Showing 1-10 of 15 extracted citations

References

Publications referenced by this paper.
Showing 1-10 of 28 references

Facility location in the presence of forbidden regions, I: Formulation and the case of Euclidean distance with one forbidden circle

  • I. N. Katz, L. Cooper
  • European Journal of Operational Research,
  • 1981
Highly Influential
5 Excerpts

Adaptation in Natural and Artificial Systems

  • J. H. Holland
  • 1975
Highly Influential
4 Excerpts

Similar Papers

Loading similar papers…