Volume 11, Issue 1 (1-2021)                   2021, 11(1): 75-99 | Back to browse issues page

XML Print

Abstract:   (6394 Views)
The capacity vehicle routing problem (CVRP) is one of the most famous issues in combinatorial optimization that has been considered so far, and has attracted the attention of many scientists and researchers today. Therefore, many exact, heuristic and meta-heuristic methods have been presented in recent decades to solve it. In this paper, due to the weaknesses in the particle swarm optimization (PSO), a hybrid-modified version of this algorithm called PPSO is presented to solve the CVRP problem. In order to evaluate the efficiency of the algorithm, 14 standard examples from 50 to 199 customers of the existing literature were considered and the results were compared with other meta-heuristic algorithms. The results show that the proposed algorithm is competitive with other meta-heuristic algorithms. Besides, this algorithm obtained very close answers to the best known solutions (BKSs) for most of the examples, so that the seven BKSs were produced by PPSO.
Full-Text [PDF 1017 kb]   (3262 Downloads)    
Type of Study: Research | Subject: Optimal design
Received: 2021/02/18 | Accepted: 2021/01/1 | Published: 2021/01/1

Rights and permissions
Creative Commons License This work is licensed under a Creative Commons Attribution-NonCommercial 4.0 International License.