Technical note: a closed form solution to the k -centra location problem

Trevor S. Hale, Crystal Welker, Ryan Pepper and Faizul Huq

International Journal of Operational Research, 2024, vol. 51, issue 2, 225-232

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.

Keywords: facility location; k -centra location; distribution network. (search for similar items in EconPapers)
Date: 2024
References: Add references at CitEc
Citations:

Downloads: (external link)
http://www.inderscience.com/link.php?id=142252 (text/html)
Access to full text is restricted to subscribers.

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:ids:ijores:v:51:y:2024:i:2:p:225-232

Access Statistics for this article

More articles in International Journal of Operational Research from Inderscience Enterprises Ltd
Bibliographic data for series maintained by Sarah Parker ().