An Innovative Genetic Algorithm for a Multi-Objective Optimization of Two-Dimensional Cutting-Stock Problem. Issue 6 (12th May 2019)

• Record Type: Journal Article
• Authors: Mellouli, Ahmed; Mellouli, Racem; Masmoudi, Faouzi
• Is Part Of: Applied artificial intelligence. Volume 33:Issue 6(2019)
• Page Start: 531
• Page End: 547
• Publication Date: 2019-05-12
• Subjects: Artificial intelligence -- Periodicals; 006.3
• DOI: 10.1080/08839514.2019.1583857
• Languages: English
• ISSNs: 0883-9514

Abstract

ABSTRACT: This paper addressed an important variant of two-dimensional cutting stock problem. The objective was not only to minimize trim loss, as in traditional cutting stock problems, but rather to minimize the number of machine setups. This additional objective is crucial for the life of the machines and affects both the time and the cost of cutting operations. Since cutting stock problems are well known to be NP-hard, we proposed an approximate method to solve this problem in a reasonable time. This approach differs from the previous works by generating a front with many interesting solutions. By this way, the decision maker or production manager can choose the best one from the set based on other additional constraints. This approach combined a genetic algorithm with a linear programming model to estimate the optimal Pareto front of these two objectives. The effectiveness of this approach was evaluated through a set of instances collected from the literature. The experimental results for different-size problems show that this algorithm provides Pareto fronts very near to the optimal ones.