The capacitated vehicle routing problem revisited: using fuzzy c-means clustering Online publication date: Fri, 08-Nov-2019
by Henrique Ewbank; Peter Wanke; Henrique L. Correa; Otávio Figueiredo
International Journal of Logistics Systems and Management (IJLSM), Vol. 34, No. 4, 2019
Abstract: This paper proposes to simplify complex distribution scenarios and find near-optimal solutions by applying a heuristic approach for solving the capacitated vehicle routing problem with a homogeneous fleet using fuzzy c-means as the clustering technique. A memetic algorithm determines the number of clusters and an improved fuzzy c-means algorithm allocates customers to routes. When benchmarked with other methods and compared with 50 known instances from the literature, it indicated an error average of less than 3%. Due to the nature of the errors studied, a tobit regression has been applied to predict the average percent error in terms of the characteristics of the demand and the distance of each customer. Results also suggest that kurtosis and skewness of the distances among all customers, capacity of the vehicles and standard deviation of the demand could be used to predict the average percent error.
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 Logistics Systems and Management (IJLSM):
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