A Route Clustering and Search Heuristic for Large-Scale Multidepot ...
ieeexplore.ieee.org › document
Feb 2, 2021 · To solve LSMDCARP, we propose an iterative improvement heuristic, called route clustering and search heuristic (RoCaSH).
The experimental results showed that RoCaSH significantly outperformed the state-of-the-art algorithms, especially for the large-scale instances. It managed to ...
This paper focuses on the large scale capacitated arc routing problem. Traditional solution optimization approaches usually fail because of their poor ...
Zhang et al. created a metaheuristic to solve a generalization named the large-scale multi-depot CARP (LSMDCARP) named route clustering and search heuristic.
On the other hand, the sub-problem solving provides better routes for the subsequent route cutting off and clustering, leading to better problem decomposition.
Oct 18, 2023 · The Multi-Depot Capacitated Arc Routing Problem (MDCARP) is an important combinatorial optimization problem with wide applications in ...
On one hand, the route clustering helps the search for each subproblem by focusing more on the promising areas. On the other hand, the subproblem solving ...
On one hand, the route clustering helps the search for each subproblem by focusing more on the promising areas. On the other hand, the subproblem solving ...
The Multi-Depot Capacitated Arc Routing Problem (MDCARP) is an important combinatorial optimization problem with wide applications in logistics. Large Scale ...
Article on RoCaSH2: An Effective Route Clustering and Search Heuristic for Large-Scale Multi-Depot Capacitated Arc Routing Problem, published in IEEE ...