Application of traveling salesman problem (TSP) for decision of optimal production sequence.

Autor: Jeong, Eun-Young, Oh, Sea, Yeo, Yeong-Koo, Chang, Kun, Chang, Jin, Kim, Kil
Zdroj: Korean Journal of Chemical Engineering; Sep1997, Vol. 14 Issue 5, p416-421, 6p
Abstrakt: In the present study a reliable and structural decision system for production sequence of polymeric products is developed. Minimization of the amount of off-specs is the main objective in the decision of production sequence to maximize profit. Off-specs are generated when the production sequence of polymeric products is changed. The amount of off-specs depends on changes of product grades. In the present study we applied the traveling salesman problem (TSP) to achieve optimal decision of production sequence. To solve the optimal decision problem formulated by TSP, we employed three different approaches such as Branch and Bound (B&B) method, Dynamic Programming (DP) method and Hopfield Neural Network (HNN) method. Production sequences computed based on the actual plant off-spec data were compared with the sequences employed in the actual plant operation. From the comparison the decision method proposed in the present study showed increased profits and reduced off-specs. [ABSTRACT FROM AUTHOR]
Databáze: Complementary Index