A feasible path-based branch and bound algorithm for strongly nonconvex MINLP problems
In this paper, a feasible path-based branch and bound (B&B) algorithm is proposed to solve mixed-integer nonlinear programming problems with highly nonconvex nature through integration of the previously proposed hybrid feasible-path optimisation algorithm and the branch and bound method. The...
| Main Authors: | , , , |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
Frontiers Media S.A.
2022-09-01
|
| Series: | Frontiers in Chemical Engineering |
| Subjects: | |
| Online Access: | https://www.frontiersin.org/articles/10.3389/fceng.2022.983162/full |
| _version_ | 1798036460614451200 |
|---|---|
| author | Chao Liu Yingjie Ma Dongda Zhang Jie Li |
| author_facet | Chao Liu Yingjie Ma Dongda Zhang Jie Li |
| author_sort | Chao Liu |
| collection | DOAJ |
| description | In this paper, a feasible path-based branch and bound (B&B) algorithm is proposed to solve mixed-integer nonlinear programming problems with highly nonconvex nature through integration of the previously proposed hybrid feasible-path optimisation algorithm and the branch and bound method. The main advantage of this novel algorithm is that our previously proposed hybrid steady-state and time-relaxation-based optimisation algorithm is employed to solve a nonlinear programming (NLP) subproblem at each node during B&B. The solution from a parent node in B&B is used to initialize the NLP subproblems at the child nodes to improve computational efficiency. This approach allows circumventing complex initialisation procedure and overcoming difficulties in convergence of process simulation. The capability of the proposed algorithm is illustrated by several process synthesis and intensification problems using rigorous models. |
| first_indexed | 2024-04-11T21:13:14Z |
| format | Article |
| id | doaj.art-b37fe45e3a764b638144820ac735e810 |
| institution | Directory Open Access Journal |
| issn | 2673-2718 |
| language | English |
| last_indexed | 2024-04-11T21:13:14Z |
| publishDate | 2022-09-01 |
| publisher | Frontiers Media S.A. |
| record_format | Article |
| series | Frontiers in Chemical Engineering |
| spelling | doaj.art-b37fe45e3a764b638144820ac735e8102022-12-22T04:02:56ZengFrontiers Media S.A.Frontiers in Chemical Engineering2673-27182022-09-01410.3389/fceng.2022.983162983162A feasible path-based branch and bound algorithm for strongly nonconvex MINLP problemsChao LiuYingjie MaDongda ZhangJie LiIn this paper, a feasible path-based branch and bound (B&B) algorithm is proposed to solve mixed-integer nonlinear programming problems with highly nonconvex nature through integration of the previously proposed hybrid feasible-path optimisation algorithm and the branch and bound method. The main advantage of this novel algorithm is that our previously proposed hybrid steady-state and time-relaxation-based optimisation algorithm is employed to solve a nonlinear programming (NLP) subproblem at each node during B&B. The solution from a parent node in B&B is used to initialize the NLP subproblems at the child nodes to improve computational efficiency. This approach allows circumventing complex initialisation procedure and overcoming difficulties in convergence of process simulation. The capability of the proposed algorithm is illustrated by several process synthesis and intensification problems using rigorous models.https://www.frontiersin.org/articles/10.3389/fceng.2022.983162/fullbranch and bound (B&B)MINLP (mixed integer nonlinear programming)feasible path optimisation algorithmprocess synthesisprocess intensification |
| spellingShingle | Chao Liu Yingjie Ma Dongda Zhang Jie Li A feasible path-based branch and bound algorithm for strongly nonconvex MINLP problems Frontiers in Chemical Engineering branch and bound (B&B) MINLP (mixed integer nonlinear programming) feasible path optimisation algorithm process synthesis process intensification |
| title | A feasible path-based branch and bound algorithm for strongly nonconvex MINLP problems |
| title_full | A feasible path-based branch and bound algorithm for strongly nonconvex MINLP problems |
| title_fullStr | A feasible path-based branch and bound algorithm for strongly nonconvex MINLP problems |
| title_full_unstemmed | A feasible path-based branch and bound algorithm for strongly nonconvex MINLP problems |
| title_short | A feasible path-based branch and bound algorithm for strongly nonconvex MINLP problems |
| title_sort | feasible path based branch and bound algorithm for strongly nonconvex minlp problems |
| topic | branch and bound (B&B) MINLP (mixed integer nonlinear programming) feasible path optimisation algorithm process synthesis process intensification |
| url | https://www.frontiersin.org/articles/10.3389/fceng.2022.983162/full |
| work_keys_str_mv | AT chaoliu afeasiblepathbasedbranchandboundalgorithmforstronglynonconvexminlpproblems AT yingjiema afeasiblepathbasedbranchandboundalgorithmforstronglynonconvexminlpproblems AT dongdazhang afeasiblepathbasedbranchandboundalgorithmforstronglynonconvexminlpproblems AT jieli afeasiblepathbasedbranchandboundalgorithmforstronglynonconvexminlpproblems AT chaoliu feasiblepathbasedbranchandboundalgorithmforstronglynonconvexminlpproblems AT yingjiema feasiblepathbasedbranchandboundalgorithmforstronglynonconvexminlpproblems AT dongdazhang feasiblepathbasedbranchandboundalgorithmforstronglynonconvexminlpproblems AT jieli feasiblepathbasedbranchandboundalgorithmforstronglynonconvexminlpproblems |