scholarly journals Facility Location Problem of Beverage Distribution Considering Time Window and Land Use Plan Using GIS

Beverages ◽  
2015 ◽  
Vol 1 (2) ◽  
pp. 55-69
Author(s):  
EunSu Lee ◽  
Alan Dybing ◽  
Sumadhur Shakya
Keyword(s):  
Land Use ◽  
Facility Location ◽  
Location Problem ◽  
Time Window ◽  
Facility Location Problem ◽  
Land Use Plan

scholarly journals An Optimization Model for Advanced Life Support Ambulance Facility Location Problem

Proceedings ◽  
2020 ◽  
Vol 39 (1) ◽  
pp. 10 ◽  
Author(s):  
Sumrit ◽  
Thongsiriruengchai
Keyword(s):  
Facility Location ◽  
Service Time ◽  
Traffic Congestion ◽  
Location Problem ◽  
Life Support ◽  
Time Window ◽  
Critical Role ◽  
Advanced Life Support ◽  
Facility Location Problem ◽  
Service Areas

The survival rate of the patients in medical emergencies depends on the minimize ambulance arrival time on-sites and promptly provides medical care to the patients. Advanced Life Support (ALS) ambulances play a critical role in reducing the fatal and severity rate of emergency patients. The several areas in big cities always encounter with traffic congestion, which is a significant obstacle for ALS ambulances to achieve their service time window target (predetermine as less than 8 min). In light of prior research, arranging appropriate parking locations can solve such a problem. This study proposes a mathematical model of facility location problem to identify the ALS ambulances parking locations. This paper simultaneously considers the minimize of the total number of ALS ambulance parking locations while covering the service areas and service time window are fulfilled. One part of business centers in Bangkok was chosen to correct the data and test the proposed model. This study is distinguished from others in these areas by the only possible parking places, i.e., schools, temples, police stations, and gas stations, which are taking into consideration. IBM ILOG CPLEX Optimization Studio Version 12.6.1 was utilized to solve the problem. The result indicates that there are 26 parking locations, which can enable the service coverage areas. As well as achieve a 54% service time window target.

scholarly journals Dispersing Obnoxious Facilities on a Graph

Algorithmica ◽  
2021 ◽  
Author(s):  
Alexander Grigoriev ◽  
Tim A. Hartmann ◽  
Stefan Lendl ◽  
Gerhard J. Woeginger
Keyword(s):  
Facility Location ◽  
Location Problem ◽  
Unit Length ◽  
Facility Location Problem ◽  
Np Hard ◽  
Obnoxious Facilities ◽  
Rational Parameter ◽  
Polynomially Solvable

AbstractWe study a continuous facility location problem on a graph where all edges have unit length and where the facilities may also be positioned in the interior of the edges. The goal is to position as many facilities as possible subject to the condition that any two facilities have at least distance $$\delta$$ δ from each other. We investigate the complexity of this problem in terms of the rational parameter $$\delta$$ δ . The problem is polynomially solvable, if the numerator of $$\delta$$ δ is 1 or 2, while all other cases turn out to be NP-hard.

Fuzzy facility location problem with preference of candidate sites

2007 ◽  
Vol 158 (17) ◽  
pp. 1922-1930 ◽  
Author(s):  
Hiroaki Ishii ◽  
Yung Lung Lee ◽  
Kuang Yih Yeh
Keyword(s):  
Facility Location ◽  
Location Problem ◽  
Facility Location Problem
Sign in / Sign up

Export Citation Format

Share Document