The material distribution routing problem in the manufacturing system is a complex combinatorial optimization problem and its main task is to deliver materials to the working stations with low cost and high efficiency...The material distribution routing problem in the manufacturing system is a complex combinatorial optimization problem and its main task is to deliver materials to the working stations with low cost and high efficiency. A multi-objective model was presented for the material distribution routing problem in mixed manufacturing systems, and it was solved by a hybrid multi-objective evolutionary algorithm (HMOEA). The characteristics of the HMOEA are as follows: 1) A route pool is employed to preserve the best routes for the population initiation; 2) A specialized best?worst route crossover (BWRC) mode is designed to perform the crossover operators for selecting the best route from Chromosomes 1 to exchange with the worst one in Chromosomes 2, so that the better genes are inherited to the offspring; 3) A route swap mode is used to perform the mutation for improving the convergence speed and preserving the better gene; 4) Local heuristics search methods are applied in this algorithm. Computational study of a practical case shows that the proposed algorithm can decrease the total travel distance by 51.66%, enhance the average vehicle load rate by 37.85%, cut down 15 routes and reduce a deliver vehicle. The convergence speed of HMOEA is faster than that of famous NSGA-II.展开更多
In the past few decades, applications of geostationary orbit (GEO) satellites have attracted increasing attention, and with the development of optical technologies, GEO optical satellites have become popular worldwide...In the past few decades, applications of geostationary orbit (GEO) satellites have attracted increasing attention, and with the development of optical technologies, GEO optical satellites have become popular worldwide. This paper proposes a general working pattern for a GEO optical satellite, as well as a target observation mission planning model. After analyzing the requirements of users and satellite control agencies, two objectives are simultaneously considered: maximization of total profit and minimization of satellite attitude maneuver angle. An NSGA-II based multi-objective optimization algorithm is proposed, which contains some heuristic principles in the initialization phase and mutation operator, and is embedded with a traveling salesman problem (TSP) optimization. The validity and performance of the proposed method are verified by extensive numerical simulations that include several types of point target distributions.展开更多
This work proposes a novel approach for multi-type optimal placement of flexible AC transmission system(FACTS) devices so as to optimize multi-objective voltage stability problem. The current study discusses a way for...This work proposes a novel approach for multi-type optimal placement of flexible AC transmission system(FACTS) devices so as to optimize multi-objective voltage stability problem. The current study discusses a way for locating and setting of thyristor controlled series capacitor(TCSC) and static var compensator(SVC) using the multi-objective optimization approach named strength pareto multi-objective evolutionary algorithm(SPMOEA). Maximization of the static voltage stability margin(SVSM) and minimizations of real power losses(RPL) and load voltage deviation(LVD) are taken as the goals or three objective functions, when optimally locating multi-type FACTS devices. The performance and effectiveness of the proposed approach has been validated by the simulation results of the IEEE 30-bus and IEEE 118-bus test systems. The proposed approach is compared with non-dominated sorting particle swarm optimization(NSPSO) algorithm. This comparison confirms the usefulness of the multi-objective proposed technique that makes it promising for determination of combinatorial problems of FACTS devices location and setting in large scale power systems.展开更多
In order to improve our military ’s level of intelligent accusation decision-making in future intelligent joint warfare, this paper studies operation loop recommendation methods for kill web based on the fundamental ...In order to improve our military ’s level of intelligent accusation decision-making in future intelligent joint warfare, this paper studies operation loop recommendation methods for kill web based on the fundamental combat form of the future, i.e.,“web-based kill,” and the operation loop theory. Firstly, we pioneer the operation loop recommendation problem with operation ring quality as the objective and closed-loop time as the constraint, and construct the corresponding planning model.Secondly, considering the case where there are multiple decision objectives for the combat ring recommendation problem,we propose for the first time a multi-objective optimization algorithm, the multi-objective ant colony evolutionary algorithm based on decomposition(MOACEA/D), which integrates the multi-objective evolutionary algorithm based on decomposition(MOEA/D) with the ant colony algorithm. The MOACEA/D can converge the optimal solutions of multiple single objectives nondominated solution set for the multi-objective problem. Finally,compared with other classical multi-objective optimization algorithms, the MOACEA/D is superior to other algorithms superior in terms of the hyper volume(HV), which verifies the effectiveness of the method and greatly improves the quality and efficiency of commanders’ decision-making.展开更多
In order to solve the flexible job shop scheduling problem with variable batches,we propose an improved multiobjective optimization algorithm,which combines the idea of inverse scheduling.First,a flexible job shop pro...In order to solve the flexible job shop scheduling problem with variable batches,we propose an improved multiobjective optimization algorithm,which combines the idea of inverse scheduling.First,a flexible job shop problem with the variable batches scheduling model is formulated.Second,we propose a batch optimization algorithm with inverse scheduling in which the batch size is adjusted by the dynamic feedback batch adjusting method.Moreover,in order to increase the diversity of the population,two methods are developed.One is the threshold to control the neighborhood updating,and the other is the dynamic clustering algorithm to update the population.Finally,a group of experiments are carried out.The results show that the improved multi-objective optimization algorithm can ensure the diversity of Pareto solutions effectively,and has effective performance in solving the flexible job shop scheduling problem with variable batches.展开更多
This study analyzes drift phenomena of deterministic crowding and probabilistic crowding by using equivalence class model and expectation proportion equations. It is proved that the replacement errors of deterministic...This study analyzes drift phenomena of deterministic crowding and probabilistic crowding by using equivalence class model and expectation proportion equations. It is proved that the replacement errors of deterministic crowding cause the population converging to a single individual, thus resulting in premature stagnation or losing optional optima. And probabilistic crowding can maintain equilibrium multiple subpopulations as the population size is adequate large. An improved niching method using clustering crowding is proposed. By analyzing topology of fitness landscape using hill valley function and extending the search space for similarity analysis, clustering crowding determines the locality of search space more accurately, thus greatly decreasing replacement errors of crowding. The integration of deterministic and probabilistic replacement increases the capacity of both parallel local hill climbing and maintaining multiple subpopulations. The experimental results optimizing various multimodal functions show that,the performances of clustering crowding, such as the number of effective peaks maintained, average peak ratio and global optimum ratio are uniformly superior to those of the evolutionary algorithms using fitness sharing, simple deterministic crowding and probabilistic crowding.展开更多
Based on immune clustering and evolutionary programming(EP), a hybrid algorithm to train the RBF network is proposed. An immune fuzzy C-means clustering algorithm (IFCM) is used to adaptively specify the amount and in...Based on immune clustering and evolutionary programming(EP), a hybrid algorithm to train the RBF network is proposed. An immune fuzzy C-means clustering algorithm (IFCM) is used to adaptively specify the amount and initial positions of the RBF centers according to input data set; then the RBF network is trained with EP that tends to global optima. The application of the hybrid algorithm in multiuser detection problem demonstrates that the RBF network trained with the algorithm has simple network structure with good generalization ability.展开更多
The research of cluster supply chains is a new direction and a hotspot of the industrial cluster theory. On the condition of the coordination game, the enterprises may be stuck on the non-efficient equilibrium status,...The research of cluster supply chains is a new direction and a hotspot of the industrial cluster theory. On the condition of the coordination game, the enterprises may be stuck on the non-efficient equilibrium status, which becomes an important problem that must be considered on cluster supply chains. A symmetrical coordination game model is constituted to describe the competition and cooperation relationship of the same-quality manufacturers on cluster supply chains. The methods of the non-cooperation game theory and the evolutionary game theory are respectively used to analyze the model, whose parameters＇ influences under each method are then compared. It can be concluded that the analysis of the evolutionary game theory is more realistic and practical. Finally, three approaches are considered to break away from being path-dependence locked-in non-efficient status during this coordination game evolutionary process, which provide the development of cluster supply chains with an effective forecasting and Pareto optimizing method.展开更多
With an aim to the fact that the K-means clustering algorithm usually ends in local optimization and is hard to harvest global optimization, a new web clustering method is presented based on the chaotic social evoluti...With an aim to the fact that the K-means clustering algorithm usually ends in local optimization and is hard to harvest global optimization, a new web clustering method is presented based on the chaotic social evolutionary programming （CSEP） algorithm. This method brings up the manner of that a cognitive agent inherits a paradigm in clustering to enable the cognitive agent to acquire a chaotic mutation operator in the betrayal. As proven in the experiment, this method can not only effectively increase web clustering efficiency, but it can also practically improve the precision of web clustering.展开更多
基金Project(50775089)supported by the National Natural Science Foundation of ChinaProject(2007AA04Z190,2009AA043301)supported by the National High Technology Research and Development Program of ChinaProject(2005CB724100)supported by the National Basic Research Program of China
文摘The material distribution routing problem in the manufacturing system is a complex combinatorial optimization problem and its main task is to deliver materials to the working stations with low cost and high efficiency. A multi-objective model was presented for the material distribution routing problem in mixed manufacturing systems, and it was solved by a hybrid multi-objective evolutionary algorithm (HMOEA). The characteristics of the HMOEA are as follows: 1) A route pool is employed to preserve the best routes for the population initiation; 2) A specialized best?worst route crossover (BWRC) mode is designed to perform the crossover operators for selecting the best route from Chromosomes 1 to exchange with the worst one in Chromosomes 2, so that the better genes are inherited to the offspring; 3) A route swap mode is used to perform the mutation for improving the convergence speed and preserving the better gene; 4) Local heuristics search methods are applied in this algorithm. Computational study of a practical case shows that the proposed algorithm can decrease the total travel distance by 51.66%, enhance the average vehicle load rate by 37.85%, cut down 15 routes and reduce a deliver vehicle. The convergence speed of HMOEA is faster than that of famous NSGA-II.
基金supported by the National Natural Science Foundation of China(7150118061473301)
文摘In the past few decades, applications of geostationary orbit (GEO) satellites have attracted increasing attention, and with the development of optical technologies, GEO optical satellites have become popular worldwide. This paper proposes a general working pattern for a GEO optical satellite, as well as a target observation mission planning model. After analyzing the requirements of users and satellite control agencies, two objectives are simultaneously considered: maximization of total profit and minimization of satellite attitude maneuver angle. An NSGA-II based multi-objective optimization algorithm is proposed, which contains some heuristic principles in the initialization phase and mutation operator, and is embedded with a traveling salesman problem (TSP) optimization. The validity and performance of the proposed method are verified by extensive numerical simulations that include several types of point target distributions.
文摘This work proposes a novel approach for multi-type optimal placement of flexible AC transmission system(FACTS) devices so as to optimize multi-objective voltage stability problem. The current study discusses a way for locating and setting of thyristor controlled series capacitor(TCSC) and static var compensator(SVC) using the multi-objective optimization approach named strength pareto multi-objective evolutionary algorithm(SPMOEA). Maximization of the static voltage stability margin(SVSM) and minimizations of real power losses(RPL) and load voltage deviation(LVD) are taken as the goals or three objective functions, when optimally locating multi-type FACTS devices. The performance and effectiveness of the proposed approach has been validated by the simulation results of the IEEE 30-bus and IEEE 118-bus test systems. The proposed approach is compared with non-dominated sorting particle swarm optimization(NSPSO) algorithm. This comparison confirms the usefulness of the multi-objective proposed technique that makes it promising for determination of combinatorial problems of FACTS devices location and setting in large scale power systems.
基金supported by the National Natural Science Foundation of China (72071206,71690233)the Science and Technology Innovation Program of Hunan Province (2020RC4046)。
文摘In order to improve our military ’s level of intelligent accusation decision-making in future intelligent joint warfare, this paper studies operation loop recommendation methods for kill web based on the fundamental combat form of the future, i.e.,“web-based kill,” and the operation loop theory. Firstly, we pioneer the operation loop recommendation problem with operation ring quality as the objective and closed-loop time as the constraint, and construct the corresponding planning model.Secondly, considering the case where there are multiple decision objectives for the combat ring recommendation problem,we propose for the first time a multi-objective optimization algorithm, the multi-objective ant colony evolutionary algorithm based on decomposition(MOACEA/D), which integrates the multi-objective evolutionary algorithm based on decomposition(MOEA/D) with the ant colony algorithm. The MOACEA/D can converge the optimal solutions of multiple single objectives nondominated solution set for the multi-objective problem. Finally,compared with other classical multi-objective optimization algorithms, the MOACEA/D is superior to other algorithms superior in terms of the hyper volume(HV), which verifies the effectiveness of the method and greatly improves the quality and efficiency of commanders’ decision-making.
基金supported by the National Key R&D Plan(2020YFB1712902)the National Natural Science Foundation of China(52075036).
文摘In order to solve the flexible job shop scheduling problem with variable batches,we propose an improved multiobjective optimization algorithm,which combines the idea of inverse scheduling.First,a flexible job shop problem with the variable batches scheduling model is formulated.Second,we propose a batch optimization algorithm with inverse scheduling in which the batch size is adjusted by the dynamic feedback batch adjusting method.Moreover,in order to increase the diversity of the population,two methods are developed.One is the threshold to control the neighborhood updating,and the other is the dynamic clustering algorithm to update the population.Finally,a group of experiments are carried out.The results show that the improved multi-objective optimization algorithm can ensure the diversity of Pareto solutions effectively,and has effective performance in solving the flexible job shop scheduling problem with variable batches.
文摘This study analyzes drift phenomena of deterministic crowding and probabilistic crowding by using equivalence class model and expectation proportion equations. It is proved that the replacement errors of deterministic crowding cause the population converging to a single individual, thus resulting in premature stagnation or losing optional optima. And probabilistic crowding can maintain equilibrium multiple subpopulations as the population size is adequate large. An improved niching method using clustering crowding is proposed. By analyzing topology of fitness landscape using hill valley function and extending the search space for similarity analysis, clustering crowding determines the locality of search space more accurately, thus greatly decreasing replacement errors of crowding. The integration of deterministic and probabilistic replacement increases the capacity of both parallel local hill climbing and maintaining multiple subpopulations. The experimental results optimizing various multimodal functions show that,the performances of clustering crowding, such as the number of effective peaks maintained, average peak ratio and global optimum ratio are uniformly superior to those of the evolutionary algorithms using fitness sharing, simple deterministic crowding and probabilistic crowding.
文摘Based on immune clustering and evolutionary programming(EP), a hybrid algorithm to train the RBF network is proposed. An immune fuzzy C-means clustering algorithm (IFCM) is used to adaptively specify the amount and initial positions of the RBF centers according to input data set; then the RBF network is trained with EP that tends to global optima. The application of the hybrid algorithm in multiuser detection problem demonstrates that the RBF network trained with the algorithm has simple network structure with good generalization ability.
基金the National Natural Science Foundation of China (60374023)the Natural ScienceFoundation of Guangdong Province (011629).
文摘The research of cluster supply chains is a new direction and a hotspot of the industrial cluster theory. On the condition of the coordination game, the enterprises may be stuck on the non-efficient equilibrium status, which becomes an important problem that must be considered on cluster supply chains. A symmetrical coordination game model is constituted to describe the competition and cooperation relationship of the same-quality manufacturers on cluster supply chains. The methods of the non-cooperation game theory and the evolutionary game theory are respectively used to analyze the model, whose parameters＇ influences under each method are then compared. It can be concluded that the analysis of the evolutionary game theory is more realistic and practical. Finally, three approaches are considered to break away from being path-dependence locked-in non-efficient status during this coordination game evolutionary process, which provide the development of cluster supply chains with an effective forecasting and Pareto optimizing method.
文摘With an aim to the fact that the K-means clustering algorithm usually ends in local optimization and is hard to harvest global optimization, a new web clustering method is presented based on the chaotic social evolutionary programming （CSEP） algorithm. This method brings up the manner of that a cognitive agent inherits a paradigm in clustering to enable the cognitive agent to acquire a chaotic mutation operator in the betrayal. As proven in the experiment, this method can not only effectively increase web clustering efficiency, but it can also practically improve the precision of web clustering.
