Solving vehicle routing problem by using improved K-nearest neighbor algorithm for best solution
Vehicle routing problem (VRP) is one of the many difficult issues that have no perfect solutions yet. Many researchers over the last few decades have established numerous researches and used many methods with different techniques to handle it. But, for all research, finding the lowest cost is very c...
| Main Authors: | , , , , , , |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
Elsevier B.V.
2017
|
| Subjects: | |
| Online Access: | http://eprints.uthm.edu.my/3898/1/AJ%202017%20%28527%29.pdf |