Core Concepts
Proposing a hybrid genetic algorithm with multi-population to solve the capacitated location-routing problem efficiently.
Abstract
The article introduces a multi-population integrated framework for solving the capacitated location-routing problem. It focuses on generating promising offspring solutions by combining depot locations and route edge assembly. The method includes neighborhood-based local search, feasibility restoration, and diversification-oriented mutation. Extensive experiments show significant improvements in results compared to existing algorithms.
Stats
"Extensive experiments on 281 benchmark instances from the literature show that the algorithm performs remarkably well."
"Improving 101 best-known results (new upper bounds) and matching 84 best-known results."
"The proposed HGAMP algorithm has six parameters: µ, λ, α, ζ, ξ, and η."