Multiobjecttve molding machine scheduling using memetic algorithms Programación multiobjetivo de máquinas moldureras a través de algoritmos meméticos

Baesler, F.; Ceballos L.; Ramirez M.

Abstract

This work presents a multiobjective optimization algorithm based on a variant of the evolutionary programming field called memetic algorithms (MA). This algorithm was proposed by the authors, combines genetic evolution with local search, in the same way as traditional MA, but with the use of independent populations for each objective, as well as a mechanism to find compromise solutions (tradeoff), where local search is performed restricted by a compromise parameter. The algorithm was applied to a scheduling problem of a molding production process and compared against two multiobjective techniques available in the literature, Multiobjective Genetic Algorithm (MOGA) and Multiobjective Simulated Annealing (MOSA). The results of the proposed approach, based on the experiments performed, outperformed the benchmark techniques based on two objectives of industrial interest, such as, the total completion time (Cmax) and the total tardiness. Both objectives are minimization. This objectives have a direct impact on the process productivity as well as the capability of delivering the goods on time.

Más información

Título de la Revista: MADERAS-CIENCIA Y TECNOLOGIA
Volumen: 8
Número: 3
Editorial: UNIV BIO-BIO
Fecha de publicación: 2006
Página de inicio: 183
Página final: 192
URL: http://www.scopus.com/inward/record.url?eid=2-s2.0-33845410188&partnerID=q2rCbXpz