Abstract
A concise expression of separation sequence superstructure is proposed. Using the expression, n -1 integers can represent all possible separation sequence for n component mixture. Based on the proposed superstructure expression, the strategy of producing adjacent separation sequence is determined. Larger scale separation sequence synthesis problems are computed by using line-up competition algorithm (LCA). Results show that LCA can find optimal or near optimal separation sequence only by searching less than 2% of the total exploration space for large-scale problems.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
