Zakir Hussain Ahmed1,*, Naif Al-Otaibi1, Abdullah Al-Tameem2, Abdul Khader Jilani Saudagar2
CMC-Computers, Materials & Continua, Vol.74, No.1, pp. 1575-1605, 2023, DOI:10.32604/cmc.2023.031325
Abstract We study the capacitated vehicle routing problem (CVRP) which is a well-known NP-hard combinatorial optimization problem (COP). The aim of the problem is to serve different customers by a convoy of vehicles starting from a depot so that sum of the routing costs under their capacity constraints is minimized. Since the problem is very complicated, solving the problem using exact methods is almost impossible. So, one has to go for the heuristic/metaheuristic methods and genetic algorithm (GA) is broadly applied metaheuristic method to obtain near optimal solution to such COPs. So, this paper studies GAs to find solution to the… More >
Login
Register
