The p-center problem: Using equivalent instances to obtain better results
ArticleDownload View PDF
ArticleDownload View PDF
The problem of an expanding chain (it already has some facilities) in a given area is considered. It may locate a new facility, or vary (up or down) the quality of its existing facilities, or close some of them, or a combination of all those possibilities, whatever it is the best to maximize its profit, … Read more
In this paper, we study a network interdiction problem on a multiple allocation, uncapacitated hub network. The problem is formulated as a bilevel Stackelberg game between an attacker and a defender, where the attacker identifies r out of p hubs to interdict so as to maximize the worst-case post-interdiction performance of the system with the … Read more
We focus on a problem of locating recharging stations in one-way station based electric car sharing systems which operate under demand uncertainty. We model this problem as a mixed integer stochastic program and develop a Benders decomposition algorithm based on this formulation. We integrate a stabilization procedure to our algorithm and conduct a large-scale experimental … Read more
In this paper, we propose a model for the generation and transmission network expansion planning problem that includes decisions related to substations’ locations and sizes. In power system expansion planning problems, locations of generation units and/or transmission lines are determined. However, substation location decisions are not explicitly studied. Nevertheless, including the decisions of substations’ locations … Read more
In this study, we consider the special case of the uncapacitated p-hub center problem, where the weight/flow matrix includes 0 entities. In some real life networks, such as airline networks, cargo networks etc., the zero flow might exist between certain demand points. Typically in airline networks, nobody travels from city i to city i. In … Read more
In this work, we present an algorithmic framework based on Benders decomposition for the Capacitated p-Cable Trench Problem with Covering. We show that our approach can be applied to most variants of the Cable Trench Problem (CTP) that have been considered in the literature. The proposed algorithm is augmented with a stabilization procedure to accelerate … Read more
The flow refueling location problem (FRLP) locates $p$ stations in order to maximize the flow volume that can be accommodated in a road network respecting the range limitations of the vehicles. This paper introduces the charging station location problem with plug-in hybrid electric vehicles (CSLP-PHEV) as a generalization of the FRLP. We consider not only … Read more
This paper addresses combined location/routing problems defined on trees. Several problems are studied, which consider service demand both at the vertices and the edges of the input tree. Greedy type optimal heuristics are presented for the cases when all vertices have to be visited and facilities have no set-up costs. Facilities set-up costs can also … Read more
In many telecommunication network architectures a given set of client nodes must be served by different kinds of facility, which provide different services and have different capabilities. Such facilities must be located and dimensioned in the design phase. We tackle a particular location problem in which two sets of facilities, mid level and high level, … Read more