In this paper, by combining a stochastic optimization method with a refrigeration shaft work targeting method,an approach for the synthesis of a heat integrated complex distillation system in a low-temperature process...In this paper, by combining a stochastic optimization method with a refrigeration shaft work targeting method,an approach for the synthesis of a heat integrated complex distillation system in a low-temperature process is presented. The synthesis problem is formulated as a mixed-integer nonlinear programming(MINLP) problem,which is solved by simulated annealing algorithm under a random procedure to explore the optimal operating parameters and the distillation sequence structure. The shaft work targeting method is used to evaluate the minimum energy cost of the corresponding separation system during the optimization without any need for a detailed design for the heat exchanger network(HEN) and the refrigeration system(RS). The method presented in the paper can dramatically reduce the scale and complexity of the problem. A case study of ethylene cold-end separation is used to illustrate the application of the approach. Compared with the original industrial scheme, the result is encouraging.展开更多
Cache-enabled small cell networks have been regarded as a promising approach for network operators to cope with the explosive data traffic growth in future 5 G networks. However, the user association and resource allo...Cache-enabled small cell networks have been regarded as a promising approach for network operators to cope with the explosive data traffic growth in future 5 G networks. However, the user association and resource allocation mechanism has not been thoroughly studied under given content placement situation. In this paper, we formulate the joint optimization problem of user association and resource allocation as a mixed integer nonlinear programming(MINLP) problem aiming at deriving a balance between the total utility of data rates and the total data rates retrieved from caches. To solve this problem, we propose a distributed relaxing-rounding method. Simulation results demonstrate that the distributed relaxing-rounding method outperforms traditional max-SINR method and range-expansion method in terms of both total utility of data rates and total data rates retrieved from caches in practical scenarios. In addition, effects of storage and backhaul capacities on the performance are also studied.展开更多
This study proposes an efficient indirect approach for general nonlinear dynamic optimization problems without path constraints. The approach incorporates the virtues both from indirect and direct methods: it solves t...This study proposes an efficient indirect approach for general nonlinear dynamic optimization problems without path constraints. The approach incorporates the virtues both from indirect and direct methods: it solves the optimality conditions like the traditional indirect methods do, but uses a discretization technique inspired from direct methods. Compared with other indirect approaches, the proposed approach has two main advantages: (1) the discretized optimization problem only employs unconstrained nonlinear programming (NLP) algorithms such as BFGS (Broyden-Fletcher-Goldfarb-Shanno), rather than constrained NLP algorithms, therefore the computational efficiency is increased; (2) the relationship between the number of the discretized time intervals and the integration error of the four-step Adams predictor-corrector algorithm is established, thus the minimal number of time intervals that under desired integration tolerance can be estimated. The classic batch reactor problem is tested and compared in detail with literature reports, and the results reveal the effectiveness of the proposed approach. Dealing with path constraints requires extra techniques, and will be studied in the second paper.展开更多
基金the National Basic Research Program of China(2010CB720500)the National Natural Science Foundation of China(21176178)
文摘In this paper, by combining a stochastic optimization method with a refrigeration shaft work targeting method,an approach for the synthesis of a heat integrated complex distillation system in a low-temperature process is presented. The synthesis problem is formulated as a mixed-integer nonlinear programming(MINLP) problem,which is solved by simulated annealing algorithm under a random procedure to explore the optimal operating parameters and the distillation sequence structure. The shaft work targeting method is used to evaluate the minimum energy cost of the corresponding separation system during the optimization without any need for a detailed design for the heat exchanger network(HEN) and the refrigeration system(RS). The method presented in the paper can dramatically reduce the scale and complexity of the problem. A case study of ethylene cold-end separation is used to illustrate the application of the approach. Compared with the original industrial scheme, the result is encouraging.
基金supported by National Natural Science Foundation of China under Grants No. 61371087 and 61531013The Research Fund of Ministry of Education-China Mobile (MCM20150102)
文摘Cache-enabled small cell networks have been regarded as a promising approach for network operators to cope with the explosive data traffic growth in future 5 G networks. However, the user association and resource allocation mechanism has not been thoroughly studied under given content placement situation. In this paper, we formulate the joint optimization problem of user association and resource allocation as a mixed integer nonlinear programming(MINLP) problem aiming at deriving a balance between the total utility of data rates and the total data rates retrieved from caches. To solve this problem, we propose a distributed relaxing-rounding method. Simulation results demonstrate that the distributed relaxing-rounding method outperforms traditional max-SINR method and range-expansion method in terms of both total utility of data rates and total data rates retrieved from caches in practical scenarios. In addition, effects of storage and backhaul capacities on the performance are also studied.
基金Supported by the National Natural Science Foundation of China (U1162130)the National High Technology Research and Development Program of China (2006AA05Z226)the Outstanding Youth Science Foundation,Zhejiang Province (R4100133)
文摘This study proposes an efficient indirect approach for general nonlinear dynamic optimization problems without path constraints. The approach incorporates the virtues both from indirect and direct methods: it solves the optimality conditions like the traditional indirect methods do, but uses a discretization technique inspired from direct methods. Compared with other indirect approaches, the proposed approach has two main advantages: (1) the discretized optimization problem only employs unconstrained nonlinear programming (NLP) algorithms such as BFGS (Broyden-Fletcher-Goldfarb-Shanno), rather than constrained NLP algorithms, therefore the computational efficiency is increased; (2) the relationship between the number of the discretized time intervals and the integration error of the four-step Adams predictor-corrector algorithm is established, thus the minimal number of time intervals that under desired integration tolerance can be estimated. The classic batch reactor problem is tested and compared in detail with literature reports, and the results reveal the effectiveness of the proposed approach. Dealing with path constraints requires extra techniques, and will be studied in the second paper.
