Multi-depot vehicle routing problem based on customer satisfaction
by Sonu Rajak; P. Parthiban; R. Dhanalakshmi
International Journal of Services Technology and Management (IJSTM), Vol. 26, No. 2/3, 2020

Abstract: Nowadays, meeting the customer's demands in the shortest time and least cost is the most challenging task of maintaining any supply chain. Vehicle routing problem (VRP) plays an important role in the logistics. In typical VRP, customers' are used to serving as a single depot, but in real-life single depot will not be sufficient to meet the customer's demand or customers' satisfaction. In this context, this article presents the multi-depot vehicle routing problem based on customer's satisfaction (MDVRPCS). Since MDVRPCS is an NP-hard problem so, ant colony optimisation (ACO) has been proposed to solve the MDVRPCS. The proposed algorithms have two phases. The first phase involves clustering the nodes into a desired number of groups. This has been done by using K-means clustering algorithm. The second phase involves optimisation of routes for each cluster. This is achieved by using ACO. The proposed algorithm has been tested for well-know problem instances from the literature. The results show that the algorithm is capable of obtaining good optimal solutions.

Online publication date: Mon, 20-Apr-2020

The full text of this article is only available to individual subscribers or to users at subscribing institutions.

 
Existing subscribers:
Go to Inderscience Online Journals to access the Full Text of this article.

Pay per view:
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 Services Technology and Management (IJSTM):
Login with your Inderscience username and password:

Username:        Password:          Forgotten your 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