Paper Info
Title
Using Voronoi diagrams to solve a hybrid facility location problem with attentive facilities
Abstract
In this paper, we introduce a novel class of facility location problems, and propose solutions based on Voronoi diagrams. Our solutions locate a set of facilities on a two dimensional space, with respect to a set of dynamic demand. The information about these demand is gathered through modifications of the overall system, into a central decision unit. This influences our objective of minimizing the total loss function. Considering a continuous space and discrete time, facilities are assigned to meet demands in each time cycle. Two distinct approaches are proposed and thoroughly studied, followed by a case study. We call our main algorithm Reactive Agent Dynamic Voronoi Diagram Facility Spread. We also test our solutions empirically through a set of experiments. Considering n and p to be the number of demand points, and the number of facilities in hand, respectively, the time complexity of the algorithm is O(c(n^2+p)logn) for a complete run of c cycles.
Year
DOI
Venue
2013
10.1016/j.ins.2013.01.017
Inf. Sci.
Keywords
Field
DocType
attentive facility,solutions empirically,demand point,dimensional space,time cycle,continuous space,hybrid facility location problem,discrete time,voronoi diagram,time complexity,dynamic demand,reactive agent dynamic voronoi,computational geometry,algorithm,artificial intelligence,facility location
Mathematical optimization,Computational geometry,Facility location problem,Dynamic demand,Artificial intelligence,Voronoi diagram,Discrete time and continuous time,Time complexity,1-center problem,Two-dimensional space,Mathematics,Machine learning
Journal
Volume
ISSN
Citations 
234,
0020-0255
5
PageRank 
References 
Authors
0.41
11
4
Name
Order
Citations
PageRank
Arman Didandeh1133.35
Bahram Sadeghi Bigham2157.47
Mehdi Khosravian350.41
Farshad Bakhshandegan Moghaddam4234.35