Particle swarm optimization approach for resolving the cutting stock problem

Lagha, Ghassen Ben; Dahmani, Nadia; Krichen, Saoussen

doi:10.1109/icadlt.2014.6866321

Cited by 6 publications

(6 citation statements)

References 10 publications

Supporting

Mentioning

Contrasting

Unclassified

Order By: Relevance

“…Feasible solutions were found for both limited and unlimited number of stocks. A method based on PSO was developed in Ben Lagha, Dahmani & Krichen (2014) for a cable manufacturer attaining comparable results against first fit-decreasing, MTP procedure and Perturbation-SAWMBS heuristic. An improvement for the artificial fish swarm algorithm was used to solve the 1D-CSP in Cheng & Bao (2018) yielding a better utilization rate of stock than the basic artificial fish swarm algorithm.…”

Section: State Of the Art Of 1d-cspmentioning

confidence: 99%

Minimizing the total waste in the one-dimensional cutting stock problem with the African buffalo optimization algorithm

Montiel-Arrieta,

Barragan-Vite,

Seck-Tuoh-Mora

et al. 2023

PeerJ Computer Science

View full text Add to dashboard Cite

The one-dimensional cutting-stock problem (1D-CSP) consists of obtaining a set of items of different lengths from stocks of one or different lengths, where the minimization of waste is one of the main objectives to be achieved. This problem arises in several industries like wood, glass, and paper, among others similar. Different approaches have been designed to deal with this problem ranging from exact algorithms to hybrid methods of heuristics or metaheuristics. The African Buffalo Optimization (ABO) algorithm is used in this work to address the 1D-CSP. This algorithm has been recently introduced to solve combinatorial problems such as travel salesman and bin packing problems. A procedure was designed to improve the search by taking advantage of the location of the buffaloes just before it is needed to restart the herd, with the aim of not to losing the advance reached in the search. Different instances from the literature were used to test the algorithm. The results show that the developed method is competitive in waste minimization against other heuristics, metaheuristics, and hybrid approaches.

show abstract

Section: State Of the Art Of 1d-cspmentioning

confidence: 99%

Minimizing the total waste in the one-dimensional cutting stock problem with the African buffalo optimization algorithm

Montiel-Arrieta,

Barragan-Vite,

Seck-Tuoh-Mora

et al. 2023

PeerJ Computer Science

View full text Add to dashboard Cite

show abstract

“…Muchos de estos algoritmos se han utilizado para resolver el Problema de patrones de corte, entre los cuales se destaca Tabu Search (TS), Greedy Randomized Adaptive Search Procedure (GRASP) [42] , Algoritmos genéticos [43][44][45][46] y Ant Colony optimization (ACO) [47,48], entre otros algoritmos evolucionarios [2], [2,[49][50][51][52].Según [6] desarrolló una tipología de enfoques de solución teniendo en cuenta el tipo de problema, para lo cual los dividió en dos categorías: orientados a los objetos o ítems, y los orientados a los patrones tal como se muestra en la tabla 2.…”

Section: Metaheurísticasunclassified

El Problema de patrones de corte, clasificación y enfoques/Cutting stock problem, classification and approaches

2017

View full text Add to dashboard Cite

RESUMENEl Problema de patrones es de gran importancia para empresas manufactureras que involucran el proceso de cortar grandes rollos de algún material y pasarlos a rollos más pequeños de diferentes anchos, considerando el efecto que este tienen sobre los inventarios de producto en proceso y materias primas. Una apropiada gestión de este problema no solo genera benéficos económicos, sino que también genera impactos sostenibles, en la medida que busca un equilibrio entre el costo de inventario y los desperdicios del proceso. Conscientes de la importancia de este problema en este trabajo se presenta inicialmente una introducción de lo que significa en complejidad la solución de un problema de este tipo en una empresa. Luego se enuncian sus antecedentes mediante los trabajos más importantes encontrados en la literatura, destacando algunos trabajos colombianos. Posteriormente, se aborda la clasificación del problema y se aportan sugerencias de otros aspectos a tener en cuenta en el problema. Finalmente se enmarcan los cuatro enfoques de solución más comunes dando ideas para investigaciones futura esperando con esto contribuir al desarrollo del tema.Palabras clave: Planeación del inventario; Proceso de cortado; Modelación matemática; Planeación de operaciones; Minimización de desperdicios. El problema de patrones de corte o cutting stock problem. ABSTRACTThe Cutting stock problem is of great importance for manufacturing companies that involving the process of cutting large rolls of some material into small strips of different widths, considering the effect this has on product inventories in process and raw materials. Proper management of this problem not only generates beneficial economic but also generates sustainable impacts, to the extent that seeks a balance between the cost of inventory and process waste. This paper first presents an overview of what complexity means in solving a problem of this type in a company. His background is set out with the most important works in the literature, highlighting some Colombian jobs. Then, we present classification problem and suggestions from other aspects are provided to consider when addressed cutting stock problem. Finally are framed the four most common approaches to solution giving ideas for future research, hoping thereby contribute to the development of the topic.

show abstract

“…This step corresponds to the update of the particle swarm by applying adapted PSO operators. Each particle is represented, at this step, by its position (associated reading vector) x d and is updated using formulas (11) and (12); where v d is the particle velocity, c 1 , c 2 and c 3 are real parameters comprised between 0 and 1, p d is the best known position of particle d and g d is the best known position of the entire swarm.…”

Section: Description Of the Algorithmmentioning

confidence: 99%

“…However, the Particle Swarm Optimization (PSO) approach seems to be less investigated in this research field [11]. Recent publications show few efforts conducted for applying PSO to one dimensional and two dimensional CSPs [12][13][14].…”

Section: Introductionmentioning

confidence: 99%

An adapted particle swarm optimization approach for a 2D guillotine cutting stock problem

Ayadi

Barkallah

2016

Mechanics & Industry

View full text Add to dashboard Cite

This paper focuses on the two dimensional rectangular non-oriented guillotine cutting stock problem in which pieces with different dimensions need to be cut with different quantities in order to satisfy customers orders. In order to optimize the raw material utilization, make-to-order and make-to-stock production strategies are combined by considering forecast plans with inventory constraints in addition to firm orders. An adapted version of Particle Swarm Optimization approach is proposed and combined to a hybrid heuristic. Results show that the proposed algorithm outperforms the hybrid heuristic in a reasonable computational time.

show abstract

Particle swarm optimization approach for resolving the cutting stock problem

Cited by 6 publications

References 10 publications

Minimizing the total waste in the one-dimensional cutting stock problem with the African buffalo optimization algorithm

Minimizing the total waste in the one-dimensional cutting stock problem with the African buffalo optimization algorithm

El Problema de patrones de corte, clasificación y enfoques/Cutting stock problem, classification and approaches

An adapted particle swarm optimization approach for a 2D guillotine cutting stock problem

Contact Info

Product

Resources

About