A Quantum Computing Based Numerical Method for Solving Mixed-Integer Optimal Control Problems

来源 :系统科学与复杂性学报(英文版) | 被引量 : 0次 | 上传用户:tyzhaoxiqing
下载到本地 , 更方便阅读
声明 : 本文档内容版权归属内容提供方 , 如果您对本文有版权争议 , 可与客服联系进行内容授权或下架
论文部分内容阅读
Mixed-integer optimal control problems(MIOCPs)usually play important roles in many real-world engineering applications.However,the MIOCP is a typical NP-hard problem with con-siderable computational complexity,resulting in slow convergence or premature convergence by most current heuristic optimization algorithms.Accordingly,this study proposes a new and effective hybrid algorithm based on quantum computing theory to solve the MIOCP.The algorithm consists of two parts:(ⅰ)Quantum Annealing(QA)specializes in solving integer optimization with high efficiency owing to the unique annealing process based on quantum tunneling,and(ⅱ)Double-Elite Quantum Ant Colony Algorithm(DEQACA)which adopts double-elite coevolutionary mechanism to enhance global searching is developed for the optimization of continuous decisions.The hybrid QA/DEQACA algorithm integrates the strengths of such algorithms to better balance the exploration and exploitation abilities.The overall evolution performs to seek out the optimal mixed-integer decisions by interac-tive parallel computing of the QA and the DEQACA.Simulation results on benchmark functions and practical engineering optimization problems verify that the proposed numerical method is more excel at achieving promising results than other two state-of-the-art heuristics.
其他文献
Scientists may shift research interests and span multiple research areas in their careers,reflecting the research diversification of scientists.Quantifying the scientists\' research diversity can help to understand the research patterns of scientists.In
In this paper,we provide a new theoretical framework of pyramid Markov processes to solve some open and fundamental problems of blockchain selfish mining under a rigorous mathematical setting.We first describe a more general model of blockchain selfish mi
The performance of traditional imbalanced classification algorithms is degraded when deal-ing with highly imbalanced data.How to deal with highly imbalanced data is a difficult problem.In this paper,the authors propose an ensemble tree classifier for high
In this paper empirical likelihood(EL)-based inference for a semiparametric varying-coefficient spatial autoregressive model is investigated.The maximum EL estimators for the parametric component and the nonparametric component are established.Furthermore
Panel count data are frequently encountered when study subjects are under discrete ob-servations.However,limited literature has been found on variable selection for panel count data.In this paper,without considering the model assumption of observation pro
This paper explores the coordination problem of a socially responsible supply chain,in which the supplier contributes corporate social responsibility by donating a specific amount of money to a cause marketing and the retailer cares for consumer surplus i
The rational ruled surface is a typical modeling surface in computer aided geometric design.A rational ruled surface may have different representations with respective advantages and disadvan-tages.In this paper,the authors revisit the representations of
Herd behavior in financial markets often leads to unjustified macroscopic phenomena.However,despite existing studies on modeling herd behavior,how it varies across individual agents and over time remains unclear.We show that herd behavior in mutual fund c
Zero-dimensional valuation rings are one kind of non-Noetherian rings.This paper inves-tigates properties of zero-dimensional valuation rings and prove that a finitely generated ideal over such a ring has a Gr?bner basis.The authors present an algorithm f
This paper constructs a strongly-consistent explicit finite difference scheme for 3D con-stant viscosity incompressible Navier-Stokes equations by using of symbolic algebraic computation.The difference scheme is space second order accurate and temporal fi