The P-Hub maximal covering problem and extensions for gradual decay functions

Meltem Peker and Bahar Y. Kara

Omega, 2015, vol. 54, issue C, 158-172

Abstract: The p-hub maximal covering problem aims to find the best locations for hubs so as to maximize demands within a coverage distance with a predetermined number of hubs. Classically, the problem is defined in the framework of binary coverage only; an origin–destination pair is covered if the cost (time, etc.) is lower than the critical value, and not covered at all if the cost is greater than the critical value. In this paper, we extend the definition of coverage, introducing “partial coverage”, which changes with distance. We present new and efficient mixed-integer programming models that are also valid for partial coverage for single and multiple allocations. We present and discuss the computational results with different data sets.

Keywords: Hub location problem; p-hub maximal covering problem; Partial coverage (search for similar items in EconPapers)
Date: 2015
References: View references in EconPapers View complete reference list from CitEc
Citations: View citations in EconPapers (17)

Downloads: (external link)
http://www.sciencedirect.com/science/article/pii/S0305048315000110
Full text for ScienceDirect subscribers only

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:eee:jomega:v:54:y:2015:i:c:p:158-172

Ordering information: This journal article can be ordered from
http://www.elsevier.com/wps/find/supportfaq.cws_home/regional
https://shop.elsevie ... _01_ooc_1&version=01

DOI: 10.1016/j.omega.2015.01.009

Access Statistics for this article

Omega is currently edited by B. Lev

More articles in Omega from Elsevier
Bibliographic data for series maintained by Catherine Liu ().