Rotary heuristic for uncapacitated continuous location-allocation problems
by M.D.H. Gamal; Zulkarnain; M. Imran
International Journal of Operational Research (IJOR), Vol. 39, No. 3, 2020

Abstract: This paper proposes a constructive heuristic method to solve location-allocation problems. Specifically, we consider the problem of locating m new facilities in a continuous region such that the sum of the weighted distances from the new facilities to n existing facilities is minimised. The distance is measured using the Euclidean-distance metric. This simple technique shows that the solution found is encouraging for the case where the number of users is much larger than the number of facilities to be located.

Online publication date: Thu, 22-Oct-2020

The full text of this article is only available to individual subscribers or to users at subscribing institutions.

 
Existing subscribers:
Go to Inderscience Online Journals to access the Full Text of this article.

Pay per view:
If you are not a subscriber and you just want to read the full contents of this article, buy online access here.

Complimentary Subscribers, Editors or Members of the Editorial Board of the International Journal of Operational Research (IJOR):
Login with your Inderscience username and password:

Username:        Password:          Forgotten your password?

Want to subscribe?
A subscription gives you complete access to all articles in the current issue, as well as to all articles in the previous three years (where applicable). See our Orders page to subscribe.

If you still need assistance, please email subs@inderscience.com