Solving soft and hard-clustered vehicle routing problems : a bi-population collaborative memetic search approach
Year of publication: |
2025
|
---|---|
Authors: | Zhou, Yangming ; Liu, Lingheng ; Benlic, Una ; Li, Zhi-chun ; Wu, Qinghua |
Published in: |
European journal of operational research : EJOR. - Amsterdam [u.a.] : Elsevier, ISSN 0377-2217, ZDB-ID 1501061-2. - Vol. 324.2025, 3 (1.8.), p. 825-838
|
Subject: | Combinatorial optimization | Cooperative evolution | Memetic computation | Metaheuristic | Vehicle routing | Tourenplanung | Vehicle routing problem | Heuristik | Heuristics | Theorie | Theory | Mathematische Optimierung | Mathematical programming | Unternehmenskooperation | Inter-firm cooperation |
-
A fast tri-individual memetic search approach for the distance-based critical node problem
Zhou, Yangming, (2023)
-
The k-dissimilar vehicle routing problem
Talarico, Luca, (2015)
-
An iterated local search metaheuristic for the capacitated demand-driven timetabling problem
Schettini, Tommaso, (2023)
- More ...
-
Heuristic search for rank aggregation with application to label ranking
Zhou, Yangming, (2024)
-
Detecting critical nodes in sparse graphs via "reduce-solve-combine" memetic search
Zhou, Yangming, (2024)
-
Bilevel memetic search approach to the soft-clustered vehicle routing problem
Zhou, Yangming, (2023)
- More ...