ABSTRACT
In this paper we optimize the preparation time of a tubes machine. Tubes are hard tubes made by gluing strips of paper that are packed in paper reels, and some of them may be reused between the production of one and another tube. We present a mathematical model for the minimization of changing reels and movements and also implementations for the heuristics Nearest Neighbor, an improvement of a nearest neighbor (Best Nearest Neighbor), refinements of the Best Nearest Neighbor heuristic and a heuristic of permutation called Best Configuration using the IDE (integrated development environment) WxDev C++. The results obtained by simulations improve the one used by the company.
Keywords:
Combinatorial optimization; Generalized traveling salesman problem; Tubes machine; Heuristic; Mixed integer programming
