Results 11 to 20 of about 7,009 (230)
Foundations of Computing and Decision Sciences, 2023 Recently, air pollution has received much attention as a result of reflections on environmental issues. Accordingly, the hub location problem (HLP) seeks to find the optimal location of hub facilities and allocate points for them to meet the demands ...
Chen Tzu-Chia +5 more
doaj +1 more source
The single-assignment hub covering problem: Models and linearizations [PDF]
Journal of the Operational Research Society, 2003 Summary: We study the hub covering problem which, so far, has remained one of the unstudied hub location problems in the literature. We give a combinatorial and a new integer programming formulation of the hub covering problem that is different from earlier integer programming formulations.
Kara, B.Y., Tansel, B.C.
openaire +3 more sources
Capacitated Multiple Allocation Hub Covering Flow Problem
MANAS: Journal of Engineering, 2021 The aim of the Capacitated Multiple Allocation Hub Covering Flow Problem is to find theoptimal design for hub-and-spoke networks while taking into account hub opening and demandrouting costs.
Orhan Feyzioğlu, Nazmi Sener
doaj
A Multimodal Passenger-and-Package Sharing Network for Urban Logistics
Journal of Advanced Transportation, 2020 This paper envisions a multimodal passenger-and-package sharing (PPS) network for urban logistics integrating metro, taxi, and truck. A hub-and-spoke structure is designed including hubs located at metro stations and service stores connected to the hubs.
Yuxiong Ji +4 more
doaj +1 more source
Regenerator Location Problem and survivable extensions: A hub covering location perspective [PDF]
Transportation Research Part B: Methodological, 2015 In a telecommunications network the reach of an optical signal is the maximum distance it can traverse before its quality degrades. Regenerators are devices to extend the optical reach. The regenerator placement problem seeks to place the minimum number of regenerators in an optical network so as to facilitate the communication of a signal between any ...
Yildiz, B., Karasan, O. E.
openaire +5 more sources
Approximation Algorithm for the Minimum Hub Cover Set Problem
IEEE Access, 2022 A subset ${\mathcal{ S}}\subseteq V$ of vertices of an undirected graph $G=(V,E)$ is a hub cover when for each edge $(u,v) \in E$ , at least one of its endpoints belongs to ${\mathcal{ S}}$ , or there exists a vertex $r \in {\mathcal{ S}}$ that is a neighbor of both $u$ and $v$ .
Joel A. Trejo-Sanchez +3 more
openaire +2 more sources
Cogent Engineering, 2014 This paper presents a stochastic bi-objective model for a single-allocation hub covering problem (HCP) with the variable capacity and uncertainty parameters.
Seyed Hossein Nikokalam-Mozafar +3 more
doaj +1 more source
Dynamic + maximal hub location problem for freight transportation planning with rational markets
Advances in Mechanical Engineering, 2019 In this article, a dynamic maximal hub location covering problem for a freight transportation system is studied, in which the model has the possibility of having expansion scenarios for future according to the forecasts of increasing demands.
Roghayyeh Alizadeh, Tatsushi Nishi
doaj +1 more source
Advanced Healthcare Materials, EarlyView.Recent studies reported immunosuppressive properties of specific MXene nanomaterials. Their intravenous injection into the bloodstream of laboratory animals has been a common delivery method to suppress systemic inflammation and prevent transplant rejection.
Alireza Rafieerad +2 more
wiley +1 more source
Hub Cover and Hub Center Problems [PDF]
, 2006 Using covering problems (CoP) combined with binary search is a well-known and successful solution approach for solving continuous center problems. In this paper, we show that this is also true for center hub location problems in networks. We introduce and compare various formulations for hub covering problems (HCoP) and analyse the feasibility ...
Hamacher, Horst W., Meyer, Tanja
openaire +1 more source