Hub location with congestion and time-sensitive demand
Carmen-Ana Domínguez-Bravo,
Elena Fernández and
Armin Lüer-Villagra
European Journal of Operational Research, 2024, vol. 316, issue 3, 828-844
Abstract:
This work studies the effect of hub congestion and time-sensitive demand on a hub-and-spoke location/allocation system. The Hub Location with Congestion and Time-sensitive Demand Problem is introduced, which combines these two main characteristics. On the one hand, hubs can be activated at several service levels, each of them characterized by a maximum capacity, expressed as the amount of flow that may circulate through the hub, which is associated with a hub transit time. On the other hand, alternative levels are available for served commodities, where each demand level is characterized by its amount of demand, unit revenue, and maximum service time. In this problem the efficiency of a hub-and-spoke system is given by the maximum net profit it may produce. To the best of our knowledge this is the first work where hub congestion and time-sensitive demand are jointly considered.
Keywords: Hub location; Hub congestion; Time-sensitive demand (search for similar items in EconPapers)
Date: 2024
References: View references in EconPapers View complete reference list from CitEc
Citations:
Downloads: (external link)
http://www.sciencedirect.com/science/article/pii/S0377221724001814
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:ejores:v:316:y:2024:i:3:p:828-844
DOI: 10.1016/j.ejor.2024.03.007
Access Statistics for this article
European Journal of Operational Research is currently edited by Roman Slowinski, Jesus Artalejo, Jean-Charles. Billaut, Robert Dyson and Lorenzo Peccati
More articles in European Journal of Operational Research from Elsevier
Bibliographic data for series maintained by Catherine Liu ().