Based on the analysis to the random sear ch algorithm of LUUS, a modified random directed integer search algorithm (MRDI SA) is given for first time. And a practical example is given to show that the adva ntage of th...Based on the analysis to the random sear ch algorithm of LUUS, a modified random directed integer search algorithm (MRDI SA) is given for first time. And a practical example is given to show that the adva ntage of this kind of algorithm is the reliability can’t be infuenced by the ini tial value X (0) and the start search domain R (0) . Besides, i t can be applied to solve the higher dimensional constrained nonlinear integer p rogramming problem.展开更多
The fund budget of multipurpose transit smart card systems is studied by stochastic programming to assign limited funds to different applications reasonably. Under the constraints of a gross fund, models of chance-con...The fund budget of multipurpose transit smart card systems is studied by stochastic programming to assign limited funds to different applications reasonably. Under the constraints of a gross fund, models of chance-constrained and dependentchance for the fund budget of multipurpose transit smart card systems are established with application scale and social demand as random variables, respectively aiming to maximize earnings and satisfy the service requirements the furthest; and the genetic algorithm based on stochastic simulation is adopted for model solution. The calculation results show that the fund budget differs greatly with different system objectives which can cause the systems to have distinct expansibilities, and the application scales of some applications may not satisfy user demands with limited funds. The analysis results indicate that the forecast of application scales and application future demands should be done first, and then the system objective is determined according to the system mission, which can help reduce the risks of fund budgets.展开更多
A new dynamic path planning method in high dimensional workspace, radial based probabilistic roadmap motion (RBPRM) planning method, is presented. Different from general probabilistic roadmap motion planning methods, ...A new dynamic path planning method in high dimensional workspace, radial based probabilistic roadmap motion (RBPRM) planning method, is presented. Different from general probabilistic roadmap motion planning methods, it uses straight lines as long as possible to construct a path graph, so the final path obtained from the graph is relatively shorter and straighter. Experimental results show the efficiency of the algorithm in finding shorter paths in sparse environment.展开更多
A novel approach was proposed to allocate spinning reserve for dynamic economic dispatch.The proposed approach set up a two-stage stochastic programming model to allocate reserve.The model was solved using a decompose...A novel approach was proposed to allocate spinning reserve for dynamic economic dispatch.The proposed approach set up a two-stage stochastic programming model to allocate reserve.The model was solved using a decomposed algorithm based on Benders' decomposition.The model and the algorithm were applied to a simple 3-node system and an actual 445-node system for verification,respectively.Test results show that the model can save 84.5 US $ cost for the testing three-node system,and the algorithm can solve the model for 445-node system within 5 min.The test results also illustrate that the proposed approach is efficient and suitable for large system calculation.展开更多
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.展开更多
This paper deals with the jointed decision question on ordering and pricing for a short-life-cycle product under stochastic multiplicative demand depended selling price. According to the marketing practices, which ret...This paper deals with the jointed decision question on ordering and pricing for a short-life-cycle product under stochastic multiplicative demand depended selling price. According to the marketing practices, which retailers sell their products in different periods with the different marketing policies, we depict the jointed decision question with a stochastic dynamic programming model from the view of the centralized system. Then, we prove that the expected profit function are concave on decision vectors respectively, and develop the decision method for ordering and pricing. Lastly, we design the iterative search arithmetic to find the optimal decision vectors.展开更多
文摘Based on the analysis to the random sear ch algorithm of LUUS, a modified random directed integer search algorithm (MRDI SA) is given for first time. And a practical example is given to show that the adva ntage of this kind of algorithm is the reliability can’t be infuenced by the ini tial value X (0) and the start search domain R (0) . Besides, i t can be applied to solve the higher dimensional constrained nonlinear integer p rogramming problem.
基金The Key Technology R& D Program of Jiangsu Scienceand Technology Department(No.BE2006010)the Key Technology R& DProgram of Nanjing Science and Technology Bureau(No.200601001)Sci-ence and Technology Research Projects of Nanjing Metro Headquarters(No.8550143007).
文摘The fund budget of multipurpose transit smart card systems is studied by stochastic programming to assign limited funds to different applications reasonably. Under the constraints of a gross fund, models of chance-constrained and dependentchance for the fund budget of multipurpose transit smart card systems are established with application scale and social demand as random variables, respectively aiming to maximize earnings and satisfy the service requirements the furthest; and the genetic algorithm based on stochastic simulation is adopted for model solution. The calculation results show that the fund budget differs greatly with different system objectives which can cause the systems to have distinct expansibilities, and the application scales of some applications may not satisfy user demands with limited funds. The analysis results indicate that the forecast of application scales and application future demands should be done first, and then the system objective is determined according to the system mission, which can help reduce the risks of fund budgets.
文摘A new dynamic path planning method in high dimensional workspace, radial based probabilistic roadmap motion (RBPRM) planning method, is presented. Different from general probabilistic roadmap motion planning methods, it uses straight lines as long as possible to construct a path graph, so the final path obtained from the graph is relatively shorter and straighter. Experimental results show the efficiency of the algorithm in finding shorter paths in sparse environment.
基金Projects(51007047,51077087)supported by the National Natural Science Foundation of ChinaProject(2013CB228205)supported by the National Key Basic Research Program of China+1 种基金Project(20100131120039)supported by Higher Learning Doctor Discipline End Scientific Research Fund of the Ministry of Education Institution,ChinaProject(ZR2010EQ035)supported by the Natural Science Foundation of Shandong Province,China
文摘A novel approach was proposed to allocate spinning reserve for dynamic economic dispatch.The proposed approach set up a two-stage stochastic programming model to allocate reserve.The model was solved using a decomposed algorithm based on Benders' decomposition.The model and the algorithm were applied to a simple 3-node system and an actual 445-node system for verification,respectively.Test results show that the model can save 84.5 US $ cost for the testing three-node system,and the algorithm can solve the model for 445-node system within 5 min.The test results also illustrate that the proposed approach is efficient and suitable for large system calculation.
基金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.
基金This research is partly supported by National Natural Science Foundation of China （70473037）, the Innovation Fund for PhD Candidate of NUAA（4003-019010）, and the Science and Technology Foundation of Henan Education Committee（2006120004）.
文摘This paper deals with the jointed decision question on ordering and pricing for a short-life-cycle product under stochastic multiplicative demand depended selling price. According to the marketing practices, which retailers sell their products in different periods with the different marketing policies, we depict the jointed decision question with a stochastic dynamic programming model from the view of the centralized system. Then, we prove that the expected profit function are concave on decision vectors respectively, and develop the decision method for ordering and pricing. Lastly, we design the iterative search arithmetic to find the optimal decision vectors.
