Publicação: An evolutionary algorithm for the one-dimensional cutting stock problem
dc.contributor.author | Araujo, Silvio A. [UNESP] | |
dc.contributor.author | Constantino, Ademir A. | |
dc.contributor.author | Poldi, Kelly C. | |
dc.contributor.institution | Universidade Estadual Paulista (Unesp) | |
dc.contributor.institution | Universidade Estadual de Maringá (UEM) | |
dc.contributor.institution | Universidade Federal de São Paulo (UNIFESP) | |
dc.date.accessioned | 2014-05-20T15:31:26Z | |
dc.date.available | 2014-05-20T15:31:26Z | |
dc.date.issued | 2011-01-01 | |
dc.description.abstract | This paper deals with the one-dimensional integer cutting stock problem, which consists of cutting a set of available objects in stock in order to produce ordered smaller items in such a way as to minimize the waste of material. The case in which there are various types of objects available in stock in limited quantities is studied. A new heuristic method based on the evolutionary algorithm concept is proposed to solve the problem. This heuristic is empirically analyzed by solving randomly generated instances and the results are compared with other methods from the literature. | en |
dc.description.affiliation | Univ Estadual Paulista, Sao Jose do Rio Preto, SP, Brazil | |
dc.description.affiliation | Universidade Estadual de Maringá (UEM), Maringa, PR, Brazil | |
dc.description.affiliation | Univ Fed São Paulo, Sao Jose Dos Campos, SP, Brazil | |
dc.description.affiliationUnesp | Univ Estadual Paulista, Sao Jose do Rio Preto, SP, Brazil | |
dc.description.sponsorship | Conselho Nacional de Desenvolvimento Científico e Tecnológico (CNPq) | |
dc.description.sponsorship | Fundação de Amparo à Pesquisa do Estado de São Paulo (FAPESP) | |
dc.format.extent | 115-127 | |
dc.identifier | http://dx.doi.org/10.1111/j.1475-3995.2009.00760.x | |
dc.identifier.citation | International Transactions In Operational Research. Malden: Wiley-blackwell, v. 18, n. 1, p. 115-127, 2011. | |
dc.identifier.doi | 10.1111/j.1475-3995.2009.00760.x | |
dc.identifier.issn | 0969-6016 | |
dc.identifier.orcid | 0000-0002-4762-2048 | |
dc.identifier.uri | http://hdl.handle.net/11449/40576 | |
dc.identifier.wos | WOS:000294307600007 | |
dc.language.iso | eng | |
dc.publisher | Wiley-Blackwell | |
dc.relation.ispartof | International Transactions in Operational Research | |
dc.relation.ispartofjcr | 2.400 | |
dc.relation.ispartofsjr | 1,071 | |
dc.rights.accessRights | Acesso restrito | pt |
dc.source | Web of Science | |
dc.subject | integer optimization | en |
dc.subject | cutting stock problem | en |
dc.subject | evolutionary algorithm | en |
dc.title | An evolutionary algorithm for the one-dimensional cutting stock problem | en |
dc.type | Artigo | pt |
dcterms.license | http://olabout.wiley.com/WileyCDA/Section/id-406071.html | |
dcterms.rightsHolder | Wiley-blackwell | |
dspace.entity.type | Publication | |
unesp.author.orcid | 0000-0002-4762-2048[1] | |
unesp.campus | Universidade Estadual Paulista (UNESP), Instituto de Biociências, Letras e Ciências Exatas, São José do Rio Preto | pt |
Arquivos
Licença do Pacote
1 - 2 de 2
Carregando...
- Nome:
- license.txt
- Tamanho:
- 1.71 KB
- Formato:
- Item-specific license agreed upon to submission
- Descrição:
Carregando...
- Nome:
- license.txt
- Tamanho:
- 1.71 KB
- Formato:
- Item-specific license agreed upon to submission
- Descrição: