In order to address the output feedback issue for linear discrete-time systems, this work suggests a brand-new adaptive dynamic programming(ADP) technique based on the internal model principle(IMP). The proposed metho...In order to address the output feedback issue for linear discrete-time systems, this work suggests a brand-new adaptive dynamic programming(ADP) technique based on the internal model principle(IMP). The proposed method, termed as IMP-ADP, does not require complete state feedback-merely the measurement of input and output data. More specifically, based on the IMP, the output control problem can first be converted into a stabilization problem. We then design an observer to reproduce the full state of the system by measuring the inputs and outputs. Moreover, this technique includes both a policy iteration algorithm and a value iteration algorithm to determine the optimal feedback gain without using a dynamic system model. It is important that with this concept one does not need to solve the regulator equation. Finally, this control method was tested on an inverter system of grid-connected LCLs to demonstrate that the proposed method provides the desired performance in terms of both tracking and disturbance rejection.展开更多
Genetic Programming (GP) is an important approach to deal with complex problem analysis and modeling, and has been applied in a wide range of areas. The development of GP involves various aspects, including design of ...Genetic Programming (GP) is an important approach to deal with complex problem analysis and modeling, and has been applied in a wide range of areas. The development of GP involves various aspects, including design of genetic operators, evolutionary controls and implementations of heuristic strategy, evaluations and other mechanisms. When designing genetic operators, it is necessary to consider the possible limitations of encoding methods of individuals. And when selecting evolutionary control strategies, it is also necessary to balance search efficiency and diversity based on representation characteristics as well as the problem itself. More importantly, all of these matters, among others, have to be implemented through tedious coding work. Therefore, GP development is both complex and time-consuming. To overcome some of these difficulties that hinder the enhancement of GP development efficiency, we explore the feasibility of mutual assistance among GP variants, and then propose a rapid GP prototyping development method based on πGrammatical Evolution (πGE). It is demonstrated through regression analysis experiments that not only is this method beneficial for the GP developers to get rid of some tedious implementations, but also enables them to concentrate on the essence of the referred problem, such as individual representation, decoding means and evaluation. Additionally, it provides new insights into the roles of individual delineations in phenotypes and semantic research of individuals.展开更多
The current financial education framework has an increasing need to introduce tools that facilitate the application of theoretical models to real-world data and contexts.However,only a limited number of free tools are...The current financial education framework has an increasing need to introduce tools that facilitate the application of theoretical models to real-world data and contexts.However,only a limited number of free tools are available for this purpose.Given this lack of tools,the present study provides two approaches to facilitate the implementa-tion of an event study.The first approach consists of a set of MS Excel files based on the Fama–French five-factor model,which allows the application of the event study methodology in a semi-automatic manner.The second approach is an open-source R-programmed tool through which results can be obtained in the context of an event study without the need for programming knowledge.This tool widens the calculus possibilities provided by the first approach and offers the option to apply not only the Fama–French five-factor model but also other models that are common in the finan-cial literature.It is a user-friendly tool that enables reproducibility of the analysis and ensures that the calculations are free of manipulation errors.Both approaches are freely available and ready-to-use.展开更多
Two classes of mixed-integer nonlinear bilevel programming problems are discussed. One is that the follower's functions are separable with respect to the follower's variables, and the other is that the follower's f...Two classes of mixed-integer nonlinear bilevel programming problems are discussed. One is that the follower's functions are separable with respect to the follower's variables, and the other is that the follower's functions are convex if the follower's variables are not restricted to integers. A genetic algorithm based on an exponential distribution is proposed for the aforementioned problems. First, for each fixed leader's variable x, it is proved that the optimal solution y of the follower's mixed-integer programming can be obtained by solving associated relaxed problems, and according to the convexity of the functions involved, a simplified branch and bound approach is given to solve the follower's programming for the second class of problems. Furthermore, based on an exponential distribution with a parameter λ, a new crossover operator is designed in which the best individuals are used to generate better offspring of crossover. The simulation results illustrate that the proposed algorithm is efficient and robust.展开更多
Deadlock resolution strategies based on siphon control are widely investigated.Their computational efficiency largely depends on siphon computation.Mixed-integer programming(MIP)can be utilized for the computation of ...Deadlock resolution strategies based on siphon control are widely investigated.Their computational efficiency largely depends on siphon computation.Mixed-integer programming(MIP)can be utilized for the computation of an emptiable siphon in a Petri net(PN).Based on it,deadlock resolution strategies can be designed without requiring complete siphon enumeration that has exponential complexity.Due to this reason,various MIP methods are proposed for various subclasses of PNs.This work proposes an innovative MIP method to compute an emptiable minimal siphon(EMS)for a subclass of PNs named S^(4)PR.In particular,many particular structural characteristics of EMS in S4 PR are formalized as constraints,which greatly reduces the solution space.Experimental results show that the proposed MIP method has higher computational efficiency.Furthermore,the proposed method allows one to determine the liveness of an ordinary S^(4)PR.展开更多
Partial cooperation models are studied for many years to solve the bilevel programming problems where the follower’s optimal reaction is not unique. However, in these existed models, the follower’s cooperation level...Partial cooperation models are studied for many years to solve the bilevel programming problems where the follower’s optimal reaction is not unique. However, in these existed models, the follower’s cooperation level does not depend on the leader’s decision. A new model is proposed to solve this deficiency. It is proved the feasibility of the new model when the reaction set of the lower level is lower semicontinuous. And the numerical results show that the new model has optimal solutions when the reaction set of the lower level is discrete, lower semi-continuous and non-lower semi-continuous.展开更多
The developments of modern mathematics and computer science make artificial neural networks become most useful tools in wide range of fields. Modeling methods of artificial neural networks are described in this paper...The developments of modern mathematics and computer science make artificial neural networks become most useful tools in wide range of fields. Modeling methods of artificial neural networks are described in this paper. The programming technique by using Matlab neural networks toolbox is discussed. The application in Material Hot Working of neural networks is also introduced.展开更多
Estimation of the rock mass modulus of deformation(Em)is one of the most important design parameters in designing many structures in and on rock.This parameter can be obtained by in situ tests,empirical relations betw...Estimation of the rock mass modulus of deformation(Em)is one of the most important design parameters in designing many structures in and on rock.This parameter can be obtained by in situ tests,empirical relations between deformation modulus and rock mass classifcation,and estimating from laboratory tests results.In this paper,a back analysis calculation is performed to present an equation for estimation of the rock mass modulus of deformation using genetic programming(GP)and numerical modeling.A database of 40,960 datasets,including vertical stress(rz),horizontal to vertical stresses ratio(k),Poisson’s ratio(m),radius of circular tunnel(r)and wall displacement of circular tunnel on the horizontal diameter(d)for input parameters and modulus of deformation for output,was established.The selected parameters are easy to determine and rock mass modulus of deformation can be obtained from instrumentation data of any size circular galleries.The resulting RMSE of 0.86 and correlation coeffcient of97%of the proposed equation demonstrated the capability of the computer program(CP)generated by GP.展开更多
This study presented a simulation-based two-stage interval-stochastic programming (STIP) model to support water resources management in the Kaidu-Konqi watershed in Northwest China. The modeling system coupled a dis...This study presented a simulation-based two-stage interval-stochastic programming (STIP) model to support water resources management in the Kaidu-Konqi watershed in Northwest China. The modeling system coupled a distributed hydrological model with an interval two-stage stochastic programing (ITSP). The distributed hydrological model was used for establishing a rainfall-runoff forecast system, while random parameters were pro- vided by the statistical analysis of simulation outcomes water resources management planning in Kaidu-Konqi The developed STIP model was applied to a real case of watershed, where three scenarios with different water re- sources management policies were analyzed. The results indicated that water shortage mainly occurred in agri- culture, ecology and forestry sectors. In comparison, the water demand from municipality, industry and stock- breeding sectors can be satisfied due to their lower consumptions and higher economic values. Different policies for ecological water allocation can result in varied system benefits, and can help to identify desired water allocation plans with a maximum economic benefit and a minimum risk of system disruption under uncertainty.展开更多
In the present work, two new, (multi-)parametric programming (mp-P)-inspired algorithms for the solutionof mixed-integer nonlinear programming (MINLP) problems are developed, with their main focus being onproces...In the present work, two new, (multi-)parametric programming (mp-P)-inspired algorithms for the solutionof mixed-integer nonlinear programming (MINLP) problems are developed, with their main focus being onprocess synthesis problems. The algorithms are developed for the special case in which the nonlinearitiesarise because of logarithmic terms, with the first one being developed for the deterministic case, and thesecond for the parametric case (p-MINLP). The key idea is to formulate and solve the square system of thefirst-order Karush-Kuhn-Tucker (KKT) conditions in an analytical way, by treating the binary variables and/or uncertain parameters as symbolic parameters. To this effect, symbolic manipulation and solution tech-niques are employed. In order to demonstrate the applicability and validity of the proposed algorithms, twoprocess synthesis case studies are examined. The corresponding solutions are then validated using state-of-the-art numerical MINLP solvers. For p-MINLP, the solution is given by an optimal solution as an explicitfunction of the uncertain parameters.展开更多
A quadratic programming model is established to choose the blocks to be blasted in a given period. The length of this period depends on the production planning requirements. During the given period, the blocks' pa...A quadratic programming model is established to choose the blocks to be blasted in a given period. The length of this period depends on the production planning requirements. During the given period, the blocks' parameters are available from the geological database of the mine. The objective is to minimize the deviation of the average ore grade of blasted blocks from the standard ore grade required by the mill. Transportation ability constraint. production quantity demand constraint. minimum safety bench constraint. block size constraint and block, bench precedence constraints are considered in forming the programming model. This model has more practical objective function and reasonable constraints compared with the existing model for this kind of problems.展开更多
At the first sight it seems that advanced operation research is not used enough in continuous production systems as comparison with mass production, batch production and job shop systems, but really in a comprehensive...At the first sight it seems that advanced operation research is not used enough in continuous production systems as comparison with mass production, batch production and job shop systems, but really in a comprehensive evaluation the advanced operation research techniques can be used in continuous production systems in developing countries very widely, because of initial inadequate plant layout, stage by stage development of production lines, the purchase of second hand machineries from various countries, plurality of customers. A case of production system planning is proposed for a chemical company in which the above mentioned conditions are almost presented. The goals and constraints in this issue are as follows: (1) Minimizing deviation of customer's requirements. (2) Maximizing the profit. (3) Minimizing the frequencies of changes in formula production. (4) Minimizing the inventory of final products. (5) Balancing the production sections with regard to rate in production. (6) Limitation in inventory of raw material. The present situation is in such a way that various techniques such as goal programming, linear programming and dynamic programming can be used. But dynamic production programming issues are divided into two categories, at first one with limitation in production capacity and another with unlimited production capacity. For the first category, a systematic and acceptable solution has not been presented yet. Therefore an innovative method is used to convert the dynamic situation to a zero- one model. At last this issue is changed to a goal programming model with non-linear limitations with the use of GRG algorithm and that's how it is solved.展开更多
The goal of this work is to develop a hybrid electric vehicle model that is suitable for use in a dynamic programming algorithm that provides the benchmark for optimal control of the hybrid powertrain. The benchmark a...The goal of this work is to develop a hybrid electric vehicle model that is suitable for use in a dynamic programming algorithm that provides the benchmark for optimal control of the hybrid powertrain. The benchmark analysis employs dynamic programming by backward induction to determine the globally optimal solution by solving the energy management problem starting at the final timestep and proceeding backwards in time. This method requires the development of a backwards facing model that propagates the wheel speed of the vehicle for the given drive cycle through the driveline components to determine the operating points of the powertrain. Although dynamic programming only searches the solution space within the feasible regions of operation, the benchmarking model must be solved for every admissible state at every timestep leading to strict requirements for runtime and memory. The backward facing model employs the quasi-static assumption of powertrain operation to reduce the fidelity of the model to accommodate these requirements. Verification and validation testing of the dynamic programming algorithm is conducted to ensure successful operation of the algorithm and to assess the validity of the determined control policy against a high-fidelity forward-facing vehicle model with a percent difference of fuel consumption of 1.2%. The benchmark analysis is conducted over multiple drive cycles to determine the optimal control policy that provides a benchmark for real-time algorithm development and determines control trends that can be used to improve existing algorithms. The optimal combined charge sustaining fuel economy of the vehicle is determined by the dynamic programming algorithm to be 32.99 MPG, a 52.6% increase over the stock 3.6 L 2019 Chevrolet Blazer.展开更多
Considering the decision-making variables of the capacities of branch roads and the optimization targets of lowering the saturation of arterial roads and the reconstruction expense of branch roads, the bi-level progra...Considering the decision-making variables of the capacities of branch roads and the optimization targets of lowering the saturation of arterial roads and the reconstruction expense of branch roads, the bi-level programming model for reconstructing the branch roads was set up. The upper level model was for determining the enlarged capacities of the branch roads, and the lower level model was for calculating the flows of road sections via the user equilibrium traffic assignment method. The genetic algorithm for solving the bi-level model was designed to obtain the reconstruction capacities of the branch roads. The results show that by the bi-level model and its algorithm, the optimum scheme of urban branch roads reconstruction can be gained, which reduces the saturation of arterial roads apparently, and alleviates traffic congestion. In the data analysis the arterial saturation decreases from 1.100 to 0.996, which verifies the micro-circulation transportation's function of urban branch road network.展开更多
To properly describe and solve complex decision problems, research on theoretical properties and solution of mixed-integer quadratic programs is becoming very important. We establish in this paper different Lipschitz-...To properly describe and solve complex decision problems, research on theoretical properties and solution of mixed-integer quadratic programs is becoming very important. We establish in this paper different Lipschitz-type continuity results about the optimal value function and optimal solutions of mixed-integer parametric quadratic programs with parameters in the linear part of the objective function and in the right-hand sides of the linear constraints. The obtained results extend some existing results for continuous quadratic programs, and, more importantly, lay the foundation for further theoretical study and corresponding algorithm analysis on mixed-integer quadratic programs.展开更多
When acquaintances of a model are little or the model is too complicate to build by using traditional time series methods, it is convenient for us to take advantage of genetic programming (GP) to build the model. Cons...When acquaintances of a model are little or the model is too complicate to build by using traditional time series methods, it is convenient for us to take advantage of genetic programming (GP) to build the model. Considering the complexity of nonlinear dynamic systems, this paper proposes modeling dynamic systems by using the nonlinear difference e-quation based on GP technique. First it gives the method, criteria and evaluation of modeling. Then it describes the modeling algorithm using GP. Finally two typical examples of time series are used to perform the numerical experiments. The result shows that this algorithm can successfully establish the difference equation model of dynamic systems and its predictive result is also satisfactory.展开更多
Creating practice questions for programming learning is not easy.It requires the instructor to diligently organize heterogeneous learning resources,that is,conceptual programming concepts and procedural programming ru...Creating practice questions for programming learning is not easy.It requires the instructor to diligently organize heterogeneous learning resources,that is,conceptual programming concepts and procedural programming rules.Today’s programming question generation(PQG)is still largely relying on the demanding creation task performed by the instructors without advanced technological support.In this work,we propose a semantic PQG model that aims to help the instructor generate new programming questions and expand the assessment items.The PQG model is designed to transform conceptual and procedural programming knowledge from textbooks into a semantic network by the Local Knowledge Graph(LKG)and Abstract Syntax Tree(AST).For any given question,the model queries the established network to find related code examples and generates a set of questions by the associated LKG/AST semantic structures.We conduct analysis to compare instructor-made questions from 9 undergraduate introductory programming courses and textbook questions.The results show that the instructormade questions had much simpler complexity than the textbook ones.The disparity of topic distribution intrigued us to further research the breadth and depth of question quality and also to investigate the complexity of the questions in relation to the student performances.Finally,we report a user study results on the proposed Artificial Intelligent-infused semantic PQG model in examining the machine-generated questions’quality.展开更多
A robust parameter identification method based on Kiencke model was proposed to solve the problem of the parameter identification accuracy being affected by the rail environment change and noise interference for heavy...A robust parameter identification method based on Kiencke model was proposed to solve the problem of the parameter identification accuracy being affected by the rail environment change and noise interference for heavy-duty trains. Firstly, a Kiencke stick-creep identification model was constructed, and the parameter identification task was transformed into a quadratic programming problem. Secondly, an iterative algorithm was constructed to solve the problem, into which a time-varying forgetting factor was added to track the change of the rail environment, and to solve the uncertainty problem of the wheel-rail environment. The Granger causality test was adopted to detect the interference, and then the weights of the current data were redistributed to solve the problem of noise interference in parameter identification. Finally, simulations were carried out and the results showed that the proposed method could track the change of the track environment in time, reduce the noise interference in the identification process, and effectively identify the adhesion performance parameters.展开更多
In this paper, a linear programming method is proposed to solve model predictive control for a class of hybrid systems. Firstly, using the (max, +) algebra, a typical subclass of hybrid systems called max-plus-line...In this paper, a linear programming method is proposed to solve model predictive control for a class of hybrid systems. Firstly, using the (max, +) algebra, a typical subclass of hybrid systems called max-plus-linear (MPL) systems is obtained. And then, model predictive control (MPC) framework is extended to MPL systems. In general, the nonlinear optimization approach or extended linear complementarity problem (ELCP) were applied to solve the MPL-MPC optimization problem. A new optimization method based on canonical forms for max-min-plus-scaling (MMPS) functions (using the operations maximization, minimization, addition and scalar multiplication) with linear constraints on the inputs is presented. The proposed approach consists in solving several linear programming problems and is more efficient than nonlinear optimization. The validity of the algorithm is illustrated by an example.展开更多
基金supported by the National Science Fund for Distinguished Young Scholars (62225303)the Fundamental Research Funds for the Central Universities (buctrc202201)+1 种基金China Scholarship Council,and High Performance Computing PlatformCollege of Information Science and Technology,Beijing University of Chemical Technology。
文摘In order to address the output feedback issue for linear discrete-time systems, this work suggests a brand-new adaptive dynamic programming(ADP) technique based on the internal model principle(IMP). The proposed method, termed as IMP-ADP, does not require complete state feedback-merely the measurement of input and output data. More specifically, based on the IMP, the output control problem can first be converted into a stabilization problem. We then design an observer to reproduce the full state of the system by measuring the inputs and outputs. Moreover, this technique includes both a policy iteration algorithm and a value iteration algorithm to determine the optimal feedback gain without using a dynamic system model. It is important that with this concept one does not need to solve the regulator equation. Finally, this control method was tested on an inverter system of grid-connected LCLs to demonstrate that the proposed method provides the desired performance in terms of both tracking and disturbance rejection.
文摘Genetic Programming (GP) is an important approach to deal with complex problem analysis and modeling, and has been applied in a wide range of areas. The development of GP involves various aspects, including design of genetic operators, evolutionary controls and implementations of heuristic strategy, evaluations and other mechanisms. When designing genetic operators, it is necessary to consider the possible limitations of encoding methods of individuals. And when selecting evolutionary control strategies, it is also necessary to balance search efficiency and diversity based on representation characteristics as well as the problem itself. More importantly, all of these matters, among others, have to be implemented through tedious coding work. Therefore, GP development is both complex and time-consuming. To overcome some of these difficulties that hinder the enhancement of GP development efficiency, we explore the feasibility of mutual assistance among GP variants, and then propose a rapid GP prototyping development method based on πGrammatical Evolution (πGE). It is demonstrated through regression analysis experiments that not only is this method beneficial for the GP developers to get rid of some tedious implementations, but also enables them to concentrate on the essence of the referred problem, such as individual representation, decoding means and evaluation. Additionally, it provides new insights into the roles of individual delineations in phenotypes and semantic research of individuals.
基金the Secretaria d’Universitats i Recerca del Departament d’Empresa i Coneixement of the Catalan government,and to Universitat Ramon Llull for their financial support.The financial support for this work did not influence its outcome.
文摘The current financial education framework has an increasing need to introduce tools that facilitate the application of theoretical models to real-world data and contexts.However,only a limited number of free tools are available for this purpose.Given this lack of tools,the present study provides two approaches to facilitate the implementa-tion of an event study.The first approach consists of a set of MS Excel files based on the Fama–French five-factor model,which allows the application of the event study methodology in a semi-automatic manner.The second approach is an open-source R-programmed tool through which results can be obtained in the context of an event study without the need for programming knowledge.This tool widens the calculus possibilities provided by the first approach and offers the option to apply not only the Fama–French five-factor model but also other models that are common in the finan-cial literature.It is a user-friendly tool that enables reproducibility of the analysis and ensures that the calculations are free of manipulation errors.Both approaches are freely available and ready-to-use.
基金supported by the National Natural Science Fundation of China (60374063)
文摘Two classes of mixed-integer nonlinear bilevel programming problems are discussed. One is that the follower's functions are separable with respect to the follower's variables, and the other is that the follower's functions are convex if the follower's variables are not restricted to integers. A genetic algorithm based on an exponential distribution is proposed for the aforementioned problems. First, for each fixed leader's variable x, it is proved that the optimal solution y of the follower's mixed-integer programming can be obtained by solving associated relaxed problems, and according to the convexity of the functions involved, a simplified branch and bound approach is given to solve the follower's programming for the second class of problems. Furthermore, based on an exponential distribution with a parameter λ, a new crossover operator is designed in which the best individuals are used to generate better offspring of crossover. The simulation results illustrate that the proposed algorithm is efficient and robust.
基金supported in part by Zhejiang Provincial Key Research and Development Program(2018C01084)Zhejiang Natural Science Foundation(LQ20F020009)Zhejiang Gongshang University,Zhejiang Provincial Key Laboratory of New Network Standards and Technologies(2013E10012)。
文摘Deadlock resolution strategies based on siphon control are widely investigated.Their computational efficiency largely depends on siphon computation.Mixed-integer programming(MIP)can be utilized for the computation of an emptiable siphon in a Petri net(PN).Based on it,deadlock resolution strategies can be designed without requiring complete siphon enumeration that has exponential complexity.Due to this reason,various MIP methods are proposed for various subclasses of PNs.This work proposes an innovative MIP method to compute an emptiable minimal siphon(EMS)for a subclass of PNs named S^(4)PR.In particular,many particular structural characteristics of EMS in S4 PR are formalized as constraints,which greatly reduces the solution space.Experimental results show that the proposed MIP method has higher computational efficiency.Furthermore,the proposed method allows one to determine the liveness of an ordinary S^(4)PR.
基金supported by the National Natural Science Foundationof China (70771080)the National Science Foundation of Hubei Province(20091107)Hubei Province Key Laboratory of Systems Science in Metallurgical Process (B201003)
文摘Partial cooperation models are studied for many years to solve the bilevel programming problems where the follower’s optimal reaction is not unique. However, in these existed models, the follower’s cooperation level does not depend on the leader’s decision. A new model is proposed to solve this deficiency. It is proved the feasibility of the new model when the reaction set of the lower level is lower semicontinuous. And the numerical results show that the new model has optimal solutions when the reaction set of the lower level is discrete, lower semi-continuous and non-lower semi-continuous.
文摘The developments of modern mathematics and computer science make artificial neural networks become most useful tools in wide range of fields. Modeling methods of artificial neural networks are described in this paper. The programming technique by using Matlab neural networks toolbox is discussed. The application in Material Hot Working of neural networks is also introduced.
文摘Estimation of the rock mass modulus of deformation(Em)is one of the most important design parameters in designing many structures in and on rock.This parameter can be obtained by in situ tests,empirical relations between deformation modulus and rock mass classifcation,and estimating from laboratory tests results.In this paper,a back analysis calculation is performed to present an equation for estimation of the rock mass modulus of deformation using genetic programming(GP)and numerical modeling.A database of 40,960 datasets,including vertical stress(rz),horizontal to vertical stresses ratio(k),Poisson’s ratio(m),radius of circular tunnel(r)and wall displacement of circular tunnel on the horizontal diameter(d)for input parameters and modulus of deformation for output,was established.The selected parameters are easy to determine and rock mass modulus of deformation can be obtained from instrumentation data of any size circular galleries.The resulting RMSE of 0.86 and correlation coeffcient of97%of the proposed equation demonstrated the capability of the computer program(CP)generated by GP.
基金supported by the Public Welfare Industry Special Fund Project of the Ministry of Water Resources of China (Grant No. 200701028)the Humanities and Social Science Foundation Program of Hohai University (Grant No. 2008421411)
基金supported by the National Basic Research Program of China(2010CB951002)the Dr.Western-funded Project of Chinese Academy of Science(XBBS201010 and XBBS201005)+1 种基金the National Natural Sciences Foundation of China (51190095)the Open Research Fund Program of State Key Laboratory of Hydro-science and Engineering(sklhse-2012-A03)
文摘This study presented a simulation-based two-stage interval-stochastic programming (STIP) model to support water resources management in the Kaidu-Konqi watershed in Northwest China. The modeling system coupled a distributed hydrological model with an interval two-stage stochastic programing (ITSP). The distributed hydrological model was used for establishing a rainfall-runoff forecast system, while random parameters were pro- vided by the statistical analysis of simulation outcomes water resources management planning in Kaidu-Konqi The developed STIP model was applied to a real case of watershed, where three scenarios with different water re- sources management policies were analyzed. The results indicated that water shortage mainly occurred in agri- culture, ecology and forestry sectors. In comparison, the water demand from municipality, industry and stock- breeding sectors can be satisfied due to their lower consumptions and higher economic values. Different policies for ecological water allocation can result in varied system benefits, and can help to identify desired water allocation plans with a maximum economic benefit and a minimum risk of system disruption under uncertainty.
基金financial support from EPSRC grants (EP/M027856/1 EP/M028240/1)
文摘In the present work, two new, (multi-)parametric programming (mp-P)-inspired algorithms for the solutionof mixed-integer nonlinear programming (MINLP) problems are developed, with their main focus being onprocess synthesis problems. The algorithms are developed for the special case in which the nonlinearitiesarise because of logarithmic terms, with the first one being developed for the deterministic case, and thesecond for the parametric case (p-MINLP). The key idea is to formulate and solve the square system of thefirst-order Karush-Kuhn-Tucker (KKT) conditions in an analytical way, by treating the binary variables and/or uncertain parameters as symbolic parameters. To this effect, symbolic manipulation and solution tech-niques are employed. In order to demonstrate the applicability and validity of the proposed algorithms, twoprocess synthesis case studies are examined. The corresponding solutions are then validated using state-of-the-art numerical MINLP solvers. For p-MINLP, the solution is given by an optimal solution as an explicitfunction of the uncertain parameters.
文摘A quadratic programming model is established to choose the blocks to be blasted in a given period. The length of this period depends on the production planning requirements. During the given period, the blocks' parameters are available from the geological database of the mine. The objective is to minimize the deviation of the average ore grade of blasted blocks from the standard ore grade required by the mill. Transportation ability constraint. production quantity demand constraint. minimum safety bench constraint. block size constraint and block, bench precedence constraints are considered in forming the programming model. This model has more practical objective function and reasonable constraints compared with the existing model for this kind of problems.
文摘At the first sight it seems that advanced operation research is not used enough in continuous production systems as comparison with mass production, batch production and job shop systems, but really in a comprehensive evaluation the advanced operation research techniques can be used in continuous production systems in developing countries very widely, because of initial inadequate plant layout, stage by stage development of production lines, the purchase of second hand machineries from various countries, plurality of customers. A case of production system planning is proposed for a chemical company in which the above mentioned conditions are almost presented. The goals and constraints in this issue are as follows: (1) Minimizing deviation of customer's requirements. (2) Maximizing the profit. (3) Minimizing the frequencies of changes in formula production. (4) Minimizing the inventory of final products. (5) Balancing the production sections with regard to rate in production. (6) Limitation in inventory of raw material. The present situation is in such a way that various techniques such as goal programming, linear programming and dynamic programming can be used. But dynamic production programming issues are divided into two categories, at first one with limitation in production capacity and another with unlimited production capacity. For the first category, a systematic and acceptable solution has not been presented yet. Therefore an innovative method is used to convert the dynamic situation to a zero- one model. At last this issue is changed to a goal programming model with non-linear limitations with the use of GRG algorithm and that's how it is solved.
文摘The goal of this work is to develop a hybrid electric vehicle model that is suitable for use in a dynamic programming algorithm that provides the benchmark for optimal control of the hybrid powertrain. The benchmark analysis employs dynamic programming by backward induction to determine the globally optimal solution by solving the energy management problem starting at the final timestep and proceeding backwards in time. This method requires the development of a backwards facing model that propagates the wheel speed of the vehicle for the given drive cycle through the driveline components to determine the operating points of the powertrain. Although dynamic programming only searches the solution space within the feasible regions of operation, the benchmarking model must be solved for every admissible state at every timestep leading to strict requirements for runtime and memory. The backward facing model employs the quasi-static assumption of powertrain operation to reduce the fidelity of the model to accommodate these requirements. Verification and validation testing of the dynamic programming algorithm is conducted to ensure successful operation of the algorithm and to assess the validity of the determined control policy against a high-fidelity forward-facing vehicle model with a percent difference of fuel consumption of 1.2%. The benchmark analysis is conducted over multiple drive cycles to determine the optimal control policy that provides a benchmark for real-time algorithm development and determines control trends that can be used to improve existing algorithms. The optimal combined charge sustaining fuel economy of the vehicle is determined by the dynamic programming algorithm to be 32.99 MPG, a 52.6% increase over the stock 3.6 L 2019 Chevrolet Blazer.
基金Project(2006CB705507) supported by the National Basic Research and Development Program of ChinaProject(20060533036) supported by the Specialized Research Foundation for the Doctoral Program of Higher Education of China
文摘Considering the decision-making variables of the capacities of branch roads and the optimization targets of lowering the saturation of arterial roads and the reconstruction expense of branch roads, the bi-level programming model for reconstructing the branch roads was set up. The upper level model was for determining the enlarged capacities of the branch roads, and the lower level model was for calculating the flows of road sections via the user equilibrium traffic assignment method. The genetic algorithm for solving the bi-level model was designed to obtain the reconstruction capacities of the branch roads. The results show that by the bi-level model and its algorithm, the optimum scheme of urban branch roads reconstruction can be gained, which reduces the saturation of arterial roads apparently, and alleviates traffic congestion. In the data analysis the arterial saturation decreases from 1.100 to 0.996, which verifies the micro-circulation transportation's function of urban branch road network.
基金Supported by the National Natural Science Foundation of China(10571141,70971109)the Key Projectof the National Natural Science Foundation of China(70531030)
文摘To properly describe and solve complex decision problems, research on theoretical properties and solution of mixed-integer quadratic programs is becoming very important. We establish in this paper different Lipschitz-type continuity results about the optimal value function and optimal solutions of mixed-integer parametric quadratic programs with parameters in the linear part of the objective function and in the right-hand sides of the linear constraints. The obtained results extend some existing results for continuous quadratic programs, and, more importantly, lay the foundation for further theoretical study and corresponding algorithm analysis on mixed-integer quadratic programs.
基金Supported by Foundation for University Key Teacher by the Ministry of Education of China
文摘When acquaintances of a model are little or the model is too complicate to build by using traditional time series methods, it is convenient for us to take advantage of genetic programming (GP) to build the model. Considering the complexity of nonlinear dynamic systems, this paper proposes modeling dynamic systems by using the nonlinear difference e-quation based on GP technique. First it gives the method, criteria and evaluation of modeling. Then it describes the modeling algorithm using GP. Finally two typical examples of time series are used to perform the numerical experiments. The result shows that this algorithm can successfully establish the difference equation model of dynamic systems and its predictive result is also satisfactory.
文摘Creating practice questions for programming learning is not easy.It requires the instructor to diligently organize heterogeneous learning resources,that is,conceptual programming concepts and procedural programming rules.Today’s programming question generation(PQG)is still largely relying on the demanding creation task performed by the instructors without advanced technological support.In this work,we propose a semantic PQG model that aims to help the instructor generate new programming questions and expand the assessment items.The PQG model is designed to transform conceptual and procedural programming knowledge from textbooks into a semantic network by the Local Knowledge Graph(LKG)and Abstract Syntax Tree(AST).For any given question,the model queries the established network to find related code examples and generates a set of questions by the associated LKG/AST semantic structures.We conduct analysis to compare instructor-made questions from 9 undergraduate introductory programming courses and textbook questions.The results show that the instructormade questions had much simpler complexity than the textbook ones.The disparity of topic distribution intrigued us to further research the breadth and depth of question quality and also to investigate the complexity of the questions in relation to the student performances.Finally,we report a user study results on the proposed Artificial Intelligent-infused semantic PQG model in examining the machine-generated questions’quality.
文摘A robust parameter identification method based on Kiencke model was proposed to solve the problem of the parameter identification accuracy being affected by the rail environment change and noise interference for heavy-duty trains. Firstly, a Kiencke stick-creep identification model was constructed, and the parameter identification task was transformed into a quadratic programming problem. Secondly, an iterative algorithm was constructed to solve the problem, into which a time-varying forgetting factor was added to track the change of the rail environment, and to solve the uncertainty problem of the wheel-rail environment. The Granger causality test was adopted to detect the interference, and then the weights of the current data were redistributed to solve the problem of noise interference in parameter identification. Finally, simulations were carried out and the results showed that the proposed method could track the change of the track environment in time, reduce the noise interference in the identification process, and effectively identify the adhesion performance parameters.
基金This work was supported by the National Science Foundation of China (No. 60474051)the program for New Century Excellent Talents in University of China (NCET).
文摘In this paper, a linear programming method is proposed to solve model predictive control for a class of hybrid systems. Firstly, using the (max, +) algebra, a typical subclass of hybrid systems called max-plus-linear (MPL) systems is obtained. And then, model predictive control (MPC) framework is extended to MPL systems. In general, the nonlinear optimization approach or extended linear complementarity problem (ELCP) were applied to solve the MPL-MPC optimization problem. A new optimization method based on canonical forms for max-min-plus-scaling (MMPS) functions (using the operations maximization, minimization, addition and scalar multiplication) with linear constraints on the inputs is presented. The proposed approach consists in solving several linear programming problems and is more efficient than nonlinear optimization. The validity of the algorithm is illustrated by an example.