Practical logistic applications of small scale traveling salesman problem for small and medium enterprises

The optimal allocation of orders to a transport fleet is an important task for functioning of different types of medium-sized enterprises. This problem was analysed using Monte Carlo simulation in [3]. In this paper we deal with a related task: the route optimization for visiting the firm's customers. We model this task using the Traveling Salesman Problem (TSP). The method to solve this small scale TSP must provide near optimal solutions in reasonable time when running on existing computers in Small and Medium Enterprises (SMEs). For this practical application we start by analysing Brute Force Search (BFS), and comparing its performance to other methods.