Affiliation:
1. Department of East Bohemia Region, Žampach 10, 53401 Žamberk, CZECH REPUBLIC
Abstract
A delivery driver uses his truck to distribute ordered goods from the warehouse (depot) to n customers. Each customer determines the delivery point (by GPS coordinates) and time window for the distribution of goods. This problem can be called the traveling salesman problem with time windows (TSPTW). The objective of the solution is to select the sequence of delivery points so that the travel distance and the total travel time are minimal. The necessary condition is that the deliverer leaves the warehouse, visits all delivery points (where he arrives at the required time windows), and returns to the warehouse. In this article, one exact robust solution of the TSPTW is presented by using mixed integer linear programming implemented in Matlab code. The created algorithm can be used for any number n of customers.
Publisher
World Scientific and Engineering Academy and Society (WSEAS)
Reference11 articles.
1. Bentley, J. J.: Fast Algorithms for Geometric Traveling Salesman Problems. ORSA Journal on Computing. Vol. 4, No. 4, 1992, pp. 387– 411.
2. Davendra, D., Traveling Salesman Problem, Theory and Applications. InTech, Jerza Trdina 9, Rijeka, Croatia, 2010.
3. Gutin, G., and Punnen, A. P., The Traveling Salesman Problem and Its Variations. New York: Springer Science+Business Media, LLC, 2007.
4. Warren, R. H.: Generating Cyclic Permutations: Insights to the Traveling Salesman Problem. WSEAS Transactions on Information Science and Applications, Vol. 18, 2021, pp. 68–72, https://doi.org/10.37394/23209.2021.18.9.
5. Zahradka, J.: The Traveling Salesman Problem Solution by Mixed Integer Linear Programming in Matlab Code. Journal of Applied and Computational Sciences, Vol. 1, No. 1, 2022, 45– 52. https://doi.org/10.5281/zenodo.6880928.