.png){kind=icon}
.png){kind=icon}
Return
A simple and effective evolutionary algorithm for the capacitated location-routing problem
.png){kind=icon}
PRE
AI
DOI：10.1016/j.cor.2016.01.006.png)
.png){kind=icon}
Original request for help.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
This paper proposes a hybrid genetic algorithm (GA) to solve the capacitated location-routing problem. The proposed algorithm follows the standard GA framework using local search procedures in the mutation phase. Computational evaluation was carried out on three sets of benchmark instances from the literature. Results show that, although relatively simple, the proposed algorithm is effective, providing competitive results for benchmark instances within reasonable computing time. (C) 2016 Elsevier Ltd. All rights reserved.
Keywords:
Location
Location-routing
Genetic algorithm
AI Summary
Key information extracted from the uploaded paper, including a brief overview, abstract, background, key highlights, visual analysis, and future outlook.
Journal
C
IF:
4.3
Papers:
6.5K
Citations:
1.8W