The alternate combinational approach of genetic algorithm and neural network （AGANN） has been presented to correct the systematic error of the density functional theory （DFT） calculation. It treats the DFT as a bl...The alternate combinational approach of genetic algorithm and neural network （AGANN） has been presented to correct the systematic error of the density functional theory （DFT） calculation. It treats the DFT as a black box and models the error through external statistical information. As a demonstration, the ACANN method has been applied in the correction of the lattice energies from the DFT calculation for 72 metal halides and hydrides. Through the AGANN correction, the mean absolute value of the relative errors of the calculated lattice energies to the experimental values decreases from 4.93% to 1.20% in the testing set. For comparison, the neural network approach reduces the mean value to 2.56%. And for the common combinational approach of genetic algorithm and neural network, the value drops to 2.15%. The multiple linear regression method almost has no correction effect here.展开更多
The application of multi-material topology optimization affords greater design flexibility compared to traditional single-material methods.However,density-based topology optimization methods encounter three unique cha...The application of multi-material topology optimization affords greater design flexibility compared to traditional single-material methods.However,density-based topology optimization methods encounter three unique challenges when inertial loads become dominant:non-monotonous behavior of the objective function,possible unconstrained characterization of the optimal solution,and parasitic effects.Herein,an improved Guide-Weight approach is introduced,which effectively addresses the structural topology optimization problem when subjected to inertial loads.Smooth and fast convergence of the compliance is achieved by the approach,while also maintaining the effectiveness of the volume constraints.The rational approximation of material properties model and smooth design are utilized to guarantee clear boundaries of the final structure,facilitating its seamless integration into manufacturing processes.The framework provided by the alternating active-phase algorithm is employed to decompose the multi-material topological problem under inertial loading into a set of sub-problems.The optimization of multi-material under inertial loads is accomplished through the effective resolution of these sub-problems using the improved Guide-Weight method.The effectiveness of the proposed approach is demonstrated through numerical examples involving two-phase and multi-phase materials.展开更多
Based on the fabricated 12-element cavity-backed microstrip sector cylinder array,a novel hybrid alternate projection algorithm（HAPA）,which combines analytical method with numerical techniques effectively,is propose...Based on the fabricated 12-element cavity-backed microstrip sector cylinder array,a novel hybrid alternate projection algorithm（HAPA）,which combines analytical method with numerical techniques effectively,is proposed for synthesizing the pattern of practical conformal array.The algorithm applies the variable direction aperture projection method with mutual coupling correction techniques to provide the good initial excitations of elements to the enhanced alternate projection algorithm（EAPA）.In order to do further optimization,which improves the convergent speed of the algorithm significantly.Finally,the HAPA has been applied to the fabricated sector cylinder array with mutual coupling considered.The results of synthesized patterns,such as low sidelobe with null points formed pattern,beam scanning with low sidelobe pattern and the shaped beam pattern are presented.It demonstrates the validity of HAPA in practical conformal array synthesis.展开更多
The quantum alternating operator ansatz algorithm(QAOA+)is widely used for constrained combinatorial optimization problems(CCOPs)due to its ability to construct feasible solution spaces.In this paper,we propose a prog...The quantum alternating operator ansatz algorithm(QAOA+)is widely used for constrained combinatorial optimization problems(CCOPs)due to its ability to construct feasible solution spaces.In this paper,we propose a progressive quantum algorithm(PQA)to reduce qubit requirements for QAOA+in solving the maximum independent set(MIS)problem.PQA iteratively constructs a subgraph likely to include the MIS solution of the original graph and solves the problem on it to approximate the global solution.Specifically,PQA starts with a small-scale subgraph and progressively expands its graph size utilizing heuristic expansion strategies.After each expansion,PQA solves the MIS problem on the newly generated subgraph using QAOA+.In each run,PQA repeats the expansion and solving process until a predefined stopping condition is reached.Simulation results show that PQA achieves an approximation ratio of 0.95 using only 5.57%(2.17%)of the qubits and 17.59%(6.43%)of the runtime compared with directly solving the original problem with QAOA+on Erd?s-Rényi(3-regular)graphs,highlighting the efficiency and scalability of PQA.展开更多
The classical job shop scheduling problem(JSP) is the most popular machine scheduling model in practice and is known as NP-hard.The formulation of the JSP is based on the assumption that for each part type or job ther...The classical job shop scheduling problem(JSP) is the most popular machine scheduling model in practice and is known as NP-hard.The formulation of the JSP is based on the assumption that for each part type or job there is only one process plan that prescribes the sequence of operations and the machine on which each operation has to be performed.However,JSP with alternative machines for various operations is an extension of the classical JSP,which allows an operation to be processed by any machine from a given set of machines.Since this problem requires an additional decision of machine allocation during scheduling,it is much more complex than JSP.We present a domain independent genetic algorithm(GA) approach for the job shop scheduling problem with alternative machines.The GA is implemented in a spreadsheet environment.The performance of the proposed GA is analyzed by comparing with various problem instances taken from the literatures.The result shows that the proposed GA is competitive with the existing approaches.A simplified approach that would be beneficial to both practitioners and researchers is presented for solving scheduling problems with alternative machines.展开更多
This paper develops a variational model for image noise removal using total curvature(TC), which is a high-order regularizer. The TC has the advantage of preserving image feature. Unfortunately, it also has the charac...This paper develops a variational model for image noise removal using total curvature(TC), which is a high-order regularizer. The TC has the advantage of preserving image feature. Unfortunately, it also has the characteristics of nonlinear, non-convex and non-smooth. Consequently, the numerical computation with the curvature regularization is difficult. In order to conquer the computation problem, the proposed model is transformed into an alternating optimization problem by importing auxiliary variables. Furthermore, based on alternating direction method of multipliers, we design a fast numerical approximation iterative scheme for proposed model. Finally, numerous experiments are implemented to indicate the advantages of the proposed model in image edge preserving, image contrast and corners preserving. Meanwhile, the high computational efficiency of the designed model is verified by comparing with traditional models, including the total variation(TV) and total Laplace(TL) model.展开更多
Remote sensing image segmentation is the basis of image understanding and analysis. However,the precision and the speed of segmentation can not meet the need of image analysis,due to strong uncertainty and rich textur...Remote sensing image segmentation is the basis of image understanding and analysis. However,the precision and the speed of segmentation can not meet the need of image analysis,due to strong uncertainty and rich texture details of remote sensing images. We proposed a new segmentation method based on Adaptive Genetic Algorithm(AGA) and Alternative Fuzzy C-Means(AFCM) . Segmentation thresholds were identified by AGA. Then the image was segmented by AFCM. The results indicate that the precision and the speed of segmentation have been greatly increased,and the accuracy of threshold selection is much higher compared with traditional Otsu and Fuzzy C-Means(FCM) segmentation methods. The segmentation results also show that multi-thresholds segmentation has been achieved by combining AGA with AFCM.展开更多
Production planning under flexible job shop environment is studied.A mathematic model is formulated to help improve alternative process production.This model,in which genetic algorithm is used,is expected to result in...Production planning under flexible job shop environment is studied.A mathematic model is formulated to help improve alternative process production.This model,in which genetic algorithm is used,is expected to result in better production planning,hence towards the aim of minimizing production cost under the constraints of delivery time and other scheduling conditions.By means of this algorithm,all planning schemes which could meet all requirements of the constraints within the whole solution space are exhaustively searched so as to find the optimal one.Also,a case study is given in the end to support and validate this model.Our results show that genetic algorithm is capable of locating feasible process routes to reduce production cost for certain tasks.展开更多
A variety of alternating direction methods have been proposed for solving a class of optimization problems. The applications in computed tomography (CT) perform well in image reconstruction. The reweighted schemes wer...A variety of alternating direction methods have been proposed for solving a class of optimization problems. The applications in computed tomography (CT) perform well in image reconstruction. The reweighted schemes were applied in l1-norm and total variation minimization for signal and image recovery to improve the convergence of algorithms. In this paper, we present a reweighted total variation algorithm using the alternating direction method (ADM) for image reconstruction in CT. The numerical experiments for ADM demonstrate that adding reweighted strategy reduces the computation time effectively and improves the quality of reconstructed images as well.展开更多
By virtue of alternating direction method of multipliers(ADMM), Newton-Raphson method, ratio consensus approach and running sum method, two distributed iterative strategies are presented in this paper to address the e...By virtue of alternating direction method of multipliers(ADMM), Newton-Raphson method, ratio consensus approach and running sum method, two distributed iterative strategies are presented in this paper to address the economic dispatch problem(EDP) in power systems. Different from most of the existing distributed ED approaches which neglect the effects of packet drops or/and time delays, this paper takes into account both packet drops and time delays which frequently occur in communication networks. Moreover, directed and possibly unbalanced graphs are considered in our algorithms, over which many distributed approaches fail to converge. Furthermore, the proposed schemes can address the EDP with local constraints of generators and nonquadratic convex cost functions, not just quadratic ones required in some existing ED approaches. Both theoretical analyses and simulation studies are provided to demonstrate the effectiveness of the proposed schemes.展开更多
A modified alternating direction implicit algorithm is proposed to solve the full-vectorial finite-difference beam propagation method formulation based on H fields. The cross-coupling terms are neglected in the first ...A modified alternating direction implicit algorithm is proposed to solve the full-vectorial finite-difference beam propagation method formulation based on H fields. The cross-coupling terms are neglected in the first sub-step, but evaluated and doubly used in the second sub-step. The order of two sub-steps is reversed for each transverse magnetic field component so that the cross-coupling terms are always expressed in implicit form, thus the calculation is very efficient and stable. Moreover, an improved six-point finite-difference scheme with high accuracy independent of specific structures of waveguide is also constructed to approximate the cross-coupling terms along the transverse directions. The imaginary-distance procedure is used to assess the validity and utility of the present method. The field patterns and the normalized propagation constants of the fundamental mode for a buried rectangular waveguide and a rib waveguide are presented. Solutions are in excellent agreement with the benchmark results from the modal transverse resonance method.展开更多
In this paper, a novel algorithm is presented for direction of arrival（DOA） estimation and array self-calibration in the presence of unknown mutual coupling. In order to highlight the relationship between the array ...In this paper, a novel algorithm is presented for direction of arrival（DOA） estimation and array self-calibration in the presence of unknown mutual coupling. In order to highlight the relationship between the array output and mutual coupling coefficients, we present a novel model of the array output with the unknown mutual coupling coefficients. Based on this model, we use the space alternating generalized expectation-maximization（SAGE） algorithm to jointly estimate the DOA parameters and the mutual coupling coefficients. Unlike many existing counterparts, our method requires neither calibration sources nor initial calibration information. At the same time,our proposed method inherits the characteristics of good convergence and high estimation precision of the SAGE algorithm. By numerical experiments we demonstrate that our proposed method outperforms the existing method for DOA estimation and mutual coupling calibration.展开更多
The alternating direction method of multipliers(ADMM)is a widely used method for solving many convex minimization models arising in signal and image processing.In this paper,we propose an inertial ADMM for solving a t...The alternating direction method of multipliers(ADMM)is a widely used method for solving many convex minimization models arising in signal and image processing.In this paper,we propose an inertial ADMM for solving a two-block separable convex minimization problem with linear equality constraints.This algorithm is obtained by making use of the inertial Douglas-Rachford splitting algorithm to the corresponding dual of the primal problem.We study the convergence analysis of the proposed algorithm in infinite-dimensional Hilbert spaces.Furthermore,we apply the proposed algorithm on the robust principal component analysis problem and also compare it with other state-of-the-art algorithms.Numerical results demonstrate the advantage of the proposed algorithm.展开更多
This paper investigates the distributed model predictive control(MPC)problem of linear systems where the network topology is changeable by the way of inserting new subsystems,disconnecting existing subsystems,or merel...This paper investigates the distributed model predictive control(MPC)problem of linear systems where the network topology is changeable by the way of inserting new subsystems,disconnecting existing subsystems,or merely modifying the couplings between different subsystems.To equip live systems with a quick response ability when modifying network topology,while keeping a satisfactory dynamic performance,a novel reconfiguration control scheme based on the alternating direction method of multipliers(ADMM)is presented.In this scheme,the local controllers directly influenced by the structure realignment are redesigned in the reconfiguration control.Meanwhile,by employing the powerful ADMM algorithm,the iterative formulas for solving the reconfigured optimization problem are obtained,which significantly accelerate the computation speed and ensure a timely output of the reconfigured optimal control response.Ultimately,the presented reconfiguration scheme is applied to the level control of a benchmark four-tank plant to illustrate its effectiveness and main characteristics.展开更多
In this paper, a distributed algorithm is proposed to solve a kind of multi-objective optimization problem based on the alternating direction method of multipliers. Compared with the centralized algorithms, this algor...In this paper, a distributed algorithm is proposed to solve a kind of multi-objective optimization problem based on the alternating direction method of multipliers. Compared with the centralized algorithms, this algorithm does not need a central node. Therefore, it has the characteristics of low communication burden and high privacy. In addition, numerical experiments are provided to validate the effectiveness of the proposed algorithm.展开更多
Solving the absent assignment problem of the shortest time limit in a weighted bipartite graph with the minimal weighted k-matching algorithm is unsuitable for situations in which large numbers of problems need to be ...Solving the absent assignment problem of the shortest time limit in a weighted bipartite graph with the minimal weighted k-matching algorithm is unsuitable for situations in which large numbers of problems need to be addressed by large numbers of parties. This paper simplifies the algorithm of searching for the even alternating path that contains a maximal element using the minimal weighted k-matching theorem and intercept graph. A program for solving the maximal efficiency assignment problem was compiled. As a case study, the program was used to solve the assignment problem of water piping repair in the case of a large number of companies and broken pipes, and the validity of the program was verified.展开更多
基金supported by the National Basic Research Program of China (973 Program) (Grant No. G2009CB929300)the National Natural Science Foundation of China (Grant No. 60521001 and 60925016)
文摘The alternate combinational approach of genetic algorithm and neural network （AGANN） has been presented to correct the systematic error of the density functional theory （DFT） calculation. It treats the DFT as a black box and models the error through external statistical information. As a demonstration, the ACANN method has been applied in the correction of the lattice energies from the DFT calculation for 72 metal halides and hydrides. Through the AGANN correction, the mean absolute value of the relative errors of the calculated lattice energies to the experimental values decreases from 4.93% to 1.20% in the testing set. For comparison, the neural network approach reduces the mean value to 2.56%. And for the common combinational approach of genetic algorithm and neural network, the value drops to 2.15%. The multiple linear regression method almost has no correction effect here.
基金supported by the National Natural Science Foundation of China(Grant No.52172356)the Hunan Provincial Natural Science Foundation of China(Grant No.2022JJ10012).
文摘The application of multi-material topology optimization affords greater design flexibility compared to traditional single-material methods.However,density-based topology optimization methods encounter three unique challenges when inertial loads become dominant:non-monotonous behavior of the objective function,possible unconstrained characterization of the optimal solution,and parasitic effects.Herein,an improved Guide-Weight approach is introduced,which effectively addresses the structural topology optimization problem when subjected to inertial loads.Smooth and fast convergence of the compliance is achieved by the approach,while also maintaining the effectiveness of the volume constraints.The rational approximation of material properties model and smooth design are utilized to guarantee clear boundaries of the final structure,facilitating its seamless integration into manufacturing processes.The framework provided by the alternating active-phase algorithm is employed to decompose the multi-material topological problem under inertial loading into a set of sub-problems.The optimization of multi-material under inertial loads is accomplished through the effective resolution of these sub-problems using the improved Guide-Weight method.The effectiveness of the proposed approach is demonstrated through numerical examples involving two-phase and multi-phase materials.
文摘Based on the fabricated 12-element cavity-backed microstrip sector cylinder array,a novel hybrid alternate projection algorithm（HAPA）,which combines analytical method with numerical techniques effectively,is proposed for synthesizing the pattern of practical conformal array.The algorithm applies the variable direction aperture projection method with mutual coupling correction techniques to provide the good initial excitations of elements to the enhanced alternate projection algorithm（EAPA）.In order to do further optimization,which improves the convergent speed of the algorithm significantly.Finally,the HAPA has been applied to the fabricated sector cylinder array with mutual coupling considered.The results of synthesized patterns,such as low sidelobe with null points formed pattern,beam scanning with low sidelobe pattern and the shaped beam pattern are presented.It demonstrates the validity of HAPA in practical conformal array synthesis.
基金supported by the National Natural Science Foundation of China(Grant Nos.62371069,62372048,and 62272056)BUPT Excellent Ph.D.Students Foundation(Grant No.CX2023123)。
文摘The quantum alternating operator ansatz algorithm(QAOA+)is widely used for constrained combinatorial optimization problems(CCOPs)due to its ability to construct feasible solution spaces.In this paper,we propose a progressive quantum algorithm(PQA)to reduce qubit requirements for QAOA+in solving the maximum independent set(MIS)problem.PQA iteratively constructs a subgraph likely to include the MIS solution of the original graph and solves the problem on it to approximate the global solution.Specifically,PQA starts with a small-scale subgraph and progressively expands its graph size utilizing heuristic expansion strategies.After each expansion,PQA solves the MIS problem on the newly generated subgraph using QAOA+.In each run,PQA repeats the expansion and solving process until a predefined stopping condition is reached.Simulation results show that PQA achieves an approximation ratio of 0.95 using only 5.57%(2.17%)of the qubits and 17.59%(6.43%)of the runtime compared with directly solving the original problem with QAOA+on Erd?s-Rényi(3-regular)graphs,highlighting the efficiency and scalability of PQA.
文摘The classical job shop scheduling problem(JSP) is the most popular machine scheduling model in practice and is known as NP-hard.The formulation of the JSP is based on the assumption that for each part type or job there is only one process plan that prescribes the sequence of operations and the machine on which each operation has to be performed.However,JSP with alternative machines for various operations is an extension of the classical JSP,which allows an operation to be processed by any machine from a given set of machines.Since this problem requires an additional decision of machine allocation during scheduling,it is much more complex than JSP.We present a domain independent genetic algorithm(GA) approach for the job shop scheduling problem with alternative machines.The GA is implemented in a spreadsheet environment.The performance of the proposed GA is analyzed by comparing with various problem instances taken from the literatures.The result shows that the proposed GA is competitive with the existing approaches.A simplified approach that would be beneficial to both practitioners and researchers is presented for solving scheduling problems with alternative machines.
基金supported by the National Natural Science Foundation of China(No.61602269)the China Postdoctoral Science Foundation(No.2015M571993)+1 种基金the Shandong Provincial Natural Science Foundation of China(No.ZR2017MD004)the Qingdao Postdoctoral Application Research Funded Project
文摘This paper develops a variational model for image noise removal using total curvature(TC), which is a high-order regularizer. The TC has the advantage of preserving image feature. Unfortunately, it also has the characteristics of nonlinear, non-convex and non-smooth. Consequently, the numerical computation with the curvature regularization is difficult. In order to conquer the computation problem, the proposed model is transformed into an alternating optimization problem by importing auxiliary variables. Furthermore, based on alternating direction method of multipliers, we design a fast numerical approximation iterative scheme for proposed model. Finally, numerous experiments are implemented to indicate the advantages of the proposed model in image edge preserving, image contrast and corners preserving. Meanwhile, the high computational efficiency of the designed model is verified by comparing with traditional models, including the total variation(TV) and total Laplace(TL) model.
基金Under the auspices of National Natural Science Foundation of China (No. 30370267)Key Project of Jilin Provincial Science & Technology Department (No. 20075014)
文摘Remote sensing image segmentation is the basis of image understanding and analysis. However,the precision and the speed of segmentation can not meet the need of image analysis,due to strong uncertainty and rich texture details of remote sensing images. We proposed a new segmentation method based on Adaptive Genetic Algorithm(AGA) and Alternative Fuzzy C-Means(AFCM) . Segmentation thresholds were identified by AGA. Then the image was segmented by AFCM. The results indicate that the precision and the speed of segmentation have been greatly increased,and the accuracy of threshold selection is much higher compared with traditional Otsu and Fuzzy C-Means(FCM) segmentation methods. The segmentation results also show that multi-thresholds segmentation has been achieved by combining AGA with AFCM.
基金Sponsored by Key Subject Foundation of Beijing Municipal(XK100070530)
文摘Production planning under flexible job shop environment is studied.A mathematic model is formulated to help improve alternative process production.This model,in which genetic algorithm is used,is expected to result in better production planning,hence towards the aim of minimizing production cost under the constraints of delivery time and other scheduling conditions.By means of this algorithm,all planning schemes which could meet all requirements of the constraints within the whole solution space are exhaustively searched so as to find the optimal one.Also,a case study is given in the end to support and validate this model.Our results show that genetic algorithm is capable of locating feasible process routes to reduce production cost for certain tasks.
文摘A variety of alternating direction methods have been proposed for solving a class of optimization problems. The applications in computed tomography (CT) perform well in image reconstruction. The reweighted schemes were applied in l1-norm and total variation minimization for signal and image recovery to improve the convergence of algorithms. In this paper, we present a reweighted total variation algorithm using the alternating direction method (ADM) for image reconstruction in CT. The numerical experiments for ADM demonstrate that adding reweighted strategy reduces the computation time effectively and improves the quality of reconstructed images as well.
基金supported by the National Natural Science Foundation of China(61673077)。
文摘By virtue of alternating direction method of multipliers(ADMM), Newton-Raphson method, ratio consensus approach and running sum method, two distributed iterative strategies are presented in this paper to address the economic dispatch problem(EDP) in power systems. Different from most of the existing distributed ED approaches which neglect the effects of packet drops or/and time delays, this paper takes into account both packet drops and time delays which frequently occur in communication networks. Moreover, directed and possibly unbalanced graphs are considered in our algorithms, over which many distributed approaches fail to converge. Furthermore, the proposed schemes can address the EDP with local constraints of generators and nonquadratic convex cost functions, not just quadratic ones required in some existing ED approaches. Both theoretical analyses and simulation studies are provided to demonstrate the effectiveness of the proposed schemes.
文摘A modified alternating direction implicit algorithm is proposed to solve the full-vectorial finite-difference beam propagation method formulation based on H fields. The cross-coupling terms are neglected in the first sub-step, but evaluated and doubly used in the second sub-step. The order of two sub-steps is reversed for each transverse magnetic field component so that the cross-coupling terms are always expressed in implicit form, thus the calculation is very efficient and stable. Moreover, an improved six-point finite-difference scheme with high accuracy independent of specific structures of waveguide is also constructed to approximate the cross-coupling terms along the transverse directions. The imaginary-distance procedure is used to assess the validity and utility of the present method. The field patterns and the normalized propagation constants of the fundamental mode for a buried rectangular waveguide and a rib waveguide are presented. Solutions are in excellent agreement with the benchmark results from the modal transverse resonance method.
基金supported by the National Natural Science Foundation of China (No. 61302141)
文摘In this paper, a novel algorithm is presented for direction of arrival（DOA） estimation and array self-calibration in the presence of unknown mutual coupling. In order to highlight the relationship between the array output and mutual coupling coefficients, we present a novel model of the array output with the unknown mutual coupling coefficients. Based on this model, we use the space alternating generalized expectation-maximization（SAGE） algorithm to jointly estimate the DOA parameters and the mutual coupling coefficients. Unlike many existing counterparts, our method requires neither calibration sources nor initial calibration information. At the same time,our proposed method inherits the characteristics of good convergence and high estimation precision of the SAGE algorithm. By numerical experiments we demonstrate that our proposed method outperforms the existing method for DOA estimation and mutual coupling calibration.
基金Supported by the National Natural Science Foundation of China(Grant Nos.12061045,12061046,11661056,11771198,11771347,91730306,41390454,11401293)the China Postdoctoral Science Foundation(Grant No.2015M571989)the Jiangxi Province Postdoctoral Science Foundation(Grant No.2015KY51)。
文摘The alternating direction method of multipliers(ADMM)is a widely used method for solving many convex minimization models arising in signal and image processing.In this paper,we propose an inertial ADMM for solving a two-block separable convex minimization problem with linear equality constraints.This algorithm is obtained by making use of the inertial Douglas-Rachford splitting algorithm to the corresponding dual of the primal problem.We study the convergence analysis of the proposed algorithm in infinite-dimensional Hilbert spaces.Furthermore,we apply the proposed algorithm on the robust principal component analysis problem and also compare it with other state-of-the-art algorithms.Numerical results demonstrate the advantage of the proposed algorithm.
基金the National Natural Science Foundation of China(61833012,61773162,61590924)the Natural Science Foundation of Shanghai(18ZR1420000)。
文摘This paper investigates the distributed model predictive control(MPC)problem of linear systems where the network topology is changeable by the way of inserting new subsystems,disconnecting existing subsystems,or merely modifying the couplings between different subsystems.To equip live systems with a quick response ability when modifying network topology,while keeping a satisfactory dynamic performance,a novel reconfiguration control scheme based on the alternating direction method of multipliers(ADMM)is presented.In this scheme,the local controllers directly influenced by the structure realignment are redesigned in the reconfiguration control.Meanwhile,by employing the powerful ADMM algorithm,the iterative formulas for solving the reconfigured optimization problem are obtained,which significantly accelerate the computation speed and ensure a timely output of the reconfigured optimal control response.Ultimately,the presented reconfiguration scheme is applied to the level control of a benchmark four-tank plant to illustrate its effectiveness and main characteristics.
文摘In this paper, a distributed algorithm is proposed to solve a kind of multi-objective optimization problem based on the alternating direction method of multipliers. Compared with the centralized algorithms, this algorithm does not need a central node. Therefore, it has the characteristics of low communication burden and high privacy. In addition, numerical experiments are provided to validate the effectiveness of the proposed algorithm.
文摘Solving the absent assignment problem of the shortest time limit in a weighted bipartite graph with the minimal weighted k-matching algorithm is unsuitable for situations in which large numbers of problems need to be addressed by large numbers of parties. This paper simplifies the algorithm of searching for the even alternating path that contains a maximal element using the minimal weighted k-matching theorem and intercept graph. A program for solving the maximal efficiency assignment problem was compiled. As a case study, the program was used to solve the assignment problem of water piping repair in the case of a large number of companies and broken pipes, and the validity of the program was verified.
