关键词: 超市导购, 环境建模, 遗传-改进A*算法

Abstract: Due to the large number of products in large supermarkets and the complex space environment, customers often spend a lot of time shopping to find the purchase of goods. In response to this problem, the genetic & modified A* algorithm is proposed to help customers find a shortest path to the desired purchase. First, the matrix is used to model the spatial layout of the supermarket. Then, the shortest path between any two commodities can be found by using the modified A* algorithm. Next, according to the customer’s shopping list a shortest path can be optimized by genetic algorithm, which includes the supermarket entrance, the shopping list, and the supermarket exit. Finally, the simulation results show that in a large supermarket with multiple floors, the more different commodities the customer purchases, the better optimization ability the genetic & modified A* algorithm has, the better quality of solution is, the shorter running time is required, which can efficiently solve the shortest path planning problem.

Key words: supermarket shopping guide, environmental modeling, genetic &, modified A* algorithm