In this paper, a branch-and-bound method for solving multi-dimensional quadratic 0-1 knapsack problems was studied. The method was based on the Lagrangian relaxation and the surrogate constraint technique for finding ...In this paper, a branch-and-bound method for solving multi-dimensional quadratic 0-1 knapsack problems was studied. The method was based on the Lagrangian relaxation and the surrogate constraint technique for finding feasible solutions. The Lagrangian relaxations were solved with the maximum-flow algorithm and the Lagrangian bounds was determined with the outer approximation method. Computational results show the efficiency of the proposed method for multi-dimensional quadratic 0-1 knapsack problems.展开更多
0-1 programming is a special case of the integer programming, which is commonly encountered in many optimization problems. Neural network and its general energy function are presented for 0-1 optimization problem. The...0-1 programming is a special case of the integer programming, which is commonly encountered in many optimization problems. Neural network and its general energy function are presented for 0-1 optimization problem. Then, the 0-1 optimization problems are solved by a neural network model with transient chaotic dynamics (TCNN). Numerical simulations of two typical 0-1 optimization problems show that TCNN can overcome HNN's main drawbacks that it suffers from the local minimum and can search for the global optimal solutions in to solveing 0-1 optimization problems.展开更多
The key problems of cold power spinning of Ti-15-3 alloy are studied. Reasonable billet preparation methods are presented to improve crystal structure and avoid crack of billet. Influences of original wall thickness,...The key problems of cold power spinning of Ti-15-3 alloy are studied. Reasonable billet preparation methods are presented to improve crystal structure and avoid crack of billet. Influences of original wall thickness, reduction rate and feed rate on expanding in diameter are analyzed and some methods to prevent expanding in diameter are given.展开更多
Based on the structure of chute - feed and autoleveHer, an analysis of their working principle and the verification of their practical production results have been carried out. Finally, the future investigation direet...Based on the structure of chute - feed and autoleveHer, an analysis of their working principle and the verification of their practical production results have been carried out. Finally, the future investigation direetiom of chute - feed and card autuleveller are put forward.展开更多
Generalized Jacobi polynomials with indexes α,β∈ R are introduced and some basic properties are established. As examples of applications,the second- and fourth-order elliptic boundary value problems with Dirichlet ...Generalized Jacobi polynomials with indexes α,β∈ R are introduced and some basic properties are established. As examples of applications,the second- and fourth-order elliptic boundary value problems with Dirichlet or Robin boundary conditions are considered,and the generalized Jacobi spectral schemes are proposed. For the diagonalization of discrete systems,the Jacobi-Sobolev orthogonal basis functions are constructed,which allow the exact solutions and the approximate solutions to be represented in the forms of infinite and truncated Jacobi series. Error estimates are obtained and numerical results are provided to illustrate the effectiveness and the spectral accuracy.展开更多
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%.展开更多
According to traditional card problem solving which is based on the idea of genetic algorithm(GA),a set of algorithms is designed to find final solution.For each process in genetic algorithm,including choices of fitne...According to traditional card problem solving which is based on the idea of genetic algorithm(GA),a set of algorithms is designed to find final solution.For each process in genetic algorithm,including choices of fitness function,parameters determination and coding scheme selection,classic algorithm is used to realize the various steps,and ultimately to find solution of problems.展开更多
In this paper, we investigate the existence and uniqueness of solutions for a new fourth-order differential equation boundary value problem：{u（4）（t） = f（t, u（t））-b, 0 〈 t 〈 1,u（0） = u′（0） = u′（1） = ...In this paper, we investigate the existence and uniqueness of solutions for a new fourth-order differential equation boundary value problem：{u（4）（t） = f（t, u（t））-b, 0 〈 t 〈 1,u（0） = u′（0） = u′（1） = u（3）（1） = 0,where f ∈ C（[0,1] ×（-∞,＋∞）,（-∞, ＋∞））,b ≥ 0 is a constant. The novelty of this paper is that the boundary value problem is a new type and the method is a new fixed point theorem ofφ-（h,e）-concave operators.展开更多
Binary wolf pack algorithm (BWPA) is a kind of intelligence algorithm which can solve combination optimization problems in discrete spaces.Based on BWPA, an improved binary wolf pack algorithm (AIBWPA) can be proposed...Binary wolf pack algorithm (BWPA) is a kind of intelligence algorithm which can solve combination optimization problems in discrete spaces.Based on BWPA, an improved binary wolf pack algorithm (AIBWPA) can be proposed by adopting adaptive step length and improved update strategy of wolf pack. AIBWPA is applied to 10 classic 0-1 knapsack problems and compared with BWPA, DPSO, which proves that AIBWPA has higher optimization accuracy and better computational robustness. AIBWPA makes the parameters simple, protects the population diversity and enhances the global convergence.展开更多
The advancements of mobile devices, public networks and the Internet of creature huge amounts of complex data, both construct & unstructured are being captured in trust to allow organizations to produce better bus...The advancements of mobile devices, public networks and the Internet of creature huge amounts of complex data, both construct & unstructured are being captured in trust to allow organizations to produce better business decisions as data is now pivotal for an organizations success. These enormous amounts of data are referred to as Big Data, which enables a competitive advantage over rivals when processed and analyzed appropriately. However Big Data Analytics has a few concerns including Management of Data, Privacy & Security, getting optimal path for transport data, and Data Representation. However, the structure of network does not completely match transportation demand, i.e., there still exist a few bottlenecks in the network. This paper presents a new approach to get the optimal path of valuable data movement through a given network based on the knapsack problem. This paper will give value for each piece of data, it depends on the importance of this data (each piece of data defined by two arguments size and value), and the approach tries to find the optimal path from source to destination, a mathematical models are developed to adjust data flows between their shortest paths based on the 0 - 1 knapsack problem. We also take out computational experience using the commercial software Gurobi and a greedy algorithm (GA), respectively. The outcome indicates that the suggest models are active and workable. This paper introduced two different algorithms to study the shortest path problems: the first algorithm studies the shortest path problems when stochastic activates and activities does not depend on weights. The second algorithm studies the shortest path problems depends on weights.展开更多
The opening of a new IUPAC-project is highly appreciated. In the year 2009, the IUPAC had published an article “Discovery of the element with atomic number 112 (IUPAC Technical Report)” [1]* which contains a section...The opening of a new IUPAC-project is highly appreciated. In the year 2009, the IUPAC had published an article “Discovery of the element with atomic number 112 (IUPAC Technical Report)” [1]* which contains a section on the work of the Marinov collaboration. It appears that this section is not always in agreement with conventional standards for scientific publications. This present comment focuses on these formal questions.展开更多
Self-organizing map(SOM) proposed by Kohonen has obtained certain achievements in solving the traveling salesman problem(TSP).To improve Kohonen SOM,an effective initialization and parameter modification method is dis...Self-organizing map(SOM) proposed by Kohonen has obtained certain achievements in solving the traveling salesman problem(TSP).To improve Kohonen SOM,an effective initialization and parameter modification method is discussed to obtain a faster convergence rate and better solution.Therefore,a new improved self-organizing map(ISOM)algorithm is introduced and applied to four traveling salesman problem instances for experimental simulation,and then the result of ISOM is compared with those of four SOM algorithms:AVL,KL,KG and MSTSP.Using ISOM,the average error of four travelingsalesman problem instances is only 2.895 0%,which is greatly better than the other four algorithms:8.51%(AVL),6.147 5%(KL),6.555%(KG) and 3.420 9%(MSTSP).Finally,ISOM is applied to two practical problems:the Chinese 100 cities-TSP and102 counties-TSP in Shanxi Province,and the two optimal touring routes are provided to the tourists.展开更多
In this paper, we consider the socalled k-coloring problem in general case.Firstly, a special quadratic 0-1 programming is constructed to formulate k-coloring problem. Secondly, by use of the equivalence between above...In this paper, we consider the socalled k-coloring problem in general case.Firstly, a special quadratic 0-1 programming is constructed to formulate k-coloring problem. Secondly, by use of the equivalence between above quadratic0-1 programming and its relaxed problem, k-coloring problem is converted intoa class of (continuous) nonconvex quadratic programs, and several theoreticresults are also introduced. Thirdly, linear programming approximate algorithmis quoted and verified for this class of nonconvex quadratic programs. Finally,examining problems which are used to test the algorithm are constructed andsufficient computation experiments are reported.展开更多
基金Project supported by the National Natural Science Foundation of China （Grant No.10571116）
文摘In this paper, a branch-and-bound method for solving multi-dimensional quadratic 0-1 knapsack problems was studied. The method was based on the Lagrangian relaxation and the surrogate constraint technique for finding feasible solutions. The Lagrangian relaxations were solved with the maximum-flow algorithm and the Lagrangian bounds was determined with the outer approximation method. Computational results show the efficiency of the proposed method for multi-dimensional quadratic 0-1 knapsack problems.
基金This project was supported by the National Natural Science Foundation of China (79970042).
文摘0-1 programming is a special case of the integer programming, which is commonly encountered in many optimization problems. Neural network and its general energy function are presented for 0-1 optimization problem. Then, the 0-1 optimization problems are solved by a neural network model with transient chaotic dynamics (TCNN). Numerical simulations of two typical 0-1 optimization problems show that TCNN can overcome HNN's main drawbacks that it suffers from the local minimum and can search for the global optimal solutions in to solveing 0-1 optimization problems.
文摘The key problems of cold power spinning of Ti-15-3 alloy are studied. Reasonable billet preparation methods are presented to improve crystal structure and avoid crack of billet. Influences of original wall thickness, reduction rate and feed rate on expanding in diameter are analyzed and some methods to prevent expanding in diameter are given.
文摘Based on the structure of chute - feed and autoleveHer, an analysis of their working principle and the verification of their practical production results have been carried out. Finally, the future investigation direetiom of chute - feed and card autuleveller are put forward.
基金the National Natural Science Foundation of China (Nos.11571238,11601332,91130014,11471312 and 91430216).
文摘Generalized Jacobi polynomials with indexes α,β∈ R are introduced and some basic properties are established. As examples of applications,the second- and fourth-order elliptic boundary value problems with Dirichlet or Robin boundary conditions are considered,and the generalized Jacobi spectral schemes are proposed. For the diagonalization of discrete systems,the Jacobi-Sobolev orthogonal basis functions are constructed,which allow the exact solutions and the approximate solutions to be represented in the forms of infinite and truncated Jacobi series. Error estimates are obtained and numerical results are provided to illustrate the effectiveness and the spectral accuracy.
文摘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%.
文摘According to traditional card problem solving which is based on the idea of genetic algorithm(GA),a set of algorithms is designed to find final solution.For each process in genetic algorithm,including choices of fitness function,parameters determination and coding scheme selection,classic algorithm is used to realize the various steps,and ultimately to find solution of problems.
基金Supported by the Shanxi Scholarship Council of China(Grant No.2016-009)the Natural Science Foundation of Shanxi Province(Grant No.201701D121004)
文摘In this paper, we investigate the existence and uniqueness of solutions for a new fourth-order differential equation boundary value problem：{u（4）（t） = f（t, u（t））-b, 0 〈 t 〈 1,u（0） = u′（0） = u′（1） = u（3）（1） = 0,where f ∈ C（[0,1] ×（-∞,＋∞）,（-∞, ＋∞））,b ≥ 0 is a constant. The novelty of this paper is that the boundary value problem is a new type and the method is a new fixed point theorem ofφ-（h,e）-concave operators.
文摘Binary wolf pack algorithm (BWPA) is a kind of intelligence algorithm which can solve combination optimization problems in discrete spaces.Based on BWPA, an improved binary wolf pack algorithm (AIBWPA) can be proposed by adopting adaptive step length and improved update strategy of wolf pack. AIBWPA is applied to 10 classic 0-1 knapsack problems and compared with BWPA, DPSO, which proves that AIBWPA has higher optimization accuracy and better computational robustness. AIBWPA makes the parameters simple, protects the population diversity and enhances the global convergence.
文摘The advancements of mobile devices, public networks and the Internet of creature huge amounts of complex data, both construct & unstructured are being captured in trust to allow organizations to produce better business decisions as data is now pivotal for an organizations success. These enormous amounts of data are referred to as Big Data, which enables a competitive advantage over rivals when processed and analyzed appropriately. However Big Data Analytics has a few concerns including Management of Data, Privacy & Security, getting optimal path for transport data, and Data Representation. However, the structure of network does not completely match transportation demand, i.e., there still exist a few bottlenecks in the network. This paper presents a new approach to get the optimal path of valuable data movement through a given network based on the knapsack problem. This paper will give value for each piece of data, it depends on the importance of this data (each piece of data defined by two arguments size and value), and the approach tries to find the optimal path from source to destination, a mathematical models are developed to adjust data flows between their shortest paths based on the 0 - 1 knapsack problem. We also take out computational experience using the commercial software Gurobi and a greedy algorithm (GA), respectively. The outcome indicates that the suggest models are active and workable. This paper introduced two different algorithms to study the shortest path problems: the first algorithm studies the shortest path problems when stochastic activates and activities does not depend on weights. The second algorithm studies the shortest path problems depends on weights.
文摘The opening of a new IUPAC-project is highly appreciated. In the year 2009, the IUPAC had published an article “Discovery of the element with atomic number 112 (IUPAC Technical Report)” [1]* which contains a section on the work of the Marinov collaboration. It appears that this section is not always in agreement with conventional standards for scientific publications. This present comment focuses on these formal questions.
文摘Self-organizing map(SOM) proposed by Kohonen has obtained certain achievements in solving the traveling salesman problem(TSP).To improve Kohonen SOM,an effective initialization and parameter modification method is discussed to obtain a faster convergence rate and better solution.Therefore,a new improved self-organizing map(ISOM)algorithm is introduced and applied to four traveling salesman problem instances for experimental simulation,and then the result of ISOM is compared with those of four SOM algorithms:AVL,KL,KG and MSTSP.Using ISOM,the average error of four travelingsalesman problem instances is only 2.895 0%,which is greatly better than the other four algorithms:8.51%(AVL),6.147 5%(KL),6.555%(KG) and 3.420 9%(MSTSP).Finally,ISOM is applied to two practical problems:the Chinese 100 cities-TSP and102 counties-TSP in Shanxi Province,and the two optimal touring routes are provided to the tourists.
文摘In this paper, we consider the socalled k-coloring problem in general case.Firstly, a special quadratic 0-1 programming is constructed to formulate k-coloring problem. Secondly, by use of the equivalence between above quadratic0-1 programming and its relaxed problem, k-coloring problem is converted intoa class of (continuous) nonconvex quadratic programs, and several theoreticresults are also introduced. Thirdly, linear programming approximate algorithmis quoted and verified for this class of nonconvex quadratic programs. Finally,examining problems which are used to test the algorithm are constructed andsufficient computation experiments are reported.
