The Gravitational Search algorithm (GSA) is one of the recent additions to the new heuristic optimization algorithms based on law of gravity and mass interactions has been applied to solve the short term scheduling hy...
详细信息
ISBN:
(纸本)9781467310499;9781467310475
The Gravitational Search algorithm (GSA) is one of the recent additions to the new heuristic optimization algorithms based on law of gravity and mass interactions has been applied to solve the short term scheduling hydrothermal system. In the proposed algorithm, the searcher agents are collection of masses interact with each other based on the Newtonian gravity and the laws of motion. Hydrothermal scheduling involves the optimization of nonlinear objective function with set of operational and physical constraints. The cascading nature of hydro plants, water transport delay and scheduling time linkage, power balance constraints, variable hourly water discharge limits, reservoir storage limits, operation limits of thermal and hydro units, hydraulic continuity constraint and initial and final reservoir storage limits are fully taken into consideration. The validity and the performance of the proposed approach are demonstrated through a large hydrothermal test system comprising of 54 thermal and 44 hydro plants.
A clonalselection based adaptive control algorithm is developed by applying clonal selection algorithm to the adaptive control problem. For the dynamical uncertainty of both the plant and the environmental disturbanc...
详细信息
ISBN:
(纸本)9789881563811
A clonalselection based adaptive control algorithm is developed by applying clonal selection algorithm to the adaptive control problem. For the dynamical uncertainty of both the plant and the environmental disturbance, the adaptive machine of clonalselection dopes out the plant output by a plant model according to the plant inputs, and then evaluates the candidate controllers before selecting the fittest controller to the current plant operating conditions. Thus the actual controller is tuned on-line to adapt the plant and environment. In simulations, a third order nonlinear model was adopted as a cargo ship, a second order linear model as its model, and the PID control law was applied to them. The results show that the proposed controller can adapt well the dynamical plant and the environmental disturbance.
Although many meta-heuristic algorithms were developed for solving combinatorial optimization problems, very few of them were realized in an agent based environment. Especially the algorithms which model dynamics of A...
详细信息
Although many meta-heuristic algorithms were developed for solving combinatorial optimization problems, very few of them were realized in an agent based environment. Especially the algorithms which model dynamics of Artificial Immune Systems (AIS) are population based approaches with adaptability characteristics, therefore AIS can be better realized in an agent based modeling environment. For this purpose first time in the literature a clonal selection algorithm which is an AIS based algorithm is modeled in a multi-agent environment for solving the travelling salesmen problem which is a combinatorial optimization problem. In order to observe the behavior of the algorithm, simulation experiments are carried out on several test problems. Netlogo software is utilized for developing agent based models and simulation tests. Moreover, receptor change process and crossover mechanisms are integrated into the proposed model in order to improve the performance of the classical clonal selection algorithm. It is shown that there is a high potential to obtain good solution by making use of agent oriented approaches which more realistically model the natural phenomenon.
Facility layout problem deals with the arrangement of departments within a given particular area that is usually rectangular. Main objective in these problems is the minimization of the material handling costs between...
详细信息
Facility layout problem deals with the arrangement of departments within a given particular area that is usually rectangular. Main objective in these problems is the minimization of the material handling costs between the departments. As the number of departments increases the problem is considered as NP complete. Exact solutions can be obtained only for rather small size problems. Therefore, heuristics are developed to generate near optimal solutions. This study considers departments that have unequal areas and utilize a clonal selection algorithm (CSA) to solve the problem. Departments are assigned to bays that are oriented vertically or horizontally. Twelve different versions of a well known unequal area test problem were studied to evaluate the performance of the algorithm. Eleven results generated better objective function values than the results in the accessible literature and one result obtained the best known value. Further, layouts generated for each test data were interpreted to visually evaluate the results.
An improved genetic algorithm is proposed by introducing selection operation and crossover operation, which overcomes the limitations of the traditional genetic algorithm, avoids the local optimum, improves its conver...
详细信息
ISBN:
(纸本)9783037853184
An improved genetic algorithm is proposed by introducing selection operation and crossover operation, which overcomes the limitations of the traditional genetic algorithm, avoids the local optimum, improves its convergence rate and the diversity of population, and solves the problems of population prematurity and slow convergence rate in the basic genetic algorithm. Simulation results show that compared with other improved genetic algorithms, the proposed algorithm is better in finding global optimal and convergent rate.
Human reliability analysis (HRA) is necessary for system safety assessment as well as equipment reliability analysis. The cognitive reliability and error analysis method (CREAM) as a representative HRA method provides...
详细信息
Human reliability analysis (HRA) is necessary for system safety assessment as well as equipment reliability analysis. The cognitive reliability and error analysis method (CREAM) as a representative HRA method provides nine common performance conditions (CPCs) to represent the contextual conditions under which a given action is performed. With a scarcity of empirical data, a high uncertainty in analyzing results is produced by subjective judgment. To obtain more objective and effective HRA results, this paper presents an optimized quantification method to evaluate the human error probability (HEP) according to CREAM, and its linguistic variables. The starting point for the quantification is an introduced fuzzy version of CREAM. However, many fuzzy rules are redundant, and occupy extensive computing time. The clonal selection algorithm combined with the fuzzy model is proposed to optimize the rule set. The evaluation method using the fuzzy-clonal selection algorithm is aimed to support possible applications for prospective and retrospective studies in the domain of safety assessment of power systems. The simulations are carried out on four presumed contexts, and a practical power system. The conclusions illuminate the feasibility of the proposed quantitative method.
The clonal selection algorithm (CS), inspired by the basic features of adaptive immune response to antigenic stimulus, can exploit and explore the solution space parallelly and effectively. However, antibody initializ...
详细信息
The clonal selection algorithm (CS), inspired by the basic features of adaptive immune response to antigenic stimulus, can exploit and explore the solution space parallelly and effectively. However, antibody initialization and premature convergence are two problems of CS. To overcome these two problems, we propose a chaotic distance-based clonal selection algorithm (CDCS). In this novel algorithm, we introduce a chaotic initialization mechanism and a distance-based somatic hypermutation to improve the performance of CS. The proposed algorithm is also verified for numerous benchmark traveling salesman problems. Experimental results show that the improved algorithm proposed in this paper provides better performance when compared to other metaheuristics.
In this paper, a clonal selection algorithm (clonalG) based on clonalselection principle of immune system has been used for null steering in the antenna radiation pattern by controlling only the element positions of ...
详细信息
In this paper, a clonal selection algorithm (clonalG) based on clonalselection principle of immune system has been used for null steering in the antenna radiation pattern by controlling only the element positions of a linear array. Numerical examples of Chebyshev pattern with the single, multiple and broad nulls imposed at the directions of interference are given to show the accuracy and flexibility of the clonalG. The sensitivity of the achieved patterns due to small variations of the element positions is also investigated by truncating the element positions.
Chaos theory describes complex motion and the dynamics of nonlinear systems. As a complex nonlinear system, the immune system is chaotic. This paper introduces chaos into the clonal selection algorithm by a novel muta...
详细信息
ISBN:
(纸本)9781424414468
Chaos theory describes complex motion and the dynamics of nonlinear systems. As a complex nonlinear system, the immune system is chaotic. This paper introduces chaos into the clonal selection algorithm by a novel mutation method, self-adaptive chaotic mutation (SACM). In detail, based on the logistic chaotic sequence, SACM extracts antibody's affinity and distribution to adjust the mutation scale. Compared with the clonal selection algorithm using random mutation and Standard Genetic algorithm, the improved clonal selection algorithm can enhance the precision and stability, and overcome prematurity effectively with a high convergence speed.
In this paper, a reliable server assignment problem in networks is defined as determining a deployment of identical servers to maximize a measure of service availability, and solved using nature-inspired metaheuristic...
详细信息
In this paper, a reliable server assignment problem in networks is defined as determining a deployment of identical servers to maximize a measure of service availability, and solved using nature-inspired metaheuristic approaches, namely Ant Colony Optimization, Particle Swarm Optimization, and clonalselection Principle of Artificial Immune Systems. In networks, the communication between a client and a server might be interrupted because the server itself is offline or unreachable as a result of catastrophic network failures. Therefore, it is very important to deploy servers at critical network nodes so that the reliability of the system is maximized. A new reliability measure, called critical service rate, is defined to evaluate alternative server assignments with respect to the network's ability to provide services in the case of catastrophic component failures. The structure of the optimal server assignments is studied, and the performances of three nature inspired metaheuristics are investigated in a rigorous experimental study. Based on the computational studies, their advantages and disadvantages are discussed.
暂无评论