COST-EFFECTIVENESS OF USING THE LOCAL SEARCH METHOD FOR THE TASK OF OPERATIONAL PLANNING

Abstract

A modification of the local search algorithm is considered using tournament selection for the task of operational planning in the production of plastic products. A comparative analysis of the results of the algorithm showed a direct dependence of the results on the presence of tournament selection and population size. The program is designed for operational planning in the production of plastic products, where it is necessary to take into account the volume and period of production of each type of product with the minimum number of changes in equipment settings. The objective of optimization is to minimize the number of product shifts in the production plan. It is proposed to modify the genetic algorithm using tournament selection for the task of planning types of products at production facilities. This algorithm is a local search method that allows you to gradually improve a certain result in some vicinity of the known solution. Purpose. The goal is to minimize the number of product shifts in the production plan. Methodology of work: the article used methods of system analysis, operations research, optimization theories, economic and mathematical methods and statistical methods of analysis. Results: on average, the solution is most quickly found with an initial population size of 100 individuals, and this time is less than the largest average values by 2 times. Tournament selection, reducing time costs, reduces the likelihood of finding an optimal solution. Practical implications. Results are useful on production lines to distribute capacity loads.

Keywords

• genetic algorithm
• local search method
• capacity load planning task
• tournament selection