Navegando por Palavras-chave "Heuristic"

Agora exibindo 1 - 3 de 3
  • Imagem de Miniatura
    Item
    Acesso aberto (Open Access)
    Um Estudo De Provas E Refutações De Imre Lakatos
    (Universidade Federal de São Paulo (UNIFESP), 2018-04-26) Carvalho, Henrique Marins De [UNIFESP]; Tranjan, Tiago [UNIFESP]; Universidade Federal de São Paulo (UNIFESP)
    Proofs And Refutations Is One Of The Most Important Works Of The Hungarian Philosopher Imre Lakatos (1922-1974) And Its Main Topic Is The Progress Evaluation Of Mathematics. The Text Is Structured As A Ficcional Story Told With The Literary Resource Of A Dialogues Set Involving A Teacher And His Pupils Arguing About The Euler Theorem About Polyhedra, Its Proofs And Counterexamples. Our Research Focused In Lakatos Ideas About The Growth Of Mathematics In A Heuristic Perspective And Has Been Set Up In Three Parts. In The First One, Aimed To Present Brief Biographical Informations About The Author And Comments About The Singular Characteristics Of This Writings Of His, Joined With Details Of His Intellectual Instruction, Highlighting Historicism And Refutationism; In The Second One, We Sought To Present A Reconstruction Of The Original Work, Joined With Comments. Finally, Taking A Stand Somewhat Far From The Text, We Selected And Explored Substantial Philosophical Questions Concerning The Truth, The Heuristic As
  • Nenhuma Miniatura disponível
    Item
    Somente Metadadados
    A heuristic approach to minimize the number of saw cycles in small-scale furniture factories
    (Springer, 2017) Toscano, Alyne; Rangel, Socorro; Yanasse, Horacio Hideki [UNIFESP]
    This paper addresses a two-dimensional cutting stock problem arising in furniture factories. The problem involves the simultaneous optimization of two, usually conflicting, objectives: minimizing the total number of objects and maximizing the cutting machine productivity in terms of the number of objects that are simultaneously cut. A heuristic algorithm to solve the problem is proposed based on variables and constraints generation. The main idea is to add, in a dynamic way, bounds to the frequency of some chosen cutting patterns. At each iteration a solution is generated and at the end we have a set of non-dominated solutions. A computational study was conducted using real data from a small-scale furniture factory. The results show that the proposed algorithm finds solutions that are as good as or better than the ones used in practice in the furniture factory.
  • Imagem de Miniatura
    Item
    Acesso aberto (Open Access)
    Uma nova heurística para o problema de minimização de trocas de ferramentas
    (Universidade Federal de São Carlos, 2012-01-01) Chaves, Antonio Augusto [UNIFESP]; Senne, Edson Luiz França; Yanasse, Horacio Hideki [UNIFESP]; Universidade Federal de São Paulo (UNIFESP); Universidade Estadual Paulista (UNESP); Instituto Nacional de Pesquisas Espaciais
    The minimization of tool switches problem (MTSP) seeks a sequence to process a set of jobs so that the number of tool switches required is minimized. This study presents a new heuristic for the MTSP. This heuristic has two phases: a constructive phase, based on a graph where the vertices correspond to tools and there is an arc k = (i, j) linking vertices i and j if and only if the tools i and j are required to execute some job; and an improvement phase, based on an Iterated Local Search. Computational results show that the proposed heuristic has a good performance on the instances tested contributing to a significant reduction in the number of nodes generated by an enumerative algorithm.