A new research paper published on arXiv introduces a novel approach to facility location problems with heterogeneous distance-decay, a scenario where the value of a facility diminishes with distance, and this decay rate varies. The study provides a tractability classification for discrete and continuous objectives, offering an exact discrete method that solves instances within seconds. Additionally, it presents a heuristic method that closely approximates optimal solutions and outperforms existing algorithms, demonstrating its effectiveness on real-world delivery order data. AI
IMPACT This research could lead to more efficient logistics and resource allocation by improving facility location strategies in scenarios with variable demand decay.
RANK_REASON The item is a research paper published on arXiv detailing a new classification and methods for a specific type of optimization problem. [lever_c_demoted from research: ic=1 ai=0.4]
Read on arXiv cs.MA (Multiagent) →
- alphaXiv
- arXiv
- CatalyzeX Code Finder for Papers
- Cooper-style alternating location-allocation
- DagsHub
- Gotit.pub
- Heterogeneous Distance-Decay Facility Location
- Hugging Face
- Influence Flower
- k-means clustering
- maximum covering
- particle swarm optimization
- ScienceCast
- Weber/p-median problem
- Weighted K-means support vector machine for cancer prediction
AI-generated summary · Google Gemini · from 1 sources. How we write summaries →
