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.
layout; optimization; hard-constraints; tabu search
