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...

Full description

Bibliographic Details

Main Authors:	Mohammed, Mazin Abed, Abd Ghani, Mohd Khanapi, Hamed, Raed Ibraheem, A. Mostafa, Salama, Ahmed Ibrahim, Dheyaa, Jameel, Humam Khaled, Alallah, Ahmed Hamed
Format:	Article
Language:	en
Published:	Elsevier B.V. 2017
Subjects:	QA299.6-433 Analysis
Online Access:	http://eprints.uthm.edu.my/3898/1/AJ%202017%20%28527%29.pdf http://eprints.uthm.edu.my/3898/ http://dx.doi.org/10.1016/j.jocs.2017.04.012
Tags:	Add Tag No Tags, Be the first to tag this record!