Utilizing Model Knowledge for Design Developed Genetic Algorithm to Solving Problem

• Autores: Hamidreza Salmani Mojaveri
• Localización: International Journal of Professional Business Review: Int. J. Prof.Bus. Rev., ISSN 2525-3654, ISSN-e 2525-3654, Vol. 3, Nº. 2 (July/December), 2018, págs. 172-186
• Idioma: inglés
• Enlaces
  • Texto completo (pdf)
• Resumen

  • One of the discussed topics in scheduling problems is Dynamic Flexible Job Shop with Parallel Machines (FDJSPM). Surveys show that this problem because of its concave and nonlinear nature usually has several local optimums. Some of the scheduling problems researchers think that genetic algorithms (GA) are appropriate approach to solve optimization problems of this kind. But researches show that one of the disadvantages of classical genetic algorithms is premature convergence and the probability of trap into the local optimum. Considering these facts, in present research, represented a developed genetic algorithm that its controlling parameters change during algorithm implementation and optimization process. This approach decreases the probability of premature convergence and trap into the local optimum. The several experiments were done show that the priority of proposed procedure of solving in field of the quality of obtained solution and convergence speed toward other present procedure.