otimização de layouts industriais com base em busca tabu optimization of industrial layouts based on tabu search
Clicks: 111
ID: 256608
2003
Article Quality & Performance Metrics
Overall Quality
Not rated
Combines reader engagement with the AI quality analysis. This
article has not been analysed, so there is no overall score —
reader engagement is measured and shown alongside.
Reader Engagement
Steady Performance
30.0
/100
111 views
17 readers
AI Quality Assessment
Not analyzed
Readership in this journal
SteadyRanked #50 of 60 articles by views in journal of pharmacy and pharmacognosy research
Most read
Least read
Bar heights use a square-root scale.
Mint this article as an NFT
Not yet mintedCreate a permanent, verifiable on-chain record of this article on the Scimatic Network. The NFT is held in your Journament account, and you can withdraw it to your own wallet at any time.
5
SUSD
one-off · no wallet required
Abstract
Este artigo aborda uma solução computacional para o problema de layout industrial considerando hard-constraints não tratadas em trabalhos anteriores. O problema é solucionado em duas etapas. Na primeira, uma solução inicial baseada em heurística construtiva é gerada e na segunda, por intermédio da aplicação da meta-heurística busca tabu, a solução inicial é melhorada. Como contribuição, apresenta-se a ferramenta computacional denominada Ambiente Visual para Otimização de Layout Industrial (AVOLI), a fim de gerar layouts viáveis e eficientes capazes de tratar problemas de grande porte sujeitos a um conjunto de restrições realistas.
This paper approaches a computational solving of the industrial layout problem considering hardconstraints not handled in previous works. The problem is solved in two steps: first a constructiveheuristic-based initial solution is generated and then tabu search heuristic is used to improve it. As a contribution, it shown a computational tool named AVOLI (Visual Environment for Optimization of Industrial Layout) that will aid planners and production engineers in the generation of layouts that contemplate real constraints.
This paper approaches a computational solving of the industrial layout problem considering hardconstraints not handled in previous works. The problem is solved in two steps: first a constructiveheuristic-based initial solution is generated and then tabu search heuristic is used to improve it. As a contribution, it shown a computational tool named AVOLI (Visual Environment for Optimization of Industrial Layout) that will aid planners and production engineers in the generation of layouts that contemplate real constraints.
| Reference Key |
martins2003gestootimizao
Use this key to autocite in the manuscript while using
SciMatic Manuscript Manager or Thesis Manager
|
|---|---|
| Authors | ;Valdair Candido Martins;Leandro dos Santos Coelho;Marco Antonio Barbosa Cândido;Ricardo Ferrari Pacheco |
| Journal | journal of pharmacy and pharmacognosy research |
| Year | 2003 |
| DOI |
10.1590/S0104-530X2003000100006
|
| URL | |
| Keywords |
Citations
No citations found. To add a citation, contact the admin at info@scimatic.org
Comments
No comments yet. Be the first to comment on this article.