Title :
A traveling salesman problem variation in a cut out optimization
Author_Institution :
Inst. Nat. des Sci. Appliques, Mt. St. Aignan, France
Abstract :
In this paper we present the optimization of cutting out sheet shapes. We will focus on one step of this process which is equivalent to a travelling salesman problem (TSP). Its characteristics will allow us to define and examine a variation of the TSP
Keywords :
computational geometry; cutting; scheduling; travelling salesman problems; TSP; cut out optimization; optimization; stock cutting; traveling salesman problem variation; Computer aided manufacturing; Finishing; Heuristic algorithms; Instruments; Joining processes; Manufacturing processes; Mathematics; Performance analysis; Shape; Traveling salesman problems;
Conference_Titel :
Systems, Man, and Cybernetics, 1996., IEEE International Conference on
Conference_Location :
Beijing
Print_ISBN :
0-7803-3280-6
DOI :
10.1109/ICSMC.1996.565495
