Article ID | Journal | Published Year | Pages | File Type |
---|---|---|---|---|
4950991 | Journal of Computational Science | 2017 | 21 Pages |
Abstract
The findings outcome from this study have shown that: (1) A universal listed of dynamic KNNACVRP; (2) Identified and built up an assessment measure for KNNACVRP; (3) Highlight the strategies, based KNNA operations, for choosing the most ideal way (4) KNNA finds a shorter route for VRP paths. The extent of lessening the distance for each route is generally short, but the savings in the distance becomes more noteworthy while figuring the aggregate distances traveled by all transports day by day or month to month. This applies likewise to the time calculate that has been decreased marginally in view of the rate of reduction in the distances of the paths.
Related Topics
Physical Sciences and Engineering
Computer Science
Computational Theory and Mathematics
Authors
Mazin Abed Mohammed, Mohd Khanapi Abd Ghani, Raed Ibraheem Hamed, Salama A. Mostafa, Dheyaa Ahmed Ibrahim, Humam Khaled Jameel, Ahmed Hamed Alallah,