Separation sequence synthesis by a predictor based ordered search

Abstract
A predictor based ordered search procedure is used to scan the graph representing all possible separation sequences for a given multicomponent separation process. The algorithmic procedure is expedited by utilizing an heuristic cost function to obtain lower bound estimates of the cost of separators not yet designed. Considerable reduction in search space occurs. Optimal and near optimal sequences are readily generated.