- -

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

RiuNet: Institutional repository of the Polithecnic University of Valencia

Share/Send to

Cited by

Statistics

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

Show full item record

Gracia Calandin, CP.; Andrés Romano, C.; Gracia Calandin, LI. (2013). A hybrid approach based on genetic algorithms to solve the problem of cutting structural beams in a metalwork company. Journal of Heuristics. 19(2):253-273. doi:10.1007/s10732-011-9187-x

Por favor, use este identificador para citar o enlazar este ítem: http://hdl.handle.net/10251/61406

Files in this item

Item Metadata

Title: A hybrid approach based on genetic algorithms to solve the problem of cutting structural beams in a metalwork company
Author:
UPV Unit: Universitat Politècnica de València. Departamento de Organización de Empresas - Departament d'Organització d'Empreses
Universitat Politècnica de València. Departamento de Ingeniería de Sistemas y Automática - Departament d'Enginyeria de Sistemes i Automàtica
Issued date:
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 ...[+]
Subjects: Cutting stock problem , Pattern generation , Hybrid metaheuristics , GA
Copyrigths: Reserva de todos los derechos
Source:
Journal of Heuristics. (issn: 1381-1231 )
DOI: 10.1007/s10732-011-9187-x
Publisher:
Springer Verlag (Germany)
Publisher version: http://dx.doi.org/10.1007/s10732-011-9187-x
Type: Artículo

References

Aktin, T., Özdemir, R.G.: An integrated approach to the one dimensional cutting stock problem in coronary stent manufacturing. Eur. J. Oper. Res. 196, 737–743 (2009)

Alves, C., Valério de Carvalho, J.M.: A stabilized branch-and-price-and-cut algorithm for the multiple length cutting stock problem. Comput. Oper. Res. 35, 1315–1328 (2008)

Anand, S., McCord, C., Sharma, R., et al.: An integrated machine vision based system for solving the nonconvex cutting stock problem using genetic algorithms. J. Manuf. Syst. 18, 396–415 (1999) [+]
Aktin, T., Özdemir, R.G.: An integrated approach to the one dimensional cutting stock problem in coronary stent manufacturing. Eur. J. Oper. Res. 196, 737–743 (2009)

Alves, C., Valério de Carvalho, J.M.: A stabilized branch-and-price-and-cut algorithm for the multiple length cutting stock problem. Comput. Oper. Res. 35, 1315–1328 (2008)

Anand, S., McCord, C., Sharma, R., et al.: An integrated machine vision based system for solving the nonconvex cutting stock problem using genetic algorithms. J. Manuf. Syst. 18, 396–415 (1999)

Belov, G., Scheithauer, G.: A cutting plane algorithm for the one-dimensional cutting stock problem with multiple stock lengths. Eur. J. Oper. Res. 141, 274–294 (2002)

Christofides, N., Hadjiconstantinou, E.: An exact algorithm for orthogonal 2-D cutting problems using guillotine cuts. Eur. J. Oper. Res. 83, 21–38 (1995)

Elizondo, R., Parada, V., Pradenas, L., Artigues, C.: An evolutionary and constructive approach to a crew scheduling problem in underground passenger transport. J. Heuristics 16, 575–591 (2010)

Fan, L., Mumford, C.L.: A metaheuristic approach to the urban transit routing problem. J. Heuristics 16, 353–372 (2010)

Gau, T., Wäscher, G.: CUTGEN1: a problem generator for the standard one-dimensional cutting stock problem. Eur. J. Oper. Res. 84, 572–579 (1995)

Gilmore, P.C., Gomory, R.E.: A linear programming approach to the cutting stock problem. Oper. Res. 9, 849–859 (1961)

Gilmore, P.C., Gomory, R.E.: A linear programming approach to the cutting stock problem. Part II. Oper. Res. 11, 863–888 (1963)

Ghiani, G., Laganà, G., Laporte, G., Mari, F.: Ant colony optimization for the arc routing problem with intermediate facilities under capacity and length restrictions. J. Heuristics 16, 211–233 (2010)

Gonçalves, J.F., Resende, G.C.: Biased random-key genetic algorithms for combinatorial optimization. J. Heuristics (2011). doi: 10.1007/s10732-010-9143-1

Gradisar, M., Kljajic, M., Resinovic, G., et al.: A sequential heuristic procedure for one-dimensional cutting. Eur. J. Oper. Res. 114, 557–568 (1999)

Haessler, R.W.: One-dimensional cutting stock problems and solution procedures. Math. Comput. Model. 16, 1–8 (1992)

Haessler, R.W., Sweeney, P.E.: Cutting stock problems and solution procedures. Eur. J. Oper. Res. 54(2), 141–150 (1991)

Haessler, R.W.: Solving the two-stage cutting stock problem. Omega 7, 145–151 (1979)

Hinterding, R., Khan, L.: Genetic algorithms for cutting stock problems: with and without contiguity. In: Yao, X. (ed.) Progress in Evolutionary Computation. LNAI, vol. 956, pp. 166–186. Springer, Berlin (1995)

Holthaus, O.: Decomposition approaches for solving the integer one-dimensional cutting stock problem with different types of standard lengths. Eur. J. Oper. Res. 141, 295–312 (2002)

Kantorovich, L.V.: Mathematical methods of organizing and planning production. Manag. Sci. 6, 366–422 (1939) (Translation to English 1960)

Liang, K., Yao, X., Newton, C., et al.: A new evolutionary approach to cutting stock problems with and without contiguity. Comput. Oper. Res. 29, 1641–1659 (2002)

Poldi, K., Arenales, M.: Heuristics for the one-dimensional cutting stock problem with limited multiple stock lengths. Comput. Oper. Res. 36, 2074–2081 (2009)

Suliman, S.M.A.: Pattern generating procedure for the cutting stock problem. Int. J. Prod. Econ. 74, 293–301 (2001)

Talbi, E.-G.: A taxonomy of hybrid metaheuristics. J. Heuristics 8, 541–564 (2002)

Vahrenkamp, R.: Random search in the one-dimensional cutting stock problem. Eur. J. Oper. Res. 95, 191–200 (1996)

Vanderbeck, F.: Exact algorithm for minimizing the number of set ups in the one dimensional cutting stock problems. Oper. Res. 48, 915–926 (2000)

Wagner, B.J.: A genetic algorithm solution for one-dimensional bundled stock cutting. Eur. J. Oper. Res. 117, 368–381 (1999)

Wäscher, G., Haußner, H., Schumann, H.: An improved typology of cutting and packing problems. Eur. J. Oper. Res. 183, 1109–1130 (2007)

[-]

This item appears in the following Collection(s)

Show full item record