Information System for Optimal Order Fulfillment in Hypermarkets

Abstract

In the qualification thesis, algorithms for finding the optimal path in a simplified traveling salesman problem are explored, as well as the process of developing an information system presented in the form of a computer program. A model of a connected graph is presented, and an algorithm for finding the optimal path in the space of this model is developed. It is determined that the passage through the hypermarket using the algorithm and graph model is approximately 16% faster.