|
|
|
|
|
 |
Search published articles |
 |
|
Showing 1 results for Naghshnilchi
Mrs. Mahnaz Naghshnilchi,
Volume 10, Issue 1 (7-2019)
Abstract
Capacitated vehicle routing problem (CVRP) is one of the most well-known and applicable issues in the field of transportation. It has been proved to be an NP-Complete problem. To this end, it is needed to develop a high-performance algorithm to solve the problem, particularly in large scales. This paper develops a novel mathematical model for the CVRP considering the satisfaction level of demand nodes. Then, the proposed model is validated using a numerical example and sensitivity analyses that are implemented by CPLEX solver/GAMS software. To solve the problem efficiently, a Genetic Algorithm (GA) is designed and implemented. The obtained results demonstrate that the proposed GA can yield high-quality solutions compared to exact solutions.
|
|
|
|
|
|
|
|
|
