A hybrid approach based on genetic algorithms to solve the problem of cutting structural beams in a metalwork company

Authors:
Carlos Gracia;Carlos Andrés;Luis Gracia
Affiliations:
Departamento de Organización de Empresas, Universidad Politécnica de Valencia, Valencia, Spain 46022;Departamento de Organización de Empresas, Universidad Politécnica de Valencia, Valencia, Spain 46022;Instituto IDF, Universidad Politécnica de Valencia, Valencia, Spain 46022
Venue:
Journal of Heuristics
Year:
2013

Citing 11
Cited 0

A Taxonomy of Hybrid Metaheuristics

Journal of Heuristics
A new evolutionary approach to cutting stock problems with and without contiguity

Computers and Operations Research
Genetic Algorithms for Cutting Stock Problems: With and Without Contiguity

AI '93/AI '94 Selected papers from the AI'93 and AI'94 Workshops on Evolutionary Computation, Process in Evolutionary Computation
Exact Algorithm for Minimising the Number of Setups in the One-Dimensional Cutting Stock Problem

Operations Research
A stabilized branch-and-price-and-cut algorithm for the multiple length cutting stock problem

Computers and Operations Research
Heuristics for the one-dimensional cutting stock problem with limited multiple stock lengths

Computers and Operations Research
Ant colony optimization for the arc routing problem with intermediate facilities under capacity and length restrictions

Journal of Heuristics
A metaheuristic approach to the urban transit routing problem

Journal of Heuristics
An evolutionary and constructive approach to a crew scheduling problem in underground passenger transport

Journal of Heuristics
Biased random-key genetic algorithms for combinatorial optimization

Journal of Heuristics
One-dimensional cutting stock problems and solution procedures

Mathematical and Computer Modelling: An International Journal

Quantified Score

Hi-index	0.00

Visualization

Abstract

This work presents a hybrid approach based on the use of genetic algorithms to solve efficiently the problem of cutting structural beams arising in a local metalwork company. The problem belongs to the class of one-dimensional multiple stock sizes cutting stock problem, namely 1-dimensional multiple stock sizes cutting stock problem. The proposed approach handles overproduction and underproduction of beams and embodies the reusability of remnants in the optimization process. Along with genetic algorithms, the approach incorporates other novel refinement algorithms that are based on different search and clustering strategies. Moreover, a new encoding with a variable number of genes is developed for cutting patterns in order to make possible the application of genetic operators. The approach is experimentally tested on a set of instances similar to those of the local metalwork company. In particular, comparative results show that the proposed approach substantially improves the performance of previous heuristics.