Abstrakt:
This contribution comes up with a specific solution of the travelling salesman prob-lem. The driver of hauler has to deliver, using his truck, goods from the depot to n customers. Each customer point of delivery is given by GPS coordinates. The objec-tive of the solution is to select the sequence of delivery points so that firstly the travel distance and subsequently the total travel time are minimal. The driver visits all delivery points and returns to the depot. In this contribution, one general solution is presented using the bound-and-branche method and by using mixed integer linear programming implemented in M-function. The created algorithm can be used in general for any number n of customers.
