A genetic algorithm for sequencing type problems in engineering design

Abstract

A genetic algorithm for engineering applications that involve sequencing of operations is proposed and demonstrated. Such applications are known as travelling salesman problems in operations research literature. The proposed algorithm uses some new operators that are different from those typically used in genetic algorithms. Some enhancements for improving performance of the algorithm are also described. Treatment of two salesmen in the problem is also discussed. Results for test problems, including a vehicle A-pillar subassembly welding sequence application, show performance of the proposed algorithm to be quite robust. © 1997 John Wiley & Sons, Ltd.