Related papers: Ordered Median Hub Location Problems with Capacity…
In this paper the capacitated hub location problem is formulated by a minimax regret model, which takes into account uncertain setup cost and demand. We focus on hub location with multiple allocations as a strategic problem requiring one…
In this paper we propose an extension of the Uncapacitated Hub Location Problem where the potential positions of the hubs are not fixed in advance. Instead, they are allowed to belong to a region around an initial discrete set of nodes. We…
The multi allocation p-hub median problem (MApHM), the multi allocation uncapacitated hub location problem (MAuHLP) and the multi allocation p-hub location problem (MApHLP) are common hub location problems with several practical…
Hub location problems are central to optimizing logistics, telecommunications, and transportation networks by consolidating flows through strategically placed hubs. While existing models assume symmetric allocation, where hubs handle…
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…
In this paper, we propose the Ordered Median Tree Location Problem (OMT). The OMT is a single-allocation facility location problem where p facilities must be placed on a network connected by a non-directed tree. The objective is to minimize…
Hub location problems have multiple applications in logistic systems, airways industry, supply chain network design, and telecommunication. In the hub location problem, a number of nodes should be selected as the hub nodes to act as the…
We introduce a new formulation for the multiple allocation hub location problem that exploits supermodular properties and uses 1- and 2-index variables only. We show that the new formulation produces the same Linear Programming bound as the…
Three models were presented in M.K. Khakim Habibi, Hamid Allaoui, Gilles Goncalves, Collaborative hub location problem under cost uncertainty, Computers & Industrial Engineering Volume 124, October 2018, Pages 393-410 as models for…
In this paper, we introduce a new variant of the $p$-median facility location problem in which it is assumed that the exact location of the potential facilities is unknown. Instead, each of the facilities must be located in a region around…
Transportation networks frequently employ hub-and-spoke network architectures to route flows between many origin and destination pairs. Hub facilities work as switching points for flows in large networks. In this study, we deal with a…
This paper introduces a new formulation and solution framework for hub location problems. The formulation is based on 2-index aggregated flow variables and incorporates a set of aggregated demand constraints, which are novel in hub…
We consider the facility location problem in the one-dimensional setting where each facility can serve a limited number of agents from the algorithmic and mechanism design perspectives. From the algorithmic perspective, we prove that the…
In the $k$-median problem, given a set of locations, the goal is to select a subset of at most $k$ centers so as to minimize the total cost of connecting each location to its nearest center. We study the uniform hard capacitated version of…
Motivated by emerging urban applications in commercial, public sector, and humanitarian logistics, we revisit continuous $p$-hub location problems in which several facilities must be located in a continuous space such that the expected…
This paper explores a GIS-based application of the conditional p-median problem (where p = 1) in last-mile delivery logistics. The rapid growth of e-commerce in Pakistan has primarily benefited logistics companies, which face the challenge…
We propose a general analytical framework for single-facility continuous location problems under spatial demand uncertainty. In contrast to classical formulations based on discrete or regionally aggregated demands, the proposed model…
Regarding the concepts of urban management, digital transformation, and smart cities, various issues are presented. Currently, we like to attend to location allocation problems that can be a new part of digital transformation in urban…
In this paper we present two new approaches for finding good starting solutions to the planar p-median problem. Both methods rely on a discrete approximation of the continuous model that restricts the facility locations to the given set of…
We investigate a location-allocation-routing problem where trucks deliver goods from a central production facility to a set of warehouses with fixed locations and known demands. Due to limited capacities congestion occurs and results in…