.png){kind=icon}
Return
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}
Original request for help.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
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.
Keywords:
Location allocation problem
capacitated multi-source weber problem
heuristic algorithm
Cell-based algorithm
dynamic radius
C44
C63
R42
Journal
IF:
2.6
Papers:
243
Citations:
739
Organization
Cited Papers
.png){kind=icon}
ShareSaveBranch and bound algorithms for solving the multi-commodity capacitated multi-facility Weber problem
PREAI
ShareSaveShareSave
ShareSaveShareSaveShareSaveShareSave
View more