Ваш браузер устарел.

Для того, чтобы использовать все возможности сайта, загрузите и установите один из этих браузеров.

скрыть

Article

  • Title

    Use of genetic algorithm as a solution of unidimensional cutting rationalization problem

  • Authors

    Smirnova К. К.
    Davydov V. О.

  • Subject

    ENERGETICS. HEAT ENGINEERING. ELECTRICAL ENGINEERING

  • Year 2017
    Issue 3(53)
    UDC 65.011.42
    DOI 10.15276/opu.3.53.2017.08
    Pages 59-63
  • Abstract

    The following research is dedicated to studying an example of a solution of unidimension cutting rationalization problem. The possibility to use the elements of GA (genetic algorithm) theory at its determination is shown. The specific of the following problem is that in the process of solution search the number of frontages and cutting details is steady, but their order is variable. The modifications of the classical genetic algorithm allowed us to develop a new algorithm of solution search. The results of the solution were used to create a DLL-library, which is easily integrated in different kinds of application software.

  • Keywords rationalization/efficiency, unidimensional cutting, genetic algorithm
  • Viewed: 370 Dowloaded: 0
  • Download Article
  • References

    1. Гэри М. Джонсон Д. Вычислительные машины и труднорешаемые задачи. Москва: Мир, 1982. 416 с.
    2. Zhang G. Parametrized On-Line Open-End Bin Packing. Computing 60. 1998. P. 267–273.
    3. Zhang G. Worst-Case Analysis of the FFH Algorithm For-Online Variable-Sized Bin Packing. Compu-ting 56. 1996. P. 165–172.
    4. Рутковская Д., Пилиньский М., Рутковский Л. Нейронные сети, генетические алгоритмы и не-четкие системы / Пер. И.Д. Рудинский. Москва: Горячая линия Телеком. 2006. 452 с.

  • Creative Commons License by Author(s)