Combinatorial optimization problems and ground state problems of spin glasses are crucial in various fields of science and technology.However,they often belong to the computational class of NP-hard,presenting signific...Combinatorial optimization problems and ground state problems of spin glasses are crucial in various fields of science and technology.However,they often belong to the computational class of NP-hard,presenting significant computational challenges.Traditional algorithms inspired by statistical physics like simulated annealing have been widely adopted.Recently,advancements in Ising machines,such as quantum annealers and coherent Ising machines,offer new paradigms for solving these problems efficiently by embedding them into the analog evolution of nonlinear dynamical systems.However,existing dynamics-based algorithms often suffer from low convergence rates and local minima traps.In this work,we introduce the dual mean-field dynamics into Ising machines.The approach integrates the gradient force and the transverse force into the dynamics of Ising machines in solving combinatorial optimization problems,making it easier for the system to jump out of the local minimums and allowing the dynamics to explore wider in configuration space.We conduct extensive numerical experiments using the Sherrington–Kirkpatrick spin glass up to 10000 spins and the maximum cut problems with the standard G-set benchmarks.The numerical results demonstrate that our dual mean-field dynamics approach enhances the performance of base Ising machines,providing a more effective solution for large-scale combinatorial optimization problems.展开更多
Computational time complexity analyzes of evolutionary algorithms （EAs） have been performed since the mid-nineties. The first results were related to very simple algorithms, such as the （1＋1）-EA, on toy problems....Computational time complexity analyzes of evolutionary algorithms （EAs） have been performed since the mid-nineties. The first results were related to very simple algorithms, such as the （1＋1）-EA, on toy problems. These efforts produced a deeper understanding of how EAs perform on different kinds of fitness landscapes and general mathematical tools that may be extended to the analysis of more complicated EAs on more realistic problems. In fact, in recent years, it has been possible to analyze the （1＋1）-EA on combinatorial optimization problems with practical applications and more realistic population-based EAs on structured toy problems. This paper presents a survey of the results obtained in the last decade along these two research lines. The most common mathematical techniques are introduced, the basic ideas behind them are discussed and their elective applications are highlighted. Solved problems that were still open are enumerated as are those still awaiting for a solution. New questions and problems arisen in the meantime are also considered.展开更多
This paper is basically a survey to show a number of combinatorial optimization problems arising from VLSI circuit design. Some of them including the existence problem, minimax problem, net representation, bend minimi...This paper is basically a survey to show a number of combinatorial optimization problems arising from VLSI circuit design. Some of them including the existence problem, minimax problem, net representation, bend minimization, area minimization, placement problem, routing problem, etc. are especially discussed with new results and theoretical ideas for treating them. Finally, a number of problems for further research are mentioned.展开更多
Electronic components' reliability has become the key of the complex system mission execution. Analog circuit is an important part of electronic components. Its fault diagnosis is far more challenging than that of...Electronic components' reliability has become the key of the complex system mission execution. Analog circuit is an important part of electronic components. Its fault diagnosis is far more challenging than that of digital circuit. Simulations and applications have shown that the methods based on BP neural network are effective in analog circuit fault diagnosis. Aiming at the tolerance of analog circuit,a combinatorial optimization diagnosis scheme was proposed with back propagation( BP) neural network( BPNN).The main contributions of this scheme included two parts:( 1) the random tolerance samples were added into the nominal training samples to establish new training samples,which were used to train the BP neural network based diagnosis model;( 2) the initial weights of the BP neural network were optimized by genetic algorithm( GA) to avoid local minima,and the BP neural network was tuned with Levenberg-Marquardt algorithm( LMA) in the local solution space to look for the optimum solution or approximate optimal solutions. The experimental results show preliminarily that the scheme substantially improves the whole learning process approximation and generalization ability,and effectively promotes analog circuit fault diagnosis performance based on BPNN.展开更多
We introduce Quafu-Qcover,an open-source cloud-based software package developed for solving combinatorial optimization problems using quantum simulators and hardware backends.Quafu-Qcover provides a standardized and c...We introduce Quafu-Qcover,an open-source cloud-based software package developed for solving combinatorial optimization problems using quantum simulators and hardware backends.Quafu-Qcover provides a standardized and comprehensive workflow that utilizes the quantum approximate optimization algorithm(QAOA).It facilitates the automatic conversion of the original problem into a quadratic unconstrained binary optimization(QUBO)model and its corresponding Ising model,which can be subsequently transformed into a weight graph.The core of Qcover relies on a graph decomposition-based classical algorithm,which efficiently derives the optimal parameters for the shallow QAOA circuit.Quafu-Qcover incorporates a dedicated compiler capable of translating QAOA circuits into physical quantum circuits that can be executed on Quafu cloud quantum computers.Compared to a general-purpose compiler,our compiler demonstrates the ability to generate shorter circuit depths,while also exhibiting superior speed performance.Additionally,the Qcover compiler has the capability to dynamically create a library of qubits coupling substructures in real-time,utilizing the most recent calibration data from the superconducting quantum devices.This ensures that computational tasks can be assigned to connected physical qubits with the highest fidelity.The Quafu-Qcover allows us to retrieve quantum computing sampling results using a task ID at any time,enabling asynchronous processing.Moreover,it incorporates modules for results preprocessing and visualization,facilitating an intuitive display of solutions for combinatorial optimization problems.We hope that Quafu-Qcover can serve as an instructive illustration for how to explore application problems on the Quafu cloud quantum computers.展开更多
Traditional expert-designed branching rules in branch-and-bound(B&B) are static, often failing to adapt to diverse and evolving problem instances. Crafting these rules is labor-intensive, and may not scale well wi...Traditional expert-designed branching rules in branch-and-bound(B&B) are static, often failing to adapt to diverse and evolving problem instances. Crafting these rules is labor-intensive, and may not scale well with complex problems.Given the frequent need to solve varied combinatorial optimization problems, leveraging statistical learning to auto-tune B&B algorithms for specific problem classes becomes attractive. This paper proposes a graph pointer network model to learn the branch rules. Graph features, global features and historical features are designated to represent the solver state. The graph neural network processes graph features, while the pointer mechanism assimilates the global and historical features to finally determine the variable on which to branch. The model is trained to imitate the expert strong branching rule by a tailored top-k Kullback-Leibler divergence loss function. Experiments on a series of benchmark problems demonstrate that the proposed approach significantly outperforms the widely used expert-designed branching rules. It also outperforms state-of-the-art machine-learning-based branch-and-bound methods in terms of solving speed and search tree size on all the test instances. In addition, the model can generalize to unseen instances and scale to larger instances.展开更多
Many problems in science,engineering and real life are related to the combinatorial optimization.However,many combinatorial optimization problems belong to a class of the NP-hard problems,and their globally optimal so...Many problems in science,engineering and real life are related to the combinatorial optimization.However,many combinatorial optimization problems belong to a class of the NP-hard problems,and their globally optimal solutions are usually difficult to solve.Therefore,great attention has been attracted to the algorithms of searching the globally optimal solution or near-optimal solution for the combinatorial optimization problems.As a typical combinatorial optimization problem,the traveling salesman problem(TSP)often serves as a touchstone for novel approaches.It has been found that natural systems,particularly brain nervous systems,work at the critical region between order and disorder,namely,on the edge of chaos.In this work,an algorithm for the combinatorial optimization problems is proposed based on the neural networks on the edge of chaos(ECNN).The algorithm is then applied to TSPs of 10 cities,21 cities,48 cities and 70 cities.The results show that ECNN algorithm has strong ability to drive the networks away from local minimums.Compared with the transiently chaotic neural network(TCNN),the stochastic chaotic neural network(SCNN)algorithms and other optimization algorithms,much higher rates of globally optimal solutions and near-optimal solutions are obtained with ECNN algorithm.To conclude,our algorithm provides an effective way for solving the combinatorial optimization problems.展开更多
This paper states a new metaheuristic based on Deterministic Finite Automata （DFA） for the multi - objective optimization of combinatorial problems. First, a new DFA named Multi - Objective Deterministic Finite Auto...This paper states a new metaheuristic based on Deterministic Finite Automata （DFA） for the multi - objective optimization of combinatorial problems. First, a new DFA named Multi - Objective Deterministic Finite Automata （MDFA） is defined. MDFA allows the representation of the feasible solutions space of combinatorial problems. Second, it is defined and implemented a metaheuritic based on MDFA theory. It is named Metaheuristic of Deterministic Swapping （MODS）. MODS is a local search strategy that works using a MDFA. Due to this, MODS never take into account unfeasible solutions. Hence, it is not necessary to verify the problem constraints for a new solution found. Lastly, MODS is tested using well know instances of the Bi-Objective Traveling Salesman Problem （TSP） from TSPLIB. Its results were compared with eight Ant Colony inspired algorithms and two Genetic algorithms taken from the specialized literature. The comparison was made using metrics such as Spacing, Generational Distance, Inverse Generational Distance and No-Dominated Generation Vectors. In every case, the MODS results on the metrics were always better and in some of those cases, the superiority was 100%.展开更多
The concept of the combinatorial discovery and optimization of new materials, and its background,importance, and application, as well as its current status in the world, are briefly reviewed in this paper.
Combining the vector level set model,the shape sensitivity analysis theory with the gradient projection technique,a level set method for topology optimization with multi-constraints and multi-materials is presented in...Combining the vector level set model,the shape sensitivity analysis theory with the gradient projection technique,a level set method for topology optimization with multi-constraints and multi-materials is presented in this paper.The method implicitly describes structural material in- terfaces by the vector level set and achieves the optimal shape and topology through the continuous evolution of the material interfaces in the structure.In order to increase computational efficiency for a fast convergence,an appropriate nonlinear speed mapping is established in the tangential space of the active constraints.Meanwhile,in order to overcome the numerical instability of general topology opti- mization problems,the regularization with the mean curvature flow is utilized to maintain the interface smoothness during the optimization process.The numerical examples demonstrate that the approach possesses a good flexibility in handling topological changes and gives an interface representation in a high fidelity,compared with other methods based on explicit boundary variations in the literature.展开更多
The vehicle routing and scheduling (VRS) problem with multi-objective and multi-constraint is analyzed, considering the complexity of the modern logistics in city economy and daily life based on the system engineering...The vehicle routing and scheduling (VRS) problem with multi-objective and multi-constraint is analyzed, considering the complexity of the modern logistics in city economy and daily life based on the system engineering. The objective and constraint includes loading, the dispatch and arrival time, transportation conditions,total cost,etc. An information model and a mathematical model are built,and a method based on knowledge and biologic immunity is put forward for optimizing and evaluating the programs dimensions in vehicle routing and scheduling with multi-objective and multi-constraints. The proposed model and method are illustrated in a case study concerning a transport network, and the result shows that more optimization solutions can be easily obtained and the method is efficient and feasible. Comparing with the standard GA and the standard GA without time constraint,the computational time of the algorithm is less in this paper. And the probability of gaining optimal solution is bigger and the result is better under the condition of multi-constraint.展开更多
The optimization of polymer structures aims to determine an optimal sequence or topology that achieves a given target property or structural performance.This inverse design problem involves searching within a vast com...The optimization of polymer structures aims to determine an optimal sequence or topology that achieves a given target property or structural performance.This inverse design problem involves searching within a vast combinatorial phase space defined by components,se-quences,and topologies,and is often computationally intractable due to its NP-hard nature.At the core of this challenge lies the need to evalu-ate complex correlations among structural variables,a classical problem in both statistical physics and combinatorial optimization.To address this,we adopt a mean-field approach that decouples direct variable-variable interactions into effective interactions between each variable and an auxiliary field.The simulated bifurcation(SB)algorithm is employed as a mean-field-based optimization framework.It constructs a Hamiltonian dynamical system by introducing generalized momentum fields,enabling efficient decoupling and dynamic evolution of strongly coupled struc-tural variables.Using the sequence optimization of a linear copolymer adsorbing on a solid surface as a case study,we demonstrate the applica-bility of the SB algorithm to high-dimensional,non-differentiable combinatorial optimization problems.Our results show that SB can efficiently discover polymer sequences with excellent adsorption performance within a reasonable computational time.Furthermore,it exhibits robust con-vergence and high parallel scalability across large design spaces.The approach developed in this work offers a new computational pathway for polymer structure optimization.It also lays a theoretical foundation for future extensions to topological design problems,such as optimizing the number and placement of side chains,as well as the co-optimization of sequence and topology.展开更多
Key information extraction can reduce the dimensional effects while evaluating the correct preferences of users during semantic data analysis.Currently,the classifiers are used to maximize the performance of web-page ...Key information extraction can reduce the dimensional effects while evaluating the correct preferences of users during semantic data analysis.Currently,the classifiers are used to maximize the performance of web-page recommendation in terms of precision and satisfaction.The recent method disambiguates contextual sentiment using conceptual prediction with robustness,however the conceptual prediction method is not able to yield the optimal solution.Context-dependent terms are primarily evaluated by constructing linear space of context features,presuming that if the terms come together in certain consumerrelated reviews,they are semantically reliant.Moreover,the more frequently they coexist,the greater the semantic dependency is.However,the influence of the terms that coexist with each other can be part of the frequency of the terms of their semantic dependence,as they are non-integrative and their individual meaning cannot be derived.In this work,we consider the strength of a term and the influence of a term as a combinatorial optimization,called Combinatorial Optimized Linear Space Knapsack for Information Retrieval(COLSK-IR).The COLSK-IR is considered as a knapsack problem with the total weight being the“term influence”or“influence of term”and the total value being the“term frequency”or“frequency of term”for semantic data analysis.The method,by which the term influence and the term frequency are considered to identify the optimal solutions,is called combinatorial optimizations.Thus,we choose the knapsack for performing an integer programming problem and perform multiple experiments using the linear space through combinatorial optimization to identify the possible optimum solutions.It is evident from our experimental results that the COLSK-IR provides better results than previous methods to detect strongly dependent snippets with minimum ambiguity that are related to inter-sentential context during semantic data analysis.展开更多
Traveling salesman problem(TSP) is one of the typical NP-hard problems, and it has been used in many engineering applications. However, the previous swarm intelligence(SI) based algorithms for TSP cannot coordinate wi...Traveling salesman problem(TSP) is one of the typical NP-hard problems, and it has been used in many engineering applications. However, the previous swarm intelligence(SI) based algorithms for TSP cannot coordinate with the exploration and exploitation abilities and are easily trapped into local optimum. In order to deal with this situation, a new hybrid optimization algorithm based on wolf pack search and local search(WPS-LS)is proposed for TSP. The new method firstly simulates the predatory process of wolf pack from the broad field to a specific place so that it allows for a search through all possible solution spaces and prevents wolf individuals from getting trapped into local optimum. Then, local search operation is used in the algorithm to improve the speed of solving and the accuracy of solution. The test of benchmarks selected from TSPLIB shows that the results obtained by this algorithm are better and closer to the theoretical optimal values with better robustness than those obtained by other methods.展开更多
The definition of local optimum solution of the discrete optimization is first given.and then a comprehensive combinatorial algorithm is proposed in this paper. Two-leveloptimum method is used in the algorithm. In t...The definition of local optimum solution of the discrete optimization is first given.and then a comprehensive combinatorial algorithm is proposed in this paper. Two-leveloptimum method is used in the algorithm. In the first level optimization, anapproximate local optimum solution X is found by using the heuristic algorithm,relative difference quotient algorithm. with high computational efficiency and highperformance demonstrated by the performance test of random samples. In the secondlevel, a mathematical model of (- 1, 0, 1) programming is established first, and then itis changed into (0, 1) programming model. The local optimum solution X will befrom the (0. 1) programming by using the delimitative and combinatorial algorithm orthe relative difference quotient algorithm. By this algorithm, the local optimumsolution can be obtained certainly, and a method is provnded to judge whether or notthe approximate optimum solution obtained by heuristic algorithm is an optimumsolution. The above comprehensive combinatorial algorithm has higher computationalefficiency.展开更多
Much of our daily tasks have been computerized by machines and sensors communicating with each other in real-time.There is a reasonable risk that something could go wrong because there are a lot of sensors producing a...Much of our daily tasks have been computerized by machines and sensors communicating with each other in real-time.There is a reasonable risk that something could go wrong because there are a lot of sensors producing a lot of data.Combinatorial testing(CT)can be used in this case to reduce risks and ensure conformance to specifications.Numerous existing metaheuristic-based solutions aim to assist the test suite generation for combinatorial testing,also known as t-way testing(where t indicates the interaction strength),viewed as an optimization problem.Much previous research,while helpful,only investigated a small number of interaction strengths up to t=6.For lightweight applications,research has demonstrated good fault-finding ability.However,the number of interaction strengths considered must be higher in the case of interactions that generate large amounts of data.Due to resource restrictions and the combinatorial explosion challenge,little work has been done to produce high-order interaction strength.In this context,the Whale Optimization Algorithm(WOA)is proposed to generate high-order interaction strength.To ensure that WOA conquers premature convergence and avoids local optima for large search spaces(owing to high-order interaction),three variants of WOA have been developed,namely Structurally Modified Whale Optimization Algorithm(SWOA),Tolerance Whale Optimization Algorithm(TWOA),and Tolerance Structurally Modified Whale Optimization Algorithm(TSWOA).Our experiments show that the third strategy gives the best performance and is comparable to existing state-of-thearts based strategies.展开更多
University timetabling problems are a yearly challenging task and are faced repeatedly each semester.The problems are considered nonpolynomial time(NP)and combinatorial optimization problems(COP),which means that they...University timetabling problems are a yearly challenging task and are faced repeatedly each semester.The problems are considered nonpolynomial time(NP)and combinatorial optimization problems(COP),which means that they can be solved through optimization algorithms to produce the aspired optimal timetable.Several techniques have been used to solve university timetabling problems,and most of them use optimization techniques.This paper provides a comprehensive review of the most recent studies dealing with concepts,methodologies,optimization,benchmarks,and open issues of university timetabling problems.The comprehensive review starts by presenting the essence of university timetabling as NP-COP,defining and clarifying the two formed classes of university timetabling:University Course Timetabling and University Examination Timetabling,illustrating the adopted algorithms for solving such a problem,elaborating the university timetabling constraints to be considered achieving the optimal timetable,and explaining how to analyze and measure the performance of the optimization algorithms by demonstrating the commonly used benchmark datasets for the evaluation.It is noted that meta-heuristic methodologies are widely used in the literature.Additionally,recently,multi-objective optimization has been increasingly used in solving such a problem that can identify robust university timetabling solutions.Finally,trends and future directions in university timetabling problems are provided.This paper provides good information for students,researchers,and specialists interested in this area of research.The challenges and possibilities for future research prospects are also explored.展开更多
The problem of social workers visiting their patients at home is a class of combinatorial optimization problems and belongs to the class of problems known as NP-Hard. These problems require heuristic techniques to pro...The problem of social workers visiting their patients at home is a class of combinatorial optimization problems and belongs to the class of problems known as NP-Hard. These problems require heuristic techniques to provide an efficient solution in the best of cases. In this article, in addition to providing a detailed resolution of the social workers’ problem using the Quadratic Unconstrained Binary Optimization Problems (QUBO) formulation, an approach to mapping the inequality constraints in the QUBO form is given. Finally, we map it in the Hamiltonian of the Ising model to solve it with the Quantum Exact Solver and Variational Quantum Eigensolvers (VQE). The quantum feasibility of the algorithm will be tested on IBMQ computers.展开更多
The minimum vertex cover problem(MVCP)is a well-known combinatorial optimization problem of graph theory.The MVCP is an NP(nondeterministic polynomial)complete problem and it has an exponential growing complexity with...The minimum vertex cover problem(MVCP)is a well-known combinatorial optimization problem of graph theory.The MVCP is an NP(nondeterministic polynomial)complete problem and it has an exponential growing complexity with respect to the size of a graph.No algorithm exits till date that can exactly solve the problem in a deterministic polynomial time scale.However,several algorithms are proposed that solve the problem approximately in a short polynomial time scale.Such algorithms are useful for large size graphs,for which exact solution of MVCP is impossible with current computational resources.The MVCP has a wide range of applications in the fields like bioinformatics,biochemistry,circuit design,electrical engineering,data aggregation,networking,internet traffic monitoring,pattern recognition,marketing and franchising etc.This work aims to solve the MVCP approximately by a novel graph decomposition approach.The decomposition of the graph yields a subgraph that contains edges shared by triangular edge structures.A subgraph is covered to yield a subgraph that forms one or more Hamiltonian cycles or paths.In order to reduce complexity of the algorithm a new strategy is also proposed.The reduction strategy can be used for any algorithm solving MVCP.Based on the graph decomposition and the reduction strategy,two algorithms are formulated to approximately solve the MVCP.These algorithms are tested using well known standard benchmark graphs.The key feature of the results is a good approximate error ratio and improvement in optimum vertex cover values for few graphs.展开更多
基金supported by Projects 12325501,12047503,12247104,and 12322501 of the National Natural Science Foundation of ChinaProject ZDRW-XX-2022-302 of the Chinese Academy of Sciencespartially supported by the Innovation Program for Quantum Science and Technology project 2021ZD0301900。
文摘Combinatorial optimization problems and ground state problems of spin glasses are crucial in various fields of science and technology.However,they often belong to the computational class of NP-hard,presenting significant computational challenges.Traditional algorithms inspired by statistical physics like simulated annealing have been widely adopted.Recently,advancements in Ising machines,such as quantum annealers and coherent Ising machines,offer new paradigms for solving these problems efficiently by embedding them into the analog evolution of nonlinear dynamical systems.However,existing dynamics-based algorithms often suffer from low convergence rates and local minima traps.In this work,we introduce the dual mean-field dynamics into Ising machines.The approach integrates the gradient force and the transverse force into the dynamics of Ising machines in solving combinatorial optimization problems,making it easier for the system to jump out of the local minimums and allowing the dynamics to explore wider in configuration space.We conduct extensive numerical experiments using the Sherrington–Kirkpatrick spin glass up to 10000 spins and the maximum cut problems with the standard G-set benchmarks.The numerical results demonstrate that our dual mean-field dynamics approach enhances the performance of base Ising machines,providing a more effective solution for large-scale combinatorial optimization problems.
基金This work was supported by an EPSRC grant (No.EP/C520696/1).
文摘Computational time complexity analyzes of evolutionary algorithms （EAs） have been performed since the mid-nineties. The first results were related to very simple algorithms, such as the （1＋1）-EA, on toy problems. These efforts produced a deeper understanding of how EAs perform on different kinds of fitness landscapes and general mathematical tools that may be extended to the analysis of more complicated EAs on more realistic problems. In fact, in recent years, it has been possible to analyze the （1＋1）-EA on combinatorial optimization problems with practical applications and more realistic population-based EAs on structured toy problems. This paper presents a survey of the results obtained in the last decade along these two research lines. The most common mathematical techniques are introduced, the basic ideas behind them are discussed and their elective applications are highlighted. Solved problems that were still open are enumerated as are those still awaiting for a solution. New questions and problems arisen in the meantime are also considered.
文摘This paper is basically a survey to show a number of combinatorial optimization problems arising from VLSI circuit design. Some of them including the existence problem, minimax problem, net representation, bend minimization, area minimization, placement problem, routing problem, etc. are especially discussed with new results and theoretical ideas for treating them. Finally, a number of problems for further research are mentioned.
基金National Natural Science Foundation of China(No.61371024)Aviation Science Fund of China(No.2013ZD53051)+2 种基金Aerospace Technology Support Fund of Chinathe Industry-Academy-Research Project of AVIC,China(No.cxy2013XGD14)the Open Research Project of Guangdong Key Laboratory of Popular High Performance Computers/Shenzhen Key Laboratory of Service Computing and Applications,China
文摘Electronic components' reliability has become the key of the complex system mission execution. Analog circuit is an important part of electronic components. Its fault diagnosis is far more challenging than that of digital circuit. Simulations and applications have shown that the methods based on BP neural network are effective in analog circuit fault diagnosis. Aiming at the tolerance of analog circuit,a combinatorial optimization diagnosis scheme was proposed with back propagation( BP) neural network( BPNN).The main contributions of this scheme included two parts:( 1) the random tolerance samples were added into the nominal training samples to establish new training samples,which were used to train the BP neural network based diagnosis model;( 2) the initial weights of the BP neural network were optimized by genetic algorithm( GA) to avoid local minima,and the BP neural network was tuned with Levenberg-Marquardt algorithm( LMA) in the local solution space to look for the optimum solution or approximate optimal solutions. The experimental results show preliminarily that the scheme substantially improves the whole learning process approximation and generalization ability,and effectively promotes analog circuit fault diagnosis performance based on BPNN.
基金supported by the National Natural Science Foundation of China(Grant No.92365206)the support of the China Postdoctoral Science Foundation(Certificate Number:2023M740272)+1 种基金supported by the National Natural Science Foundation of China(Grant No.12247168)China Postdoctoral Science Foundation(Certificate Number:2022TQ0036)。
文摘We introduce Quafu-Qcover,an open-source cloud-based software package developed for solving combinatorial optimization problems using quantum simulators and hardware backends.Quafu-Qcover provides a standardized and comprehensive workflow that utilizes the quantum approximate optimization algorithm(QAOA).It facilitates the automatic conversion of the original problem into a quadratic unconstrained binary optimization(QUBO)model and its corresponding Ising model,which can be subsequently transformed into a weight graph.The core of Qcover relies on a graph decomposition-based classical algorithm,which efficiently derives the optimal parameters for the shallow QAOA circuit.Quafu-Qcover incorporates a dedicated compiler capable of translating QAOA circuits into physical quantum circuits that can be executed on Quafu cloud quantum computers.Compared to a general-purpose compiler,our compiler demonstrates the ability to generate shorter circuit depths,while also exhibiting superior speed performance.Additionally,the Qcover compiler has the capability to dynamically create a library of qubits coupling substructures in real-time,utilizing the most recent calibration data from the superconducting quantum devices.This ensures that computational tasks can be assigned to connected physical qubits with the highest fidelity.The Quafu-Qcover allows us to retrieve quantum computing sampling results using a task ID at any time,enabling asynchronous processing.Moreover,it incorporates modules for results preprocessing and visualization,facilitating an intuitive display of solutions for combinatorial optimization problems.We hope that Quafu-Qcover can serve as an instructive illustration for how to explore application problems on the Quafu cloud quantum computers.
基金supported by the Open Project of Xiangjiang Laboratory (22XJ02003)Scientific Project of the National University of Defense Technology (NUDT)(ZK21-07, 23-ZZCX-JDZ-28)+1 种基金the National Science Fund for Outstanding Young Scholars (62122093)the National Natural Science Foundation of China (72071205)。
文摘Traditional expert-designed branching rules in branch-and-bound(B&B) are static, often failing to adapt to diverse and evolving problem instances. Crafting these rules is labor-intensive, and may not scale well with complex problems.Given the frequent need to solve varied combinatorial optimization problems, leveraging statistical learning to auto-tune B&B algorithms for specific problem classes becomes attractive. This paper proposes a graph pointer network model to learn the branch rules. Graph features, global features and historical features are designated to represent the solver state. The graph neural network processes graph features, while the pointer mechanism assimilates the global and historical features to finally determine the variable on which to branch. The model is trained to imitate the expert strong branching rule by a tailored top-k Kullback-Leibler divergence loss function. Experiments on a series of benchmark problems demonstrate that the proposed approach significantly outperforms the widely used expert-designed branching rules. It also outperforms state-of-the-art machine-learning-based branch-and-bound methods in terms of solving speed and search tree size on all the test instances. In addition, the model can generalize to unseen instances and scale to larger instances.
基金supported by the National Natural Science Foundation of China(Grant No.12074335)the National Science and Technology Major Project of the Ministry of Science and Technology of China(Grant No.2016YFA0300402).
文摘Many problems in science,engineering and real life are related to the combinatorial optimization.However,many combinatorial optimization problems belong to a class of the NP-hard problems,and their globally optimal solutions are usually difficult to solve.Therefore,great attention has been attracted to the algorithms of searching the globally optimal solution or near-optimal solution for the combinatorial optimization problems.As a typical combinatorial optimization problem,the traveling salesman problem(TSP)often serves as a touchstone for novel approaches.It has been found that natural systems,particularly brain nervous systems,work at the critical region between order and disorder,namely,on the edge of chaos.In this work,an algorithm for the combinatorial optimization problems is proposed based on the neural networks on the edge of chaos(ECNN).The algorithm is then applied to TSPs of 10 cities,21 cities,48 cities and 70 cities.The results show that ECNN algorithm has strong ability to drive the networks away from local minimums.Compared with the transiently chaotic neural network(TCNN),the stochastic chaotic neural network(SCNN)algorithms and other optimization algorithms,much higher rates of globally optimal solutions and near-optimal solutions are obtained with ECNN algorithm.To conclude,our algorithm provides an effective way for solving the combinatorial optimization problems.
文摘This paper states a new metaheuristic based on Deterministic Finite Automata （DFA） for the multi - objective optimization of combinatorial problems. First, a new DFA named Multi - Objective Deterministic Finite Automata （MDFA） is defined. MDFA allows the representation of the feasible solutions space of combinatorial problems. Second, it is defined and implemented a metaheuritic based on MDFA theory. It is named Metaheuristic of Deterministic Swapping （MODS）. MODS is a local search strategy that works using a MDFA. Due to this, MODS never take into account unfeasible solutions. Hence, it is not necessary to verify the problem constraints for a new solution found. Lastly, MODS is tested using well know instances of the Bi-Objective Traveling Salesman Problem （TSP） from TSPLIB. Its results were compared with eight Ant Colony inspired algorithms and two Genetic algorithms taken from the specialized literature. The comparison was made using metrics such as Spacing, Generational Distance, Inverse Generational Distance and No-Dominated Generation Vectors. In every case, the MODS results on the metrics were always better and in some of those cases, the superiority was 100%.
文摘The concept of the combinatorial discovery and optimization of new materials, and its background,importance, and application, as well as its current status in the world, are briefly reviewed in this paper.
基金The project supported by the National Natural Science Foundation of China (59805001,10332010) and Key Science and Technology Research Project of Ministry of Education of China (No.104060)
文摘Combining the vector level set model,the shape sensitivity analysis theory with the gradient projection technique,a level set method for topology optimization with multi-constraints and multi-materials is presented in this paper.The method implicitly describes structural material in- terfaces by the vector level set and achieves the optimal shape and topology through the continuous evolution of the material interfaces in the structure.In order to increase computational efficiency for a fast convergence,an appropriate nonlinear speed mapping is established in the tangential space of the active constraints.Meanwhile,in order to overcome the numerical instability of general topology opti- mization problems,the regularization with the mean curvature flow is utilized to maintain the interface smoothness during the optimization process.The numerical examples demonstrate that the approach possesses a good flexibility in handling topological changes and gives an interface representation in a high fidelity,compared with other methods based on explicit boundary variations in the literature.
基金National natural science foundation (No:70371040)
文摘The vehicle routing and scheduling (VRS) problem with multi-objective and multi-constraint is analyzed, considering the complexity of the modern logistics in city economy and daily life based on the system engineering. The objective and constraint includes loading, the dispatch and arrival time, transportation conditions,total cost,etc. An information model and a mathematical model are built,and a method based on knowledge and biologic immunity is put forward for optimizing and evaluating the programs dimensions in vehicle routing and scheduling with multi-objective and multi-constraints. The proposed model and method are illustrated in a case study concerning a transport network, and the result shows that more optimization solutions can be easily obtained and the method is efficient and feasible. Comparing with the standard GA and the standard GA without time constraint,the computational time of the algorithm is less in this paper. And the probability of gaining optimal solution is bigger and the result is better under the condition of multi-constraint.
基金supported by the Fundamental Research Funds for the Central Universities(No.2024JBZX029)Shijiazhuang High Level Science and Technology Innovation and Entrepreneurship Talent Project(No.08202307)the National Natural Science Foundation of China(NSFC)(No.22173004).
文摘The optimization of polymer structures aims to determine an optimal sequence or topology that achieves a given target property or structural performance.This inverse design problem involves searching within a vast combinatorial phase space defined by components,se-quences,and topologies,and is often computationally intractable due to its NP-hard nature.At the core of this challenge lies the need to evalu-ate complex correlations among structural variables,a classical problem in both statistical physics and combinatorial optimization.To address this,we adopt a mean-field approach that decouples direct variable-variable interactions into effective interactions between each variable and an auxiliary field.The simulated bifurcation(SB)algorithm is employed as a mean-field-based optimization framework.It constructs a Hamiltonian dynamical system by introducing generalized momentum fields,enabling efficient decoupling and dynamic evolution of strongly coupled struc-tural variables.Using the sequence optimization of a linear copolymer adsorbing on a solid surface as a case study,we demonstrate the applica-bility of the SB algorithm to high-dimensional,non-differentiable combinatorial optimization problems.Our results show that SB can efficiently discover polymer sequences with excellent adsorption performance within a reasonable computational time.Furthermore,it exhibits robust con-vergence and high parallel scalability across large design spaces.The approach developed in this work offers a new computational pathway for polymer structure optimization.It also lays a theoretical foundation for future extensions to topological design problems,such as optimizing the number and placement of side chains,as well as the co-optimization of sequence and topology.
文摘Key information extraction can reduce the dimensional effects while evaluating the correct preferences of users during semantic data analysis.Currently,the classifiers are used to maximize the performance of web-page recommendation in terms of precision and satisfaction.The recent method disambiguates contextual sentiment using conceptual prediction with robustness,however the conceptual prediction method is not able to yield the optimal solution.Context-dependent terms are primarily evaluated by constructing linear space of context features,presuming that if the terms come together in certain consumerrelated reviews,they are semantically reliant.Moreover,the more frequently they coexist,the greater the semantic dependency is.However,the influence of the terms that coexist with each other can be part of the frequency of the terms of their semantic dependence,as they are non-integrative and their individual meaning cannot be derived.In this work,we consider the strength of a term and the influence of a term as a combinatorial optimization,called Combinatorial Optimized Linear Space Knapsack for Information Retrieval(COLSK-IR).The COLSK-IR is considered as a knapsack problem with the total weight being the“term influence”or“influence of term”and the total value being the“term frequency”or“frequency of term”for semantic data analysis.The method,by which the term influence and the term frequency are considered to identify the optimal solutions,is called combinatorial optimizations.Thus,we choose the knapsack for performing an integer programming problem and perform multiple experiments using the linear space through combinatorial optimization to identify the possible optimum solutions.It is evident from our experimental results that the COLSK-IR provides better results than previous methods to detect strongly dependent snippets with minimum ambiguity that are related to inter-sentential context during semantic data analysis.
基金the National Natural Science Foundation of China(No.61502198)the Science&Technology Development Project of Jilin Province(Nos.20180101334JC and 20190302117GX)the"3th-Five Year" Science and Technology Research Project of Education Department of Jilin Province(No.JJKH20170574KJ)
文摘Traveling salesman problem(TSP) is one of the typical NP-hard problems, and it has been used in many engineering applications. However, the previous swarm intelligence(SI) based algorithms for TSP cannot coordinate with the exploration and exploitation abilities and are easily trapped into local optimum. In order to deal with this situation, a new hybrid optimization algorithm based on wolf pack search and local search(WPS-LS)is proposed for TSP. The new method firstly simulates the predatory process of wolf pack from the broad field to a specific place so that it allows for a search through all possible solution spaces and prevents wolf individuals from getting trapped into local optimum. Then, local search operation is used in the algorithm to improve the speed of solving and the accuracy of solution. The test of benchmarks selected from TSPLIB shows that the results obtained by this algorithm are better and closer to the theoretical optimal values with better robustness than those obtained by other methods.
基金supported by National Natural Science Foundation of China(61425008,61333004,61273054)Top-Notch Young Talents Program of China,and Aeronautical Foundation of China(2013585104)
文摘The definition of local optimum solution of the discrete optimization is first given.and then a comprehensive combinatorial algorithm is proposed in this paper. Two-leveloptimum method is used in the algorithm. In the first level optimization, anapproximate local optimum solution X is found by using the heuristic algorithm,relative difference quotient algorithm. with high computational efficiency and highperformance demonstrated by the performance test of random samples. In the secondlevel, a mathematical model of (- 1, 0, 1) programming is established first, and then itis changed into (0, 1) programming model. The local optimum solution X will befrom the (0. 1) programming by using the delimitative and combinatorial algorithm orthe relative difference quotient algorithm. By this algorithm, the local optimumsolution can be obtained certainly, and a method is provnded to judge whether or notthe approximate optimum solution obtained by heuristic algorithm is an optimumsolution. The above comprehensive combinatorial algorithm has higher computationalefficiency.
基金This work was supported by the Ministry of Education,Malaysia(FRGS/1/2019/ICT02/UKM/01/1)the Universiti Kebangsaan Malaysia(DIP-2016-024).
文摘Much of our daily tasks have been computerized by machines and sensors communicating with each other in real-time.There is a reasonable risk that something could go wrong because there are a lot of sensors producing a lot of data.Combinatorial testing(CT)can be used in this case to reduce risks and ensure conformance to specifications.Numerous existing metaheuristic-based solutions aim to assist the test suite generation for combinatorial testing,also known as t-way testing(where t indicates the interaction strength),viewed as an optimization problem.Much previous research,while helpful,only investigated a small number of interaction strengths up to t=6.For lightweight applications,research has demonstrated good fault-finding ability.However,the number of interaction strengths considered must be higher in the case of interactions that generate large amounts of data.Due to resource restrictions and the combinatorial explosion challenge,little work has been done to produce high-order interaction strength.In this context,the Whale Optimization Algorithm(WOA)is proposed to generate high-order interaction strength.To ensure that WOA conquers premature convergence and avoids local optima for large search spaces(owing to high-order interaction),three variants of WOA have been developed,namely Structurally Modified Whale Optimization Algorithm(SWOA),Tolerance Whale Optimization Algorithm(TWOA),and Tolerance Structurally Modified Whale Optimization Algorithm(TSWOA).Our experiments show that the third strategy gives the best performance and is comparable to existing state-of-thearts based strategies.
基金This research work was supported by the University Malaysia Sabah,Malaysia.
文摘University timetabling problems are a yearly challenging task and are faced repeatedly each semester.The problems are considered nonpolynomial time(NP)and combinatorial optimization problems(COP),which means that they can be solved through optimization algorithms to produce the aspired optimal timetable.Several techniques have been used to solve university timetabling problems,and most of them use optimization techniques.This paper provides a comprehensive review of the most recent studies dealing with concepts,methodologies,optimization,benchmarks,and open issues of university timetabling problems.The comprehensive review starts by presenting the essence of university timetabling as NP-COP,defining and clarifying the two formed classes of university timetabling:University Course Timetabling and University Examination Timetabling,illustrating the adopted algorithms for solving such a problem,elaborating the university timetabling constraints to be considered achieving the optimal timetable,and explaining how to analyze and measure the performance of the optimization algorithms by demonstrating the commonly used benchmark datasets for the evaluation.It is noted that meta-heuristic methodologies are widely used in the literature.Additionally,recently,multi-objective optimization has been increasingly used in solving such a problem that can identify robust university timetabling solutions.Finally,trends and future directions in university timetabling problems are provided.This paper provides good information for students,researchers,and specialists interested in this area of research.The challenges and possibilities for future research prospects are also explored.
文摘The problem of social workers visiting their patients at home is a class of combinatorial optimization problems and belongs to the class of problems known as NP-Hard. These problems require heuristic techniques to provide an efficient solution in the best of cases. In this article, in addition to providing a detailed resolution of the social workers’ problem using the Quadratic Unconstrained Binary Optimization Problems (QUBO) formulation, an approach to mapping the inequality constraints in the QUBO form is given. Finally, we map it in the Hamiltonian of the Ising model to solve it with the Quantum Exact Solver and Variational Quantum Eigensolvers (VQE). The quantum feasibility of the algorithm will be tested on IBMQ computers.
文摘The minimum vertex cover problem(MVCP)is a well-known combinatorial optimization problem of graph theory.The MVCP is an NP(nondeterministic polynomial)complete problem and it has an exponential growing complexity with respect to the size of a graph.No algorithm exits till date that can exactly solve the problem in a deterministic polynomial time scale.However,several algorithms are proposed that solve the problem approximately in a short polynomial time scale.Such algorithms are useful for large size graphs,for which exact solution of MVCP is impossible with current computational resources.The MVCP has a wide range of applications in the fields like bioinformatics,biochemistry,circuit design,electrical engineering,data aggregation,networking,internet traffic monitoring,pattern recognition,marketing and franchising etc.This work aims to solve the MVCP approximately by a novel graph decomposition approach.The decomposition of the graph yields a subgraph that contains edges shared by triangular edge structures.A subgraph is covered to yield a subgraph that forms one or more Hamiltonian cycles or paths.In order to reduce complexity of the algorithm a new strategy is also proposed.The reduction strategy can be used for any algorithm solving MVCP.Based on the graph decomposition and the reduction strategy,two algorithms are formulated to approximately solve the MVCP.These algorithms are tested using well known standard benchmark graphs.The key feature of the results is a good approximate error ratio and improvement in optimum vertex cover values for few graphs.
