Problem of finding the optimal route for buyer at the store with additional conditions (given a shopping list) was considered. The model, based on the algorithm for finding the optimal route for buyer at the store, was described in the article. Developed model is based on the heuristic algorithm A∗ and on the nearest neighbor method. The main objective of the problem is reduced to solving the traveling salesman problem. The model is used in finding the recommended route in the information system, which contains a map of the store and the list of available products.