The research on two phase pickup vehicle routing based on the K-means++ and genetic algorithms Online publication date: Mon, 08-Jun-2020
by Huan Zhao; Yiping Yang
International Journal of Web Engineering and Technology (IJWET), Vol. 15, No. 1, 2020
Abstract: A popular topic of interest is the development of an efficient vehicle routing plan, which needs to meet customer requirements and ensure delivery with the lowest cost. This paper established a model of the vehicle routing problem with a time window and static network considering the vehicle type, type of goods, and customer satisfaction requirements to build an optimisation model. By optimising the combination of the K-means++ and genetic algorithms, the problem is transformed into a two stage solution, supplier clustering is performed using the K-means++ algorithm, and the vehicle path is determined using the genetic algorithm in each cluster arrangement. Finally, the optimisation results are compared with the actual delivery data, which demonstrates that the optimisation results are superior to the current vehicle arrangement in terms of vehicle utilisation and cost. Finally, an example is presented to illustrate the feasibility of the proposed algorithm.
Existing subscribers:
Go to Inderscience Online Journals to access the Full Text of this article.
If you are not a subscriber and you just want to read the full contents of this article, buy online access here.Complimentary Subscribers, Editors or Members of the Editorial Board of the International Journal of Web Engineering and Technology (IJWET):
Login with your Inderscience username and password:
Want to subscribe?
A subscription gives you complete access to all articles in the current issue, as well as to all articles in the previous three years (where applicable). See our Orders page to subscribe.
If you still need assistance, please email subs@inderscience.com
Our Blog 
Follow us on Twitter 
Visit us on Facebook