Publications

Abstract : E-commerce business is now becoming more popular and has become a critical need of the day for every customer. When considering the revenue and expense factors, each e-commerce business spent their major outflow in its logistics activities. Logistics costs are the focused area to be optimized so that the overall business can be dealt with in a controlled and safe manner. To with the logistics part, let us first consider the problem of vehicle routing. The Vehicle Routing Problem (VRP) is an intricate situation where multiple constraints can be taken into consideration. Thus, before dealing with such a complex situation, originally to move on with the study, the simple Traveling Salesman Problem is considered here in the paper. To solve such a hard NP problem and to get an optimal solution, many alternate methods have been tried out by many. In this paper, some of the meta-heuristic algorithms are considered and each of their performance is compared depending upon the length of the route, number of cities, time of execution of each algorithm, and their error rates. These algorithms are implemented and verified using Python 3.8.