Solving the CVRP with Reduction to Knapsack Problem and Greedy Clustering Heuristic Method
The vehicle routing problem is one of the most well-known optimization problems, which aims to design an optimum set of routes with the lowest cost for servicing the customers in a way that is consistent with the existing constraints. The wide practical application and scope of this problem has attr...
| Main Authors: | , |
|---|---|
| Format: | Article |
| Language: | fas |
| Published: |
Shahid Beheshti University
2020-02-01
|
| Series: | چشمانداز مدیریت صنعتی |
| Subjects: | |
| Online Access: | https://jimp.sbu.ac.ir/article_87472_55b100d9ed677e159fa42f35c800bd4c.pdf |