|
A Capacitated Vehicle Routing Problem considering Satisfaction Level of Customers: A Genetic Algorithm
|
Mahnaz Naghshnilchi *    |
| University of Isfahan , mahnaz.naghsh2@gmail.com |
|
|
Abstract: (6631 Views) |
| 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. |
|
| Keywords: Vehicle routing problem, Genetic algorithm, Sensitivity analysis, Satisfaction level |
|
|
Full-Text [PDF 517 kb]
(10171 Downloads)
|
Type of Study: Original |
Subject:
Mathematical Modeling and Applications of OR
Received: 2019/03/14 | Accepted: 2019/10/2 | Published: 2019/10/2
|
|
|
|
|
|
|
| Send email to the article author |
|
|
|
| Add your comments about this article |
|
|
|
