Pareto Optimality of Production Schedules in the Stage of Populations Selection of the MOIA Immune Algorithm
In the paper, the problem of achieving Pareto optimal solutions set with application of the elaborated Multi Objectives Immune Algorithm is presented. The Pareto frontier provides a variety of compromise solutions for contradictive criteria to a decision maker. We propose the application of the selection based on the Pareto optimality to maintain solutions with great diversity in an immune memory. Stimulation and suppression mechanisms are used to control the diversity of generated solutions. Computer simulations are done for a job shop scheduling problem.
Laurentiu Slătineanu, Vasile Merticaru, Gheorghe Nagîţ, Margareta Coteaţă, Eugen Axinte, Petru Duşa, Gavril Muscă, Laurenţiu Ghenghea, Florin Negoescu, Octavian Lupescu, Irina Tiţa and Oana Dodun
I. Paprocka and K. Kalinowski, "Pareto Optimality of Production Schedules in the Stage of Populations Selection of the MOIA Immune Algorithm", Applied Mechanics and Materials, Vol. 657, pp. 869-873, 2014