{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,4,2]],"date-time":"2022-04-02T17:01:36Z","timestamp":1648918896597},"reference-count":18,"publisher":"Cambridge University Press (CUP)","issue":"1","license":[{"start":{"date-parts":[[2005,7,22]],"date-time":"2005-07-22T00:00:00Z","timestamp":1121990400000},"content-version":"unspecified","delay-in-days":171,"URL":"https:\/\/www.cambridge.org\/core\/terms"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["AIEDAM"],"published-print":{"date-parts":[[2005,2]]},"abstract":"<jats:p>This study presents an application to optimize the use of an L-cut \nguillotine machine. The application has two distinct parts to it; first, a \nnumber of rectangular shapes are placed on as few metal sheets as possible \nby using genetic algorithms. Second, the sequence for cutting these pieces \nhas to be generated. The guillotine's numeric control then uses this \nsequence to make the cuts.<\/jats:p>","DOI":"10.1017\/s0890060405050031","type":"journal-article","created":{"date-parts":[[2005,7,26]],"date-time":"2005-07-26T17:03:44Z","timestamp":1122397424000},"page":"33-38","source":"Crossref","is-referenced-by-count":1,"title":["Heuristic to optimize L-guillotine cutting operations"],"prefix":"10.1017","volume":"19","author":[{"given":"ALBERTO","family":"G\u00d3MEZ","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"DAVID","family":"DE LA FUENTE","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"PAOLO","family":"PRIORE","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"JAVIER","family":"PUENTE","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"56","published-online":{"date-parts":[[2005,7,22]]},"reference":[{"key":"S0890060405050031_ref018","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-662-03315-9"},{"key":"S0890060405050031_ref017","doi-asserted-by":"publisher","DOI":"10.1016\/S0377-2217(02)00123-6"},{"key":"S0890060405050031_ref012","unstructured":"Holland, H.J. (1975).Adaptation in natural and artificial systems.Ann Arbor, MI:University of Michigan Press."},{"key":"S0890060405050031_ref009","doi-asserted-by":"publisher","DOI":"10.1057\/palgrave.jors.2601019"},{"key":"S0890060405050031_ref005","doi-asserted-by":"publisher","DOI":"10.1287\/opre.11.6.863"},{"key":"S0890060405050031_ref003","doi-asserted-by":"publisher","DOI":"10.1016\/0377-2217(90)90350-K"},{"key":"S0890060405050031_ref004","doi-asserted-by":"publisher","DOI":"10.1287\/opre.9.6.849"},{"key":"S0890060405050031_ref014","doi-asserted-by":"publisher","DOI":"10.1016\/0377-2217(94)00166-9"},{"key":"S0890060405050031_ref016","doi-asserted-by":"publisher","DOI":"10.1016\/S0360-8352(01)00021-3"},{"key":"S0890060405050031_ref013","doi-asserted-by":"publisher","DOI":"10.1023\/A:1012590107280"},{"key":"S0890060405050031_ref011","doi-asserted-by":"publisher","DOI":"10.1016\/S0167-6377(98)00048-0"},{"key":"S0890060405050031_ref007","unstructured":"Goldberg, D. (1989).Genetic Algorithms in Search, Optimization & MachineLearning.Reading, MA:Addison\u2013Wesley."},{"key":"S0890060405050031_ref001","unstructured":"Baker, J.E. (1987).Reducing bias and inefficiency in the selection algorithm.Proc. Second Int. Conf. Genetic Algorithms, pp.14\u201321."},{"key":"S0890060405050031_ref002","unstructured":"Davis, L. (1991).Handbook of Genetic Algorithms.New York:Van Nostrand Reinhold."},{"key":"S0890060405050031_ref006","doi-asserted-by":"publisher","DOI":"10.1287\/opre.13.1.94"},{"key":"S0890060405050031_ref008","unstructured":"Goldberg, D.E. & Lingle, R. (1985).Alleles, loci, and the TSP.Proc. First Int. Conf. Genetic Algorithms, pp.154\u2013159.Hillsdale, NJ:Erlbaum."},{"key":"S0890060405050031_ref010","unstructured":"G\u00f3mez, A. , De la Fuente, D. , & Priore, P. (2000).Resoluci\u00f3n del problema de strip-packing mediante lametaheur\u00edstica algoritmos gen\u00e9ticos.Bolet\u00edn de la SEIO 16(2),12\u201316."},{"key":"S0890060405050031_ref015","doi-asserted-by":"publisher","DOI":"10.1016\/S0360-8352(96)00205-7"}],"container-title":["Artificial Intelligence for Engineering Design, Analysis and Manufacturing"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/www.cambridge.org\/core\/services\/aop-cambridge-core\/content\/view\/S0890060405050031","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,3,29]],"date-time":"2019-03-29T19:01:25Z","timestamp":1553886085000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.cambridge.org\/core\/product\/identifier\/S0890060405050031\/type\/journal_article"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2005,2]]},"references-count":18,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2005,2]]}},"alternative-id":["S0890060405050031"],"URL":"https:\/\/doi.org\/10.1017\/s0890060405050031","relation":{},"ISSN":["0890-0604","1469-1760"],"issn-type":[{"value":"0890-0604","type":"print"},{"value":"1469-1760","type":"electronic"}],"subject":[],"published":{"date-parts":[[2005,2]]}}}