✦ LIBER ✦

A genetic algorithm for sequencing type problems in engineering design

✍ Scribed by Min-Wei Huang; Ching C. Hsieh; Jasbir S. Arora

Publisher: John Wiley and Sons
Year: 1997
Tongue: English
Weight: 165 KB
Volume: 40
Category: Article
ISSN: 0029-5981
DOI: 10.1002/(sici)1097-0207(19970915)40:17<3105::aid-nme200>3.0.co;2-f

No coin nor oath required. For personal study only.

✦ Synopsis

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.

📜 SIMILAR VOLUMES

Improved successive quadratic programmin

Improved successive quadratic programming optimization algorithm for engineering design problems

✍ M. H. Locke; A. W. Westerberg; R. H. Edahl 📂 Article 📅 1983 🏛 American Institute of Chemical Engineers 🌐 English ⚖ 330 KB 👁 1 views

An exact algorithm for the batch sequenc

An exact algorithm for the batch sequencing problem in a two-machine flow shop with limited buffer

✍ A. Agnetis; F. Rossi; G. Gristina 📂 Article 📅 1998 🏛 John Wiley and Sons 🌐 English ⚖ 295 KB 👁 1 views

This paper deals with the problem of makespan minimization in a flow shop with two machines when the input buffer of the second machine can only host a limited number of parts. Here we analyze the problem in the context of batch processing, i.e., when identical parts must be processed consecutively.