This paper first reflects the sales stability of dishes by defining the calculation method of average profit and selects appropriate dishes based on the relationship between profits.Then,according to the greedy algori...This paper first reflects the sales stability of dishes by defining the calculation method of average profit and selects appropriate dishes based on the relationship between profits.Then,according to the greedy algorithm,the daily replenishment quantity can be optimized into six complete knapsack problems.Finally,the genetic algorithm can solve the selection frequency and weight of each dish.The calculation results show that the maximum profit of the supermarket is 1102.2189 yuan.展开更多
文摘This paper first reflects the sales stability of dishes by defining the calculation method of average profit and selects appropriate dishes based on the relationship between profits.Then,according to the greedy algorithm,the daily replenishment quantity can be optimized into six complete knapsack problems.Finally,the genetic algorithm can solve the selection frequency and weight of each dish.The calculation results show that the maximum profit of the supermarket is 1102.2189 yuan.
