Publication Type : Book Chapter
Publisher : Springer
Source : In International Conference on Communication, Computing and Electronics Systems: Proceedings of ICCCES 2020, vol. 733, p. 419. Springer Nature, 2021.
Url : https://link.springer.com/chapter/10.1007/978-981-33-4909-4_32
Campus : Kochi
School : School of Computing
Department : Computer Science
Year : 2021
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.
Cite this Research Publication : Krishnan, M. Soumya, and E. R. Vimina. (March 2021). "E-commerce Logistic Route Optimization Deciphered Through Meta-Heuristic Algorithms by Solving TSP." In International Conference on Communication, Computing and Electronics Systems: Proceedings of ICCCES 2020, vol. 733, p. 419. Springer Nature, 2021.