An Enhanced Red Deer Algorithm with Adaptive Memory Strategy for the Capacitated Vehicle Routing Problem
Journal of Information and Communication Technology · 30.04.2026 · 25 (2) · 70-95
DOI: 10.32890/jict2026.25.2.4 ↗Kurz gefasst
Fachartikel in der Zeitschrift Journal of Information and Communication Technology, online erschienen am 30.04.2026. Verfasst von Noor Nabeel und 2 weiteren Autor:innen. Der Volltext ist frei zugänglich (Open Access, CC BY 4.0).
Abstract (Originalsprache)
The vehicle routing problem (VRP), especially its capacitated (CVRP), has been extensively studied. In the CVRP, each customer must be served exactly once without exceeding the vehicle’s capacity, with the aim of minimising the total distance of all routes. As a nondeterministic polynomial (NP)-hard problem, the CVRP is best solved using metaheuristics. The red deer algorithm (RDA), inspired by red deer mating behaviour, is population-based search metaheuristic with both exploration and exploitation phases. However, it may still get trapped in local optima and lacks a strong intensification mechanism for refining solutions. In RDA, not all solutions are explored, as it imposes no limit on solution reproduction, thereby restricting exploration. Thus, this study proposes an enhanced RDA that incorporates adaptive memory strategies to strengthen exploration and exploitation. The RDA classifies the population into males (i.e., high-quality solutions) and females or hinds (i.e., lower-quality solutions), with males further divided into commanders and stags. Exploitation occurs through roaring, selecting commanders, and fighting, while exploration involves forming harems and mating commanders with hinds both within and outside their harems. In enhanced RDA, previously mated hinds are adaptively excluded to promote mating with new ones, thereby enhancing exploration and solution quality. Enhanced RDA with an adaptive memory strategy (RDAM) was tested on 87 benchmark instances, outperforming a construction algorithm by 96.5% and the original RDA by 87.3%, and showing competitive results with established methods. The adaptive memory strategy in RDA enhanced the total distance compared with the original RDA, while improving its exploration–exploitation in solving the CVRP, offering theoretical and practical benefits for logistics efficiency.
Zitieren
APA
Nabeel, N., Abdul-Rahman, S., & Wahid, J. (2026). An Enhanced Red Deer Algorithm with Adaptive Memory Strategy for the Capacitated Vehicle Routing Problem. Journal of Information and Communication Technology, 25(2), 70-95. https://doi.org/10.32890/jict2026.25.2.4
Vancouver
Nabeel N, Abdul-Rahman S, Wahid J. An Enhanced Red Deer Algorithm with Adaptive Memory Strategy for the Capacitated Vehicle Routing Problem. Journal of Information and Communication Technology. 2026;25(2):70-95. doi:10.32890/jict2026.25.2.4
BibTeX
@article{Nabeel2026,
author = {Nabeel, Noor and Abdul-Rahman, Syariza and Wahid, Juliana},
title = {An Enhanced Red Deer Algorithm with Adaptive Memory Strategy for the Capacitated Vehicle Routing Problem},
journal = {Journal of Information and Communication Technology},
year = {2026},
volume = {25},
number = {2},
pages = {70--95},
doi = {10.32890/jict2026.25.2.4}
}
EUVIMED