Navegando por Palavras-chave "integer optimization"

Agora exibindo 1 - 3 de 3
  • Nenhuma Miniatura disponível
    Item
    Somente Metadadados
    An evolutionary algorithm for the one-dimensional cutting stock problem
    (Wiley-Blackwell, 2011-01-01) Araujo, Silvio A.; Constantino, Ademir A.; Poldi, Kelly C. [UNIFESP]; Univ Estadual Paulista; Universidade Estadual de Maringá (UEM); Universidade Federal de São Paulo (UNIFESP)
    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.
  • Imagem de Miniatura
    Item
    Acesso aberto (Open Access)
    A GENETIC ALGORITHM FOR THE ONE-DIMENSIONAL CUTTING STOCK PROBLEM WITH SETUPS
    (Sociedade Brasileira de Pesquisa Operacional, 2014-05-01) Araujo, Silvio Alexandre De; Poldi, Kelly Cristina; Smith, Jim; Universidade Estadual Paulista (UNESP); Universidade Federal de São Paulo (UNIFESP); University of the West of England Faculty of Environment and Technology
    This paper investigates the one-dimensional cutting stock problem considering two conflicting objective functions: minimization of both the number of objects and the number of different cutting patterns used. A new heuristic method based on the concepts of genetic algorithms is proposed to solve the problem. This heuristic is empirically analyzed by solving randomly generated instances and also practical instances from a chemical-fiber company. The computational results show that the method is efficient and obtains positive results when compared to other methods from the literature.
  • Nenhuma Miniatura disponível
    Item
    Somente Metadadados
    Técnicas para minimização do número de padrões de corte no problema de corte de estoque
    (Universidade Federal de São Paulo (UNIFESP), 2015-10-27) Kobersztajn, Henrique Augusto [UNIFESP]; Poldi, Kelly Cristina Poldi [UNIFESP]; Universidade Federal de São Paulo (UNIFESP)
    In this work, we present an approach to the one-dimensional cutting stock problem with one type of object and also with multiple types of objects. We consider two objectives in order to obtain the final solution: minimize the total length of cut objects and the number of different cutting patterns. Both objectives, generally conflicting, are dealt independently on the proposed methods. Initially, an exact solution to the cutting stock problem is obtained and, upon this solution, procedures are applied aiming different cutting patterns reduction. The minimizing pattern reduction process does not necessarily keep the initial minimum length of cut objects, however the increase of the length is allowed in a controlled way if it implies in more pattern reduction at the final solution. Computational tests are performed with random data to evaluate empirically this approach, and good results are obtained comparing to other methods presented in literature.