Technical note: a closed form solution to the k-centra location problem
by Trevor S. Hale; Crystal Welker; Ryan Pepper; Faizul Huq
International Journal of Operational Research (IJOR), Vol. 51, No. 2, 2024

Abstract: This research delineates a new heuristic that solves the k-centra location problem on a simple distribution network. This treatise differs from most location research in that we employ a novel, graph theoretic based k-centra approach that seeks to find the location that minimises the sum of the distances to the k furthest existing facilities. The k-centra problem generalises the classic minimax and minisum location problems: If k = 2, the problem reduces to the centre (minimax) location problem, whereas if k = n, the problem reduces to the median (minisum) location problem. This research has direct application to the location of a distribution centre on a simple origin-to-destination distribution network to improve service levels.

Online publication date: Wed, 16-Oct-2024

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