The IRMA Community
Newsletters
Research IRM
Click a keyword to search titles using our InfoSci-OnDemand powered search:
|
Evolutionary Algorithms for Multi-Objective Scheduling in a Hybrid Manufacturing System
Abstract
Problems encountered in real manufacturing environments are complex to solve optimally, and they are expected to fulfill multiple objectives. Such problems are called multi-objective optimization problems(MOPs) involving conflicting objectives. The use of multi-objective evolutionary algorithms (MOEAs) to find solutions for these problems has increased over the last decade. It has been shown that MOEAs are well-suited to search solutions for MOPs having multiple objectives. In this chapter, in addition to comprehensive information, two different MOEAs are implemented to solve a MOP for comparison purposes. One of these algorithms is the non-dominated sorting genetic algorithm (NSGA-II), the effectiveness of which has already been demonstrated in the literature for solving complex MOPs. The other algorithm is fast Pareto genetic algorithm (FastPGA), which has population regulation operator to adapt the population size. These two algorithms are used to solve a scheduling problem in a Hybrid Manufacturing System (HMS). Computational results indicate that FastPGA outperforms NSGA-II.
Related Content
|
Poshan Yu, Zixuan Zhao, Emanuela Hanes.
© 2023.
29 pages.
|
|
Subramaniam Meenakshi Sundaram, Tejaswini R. Murgod, Madhu M. Nayak, Usha Rani Janardhan, Usha Obalanarasimhaiah.
© 2023.
20 pages.
|
|
Rekha R. Nair, Tina Babu, Kishore S..
© 2023.
23 pages.
|
|
Wasswa Shafik.
© 2023.
22 pages.
|
|
Jay Kumar Jain, Dipti Chauhan.
© 2023.
24 pages.
|
|
George Makropoulos, Dimitrios Fragkos, Harilaos Koumaras, Nancy Alonistioti, Alexandros Kaloxylos, Vaios Koumaras, Theoni Dounia, Christos Sakkas, Dimitris Tsolkas.
© 2023.
19 pages.
|
|
Shouvik Sanyal, Kalimuthu M., Thangaraja Arumugam, Aruna R., Balaji J., Ajitha Savarimuthu, Chandan Chavadi, Dhanabalan Thangam, Sendhilkumar Manoharan, Shasikala Patil.
© 2023.
17 pages.
|
|
|