| Article ID: | iaor1999751 |
| Country: | South Korea |
| Volume: | 14 |
| Issue: | 5 |
| Start Page Number: | 416 |
| End Page Number: | 421 |
| Publication Date: | Sep 1997 |
| Journal: | Korean Journal of Chemical Engineering |
| Authors: | Chang K.S., Jeong F.Y., Oh S.C., Yeo Y.K., Chang J.Y., Kim K.S. |
| Keywords: | programming: travelling salesman, programming: branch and bound, programming: dynamic, neural networks |
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 method, Dynamic Programming method and Hopfield Neural Network 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.