نتایج جستجو برای: facility location spatial clustering
تعداد نتایج: 709800 فیلتر نتایج به سال:
Facility location problems are well known problem in Industrial optimization. Locating emergency facility typically involves optimal location allocation of facilities with an objective to locate limited number of facilities such that the average response time is minimized. This paper describes an approach for finding a candidate set of emergency facility locations based on spat ial pattern anal...
This paper deals with social infrastructure planning problems to determine the location of the facilities of social infrastructure network and the layout. Each user must be assigned to the closest facility to be economically viable. The objective is how to make the accessibility to facilities maximum (i.e., to minimize the distance which the users traveled to reach the facilities). In this pape...
We propose several methods to speed up the facility location, and the single link and the complete link clustering algorithms. The local search algorithm for the facility location is accelerated by introducing several space partitioning methods and a parallelisation on the CPU of a standard desktop computer. The influence of the cluster size on the speedup is documented. The paper further prese...
This research develops a clustering-based location-allocation method to the Capacitated Facility Location Problem (CFLP), which provides an approximate optimal solution to determine the location and coverage of a set of facilities to serve the demands of a large number of locations. The allocation is constrained by facility capacities – different facilities may have different capacities and the...
Because of shrinking budgets, transportation agencies are facing severe challenges in the preservation of deteriorating pavements. There is an urgent need to develop a methodology that minimizes maintenance and rehabilitation (M&R) cost. To minimize total network M&R cost of clustering pavement segments, we propose an integer programming model similar to an uncapacitated facility location probl...
An important component of a spatial clustering algorithm is the distance measure between sample points in object space. In this paper, the traditional Euclidean distance measure is replaced with innovative obstacle distance measure for spatial clustering under obstacle constraints. Firstly, we present a path searching algorithm to approximate the obstacle distance between two points for dealing...
this paper addresses a reliable facility location problem with considering facility capacity constraints. in reliable facility location problem some facilities may become unavailable from time to time. if a facility fails, its clients should refer to other facilities by paying the cost of retransfer to these facilities. hence, the fail of facilities leads to disruptions in facility location dec...
We give a new randomized LP-rounding 1.725-approximation algorithm for the metric Fault-Tolerant Uncapacitated Facility Location problem. This improves on the previously best known 2.076-approximation algorithm of Swamy & Shmoys. To the best of our knowledge, our work provides the first application of a dependent-rounding technique in the domain of facility location. The analysis of our algorit...
نمودار تعداد نتایج جستجو در هر سال
با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید