Hierarchical Co-Evolution of Self-Configuring Bio-Inspired Algorithms for Production Scheduling with Priorities : доклад, тезисы доклада | Научно-инновационный портал СФУ

Hierarchical Co-Evolution of Self-Configuring Bio-Inspired Algorithms for Production Scheduling with Priorities : доклад, тезисы доклада

Тип публикации: доклад, тезисы доклада, статья из сборника материалов конференций

Конференция: International Workshop “Hybrid methods of modeling and optimization in complex systems” (HMMOCS 2022); Krasnoyarsk; Krasnoyarsk

Год издания: 2022

Идентификатор DOI: 10.15405/epct.23021.21

Ключевые слова: bio-inspired algorithms, self-configuring, cooperative coevolution, scheduling problem, operational production planning

Аннотация: This article is focused on the consideration of universal formulations of the scheduling problem, which can be used in the broadest sense for any existing production model. The model must have some external parameters for control, but inside it can contain any aspects and moments that are difficult to formalize, for example, dynamically appearing operations, merging and splitting batches, not a fixed order of operations, accumulating a certain weight to start an operation, and anything else. Four universal scheduling problem statements for operational production planning are considered: permutation of the lots processing order, permutation of operation priorities, real operation priorities, and lot order with machine tool priorities nested problem. The second goal of this paper is to suggest a universal optimization approach for solving such problems. A cooperative co-evolutionary method based on self-configuring bio-inspired algorithms for combinatorial and/or real optimization is proposed. For lot order with machine tool priorities problem a hierarchical co-evolution method with both combinatorial and real optimization is proposed. This optimization method helps not only to adjust the parameters of the algorithm in the process of solving the problem but also to eliminate the need to choose an algorithm suitable for a particular problem. That is, a fully automatic adjustment of the optimization method to the optimization problem is achieved, that simplifies the use of intelligent technologies in practice. The effectiveness of the application of this approach to the scheduling problem is shown.

Ссылки на полный текст

Издание

Журнал: HYBRID METHODS OF MODELING AND OPTIMIZATION IN COMPLEX SYSTEMS

Номера страниц: 167-177

Место издания: London, United Kingdom

Издатель: European Proceedings

Персоны

  • Semenkina O. E. (Reshetnev Siberian State University of Science and Technologies)
  • Popov E. A. (Reshetnev Siberian State University of Science and Technologies)
  • Semenkin E. S. (Siberian Federal University)

Вхождение в базы данных

Информация о публикациях загружается с сайта службы поддержки публикационной активности СФУ. Сообщите, если заметили неточности.

Вы можете отметить интересные фрагменты текста, которые будут доступны по уникальной ссылке в адресной строке браузера.