APPLYING GRAPH THEORY TO OPTIMIZE PRODUCT DELIVERY ROUTES AND MINIMIZE COSTS IN THE RESTAURANT BUSINESS

An important role in the management system of restaurant business enterprises in conditions of competition belongs to solving complex tasks of managing product supply chains and developing new technological solutions for optimizing transport routes.The article presents a mathematical model of optimal product delivery for restaurant business enterprises.The purpose of the work is to present the parameters and algorithms of graph theory as a tool for analyzing and optimizing product delivery routes for the restaurant business.Routing algorithms based on graphical description are considered the most optimal analysis method for developing optimal product delivery routes, which helps minimize enterprise costs. The availability of various algorithms for the development of graph bypass routes allows you to choose the most convenient option depending on transport capabilities, the type of goods and services, time constraints, etc. A scientific and methodological basis is proposed for the use of graph theory parameters and algorithms to optimize delivery routes, which helps minimize product costs in the restaurant business, taking into account the financial component. The use of the Bellman-Ford method of dynamic programming for this algorithm as a search for the shortest path in a weighted graph is substantiated. Two options for traversing the graph in depth for chain and cyclic routes were developed and the shortest routes for delivering products and raw materials from Kyiv to all cities where «Sushiya» establishments are located were determined, namely: Irpin, Bucha, Boryspil, Cherkasy, Vinnytsia, Lviv. The results of the work consist of practical recommendations on using a logistical approach in the service system to improve the quality of services and reduce costs, which directly affects the profitability and financial stability of the restaurant business.