In this division, an investigation of the influence of Crossover Probability on Genetic Algorithm (GA) conduct for the bi-criteria objective function to acquire the best resolution in a rational time in organizing of parallel machines is studied. A curious model for reducing the assigned work imbalance on the machines seeing work-in-process material is developed. The imitation on a proposed historical treasure was carried out accompanying a crossover probability of 0.4 to 0.95 (accompanying a step of 0.05) and 0.97, and it was discovered that the results were gathering for the crossover probability of 0.6 accompanying a computing opportunity of 3.41 seconds. The submitted algorithm assists the conclusion maker in analysing the objective function accompanying the computational time.
Author(s) Details:
B. V. Raghavendra,
Department
of Mechanical Engineering, JSS Academy of Technical Education, Bengaluru –
560060, India.
Dayananda
K. Pai,
Department
of Aeronautical and Automobile Engineering, Manipal Institute of Technology,
Manipal – 576104, India.
Please see the link here: https://stm.bookpi.org/TAIERT-V5/article/view/9054
