Related papers: Facility Location Problems with Capacity Constrain…
In the classical facility location problem we consider a graph $G$ with fixed weights on the edges of $G$. The goal is then to find an optimal positioning for a set of facilities on the graph with respect to some objective function. We…
We consider a multi-stage facility reallocation problems on the real line, where a facility is being moved between time stages based on the locations reported by $n$ agents. The aim of the reallocation algorithm is to minimise the social…
The Maximal Covering Location Problem (MCLP) is a classical location problem where a company maximizes the demand covered by placing a given number of facilities, and each demand node is covered if the closest facility is within a…
The energy transition in transportation benefits from demand-based models to determine the optimal placement of refueling stations for alternative fuel vehicles such as battery electric trucks. A formulation known as the refueling station…
Consider an online facility assignment problem where a set of facilities $F = \{ f_1, f_2, f_3, \cdots, f_{|F|} \}$ of equal capacity $l$ is situated on a metric space and customers arrive one by one in an online manner on that space. We…
We attack the 4-level facility location problem (4L-FLP), a critical component in supply chains. Foundational tasks here involve selecting markets, plants, warehouses, and distribution centers to maximize profits while considering related…
We study the distributed facility location games with candidate locations, where agents on a line are partitioned into groups. Both desirable and obnoxious facility location settings are discussed. In distributed location problems,…
In multi-agent path finding (MAPF) the task is to navigate agents from their starting positions to given individual goals. The problem takes place in an undirected graph whose vertices represent positions and edges define the topology.…
We consider the problem of locating a single facility on the real line. This facility serves a set of agents, each of whom is located on the line, and incurs a cost equal to his distance from the facility. An agent's location is private…
In this paper, we study mechanism design for single-facility location games where each agent has multiple private locations in [0, 1]. The individual objective is a satisfaction function that measures the discrepancy between the optimal…
Facility location is a prominent optimization problem that has inspired a large quantity of both theoretical and practical studies in combinatorial optimization. Although the problem has been investigated under various settings reflecting…
With growing emphasis on e-commerce marketplace platforms where we have a central platform mediating between the seller and the buyer, it becomes important to keep a check on the availability and profitability of the central store. A store…
This paper addresses a version of the single-facility Maximal Covering Location Problem on a network where the demand is: (i) distributed along the edges and (ii) uncertain with only a known interval estimation. To deal with this problem,…
In this work we consider general facility location and social choice problems, in which sets of agents $\mathcal{A}$ and facilities $\mathcal{F}$ are located in a metric space, and our goal is to assign agents to facilities (as well as…
We consider a facility location game in which $n$ agents reside at known locations on a path, and $k$ heterogeneous facilities are to be constructed on the path. Each agent is adversely affected by some subset of the facilities, and is…
The facility location problems (FLPs) are a typical class of NP-hard combinatorial optimization problems, which are widely seen in the supply chain and logistics. Many mathematical and heuristic algorithms have been developed for optimizing…
The Flow Refueling Location Problem (FRLP) is a stylized model for determining the optimal placement of refueling stations for vehicles with limited travel ranges, such as hydrogen fuel cell vehicles and electric vehicles. A notable…
Proportionality is an attractive fairness concept that has been applied to a range of problems including the facility location problem, a classic problem in social choice. In our work, we propose a concept called Strong Proportionality,…
Metaheuristics are known to be strong in solving large-scale instances of computationally hard problems. However, their efficiency still needs exploration in the context of instance structure, scale and numerical properties for many of…
In power systems, large-scale optimisation problems are extensively used to plan for capacity expansion at the supra-national level. However, their cost-optimal solutions are often not exploitable by decision-makers who are preferably…