Network reconfiguration and capacitor switching are important measures to reduce power loss and improve security and economy in automation of distribution. A new method based on parallel genetic algorithm is proposed ...
详细信息
Network reconfiguration and capacitor switching are important measures to reduce power loss and improve security and economy in automation of distribution. A new method based on parallel genetic algorithm is proposed to search the whole problem space for better solution. Multiple populations evolve independently and communicate periodically, which simulates parallel computing process to save computing time. The results show that the method is robust and has better benefit than the alterative iteration method. In addition, the effect of overall optimization is better than optimization alone. Power loss can be reduced and the level of voltage can be greatly improved.
The vehicles are navigated and assigned to the optimized routes according to the information of real-time and predicted traffic flow so that the optimization of traffic flow system and travelers' satisfaction degr...
详细信息
ISBN:
(纸本)9780769535715
The vehicles are navigated and assigned to the optimized routes according to the information of real-time and predicted traffic flow so that the optimization of traffic flow system and travelers' satisfaction degree can be both achieved. The architecture of traffic flow predictive control is presented in this paper including such two parts as traffic flow navigation predictive control or dynamic traffic assignment based on predictive control and traffic signal predictive control. The real-time processing approach of parallel genetic algorithm based on web services in IntraGrid is presented in which distributed-control and central-control parallel genetic algorithms are devised. The simulation results show that the traffic flow navigation predictive control can predict possible congestion and prevent its happening, and thus realize the win-win system-optimal and user-optimal optimization. The IntraGrid computing of parallel genetic algorithm based on web services can meet the requirements of real-time processing for traffic flow predictive control.
An evolvable hardware structure and design method on an analogue evolvable trans-conductance filter was presented. Its own technical parameters could be changed with external environment's real-time changing. The ...
详细信息
ISBN:
(纸本)9781424421138
An evolvable hardware structure and design method on an analogue evolvable trans-conductance filter was presented. Its own technical parameters could be changed with external environment's real-time changing. The filter has the very good adaptive ability and certain fault-tolerant ability. An improved parallel genetic algorithm with migration strategy based on parallel crossover migration was applied. Selection strategy used an improved expected value model. Crossover strategy selected AND/OR crossover logic operators. Mutation strategy selected dual exclusive NOR/ exclusive OR logic operators. Probability of crossover and mutation used adaptive probability which could be adjusted dynamically by reflecting diversity degrees of a population. A multi-objective optimization fitness function for the filter's parameters had been built. Speed of resource allocation and quality of solutions is improved greatly by improved parallel genetic algorithm. The in-system programmability programmable analog circuits (ispPAC10) were used. The four-order Chebyshev trans-conductance filter is built by cascade method, which is able to meet performance request in its stop-band, passing band and transition band. Its practicality had been simulated and verified. Values of evolutionary parameters are in line with theoretical value exceedingly. Simulation results are satisfying.
In this study, we present three methods of sharing knowledge between cooperative compact geneticalgorithms. The methods exploit the effect of the worse solutions of the two-cooperative compact geneticalgorithms to t...
详细信息
ISBN:
(纸本)9781538663509
In this study, we present three methods of sharing knowledge between cooperative compact geneticalgorithms. The methods exploit the effect of the worse solutions of the two-cooperative compact geneticalgorithms to the search space which can prevent premature convergence. The benefit also encourages exploring other areas in solution space which enhance the opportunity to discover the better solutions. The proposed algorithm has a simple structure requires much less execution time than the non-sharing compact geneticalgorithm.
Evolvable Hardware (EHW) is inspired by natural evolution for the automatic design of hardware systems, based on Evolutionary algorithm (EA). This paper proposed a novel optimization process of evolution system by uti...
详细信息
ISBN:
(纸本)9781479920785
Evolvable Hardware (EHW) is inspired by natural evolution for the automatic design of hardware systems, based on Evolutionary algorithm (EA). This paper proposed a novel optimization process of evolution system by utilizing a two-level hierarchical parallelalgorithm and constructing EHW system into NoC infrastructure. The NoC is specially designed for high-speed reconfigurable hardware. Experimental results show that the usage of the hierarchical parallelalgorithm can achieve 188.7% and 675.7% improvement in convergence speed against the global parallel one or the serial one;moreover, by using the NoC architecture, the Single Evolution Cycle Run Time can be at least two orders of magnitude faster than the state-of-the-art EHW systems when evolving the same scale of circuits.
In this paper, Amdahl's Law for multicore processors is revisited and applied to the case of parallel genetic algorithm. This paper uses parallel master-slave model for function evaluation and independent identica...
详细信息
ISBN:
(纸本)9781467314602
In this paper, Amdahl's Law for multicore processors is revisited and applied to the case of parallel genetic algorithm. This paper uses parallel master-slave model for function evaluation and independent identical processing model for geneticalgorithm. Moreover, the super-linear speedup for parallel genetic algorithm has been found in one of our algorithm.
A parallel Strength Pareto Multi-objective Evolutionary algorithm (PSPMEA) is proposed. PSPMEA is a parallel computing model designed for solving Pareto-based multi-objective optimization problems by using an evolutio...
详细信息
ISBN:
(纸本)0780378407
A parallel Strength Pareto Multi-objective Evolutionary algorithm (PSPMEA) is proposed. PSPMEA is a parallel computing model designed for solving Pareto-based multi-objective optimization problems by using an evolutionary procedure. In this procedure, both global parallelization and island parallel evolutionary algorithm models are used. Each subpopulation evolves separately with different crossover and mutation probability, but they exchange individuals in the elitist archive. The benchmark problems numerical experiment results demonstrate that the proposed method can rapidly converge to the Pareto optimal front and spread widely along the front.
This paper investigates the hybridisation of two very different optimisation methods, namely the parallel genetic algorithm (PGA) and Sequential Quadratic Programming (SQP) algorithm. The different characteristics of ...
详细信息
ISBN:
(纸本)9781424407033
This paper investigates the hybridisation of two very different optimisation methods, namely the parallel genetic algorithm (PGA) and Sequential Quadratic Programming (SQP) algorithm. The different characteristics of genetic-based and traditional quadratic programming-based methods are discussed and to what extent the hybrid method can benefit the solving of optimisation problems with nonlinear complex objective and constraint functions. Experiments show the hybrid method effectively combines the robust and global search property of parallel genetic algorithms with the high convergence velocity of the Sequential Quadratic Programming algorithm, thereby reducing computation time, maintaining robustness and increasing solution quality.
The paper is devoted to the problem of machine-made synthesis of control for robotic teams. The goal of synthesis is to find a multidimensional control function that depends on the current states of all robots. The sy...
详细信息
The paper is devoted to the problem of machine-made synthesis of control for robotic teams. The goal of synthesis is to find a multidimensional control function that depends on the current states of all robots. The synthesised control function provides any time the optimal control values to allow each robot achieving the objectives with the best value of functional quality. The approach is based on multilayer network operator method that belongs to a symbolic regression class. Formations of multi-robot systems require individual robots to satisfy their kinematic equations while constantly maintaining inter-robot dynamic constraints. Verification of these dynamic constraints on each iteration of the evolutionary algorithm greatly increases the computational costs of the numerical synthesis. In the paper we propose to accelerate existing designs through taking advantage of newest programming tools of MPI framework for automatic parallelization. Experiments show that our approach reduces greatly computational time. (C) 2017 The Authors. Published by Elsevier B.V.
In this paper, we describe our implementation of geneticalgorithm for job-shop scheduling problem as a processing core for production plan optimization system. We have implemented several well-known improvements like...
详细信息
ISBN:
(纸本)9781450300735
In this paper, we describe our implementation of geneticalgorithm for job-shop scheduling problem as a processing core for production plan optimization system. We have implemented several well-known improvements like parallel structure and some operations based on Giffler and Thompson algorithm, and also created two our own hypotheses that were fully tested on several benchmarks and then one of them - the concept of "clever" crises has successfully implemented and showed considerable improvement of geneticalgorithm itself.
暂无评论