Large calculation error can be formed by directly employing the conventional Yee’s grid to curve surfaces.In order to alleviate such condition,unconditionally stable CrankNicolson Douglas-Gunn(CNDG)algorithm with is ...Large calculation error can be formed by directly employing the conventional Yee’s grid to curve surfaces.In order to alleviate such condition,unconditionally stable CrankNicolson Douglas-Gunn(CNDG)algorithm with is proposed for rotationally symmetric multi-scale problems in anisotropic magnetized plasma.Within the CNDG algorithm,an alternative scheme for the simulation of anisotropic plasma is proposed in body-of-revolution domains.Convolutional perfectly matched layer(CPML)formulation is proposed to efficiently solve the open region problems.Numerical example is carried out for the illustration of effectiveness including the efficiency,resources,and absorption.Through the results,it can be concluded that the proposed scheme shows considerable performance during the simulation.展开更多
As commercial drone delivery becomes increasingly popular,the extension of the vehicle routing problem with drones(VRPD)is emerging as an optimization problem of inter-ests.This paper studies a variant of VRPD in mult...As commercial drone delivery becomes increasingly popular,the extension of the vehicle routing problem with drones(VRPD)is emerging as an optimization problem of inter-ests.This paper studies a variant of VRPD in multi-trip and multi-drop(VRP-mmD).The problem aims at making schedules for the trucks and drones such that the total travel time is minimized.This paper formulate the problem with a mixed integer program-ming model and propose a two-phase algorithm,i.e.,a parallel route construction heuristic(PRCH)for the first phase and an adaptive neighbor searching heuristic(ANSH)for the second phase.The PRCH generates an initial solution by con-currently assigning as many nodes as possible to the truck–drone pair to progressively reduce the waiting time at the rendezvous node in the first phase.Then the ANSH improves the initial solution by adaptively exploring the neighborhoods in the second phase.Numerical tests on some benchmark data are conducted to verify the performance of the algorithm.The results show that the proposed algorithm can found better solu-tions than some state-of-the-art methods for all instances.More-over,an extensive analysis highlights the stability of the pro-posed algorithm.展开更多
A class of singularly perturbed initial boundary value problems for the reaction diffusion equations in a part of domain are considered. Using the operator theory the asymptotic behavior of solution for the problems i...A class of singularly perturbed initial boundary value problems for the reaction diffusion equations in a part of domain are considered. Using the operator theory the asymptotic behavior of solution for the problems is studied.展开更多
By using an existence theorems of maximal elements for a family of set-valued mappings in G-convex spaces due to the author, some new nonempty intersection theorems for a family of set-valued mappings were established...By using an existence theorems of maximal elements for a family of set-valued mappings in G-convex spaces due to the author, some new nonempty intersection theorems for a family of set-valued mappings were established in noncompact product G-convex spaces. As applications, some equilibrium existence theorems for a system of generalized vector equilibrium problems were proved in noncompact product G-convex spaces. These theorems unify, improve and generalize some important known results in literature.展开更多
An improved genetic algorithm（IGA） based on a novel selection strategy to handle nonlinear programming problems is proposed.Each individual in selection process is represented as a three-dimensional feature vector w...An improved genetic algorithm（IGA） based on a novel selection strategy to handle nonlinear programming problems is proposed.Each individual in selection process is represented as a three-dimensional feature vector which is composed of objective function value,the degree of constraints violations and the number of constraints violations.It is easy to distinguish excellent individuals from general individuals by using an individuals＇ feature vector.Additionally,a local search（LS） process is incorporated into selection operation so as to find feasible solutions located in the neighboring areas of some infeasible solutions.The combination of IGA and LS should offer the advantage of both the quality of solutions and diversity of solutions.Experimental results over a set of benchmark problems demonstrate that IGA has better performance than other algorithms.展开更多
A modified bottleneck-based （MB） heuristic for large-scale job-shop scheduling problems with a welldefined bottleneck is suggested, which is simpler but more tailored than the shifting bottleneck （SB） procedure. I...A modified bottleneck-based （MB） heuristic for large-scale job-shop scheduling problems with a welldefined bottleneck is suggested, which is simpler but more tailored than the shifting bottleneck （SB） procedure. In this algorithm, the bottleneck is first scheduled optimally while the non-bottleneck machines are subordinated around the solutions of the bottleneck schedule by some effective dispatching rules. Computational results indicate that the MB heuristic can achieve a better tradeoff between solution quality and computational time compared to SB procedure for medium-size problems. Furthermore, it can obtain a good solution in a short time for large-scale jobshop scheduling problems.展开更多
Ant colony optimization （ACO） is a new heuristic algo- rithm which has been proven a successful technique and applied to a number of combinatorial optimization problems. The traveling salesman problem （TSP） is amo...Ant colony optimization （ACO） is a new heuristic algo- rithm which has been proven a successful technique and applied to a number of combinatorial optimization problems. The traveling salesman problem （TSP） is among the most important combinato- rial problems. An ACO algorithm based on scout characteristic is proposed for solving the stagnation behavior and premature con- vergence problem of the basic ACO algorithm on TSP. The main idea is to partition artificial ants into two groups： scout ants and common ants. The common ants work according to the search manner of basic ant colony algorithm, but scout ants have some differences from common ants, they calculate each route＇s muta- tion probability of the current optimal solution using path evaluation model and search around the optimal solution according to the mutation probability. Simulation on TSP shows that the improved algorithm has high efficiency and robustness.展开更多
A novel chaotic search method is proposed,and a hybrid algorithm combining particle swarm optimization(PSO) with this new method,called CLSPSO,is put forward to solve 14 integer and mixed integer programming problems....A novel chaotic search method is proposed,and a hybrid algorithm combining particle swarm optimization(PSO) with this new method,called CLSPSO,is put forward to solve 14 integer and mixed integer programming problems.The performances of CLSPSO are compared with those of other five hybrid algorithms combining PSO with chaotic search methods.Experimental results indicate that in terms of robustness and final convergence speed,CLSPSO is better than other five algorithms in solving many of these problems.Furthermore,CLSPSO exhibits good performance in solving two high-dimensional problems,and it finds better solutions than the known ones.A performance index(PI) is introduced to fairly compare the above six algorithms,and the obtained values of(PI) in three cases demonstrate that CLSPSO is superior to all the other five algorithms under the same conditions.展开更多
An integer linear bilevel programming problem is firstly transformed into a binary linear bilevel programming problem, and then converted into a single-level binary implicit programming. An orthogonal genetic algorith...An integer linear bilevel programming problem is firstly transformed into a binary linear bilevel programming problem, and then converted into a single-level binary implicit programming. An orthogonal genetic algorithm is developed for solving the binary linear implicit programming problem based on the orthogonal design. The orthogonal design with the factor analysis, an experimental design method is applied to the genetic algorithm to make the algorithm more robust, statistical y sound and quickly convergent. A crossover operator formed by the orthogonal array and the factor analysis is presented. First, this crossover operator can generate a smal but representative sample of points as offspring. After al of the better genes of these offspring are selected, a best combination among these offspring is then generated. The simulation results show the effectiveness of the proposed algorithm.展开更多
Employing an ideal elasto-plastic model,the typically used strength reduction method reduced the strength of all soil elements of a slope.Therefore,this method was called the global strength reduction method(GSRM).How...Employing an ideal elasto-plastic model,the typically used strength reduction method reduced the strength of all soil elements of a slope.Therefore,this method was called the global strength reduction method(GSRM).However,the deformation field obtained by GSRM could not reflect the real deformation of a slope when the slope became unstable.For most slopes,failure occurs once the strength of some regional soil is sufficiently weakened; thus,the local strength reduction method(LSRM)was proposed to analyze slope stability.In contrast with GSRM,LSRM only reduces the strength of local soil,while the strength of other soil remains unchanged.Therefore,deformation by LSRM is more reasonable than that by GSRM.In addition,the accuracy of the slope's deformation depends on the constitutive model to a large degree,and the variable-modulus elasto-plastic model was thus adopted.This constitutive model was an improvement of the Duncan–Chang model,which modified soil's deformation modulus according to stress level,and it thus better reflected the plastic feature of soil.Most importantly,the parameters of the variable-modulus elasto-plastic model could be determined through in-situ tests,and parameters determination by plate loading test and pressuremeter test were introduced.Therefore,it is easy to put this model into practice.Finally,LSRM and the variable-modulus elasto-plastic model were used to analyze Egongdai ancient landslide.Safety factor,deformation field,and optimal reinforcement measures for Egongdai ancient landslide were obtained based on the proposed method.展开更多
In this paper, we propose a modified evolutionary programming with dynamic domain for solving nonlinear IP/MIP problems with linear constraints, without involving penalty function or any transformation for the problem...In this paper, we propose a modified evolutionary programming with dynamic domain for solving nonlinear IP/MIP problems with linear constraints, without involving penalty function or any transformation for the problem to a linear model or others. The numerical results show that the new algorithm gives a satisfactory performance in which it works of high speed, and accuracy in IP/MIP problems.展开更多
In dynamic environments,it is important to track changing optimal solutions over time.Univariate marginal distribution algorithm（UMDA） which is a class algorithm of estimation of distribution algorithms attracts mor...In dynamic environments,it is important to track changing optimal solutions over time.Univariate marginal distribution algorithm（UMDA） which is a class algorithm of estimation of distribution algorithms attracts more and more attention in recent years.In this paper a new multi-population and diffusion UMDA（MDUMDA） is proposed for dynamic multimodal problems.The multi-population approach is used to locate multiple local optima which are useful to find the global optimal solution quickly to dynamic multimodal problems.The diffusion model is used to increase the diversity in a guided fashion,which makes the neighbor individuals of previous optimal solutions move gradually from the previous optimal solutions and enlarge the search space.This approach uses both the information of current population and the part history information of the optimal solutions.Finally experimental studies on the moving peaks benchmark are carried out to evaluate the proposed algorithm and compare the performance of MDUMDA and multi-population quantum swarm optimization（MQSO） from the literature.The experimental results show that the MDUMDA is effective for the function with moving optimum and can adapt to the dynamic environments rapidly.展开更多
A quadratic bilevel programming problem is transformed into a single level complementarity slackness problem by applying Karush-Kuhn-Tucker（KKT） conditions.To cope with the complementarity constraints,a binary encod...A quadratic bilevel programming problem is transformed into a single level complementarity slackness problem by applying Karush-Kuhn-Tucker（KKT） conditions.To cope with the complementarity constraints,a binary encoding scheme is adopted for KKT multipliers,and then the complementarity slackness problem is simplified to successive quadratic programming problems,which can be solved by many algorithms available.Based on 0-1 binary encoding,an orthogonal genetic algorithm,in which the orthogonal experimental design with both two-level orthogonal array and factor analysis is used as crossover operator,is proposed.Numerical experiments on 10 benchmark examples show that the orthogonal genetic algorithm can find global optimal solutions of quadratic bilevel programming problems with high accuracy in a small number of iterations.展开更多
A self-adaptive large neighborhood search method for scheduling n jobs on m non-identical parallel machines with mul- tiple time windows is presented. The problems＇ another feature lies in oversubscription, namely no...A self-adaptive large neighborhood search method for scheduling n jobs on m non-identical parallel machines with mul- tiple time windows is presented. The problems＇ another feature lies in oversubscription, namely not all jobs can be scheduled within specified scheduling horizons due to the limited machine capacity. The objective is thus to maximize the overall profits of processed jobs while respecting machine constraints. A first-in- first-out heuristic is applied to find an initial solution, and then a large neighborhood search procedure is employed to relax and re- optimize cumbersome solutions. A machine learning mechanism is also introduced to converge on the most efficient neighborhoods for the problem. Extensive computational results are presented based on data from an application involving the daily observation scheduling of a fleet of earth observing satellites. The method rapidly solves most problem instances to optimal or near optimal and shows a robust performance in sensitive analysis.展开更多
Determination of collapse load-carrying capacity of elasto-plastic material is very important in designing structure. The problem is commonly solved by elasto-plastic finite element method （FEM）. In order to deal wi...Determination of collapse load-carrying capacity of elasto-plastic material is very important in designing structure. The problem is commonly solved by elasto-plastic finite element method （FEM）. In order to deal with material nonlinear problem involving strain softening problem effectively, a new numerical method-damped Newton method was proposed. The iterative schemes are discussed in detail for pure equilibrium models. In the equilibrium model, the plasticity criterion and the compatibility of the strains are verified, and the strain increment and plastic factor are treated as independent unknowns. To avoid the stiffness matrix being singularity or condition of matrix being ill, a damping factor a was introduced to adjust the value of plastic consistent parameter automatically during the iterations. According to the algorithm, the nonlinear finite element program was complied and its numerical example was calculated. The numerical results indicate that this method converges very fast for both small load steps and large load steps. Compared with those results obtained by analysis and experiment, the predicted ultimate bearing capacity from the proposed method is identical.展开更多
A novel algorithm named randomized binary gravita- tional search （RBGS） algorithm is proposed for the set covering problem （SCP）. It differs from previous SCP approaches because it does not work directly on the SC...A novel algorithm named randomized binary gravita- tional search （RBGS） algorithm is proposed for the set covering problem （SCP）. It differs from previous SCP approaches because it does not work directly on the SCP matrix. In the proposed algo- rithm, the solution of SCP is viewed as multi-dimension position of objects in the binary search space. All objects in the space attract each other by the gravity force, and this force causes a global movement of all objects towards the objects with heavier masses which correspond to good solutions. Computation results show that the proposed algorithm is very competitive. In addition, the proposed aigodthm is extended for SCP to solve the fault diagno- sis problem in graph-based systems.展开更多
The knapsack problem is a well-known combinatorial optimization problem which has been proved to be NP-hard. This paper proposes a new algorithm called quantum-inspired ant algorithm （QAA） to solve the knapsack prob...The knapsack problem is a well-known combinatorial optimization problem which has been proved to be NP-hard. This paper proposes a new algorithm called quantum-inspired ant algorithm （QAA） to solve the knapsack problem. QAA takes the advantage of the principles in quantum computing, such as qubit, quantum gate, and quantum superposition of states, to get more probabilistic-based status with small colonies. By updating the pheromone in the ant algorithm and rotating the quantum gate, the algorithm can finally reach the optimal solution. The detailed steps to use QAA are presented, and by solving series of test cases of classical knapsack problems, the effectiveness and generality of the new algorithm are validated.展开更多
Based on the modified plastic strain energy approach, an elasto-plastic constitutive modeling for sand was proposed. The hardening function between the modified plastic strain energy and a stress parameter was present...Based on the modified plastic strain energy approach, an elasto-plastic constitutive modeling for sand was proposed. The hardening function between the modified plastic strain energy and a stress parameter was presented, which was independent of stress history and stress paths. The proposed model was related to an isotropically work-hardening and softening, non-associated and elasto-plastic material description. It is shown that the constitutive modeling, the inherent and stress system-induced cross-anisotropic elasticity is also considered. The constitutive model is capable of simulating the effects on the deformation characteristics of stress history and stress path, pressure level and anisotropic strength.展开更多
In order to overcome the shortcoming of the classical Hungarian algorithm that it can only solve the problems where the total cost is the sum of that of each job, an improved Hungarian algorithm is proposed and used t...In order to overcome the shortcoming of the classical Hungarian algorithm that it can only solve the problems where the total cost is the sum of that of each job, an improved Hungarian algorithm is proposed and used to solve the assignment problem of serial-parallel systems. First of all, by replacing parallel jobs with virtual jobs, the proposed algorithm converts the serial-parallel system into a pure serial system, where the classical Hungarian algorithm can be used to generate a temporal assignment plan via optimization. Afterwards, the assignment plan is validated by checking whether the virtual jobs can be realized by real jobs through local searching. If the assignment plan is not valid, the converted system will be adapted by adjusting the parameters of virtual jobs, and then be optimized again. Through iterative searching, the valid optimal assignment plan can eventually be obtained.To evaluate the proposed algorithm, the valid optimal assignment plan is applied to labor allocation of a manufacturing system which is a typical serial-parallel system.展开更多
Application research of neural networks to geotechnical engineering has become a hotspot nowadays.General model may not reach the predicting precision in practical application due to different characteristics in diffe...Application research of neural networks to geotechnical engineering has become a hotspot nowadays.General model may not reach the predicting precision in practical application due to different characteristics in different fields.In allusion to this,an elasto-plastic constitutive model based on clustering radial basis function neural network(BC-RBFNN) was proposed for moderate sandy clay according to its properties.Firstly,knowledge base was established on triaxial compression testing data;then the model was trained,learned and emulated using knowledge base;finally,predicting results of the BC-RBFNN model were compared and analyzed with those of other intelligent model.The results show that the BC-RBFNN model can alter the training and learning velocity and improve the predicting precision,which provides possibility for engineering practice on demanding high precision.展开更多
文摘Large calculation error can be formed by directly employing the conventional Yee’s grid to curve surfaces.In order to alleviate such condition,unconditionally stable CrankNicolson Douglas-Gunn(CNDG)algorithm with is proposed for rotationally symmetric multi-scale problems in anisotropic magnetized plasma.Within the CNDG algorithm,an alternative scheme for the simulation of anisotropic plasma is proposed in body-of-revolution domains.Convolutional perfectly matched layer(CPML)formulation is proposed to efficiently solve the open region problems.Numerical example is carried out for the illustration of effectiveness including the efficiency,resources,and absorption.Through the results,it can be concluded that the proposed scheme shows considerable performance during the simulation.
文摘As commercial drone delivery becomes increasingly popular,the extension of the vehicle routing problem with drones(VRPD)is emerging as an optimization problem of inter-ests.This paper studies a variant of VRPD in multi-trip and multi-drop(VRP-mmD).The problem aims at making schedules for the trucks and drones such that the total travel time is minimized.This paper formulate the problem with a mixed integer program-ming model and propose a two-phase algorithm,i.e.,a parallel route construction heuristic(PRCH)for the first phase and an adaptive neighbor searching heuristic(ANSH)for the second phase.The PRCH generates an initial solution by con-currently assigning as many nodes as possible to the truck–drone pair to progressively reduce the waiting time at the rendezvous node in the first phase.Then the ANSH improves the initial solution by adaptively exploring the neighborhoods in the second phase.Numerical tests on some benchmark data are conducted to verify the performance of the algorithm.The results show that the proposed algorithm can found better solu-tions than some state-of-the-art methods for all instances.More-over,an extensive analysis highlights the stability of the pro-posed algorithm.
文摘A class of singularly perturbed initial boundary value problems for the reaction diffusion equations in a part of domain are considered. Using the operator theory the asymptotic behavior of solution for the problems is studied.
文摘By using an existence theorems of maximal elements for a family of set-valued mappings in G-convex spaces due to the author, some new nonempty intersection theorems for a family of set-valued mappings were established in noncompact product G-convex spaces. As applications, some equilibrium existence theorems for a system of generalized vector equilibrium problems were proved in noncompact product G-convex spaces. These theorems unify, improve and generalize some important known results in literature.
基金supported by the National Natural Science Foundation of China (60632050)National Basic Research Program of Jiangsu Province University (08KJB520003)
文摘An improved genetic algorithm（IGA） based on a novel selection strategy to handle nonlinear programming problems is proposed.Each individual in selection process is represented as a three-dimensional feature vector which is composed of objective function value,the degree of constraints violations and the number of constraints violations.It is easy to distinguish excellent individuals from general individuals by using an individuals＇ feature vector.Additionally,a local search（LS） process is incorporated into selection operation so as to find feasible solutions located in the neighboring areas of some infeasible solutions.The combination of IGA and LS should offer the advantage of both the quality of solutions and diversity of solutions.Experimental results over a set of benchmark problems demonstrate that IGA has better performance than other algorithms.
基金the National Natural Science Foundation of China (6027401360474002)Shanghai Development Found for Science and Technology (04DZ11008).
文摘A modified bottleneck-based （MB） heuristic for large-scale job-shop scheduling problems with a welldefined bottleneck is suggested, which is simpler but more tailored than the shifting bottleneck （SB） procedure. In this algorithm, the bottleneck is first scheduled optimally while the non-bottleneck machines are subordinated around the solutions of the bottleneck schedule by some effective dispatching rules. Computational results indicate that the MB heuristic can achieve a better tradeoff between solution quality and computational time compared to SB procedure for medium-size problems. Furthermore, it can obtain a good solution in a short time for large-scale jobshop scheduling problems.
基金supported by the National Natural Science Foundation of China(60573159)
文摘Ant colony optimization （ACO） is a new heuristic algo- rithm which has been proven a successful technique and applied to a number of combinatorial optimization problems. The traveling salesman problem （TSP） is among the most important combinato- rial problems. An ACO algorithm based on scout characteristic is proposed for solving the stagnation behavior and premature con- vergence problem of the basic ACO algorithm on TSP. The main idea is to partition artificial ants into two groups： scout ants and common ants. The common ants work according to the search manner of basic ant colony algorithm, but scout ants have some differences from common ants, they calculate each route＇s muta- tion probability of the current optimal solution using path evaluation model and search around the optimal solution according to the mutation probability. Simulation on TSP shows that the improved algorithm has high efficiency and robustness.
基金Projects(50275150,61173052) supported by the National Natural Science Foundation of ChinaProject(14FJ3112) supported by the Planned Science and Technology of Hunan Province,ChinaProject(14B033) supported by Scientific Research Fund Education Department of Hunan Province,China
文摘A novel chaotic search method is proposed,and a hybrid algorithm combining particle swarm optimization(PSO) with this new method,called CLSPSO,is put forward to solve 14 integer and mixed integer programming problems.The performances of CLSPSO are compared with those of other five hybrid algorithms combining PSO with chaotic search methods.Experimental results indicate that in terms of robustness and final convergence speed,CLSPSO is better than other five algorithms in solving many of these problems.Furthermore,CLSPSO exhibits good performance in solving two high-dimensional problems,and it finds better solutions than the known ones.A performance index(PI) is introduced to fairly compare the above six algorithms,and the obtained values of(PI) in three cases demonstrate that CLSPSO is superior to all the other five algorithms under the same conditions.
基金supported by the Fundamental Research Funds for the Central Universities(K50511700004)the Natural Science Basic Research Plan in Shaanxi Province of China(2013JM1022)
文摘An integer linear bilevel programming problem is firstly transformed into a binary linear bilevel programming problem, and then converted into a single-level binary implicit programming. An orthogonal genetic algorithm is developed for solving the binary linear implicit programming problem based on the orthogonal design. The orthogonal design with the factor analysis, an experimental design method is applied to the genetic algorithm to make the algorithm more robust, statistical y sound and quickly convergent. A crossover operator formed by the orthogonal array and the factor analysis is presented. First, this crossover operator can generate a smal but representative sample of points as offspring. After al of the better genes of these offspring are selected, a best combination among these offspring is then generated. The simulation results show the effectiveness of the proposed algorithm.
基金Project([2005]205)supported by the Science and Technology Planning Project of Water Resources Department of Guangdong Province,ChinaProject(2012-7)supported by Guangdong Bureau of Highway Administration,ChinaProject(2012210020203)supported by the Fundamental Research Funds for the Central Universities,China
文摘Employing an ideal elasto-plastic model,the typically used strength reduction method reduced the strength of all soil elements of a slope.Therefore,this method was called the global strength reduction method(GSRM).However,the deformation field obtained by GSRM could not reflect the real deformation of a slope when the slope became unstable.For most slopes,failure occurs once the strength of some regional soil is sufficiently weakened; thus,the local strength reduction method(LSRM)was proposed to analyze slope stability.In contrast with GSRM,LSRM only reduces the strength of local soil,while the strength of other soil remains unchanged.Therefore,deformation by LSRM is more reasonable than that by GSRM.In addition,the accuracy of the slope's deformation depends on the constitutive model to a large degree,and the variable-modulus elasto-plastic model was thus adopted.This constitutive model was an improvement of the Duncan–Chang model,which modified soil's deformation modulus according to stress level,and it thus better reflected the plastic feature of soil.Most importantly,the parameters of the variable-modulus elasto-plastic model could be determined through in-situ tests,and parameters determination by plate loading test and pressuremeter test were introduced.Therefore,it is easy to put this model into practice.Finally,LSRM and the variable-modulus elasto-plastic model were used to analyze Egongdai ancient landslide.Safety factor,deformation field,and optimal reinforcement measures for Egongdai ancient landslide were obtained based on the proposed method.
基金This project was supported by the National Natural Science Foundation of China.
文摘In this paper, we propose a modified evolutionary programming with dynamic domain for solving nonlinear IP/MIP problems with linear constraints, without involving penalty function or any transformation for the problem to a linear model or others. The numerical results show that the new algorithm gives a satisfactory performance in which it works of high speed, and accuracy in IP/MIP problems.
基金supported by the National Natural Science Foundation of China (6087309960775013)
文摘In dynamic environments,it is important to track changing optimal solutions over time.Univariate marginal distribution algorithm（UMDA） which is a class algorithm of estimation of distribution algorithms attracts more and more attention in recent years.In this paper a new multi-population and diffusion UMDA（MDUMDA） is proposed for dynamic multimodal problems.The multi-population approach is used to locate multiple local optima which are useful to find the global optimal solution quickly to dynamic multimodal problems.The diffusion model is used to increase the diversity in a guided fashion,which makes the neighbor individuals of previous optimal solutions move gradually from the previous optimal solutions and enlarge the search space.This approach uses both the information of current population and the part history information of the optimal solutions.Finally experimental studies on the moving peaks benchmark are carried out to evaluate the proposed algorithm and compare the performance of MDUMDA and multi-population quantum swarm optimization（MQSO） from the literature.The experimental results show that the MDUMDA is effective for the function with moving optimum and can adapt to the dynamic environments rapidly.
基金supported by the National Natural Science Foundation of China (60873099)
文摘A quadratic bilevel programming problem is transformed into a single level complementarity slackness problem by applying Karush-Kuhn-Tucker（KKT） conditions.To cope with the complementarity constraints,a binary encoding scheme is adopted for KKT multipliers,and then the complementarity slackness problem is simplified to successive quadratic programming problems,which can be solved by many algorithms available.Based on 0-1 binary encoding,an orthogonal genetic algorithm,in which the orthogonal experimental design with both two-level orthogonal array and factor analysis is used as crossover operator,is proposed.Numerical experiments on 10 benchmark examples show that the orthogonal genetic algorithm can find global optimal solutions of quadratic bilevel programming problems with high accuracy in a small number of iterations.
基金supported by the National Natural Science Foundation of China (7060103570801062)
文摘A self-adaptive large neighborhood search method for scheduling n jobs on m non-identical parallel machines with mul- tiple time windows is presented. The problems＇ another feature lies in oversubscription, namely not all jobs can be scheduled within specified scheduling horizons due to the limited machine capacity. The objective is thus to maximize the overall profits of processed jobs while respecting machine constraints. A first-in- first-out heuristic is applied to find an initial solution, and then a large neighborhood search procedure is employed to relax and re- optimize cumbersome solutions. A machine learning mechanism is also introduced to converge on the most efficient neighborhoods for the problem. Extensive computational results are presented based on data from an application involving the daily observation scheduling of a fleet of earth observing satellites. The method rapidly solves most problem instances to optimal or near optimal and shows a robust performance in sensitive analysis.
基金Project(2012CB026200)supported by the National Basic Research Program of ChinaProjects(50978055,50878048)supported by the National Natural Science Foundation of China
文摘Determination of collapse load-carrying capacity of elasto-plastic material is very important in designing structure. The problem is commonly solved by elasto-plastic finite element method （FEM）. In order to deal with material nonlinear problem involving strain softening problem effectively, a new numerical method-damped Newton method was proposed. The iterative schemes are discussed in detail for pure equilibrium models. In the equilibrium model, the plasticity criterion and the compatibility of the strains are verified, and the strain increment and plastic factor are treated as independent unknowns. To avoid the stiffness matrix being singularity or condition of matrix being ill, a damping factor a was introduced to adjust the value of plastic consistent parameter automatically during the iterations. According to the algorithm, the nonlinear finite element program was complied and its numerical example was calculated. The numerical results indicate that this method converges very fast for both small load steps and large load steps. Compared with those results obtained by analysis and experiment, the predicted ultimate bearing capacity from the proposed method is identical.
基金supported by the National Natural Science Foundation of China (4100605850909096)
文摘A novel algorithm named randomized binary gravita- tional search （RBGS） algorithm is proposed for the set covering problem （SCP）. It differs from previous SCP approaches because it does not work directly on the SCP matrix. In the proposed algo- rithm, the solution of SCP is viewed as multi-dimension position of objects in the binary search space. All objects in the space attract each other by the gravity force, and this force causes a global movement of all objects towards the objects with heavier masses which correspond to good solutions. Computation results show that the proposed algorithm is very competitive. In addition, the proposed aigodthm is extended for SCP to solve the fault diagno- sis problem in graph-based systems.
基金supported by the National Natural Science Foundation of China(70871081)the Shanghai Leading Academic Discipline Project(S30504).
文摘The knapsack problem is a well-known combinatorial optimization problem which has been proved to be NP-hard. This paper proposes a new algorithm called quantum-inspired ant algorithm （QAA） to solve the knapsack problem. QAA takes the advantage of the principles in quantum computing, such as qubit, quantum gate, and quantum superposition of states, to get more probabilistic-based status with small colonies. By updating the pheromone in the ant algorithm and rotating the quantum gate, the algorithm can finally reach the optimal solution. The detailed steps to use QAA are presented, and by solving series of test cases of classical knapsack problems, the effectiveness and generality of the new algorithm are validated.
文摘Based on the modified plastic strain energy approach, an elasto-plastic constitutive modeling for sand was proposed. The hardening function between the modified plastic strain energy and a stress parameter was presented, which was independent of stress history and stress paths. The proposed model was related to an isotropically work-hardening and softening, non-associated and elasto-plastic material description. It is shown that the constitutive modeling, the inherent and stress system-induced cross-anisotropic elasticity is also considered. The constitutive model is capable of simulating the effects on the deformation characteristics of stress history and stress path, pressure level and anisotropic strength.
文摘In order to overcome the shortcoming of the classical Hungarian algorithm that it can only solve the problems where the total cost is the sum of that of each job, an improved Hungarian algorithm is proposed and used to solve the assignment problem of serial-parallel systems. First of all, by replacing parallel jobs with virtual jobs, the proposed algorithm converts the serial-parallel system into a pure serial system, where the classical Hungarian algorithm can be used to generate a temporal assignment plan via optimization. Afterwards, the assignment plan is validated by checking whether the virtual jobs can be realized by real jobs through local searching. If the assignment plan is not valid, the converted system will be adapted by adjusting the parameters of virtual jobs, and then be optimized again. Through iterative searching, the valid optimal assignment plan can eventually be obtained.To evaluate the proposed algorithm, the valid optimal assignment plan is applied to labor allocation of a manufacturing system which is a typical serial-parallel system.
基金Project(07031B) supported by the Scientific Research Fund of Central South University of Forestry and TechnologyProject(06C843) supported by the Scientific Research Fund of Hunan Provincial Education Department
文摘Application research of neural networks to geotechnical engineering has become a hotspot nowadays.General model may not reach the predicting precision in practical application due to different characteristics in different fields.In allusion to this,an elasto-plastic constitutive model based on clustering radial basis function neural network(BC-RBFNN) was proposed for moderate sandy clay according to its properties.Firstly,knowledge base was established on triaxial compression testing data;then the model was trained,learned and emulated using knowledge base;finally,predicting results of the BC-RBFNN model were compared and analyzed with those of other intelligent model.The results show that the BC-RBFNN model can alter the training and learning velocity and improve the predicting precision,which provides possibility for engineering practice on demanding high precision.
