Title: Multi-depot vehicle routing problem based on customer satisfaction

Authors: Sonu Rajak; P. Parthiban; R. Dhanalakshmi

Addresses: Department of Production Engineering, National Institute of Technology, Tiruchirappalli, 620015, India ' Department of Production Engineering, National Institute of Technology, Tiruchirappalli, 620015, India ' Department of Computer Science and Engineering, National Institute of Technology, Nagaland, Dimapur, 797103, India

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.

Keywords: vehicle routing problem; VRP; combinatorial optimisation; K-means clustering algorithm; ant colony optimisation; ACO; customers satisfaction; fuzzy time windows.

DOI: 10.1504/IJSTM.2020.106693

International Journal of Services Technology and Management, 2020 Vol.26 No.2/3, pp.252 - 265

Received: 28 Jan 2017
Accepted: 17 Jul 2017
Published online: 20 Apr 2020 *

Full-text access for editors Full-text access for subscribers Purchase this article Comment on this article