Hybrid metaheuristic approach GA-SA for the buffer allocation problem that minimizes the work in process in open serial production lines

• Main Authors: José Omar Hernández-Vázquez, Salvador Hernández-González, José Alfredo Jiménez-García, Manuel Darío Hernández-Ripalda, José Israel Hernández-Vázquez
• Format: Article
• Language: Spanish
• Published: Universitat Politecnica de Valencia 2019-09-01
• Series: Revista Iberoamericana de Automática e Informática Industrial RIAI
• Subjects: control de inventario; optimización y métodos computacionales; bap; metaheurísticas híbridas; líneas de producción
• Online Access: https://polipapers.upv.es/index.php/RIAI/article/view/10883
• ISSN: 1697-7912; 1697-7920

The Buffer Allocation Problem (BAP) is a problem of combinatorial NP-Hard optimization in the design of production lines. This consists of defining the allocation of storage places (buffers) within a production line, in order to maximize the efficiency of the process. The methods of optimization have been reported with greater success in recent years are metaheuristic techniques. In this work, a hybrid approach is proposed that uses the metaheuristic techniques of Genetic Algorithms (GA) and Simulated Annealing (SA), with the objective of determining the required buffers that minimize the average work in process (WIP) in open serial production lines M/M/1/K. The evaluation is carried out with an analytical method of decomposition. The results obtained demonstrate the computational efficiency of the proposed hybrid algorithm with respect to a simple SA or GA.