.png){kind=icon}
返回
Enhanced Cell-Based Algorithm with dynamic radius for solving capacitated multi-source Weber problem
.png){kind=icon}
PRE
AI
DOI：10.1080/17509653.2024.2446245.png)
.png){kind=icon}
原文求助.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
This study proposes a novel enhancement to location allocation algorithms called the Enhanced Cell-based Algorithm (ECBA), which specifically addresses the Capacitated Multi-source Weber Problem, a variant of the Location Allocation Problem. The ECBA finds profitable cells in a continuous space to strategically locate facilities while minimising transportation costs. ECBA operates by dividing the distribution of customers into smaller cells that signify promising locations, establishes an initial facility configuration using fixed and dynamic radii and applies an Alternating Transportation Problem to determine optimal new locations. The algorithm was tested on datasets containing 50, 654 and 1060 customers, along with various facility configurations. The results showed that the algorithm outperformed previous studies in identifying strategic facility locations while adhering to capacity restrictions. The performance and effectiveness of the ECBA make it a useful tool for addressing other LAP applications with similar requirements. These contributions extend its applicability to a variety of complex location allocation challenges.
Keyword:
Location allocation problem
capacitated multi-source weber problem
heuristic algorithm
Cell-based algorithm
dynamic radius
C44
C63
R42
期刊
IF:
2.6
论文数:
243
被引数:
739
机构
引用论文
.png){kind=icon}
Branch and bound algorithms for solving the multi-commodity capacitated multi-facility Weber problem求解多商品容量多设施韦伯问题的分支定界算法
PREAI
分享收藏分享收藏
查看更多内容