Answers are grounded in this paper and cite their sources.
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.
No takes yet. Share an insight, caveat, or question.
Rajak et al. (2020) studied this question.
Synapse has enriched 10 related papers. Consider them for comparative context: