Using Voronoi diagrams to solve a hybrid facility location problem with attentive facilities

DOI10.1016/j.ins.2013.01.017zbMath1284.90036OpenAlexW2008228566MaRDI QIDQ2446403

Farshad Bakhshandegan Moghaddam, Mehdi Khosravian, Arman Didandeh, Bahram Sadeghi Bigham

Publication date: 16 April 2014

Published in: Information Sciences (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.ins.2013.01.017

zbMATH Keywords

algorithmartificial intelligenceVoronoi diagramfacility locationcomputational geometryreactive agent

Mathematics Subject Classification ID

Continuous location (90B85) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05) Agent technology and artificial intelligence (68T42)

Related Items

Solving the \(k\)-influence region problem with the GPU ⋮ Optimization of facility location and size problem based on bi-level multi-objective programming ⋮ The \(\sigma\)-neighborhood skyline queries ⋮ Data imprecision under \(\lambda\)-geometry model ⋮ On efficient \( k\)-optimal-location-selection query processing in metric spaces

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Ectropy of diversity measures for populations in Euclidean space
• A sweepline algorithm for Euclidean Voronoi diagram of circles
• A hybrid modified PSO approach to VaR-based facility location problems with variable capacity in fuzzy random uncertainty
• Dynamic polar diagram
• Algorithms – ESA 2005