Approximate Hierarchical Facility Location and Applications to the Shallow Steiner Tree and Range Assignment Problems

Author(s):  
Erez Kantor ◽  
David Peleg
2018 ◽  
Vol 70 (3) ◽  
pp. 865-888 ◽  
Author(s):  
Laureano F. Escudero ◽  
María Araceli Garín ◽  
Celeste Pizarro ◽  
Aitziber Unzueta

2009 ◽  
Vol 5 (1) ◽  
pp. 53-64 ◽  
Author(s):  
Rashid Bin Muhammad

This paper describes an efficient method for introducing relay nodes in the given communication graph. Our algorithm assigns transmitting ranges to the nodes such that the cost of range assignment function is minimal over all connecting range assignments in the graph. The main contribution of this paper is the O(N log N) algorithm to add relay nodes to the wireless communication network and 2-approximation to assign transmitting ranges to nodes (original and relay). It does not assume that communication graph to be a unit disk graph. The output of the algorithm is the minimal Steiner tree on the graph consists of terminal (original) nodes and relay (additional) nodes. The output of approximation is the range assignments to the nodes.


2010 ◽  
Vol 36 ◽  
pp. 239-246
Author(s):  
Frank Baumann ◽  
Christoph Buchheim

2019 ◽  
pp. 365-389
Author(s):  
Ivan Contreras ◽  
Camilo Ortiz-Astorquiza

2021 ◽  
Vol 13 (22) ◽  
pp. 12704
Author(s):  
Mariana de Oliveira Lage ◽  
Cláudia Aparecida Soares Machado ◽  
Cristiano Martins Monteiro ◽  
Clodoveu Augusto Davis ◽  
Charles Lincoln Kenji Yamamura ◽  
...  

In the last few years, vehicle sharing has driven a gradual switch from ownership-based private mobility to service usage as a sustainable urban transport alternative. A significant number of cities have implemented mobility sharing programs. Shared transport reduces both traffic congestion, and the need for parking space, decreasing the number of vehicles on the road. The optimization of shared mobility service sites increases potential user access, reduces transportation costs, and augments demand for this transportation modality. Car sharing is a mobility concept where the usage of a vehicle fleet is shared among several people. This is a relatively new concept of transport, with short vehicle rental periods. It provides the convenience of private vehicles without additional charges. A key success factor is the location of sharing stations. The study presented here refers to a car sharing service to be operated by a carmaker in the city of São Paulo (Brazil). This article aims to identify and to select the best places to establish sharing stations within the company’s dealer and servicing network. A geographic information system (GIS) calculates spatial distribution of potential trip demand. Two models of hierarchical facility location are used to determine ideal station locations. It also suggests potential local partners to house car-sharing stations, such as hotels and private car parks. Voronoi diagrams support the location task. The recent rediscovery of Weber’s classic unique facility location problem has also been applied. The selection criterion was to maximize demand and hence operator profit, while minimizing obstacles like the distance to stations.


Sign in / Sign up

Export Citation Format

Share Document