A GENETIC ALGORITHM FOR SEQUENCING TYPE PROBLEMS IN ENGINEERING DESIGN

A genetic algorithm for engineering applications that involve sequenci ng of operations is proposed and demonstrated. Such applications are k nown as travelling salesman problems in operations research literature . The proposed algorithm uses some new operators that are different fr om those typically used in genetic algorithms. Some enhancements for i mproving performance of the algorithm are also described. Treatment of two salesmen in the problem is also discussed. Results for test probl ems, including a vehicle A-pillar subassembly welding sequence applica tion, show performance of the proposed algorithm to be quite robust. ( C) 1997 by John Whey & Sons, Ltd.