|
A Capacitated Vehicle Routing Problem considering Satisfaction Level of Customers: A Genetic Algorithm
|
مهناز نقش نیلچی    |
| دانشگاه اصفهان ، mahnaz.naghsh2@gmail.com |
|
|
چکیده: (6249 مشاهده) |
| 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. |
|
| |
|
|
متن کامل [PDF 517 kb]
(8872 دریافت)
|
نوع مطالعه: پژوهشی |
موضوع مقاله:
Mathematical Modeling and Applications of OR
دریافت: 1397/12/23 | پذیرش: 1398/7/10 | انتشار: 1398/7/10
|
|
|
|
|
|
|
| ارسال پیام به نویسنده مسئول |
|
|
|
| ارسال نظر درباره این مقاله |
|
|
|
