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.
Sign-in/Register to access full text options 
Free) 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a call
