WorldWideScience

Sample records for hybrid intelligent algorithm

  1. A Hybrid Intelligent Algorithm for Optimal Birandom Portfolio Selection Problems

    Directory of Open Access Journals (Sweden)

    Qi Li

    2014-01-01

    Full Text Available Birandom portfolio selection problems have been well developed and widely applied in recent years. To solve these problems better, this paper designs a new hybrid intelligent algorithm which combines the improved LGMS-FOA algorithm with birandom simulation. Since all the existing algorithms solving these problems are based on genetic algorithm and birandom simulation, some comparisons between the new hybrid intelligent algorithm and the existing algorithms are given in terms of numerical experiments, which demonstrate that the new hybrid intelligent algorithm is more effective and precise when the numbers of the objective function computations are the same.

  2. MAKHA—A New Hybrid Swarm Intelligence Global Optimization Algorithm

    Directory of Open Access Journals (Sweden)

    Ahmed M.E. Khalil

    2015-06-01

    Full Text Available The search for efficient and reliable bio-inspired optimization methods continues to be an active topic of research due to the wide application of the developed methods. In this study, we developed a reliable and efficient optimization method via the hybridization of two bio-inspired swarm intelligence optimization algorithms, namely, the Monkey Algorithm (MA and the Krill Herd Algorithm (KHA. The hybridization made use of the efficient steps in each of the two original algorithms and provided a better balance between the exploration/diversification steps and the exploitation/intensification steps. The new hybrid algorithm, MAKHA, was rigorously tested with 27 benchmark problems and its results were compared with the results of the two original algorithms. MAKHA proved to be considerably more reliable and more efficient in tested problems.

  3. A NEW HYBRID ALGORITHM FOR BUSINESS INTELLIGENCE RECOMMENDER SYSTEM

    Directory of Open Access Journals (Sweden)

    P.Prabhu

    2014-03-01

    Full Text Available Business Intelligence is a set of methods, process and technologies that transform raw data into meaningful and useful information. Recommender system is one of business intelligence system that is used to obtain knowledge to the active user for better decision making. Recommender systems apply data mining techniques to the problem of making personalized recommendations for information. Due to the growth in the number of information and the users in recent years offers challenges in recommender systems. Collaborative, content, demographic and knowledge-based are four different types of recommendations systems. In this paper, a new hybrid algorithm is proposed for recommender system which combines knowledge based, profile of the users and most frequent item mining technique to obtain intelligence.

  4. Development of hybrid artificial intelligent based handover decision algorithm

    Directory of Open Access Journals (Sweden)

    A.M. Aibinu

    2017-04-01

    Full Text Available The possibility of seamless handover remains a mirage despite the plethora of existing handover algorithms. The underlying factor responsible for this has been traced to the Handover decision module in the Handover process. Hence, in this paper, the development of novel hybrid artificial intelligent handover decision algorithm has been developed. The developed model is made up of hybrid of Artificial Neural Network (ANN based prediction model and Fuzzy Logic. On accessing the network, the Received Signal Strength (RSS was acquired over a period of time to form a time series data. The data was then fed to the newly proposed k-step ahead ANN-based RSS prediction system for estimation of prediction model coefficients. The synaptic weights and adaptive coefficients of the trained ANN was then used to compute the k-step ahead ANN based RSS prediction model coefficients. The predicted RSS value was later codified as Fuzzy sets and in conjunction with other measured network parameters were fed into the Fuzzy logic controller in order to finalize handover decision process. The performance of the newly developed k-step ahead ANN based RSS prediction algorithm was evaluated using simulated and real data acquired from available mobile communication networks. Results obtained in both cases shows that the proposed algorithm is capable of predicting ahead the RSS value to about ±0.0002 dB. Also, the cascaded effect of the complete handover decision module was also evaluated. Results obtained show that the newly proposed hybrid approach was able to reduce ping-pong effect associated with other handover techniques.

  5. A SAA-based Novel Hybrid Intelligent Evolutionary Algorithm for Job Shop Scheduling Problem

    Institute of Scientific and Technical Information of China (English)

    2002-01-01

    Through systematic analysis and comparison of the common features of SAA, ES and traditional LS (local search) algorithm, a new hybrid strategy of mixing SA, ES with LS, namely HIEA (Hybrid Intelligent Evolutionary Algorithm), is proposed in this paper. Viewed as a whole, the hybrid strategy is also an intelligent heuristic searching procedure. But it has some characteristics such as generality, robustness, etc., because it synthesizes advantages of SA, ES and LS, while the shortages of the three methods are overcome. This paper applies Markov chain theory to describe the hybrid strategy mathematically, and proves that the algorithm possesses the global asymptotical convergence and analyzes the performance of HIEA.

  6. A hybrid intelligent algorithm for portfolio selection problem with fuzzy returns

    Science.gov (United States)

    Li, Xiang; Zhang, Yang; Wong, Hau-San; Qin, Zhongfeng

    2009-11-01

    Portfolio selection theory with fuzzy returns has been well developed and widely applied. Within the framework of credibility theory, several fuzzy portfolio selection models have been proposed such as mean-variance model, entropy optimization model, chance constrained programming model and so on. In order to solve these nonlinear optimization models, a hybrid intelligent algorithm is designed by integrating simulated annealing algorithm, neural network and fuzzy simulation techniques, where the neural network is used to approximate the expected value and variance for fuzzy returns and the fuzzy simulation is used to generate the training data for neural network. Since these models are used to be solved by genetic algorithm, some comparisons between the hybrid intelligent algorithm and genetic algorithm are given in terms of numerical examples, which imply that the hybrid intelligent algorithm is robust and more effective. In particular, it reduces the running time significantly for large size problems.

  7. Intelligent Hybrid Cluster Based Classification Algorithm for Social Network Analysis

    Directory of Open Access Journals (Sweden)

    S. Muthurajkumar

    2014-05-01

    Full Text Available In this paper, we propose an hybrid clustering based classification algorithm based on mean approach to effectively classify to mine the ordered sequences (paths from weblog data in order to perform social network analysis. In the system proposed in this work for social pattern analysis, the sequences of human activities are typically analyzed by switching behaviors, which are likely to produce overlapping clusters. In this proposed system, a robust Modified Boosting algorithm is proposed to hybrid clustering based classification for clustering the data. This work is useful to provide connection between the aggregated features from the network data and traditional indices used in social network analysis. Experimental results show that the proposed algorithm improves the decision results from data clustering when combined with the proposed classification algorithm and hence it is proved that of provides better classification accuracy when tested with Weblog dataset. In addition, this algorithm improves the predictive performance especially for multiclass datasets which can increases the accuracy.

  8. Intelligent Scheduling of Public Traffic Vehicles Based on a Hybrid Genetic Algorithm

    Institute of Scientific and Technical Information of China (English)

    ZHANG Feizhou; CAO Xuejun; YANG Dongkai

    2008-01-01

    A genetic algorithm (GA) and a hybrid genetic algorithm (HGA) were used for optimal scheduling of public vehicles based on their actual operational environments.The performance for three kinds of vehicular levels were compared using one-point and two-point crossover operations.The vehicle scheduling times are improved by the intelligent characteristics of the GA.The HGA,which integrates the genetic algorithm with a tabu search,further improves the convergence performance and the optimization by avoiding the premature convergence of the GA.The results show that intelligent scheduling of public vehicles based on the HGA overcomes the shortcomings of traditional scheduling methods.The vehicle operation management efficiency is improved by this essential technology for intelligent scheduling of public vehicles.

  9. A Dynamic Multistage Hybrid Swarm Intelligence Optimization Algorithm for Function Optimization

    Directory of Open Access Journals (Sweden)

    Daqing Wu

    2012-01-01

    Full Text Available A novel dynamic multistage hybrid swarm intelligence optimization algorithm is introduced, which is abbreviated as DM-PSO-ABC. The DM-PSO-ABC combined the exploration capabilities of the dynamic multiswarm particle swarm optimizer (PSO and the stochastic exploitation of the cooperative artificial bee colony algorithm (CABC for solving the function optimization. In the proposed hybrid algorithm, the whole process is divided into three stages. In the first stage, a dynamic multiswarm PSO is constructed to maintain the population diversity. In the second stage, the parallel, positive feedback of CABC was implemented in each small swarm. In the third stage, we make use of the particle swarm optimization global model, which has a faster convergence speed to enhance the global convergence in solving the whole problem. To verify the effectiveness and efficiency of the proposed hybrid algorithm, various scale benchmark problems are tested to demonstrate the potential of the proposed multistage hybrid swarm intelligence optimization algorithm. The results show that DM-PSO-ABC is better in the search precision, and convergence property and has strong ability to escape from the local suboptima when compared with several other peer algorithms.

  10. Hybrid intelligent engineering systems

    CERN Document Server

    Jain, L C; Adelaide, Australia University of

    1997-01-01

    This book on hybrid intelligent engineering systems is unique, in the sense that it presents the integration of expert systems, neural networks, fuzzy systems, genetic algorithms, and chaos engineering. It shows that these new techniques enhance the capabilities of one another. A number of hybrid systems for solving engineering problems are presented.

  11. Parameter estimation of Lorenz chaotic system using a hybrid swarm intelligence algorithm

    Science.gov (United States)

    Lazzús, Juan A.; Rivera, Marco; López-Caraballo, Carlos H.

    2016-03-01

    A novel hybrid swarm intelligence algorithm for chaotic system parameter estimation is present. For this purpose, the parameters estimation on Lorenz systems is formulated as a multidimensional problem, and a hybrid approach based on particle swarm optimization with ant colony optimization (PSO-ACO) is implemented to solve this problem. Firstly, the performance of the proposed PSO-ACO algorithm is tested on a set of three representative benchmark functions, and the impact of the parameter settings on PSO-ACO efficiency is studied. Secondly, the parameter estimation is converted into an optimization problem on a three-dimensional Lorenz system. Numerical simulations on Lorenz model and comparisons with results obtained by other algorithms showed that PSO-ACO is a very powerful tool for parameter estimation with high accuracy and low deviations.

  12. Parameter estimation of Lorenz chaotic system using a hybrid swarm intelligence algorithm

    Energy Technology Data Exchange (ETDEWEB)

    Lazzús, Juan A., E-mail: jlazzus@dfuls.cl; Rivera, Marco; López-Caraballo, Carlos H.

    2016-03-11

    A novel hybrid swarm intelligence algorithm for chaotic system parameter estimation is present. For this purpose, the parameters estimation on Lorenz systems is formulated as a multidimensional problem, and a hybrid approach based on particle swarm optimization with ant colony optimization (PSO–ACO) is implemented to solve this problem. Firstly, the performance of the proposed PSO–ACO algorithm is tested on a set of three representative benchmark functions, and the impact of the parameter settings on PSO–ACO efficiency is studied. Secondly, the parameter estimation is converted into an optimization problem on a three-dimensional Lorenz system. Numerical simulations on Lorenz model and comparisons with results obtained by other algorithms showed that PSO–ACO is a very powerful tool for parameter estimation with high accuracy and low deviations. - Highlights: • PSO–ACO combined particle swarm optimization with ant colony optimization. • This study is the first research of PSO–ACO to estimate parameters of chaotic systems. • PSO–ACO algorithm can identify the parameters of the three-dimensional Lorenz system with low deviations. • PSO–ACO is a very powerful tool for the parameter estimation on other chaotic system.

  13. Quality of Service Routing in Manet Using a Hybrid Intelligent Algorithm Inspired by Cuckoo Search

    Directory of Open Access Journals (Sweden)

    S. Rajalakshmi

    2015-01-01

    Full Text Available A hybrid computational intelligent algorithm is proposed by integrating the salient features of two different heuristic techniques to solve a multiconstrained Quality of Service Routing (QoSR problem in Mobile Ad Hoc Networks (MANETs is presented. The QoSR is always a tricky problem to determine an optimum route that satisfies variety of necessary constraints in a MANET. The problem is also declared as NP-hard due to the nature of constant topology variation of the MANETs. Thus a solution technique that embarks upon the challenges of the QoSR problem is needed to be underpinned. This paper proposes a hybrid algorithm by modifying the Cuckoo Search Algorithm (CSA with the new position updating mechanism. This updating mechanism is derived from the differential evolution (DE algorithm, where the candidates learn from diversified search regions. Thus the CSA will act as the main search procedure guided by the updating mechanism derived from DE, called tuned CSA (TCSA. Numerical simulations on MANETs are performed to demonstrate the effectiveness of the proposed TCSA method by determining an optimum route that satisfies various Quality of Service (QoS constraints. The results are compared with some of the existing techniques in the literature; therefore the superiority of the proposed method is established.

  14. Quality of Service Routing in Manet Using a Hybrid Intelligent Algorithm Inspired by Cuckoo Search.

    Science.gov (United States)

    Rajalakshmi, S; Maguteeswaran, R

    2015-01-01

    A hybrid computational intelligent algorithm is proposed by integrating the salient features of two different heuristic techniques to solve a multiconstrained Quality of Service Routing (QoSR) problem in Mobile Ad Hoc Networks (MANETs) is presented. The QoSR is always a tricky problem to determine an optimum route that satisfies variety of necessary constraints in a MANET. The problem is also declared as NP-hard due to the nature of constant topology variation of the MANETs. Thus a solution technique that embarks upon the challenges of the QoSR problem is needed to be underpinned. This paper proposes a hybrid algorithm by modifying the Cuckoo Search Algorithm (CSA) with the new position updating mechanism. This updating mechanism is derived from the differential evolution (DE) algorithm, where the candidates learn from diversified search regions. Thus the CSA will act as the main search procedure guided by the updating mechanism derived from DE, called tuned CSA (TCSA). Numerical simulations on MANETs are performed to demonstrate the effectiveness of the proposed TCSA method by determining an optimum route that satisfies various Quality of Service (QoS) constraints. The results are compared with some of the existing techniques in the literature; therefore the superiority of the proposed method is established.

  15. Introducing a Novel Hybrid Artificial Intelligence Algorithm to Optimize Network of Industrial Applications in Modern Manufacturing

    Directory of Open Access Journals (Sweden)

    Aydin Azizi

    2017-01-01

    Full Text Available Recent advances in modern manufacturing industries have created a great need to track and identify objects and parts by obtaining real-time information. One of the main technologies which has been utilized for this need is the Radio Frequency Identification (RFID system. As a result of adopting this technology to the manufacturing industry environment, RFID Network Planning (RNP has become a challenge. Mainly RNP deals with calculating the number and position of antennas which should be deployed in the RFID network to achieve full coverage of the tags that need to be read. The ultimate goal of this paper is to present and evaluate a way of modelling and optimizing nonlinear RNP problems utilizing artificial intelligence (AI techniques. This effort has led the author to propose a novel AI algorithm, which has been named “hybrid AI optimization technique,” to perform optimization of RNP as a hard learning problem. The proposed algorithm is composed of two different optimization algorithms: Redundant Antenna Elimination (RAE and Ring Probabilistic Logic Neural Networks (RPLNN. The proposed hybrid paradigm has been explored using a flexible manufacturing system (FMS, and results have been compared with Genetic Algorithm (GA that demonstrates the feasibility of the proposed architecture successfully.

  16. Hybrid Swarm Intelligence Energy Efficient Clustered Routing Algorithm for Wireless Sensor Networks

    Directory of Open Access Journals (Sweden)

    Rajeev Kumar

    2016-01-01

    Full Text Available Currently, wireless sensor networks (WSNs are used in many applications, namely, environment monitoring, disaster management, industrial automation, and medical electronics. Sensor nodes carry many limitations like low battery life, small memory space, and limited computing capability. To create a wireless sensor network more energy efficient, swarm intelligence technique has been applied to resolve many optimization issues in WSNs. In many existing clustering techniques an artificial bee colony (ABC algorithm is utilized to collect information from the field periodically. Nevertheless, in the event based applications, an ant colony optimization (ACO is a good solution to enhance the network lifespan. In this paper, we combine both algorithms (i.e., ABC and ACO and propose a new hybrid ABCACO algorithm to solve a Nondeterministic Polynomial (NP hard and finite problem of WSNs. ABCACO algorithm is divided into three main parts: (i selection of optimal number of subregions and further subregion parts, (ii cluster head selection using ABC algorithm, and (iii efficient data transmission using ACO algorithm. We use a hierarchical clustering technique for data transmission; the data is transmitted from member nodes to the subcluster heads and then from subcluster heads to the elected cluster heads based on some threshold value. Cluster heads use an ACO algorithm to discover the best route for data transmission to the base station (BS. The proposed approach is very useful in designing the framework for forest fire detection and monitoring. The simulation results show that the ABCACO algorithm enhances the stability period by 60% and also improves the goodput by 31% against LEACH and WSNCABC, respectively.

  17. Performance Evaluation of OLSR Using Swarm Intelligence and Hybrid Particle Swarm Optimization Using Gravitational Search Algorithm

    Directory of Open Access Journals (Sweden)

    S. Meenakshi Sundaram

    2014-04-01

    Full Text Available The aim of this research is to evaluate the performance of OLSR using swarm intelligence and HPSO with Gravitational search algorithm to lower the jitter time, data drop and end to end delay and improve the network throughput. Simulation was carried out for multimedia traffic and video streamed network traffic using OPNET Simulator. Routing is exchanging of information from one host to another in a network. Routing forwards packets to destination using an efficient path. Path efficiency is measured through metrics like hop number, traffic and security. Each host node acts as a specialized router in Ad-hoc networks. A table driven proactive routing protocol Optimized Link State Protocol (OLSR has available topology information and routes. OLSR’s efficiency depends on Multipoint relay selection. Various studies were conducted to decrease control traffic overheads through modification of existing OLSR routing protocol and traffic shaping based on packet priority. This study proposes a modification of OLSR using swarm intelligence, Hybrid Particle Swarm Optimization (HPSO using Gravitational Search Algorithm (GSA and evaluation of performance of jitter, end to end delay, data drop and throughput. Simulation was carried out to investigate the proposed method for the network’s multimedia traffic.

  18. Multi-objective decoupling algorithm for active distance control of intelligent hybrid electric vehicle

    Science.gov (United States)

    Luo, Yugong; Chen, Tao; Li, Keqiang

    2015-12-01

    The paper presents a novel active distance control strategy for intelligent hybrid electric vehicles (IHEV) with the purpose of guaranteeing an optimal performance in view of the driving functions, optimum safety, fuel economy and ride comfort. Considering the complexity of driving situations, the objects of safety and ride comfort are decoupled from that of fuel economy, and a hierarchical control architecture is adopted to improve the real-time performance and the adaptability. The hierarchical control structure consists of four layers: active distance control object determination, comprehensive driving and braking torque calculation, comprehensive torque distribution and torque coordination. The safety distance control and the emergency stop algorithms are designed to achieve the safety and ride comfort goals. The optimal rule-based energy management algorithm of the hybrid electric system is developed to improve the fuel economy. The torque coordination control strategy is proposed to regulate engine torque, motor torque and hydraulic braking torque to improve the ride comfort. This strategy is verified by simulation and experiment using a forward simulation platform and a prototype vehicle. The results show that the novel control strategy can achieve the integrated and coordinated control of its multiple subsystems, which guarantees top performance of the driving functions and optimum safety, fuel economy and ride comfort.

  19. Optimization of the core configuration design using a hybrid artificial intelligence algorithm for research reactors

    Energy Technology Data Exchange (ETDEWEB)

    Hedayat, Afshin, E-mail: ahedayat@aut.ac.i [Department of Nuclear Engineering and Physics, Amirkabir University of Technology (Tehran Polytechnic), 424 Hafez Avenue, P.O. Box 15875-4413, Tehran (Iran, Islamic Republic of); Reactor Research and Development School, Nuclear Science and Technology Research Institute (NSTRI), End of North Karegar Street, P.O. Box 14395-836, Tehran (Iran, Islamic Republic of); Davilu, Hadi [Department of Nuclear Engineering and Physics, Amirkabir University of Technology (Tehran Polytechnic), 424 Hafez Avenue, P.O. Box 15875-4413, Tehran (Iran, Islamic Republic of); Barfrosh, Ahmad Abdollahzadeh [Department of Computer Engineering, Amirkabir University of Technology (Tehran Polytechnic), 424 Hafez Avenue, P.O. Box 15875-4413, Tehran (Iran, Islamic Republic of); Sepanloo, Kamran [Reactor Research and Development School, Nuclear Science and Technology Research Institute (NSTRI), End of North Karegar Street, P.O. Box 14395-836, Tehran (Iran, Islamic Republic of)

    2009-12-15

    To successfully carry out material irradiation experiments and radioisotope productions, a high thermal neutron flux at irradiation box over a desired life time of a core configuration is needed. On the other hand, reactor safety and operational constraints must be preserved during core configuration selection. Two main objectives and two safety and operational constraints are suggested to optimize reactor core configuration design. Suggested parameters and conditions are considered as two separate fitness functions composed of two main objectives and two penalty functions. This is a constrained and combinatorial type of a multi-objective optimization problem. In this paper, a fast and effective hybrid artificial intelligence algorithm is introduced and developed to reach a Pareto optimal set. The hybrid algorithm is composed of a fast and elitist multi-objective genetic algorithm (GA) and a fast fitness function evaluating system based on the cascade feed forward artificial neural networks (ANNs). A specific GA representation of core configuration and also special GA operators are introduced and used to overcome the combinatorial constraints of this optimization problem. A software package (Core Pattern Calculator 1) is developed to prepare and reform required data for ANNs training and also to revise the optimization results. Some practical test parameters and conditions are suggested to adjust main parameters of the hybrid algorithm. Results show that introduced ANNs can be trained and estimate selected core parameters of a research reactor very quickly. It improves effectively optimization process. Final optimization results show that a uniform and dense diversity of Pareto fronts are gained over a wide range of fitness function values. To take a more careful selection of Pareto optimal solutions, a revision system is introduced and used. The revision of gained Pareto optimal set is performed by using developed software package. Also some secondary operational

  20. Artificial Neural Network and Genetic Algorithm Hybrid Intelligence for Predicting Thai Stock Price Index Trend

    Directory of Open Access Journals (Sweden)

    Montri Inthachot

    2016-01-01

    Full Text Available This study investigated the use of Artificial Neural Network (ANN and Genetic Algorithm (GA for prediction of Thailand’s SET50 index trend. ANN is a widely accepted machine learning method that uses past data to predict future trend, while GA is an algorithm that can find better subsets of input variables for importing into ANN, hence enabling more accurate prediction by its efficient feature selection. The imported data were chosen technical indicators highly regarded by stock analysts, each represented by 4 input variables that were based on past time spans of 4 different lengths: 3-, 5-, 10-, and 15-day spans before the day of prediction. This import undertaking generated a big set of diverse input variables with an exponentially higher number of possible subsets that GA culled down to a manageable number of more effective ones. SET50 index data of the past 6 years, from 2009 to 2014, were used to evaluate this hybrid intelligence prediction accuracy, and the hybrid’s prediction results were found to be more accurate than those made by a method using only one input variable for one fixed length of past time span.

  1. HYBRID OPTIMIZING GRIFFON-VULTURE ALGORITHM BASED ON SWARM INTELLIGENCE MECHANISMS

    Directory of Open Access Journals (Sweden)

    Chastikova V. A.

    2014-06-01

    Full Text Available Griffon-vultures with input parameters minimal value for compound functions optimization that change during the time searching hybrid algorithm offered in this article. Researches of its efficiency and comparing analysis with some other systems have been performed

  2. Recent Advances on Hybrid Intelligent Systems

    CERN Document Server

    Melin, Patricia; Kacprzyk, Janusz

    2013-01-01

    This book presents recent advances on hybrid intelligent systems using soft computing techniques for intelligent control and robotics, pattern recognition, time series prediction and optimization of complex problems. Soft Computing (SC) consists of several intelligent computing paradigms, including fuzzy logic, neural networks, and bio-inspired optimization algorithms, which can be used to produce powerful hybrid intelligent systems. The book is organized in five main parts, which contain groups of papers around a similar subject. The first part consists of papers with the main theme of hybrid intelligent systems for control and robotics, which are basically state of the art papers that propose new models and concepts, which can be the basis for achieving intelligent control and mobile robotics. The second part contains papers with the main theme of hybrid intelligent systems for pattern recognition and time series prediction, which are basically papers using nature-inspired techniques, like evolutionary algo...

  3. Optimization process planning using hybrid genetic algorithm and intelligent search for job shop machining.

    Science.gov (United States)

    Salehi, Mojtaba; Bahreininejad, Ardeshir

    2011-08-01

    Optimization of process planning is considered as the key technology for computer-aided process planning which is a rather complex and difficult procedure. A good process plan of a part is built up based on two elements: (1) the optimized sequence of the operations of the part; and (2) the optimized selection of the machine, cutting tool and Tool Access Direction (TAD) for each operation. In the present work, the process planning is divided into preliminary planning, and secondary/detailed planning. In the preliminary stage, based on the analysis of order and clustering constraints as a compulsive constraint aggregation in operation sequencing and using an intelligent searching strategy, the feasible sequences are generated. Then, in the detailed planning stage, using the genetic algorithm which prunes the initial feasible sequences, the optimized operation sequence and the optimized selection of the machine, cutting tool and TAD for each operation based on optimization constraints as an additive constraint aggregation are obtained. The main contribution of this work is the optimization of sequence of the operations of the part, and optimization of machine selection, cutting tool and TAD for each operation using the intelligent search and genetic algorithm simultaneously.

  4. A Hybrid Swarm Intelligence Algorithm for Intrusion Detection Using Significant Features

    Directory of Open Access Journals (Sweden)

    P. Amudha

    2015-01-01

    Full Text Available Intrusion detection has become a main part of network security due to the huge number of attacks which affects the computers. This is due to the extensive growth of internet connectivity and accessibility to information systems worldwide. To deal with this problem, in this paper a hybrid algorithm is proposed to integrate Modified Artificial Bee Colony (MABC with Enhanced Particle Swarm Optimization (EPSO to predict the intrusion detection problem. The algorithms are combined together to find out better optimization results and the classification accuracies are obtained by 10-fold cross-validation method. The purpose of this paper is to select the most relevant features that can represent the pattern of the network traffic and test its effect on the success of the proposed hybrid classification algorithm. To investigate the performance of the proposed method, intrusion detection KDDCup’99 benchmark dataset from the UCI Machine Learning repository is used. The performance of the proposed method is compared with the other machine learning algorithms and found to be significantly different.

  5. A new hybrid optimization method inspired from swarm intelligence: Fuzzy adaptive swallow swarm optimization algorithm (FASSO

    Directory of Open Access Journals (Sweden)

    Mehdi Neshat

    2015-11-01

    Full Text Available In this article, the objective was to present effective and optimal strategies aimed at improving the Swallow Swarm Optimization (SSO method. The SSO is one of the best optimization methods based on swarm intelligence which is inspired by the intelligent behaviors of swallows. It has been able to offer a relatively strong method for solving optimization problems. However, despite its many advantages, the SSO suffers from two shortcomings. Firstly, particles movement speed is not controlled satisfactorily during the search due to the lack of an inertia weight. Secondly, the variables of the acceleration coefficient are not able to strike a balance between the local and the global searches because they are not sufficiently flexible in complex environments. Therefore, the SSO algorithm does not provide adequate results when it searches in functions such as the Step or Quadric function. Hence, the fuzzy adaptive Swallow Swarm Optimization (FASSO method was introduced to deal with these problems. Meanwhile, results enjoy high accuracy which are obtained by using an adaptive inertia weight and through combining two fuzzy logic systems to accurately calculate the acceleration coefficients. High speed of convergence, avoidance from falling into local extremum, and high level of error tolerance are the advantages of proposed method. The FASSO was compared with eleven of the best PSO methods and SSO in 18 benchmark functions. Finally, significant results were obtained.

  6. Intelligent control a hybrid approach based on fuzzy logic, neural networks and genetic algorithms

    CERN Document Server

    Siddique, Nazmul

    2014-01-01

    Intelligent Control considers non-traditional modelling and control approaches to nonlinear systems. Fuzzy logic, neural networks and evolutionary computing techniques are the main tools used. The book presents a modular switching fuzzy logic controller where a PD-type fuzzy controller is executed first followed by a PI-type fuzzy controller thus improving the performance of the controller compared with a PID-type fuzzy controller.  The advantage of the switching-type fuzzy controller is that it uses one rule-base thus minimises the rule-base during execution. A single rule-base is developed by merging the membership functions for change of error of the PD-type controller and sum of error of the PI-type controller. Membership functions are then optimized using evolutionary algorithms. Since the two fuzzy controllers were executed in series, necessary further tuning of the differential and integral scaling factors of the controller is then performed. Neural-network-based tuning for the scaling parameters of t...

  7. Configurable intelligent optimization algorithm design and practice in manufacturing

    CERN Document Server

    Tao, Fei; Laili, Yuanjun

    2014-01-01

    Presenting the concept and design and implementation of configurable intelligent optimization algorithms in manufacturing systems, this book provides a new configuration method to optimize manufacturing processes. It provides a comprehensive elaboration of basic intelligent optimization algorithms, and demonstrates how their improvement, hybridization and parallelization can be applied to manufacturing. Furthermore, various applications of these intelligent optimization algorithms are exemplified in detail, chapter by chapter. The intelligent optimization algorithm is not just a single algorit

  8. 3Es System Optimization under Uncertainty Using Hybrid Intelligent Algorithm: A Fuzzy Chance-Constrained Programming Model

    Directory of Open Access Journals (Sweden)

    Jiekun Song

    2016-01-01

    Full Text Available Harmonious development of 3Es (economy-energy-environment system is the key to realize regional sustainable development. The structure and components of 3Es system are analyzed. Based on the analysis of causality diagram, GDP and industrial structure are selected as the target parameters of economy subsystem, energy consumption intensity is selected as the target parameter of energy subsystem, and the emissions of COD, ammonia nitrogen, SO2, and NOX and CO2 emission intensity are selected as the target parameters of environment system. Fixed assets investment of three industries, total energy consumption, and investment in environmental pollution control are selected as the decision variables. By regarding the parameters of 3Es system optimization as fuzzy numbers, a fuzzy chance-constrained goal programming (FCCGP model is constructed, and a hybrid intelligent algorithm including fuzzy simulation and genetic algorithm is proposed for solving it. The results of empirical analysis on Shandong province of China show that the FCCGP model can reflect the inherent relationship and evolution law of 3Es system and provide the effective decision-making support for 3Es system optimization.

  9. Structure and weights optimisation of a modified Elman network emotion classifier using hybrid computational intelligence algorithms: a comparative study

    Science.gov (United States)

    Sheikhan, Mansour; Abbasnezhad Arabi, Mahdi; Gharavian, Davood

    2015-10-01

    Artificial neural networks are efficient models in pattern recognition applications, but their performance is dependent on employing suitable structure and connection weights. This study used a hybrid method for obtaining the optimal weight set and architecture of a recurrent neural emotion classifier based on gravitational search algorithm (GSA) and its binary version (BGSA), respectively. By considering the features of speech signal that were related to prosody, voice quality, and spectrum, a rich feature set was constructed. To select more efficient features, a fast feature selection method was employed. The performance of the proposed hybrid GSA-BGSA method was compared with similar hybrid methods based on particle swarm optimisation (PSO) algorithm and its binary version, PSO and discrete firefly algorithm, and hybrid of error back-propagation and genetic algorithm that were used for optimisation. Experimental tests on Berlin emotional database demonstrated the superior performance of the proposed method using a lighter network structure.

  10. Pap Smear Diagnosis Using a Hybrid Intelligent Scheme Focusing on Genetic Algorithm Based Feature Selection and Nearest Neighbor Classification

    DEFF Research Database (Denmark)

    Marinakis, Yannis; Dounias, Georgios; Jantzen, Jan

    2009-01-01

    The term pap-smear refers to samples of human cells stained by the so-called Papanicolaou method. The purpose of the Papanicolaou method is to diagnose pre-cancerous cell changes before they progress to invasive carcinoma. In this paper a metaheuristic algorithm is proposed in order to classify t...... other previously applied intelligent approaches....

  11. HYBRIDIZATION OF MODIFIED ANT COLONY OPTIMIZATION AND INTELLIGENT WATER DROPS ALGORITHM FOR JOB SCHEDULING IN COMPUTATIONAL GRID

    Directory of Open Access Journals (Sweden)

    P. Mathiyalagan

    2013-10-01

    Full Text Available As grid is a heterogeneous environment, finding an optimal schedule for the job is always a complex task. In this paper, a hybridization technique using intelligent water drops and Ant colony optimization which are nature-inspired swarm intelligence approaches are used to find the best resource for the job. Intelligent water drops involves in finding out all matching resources for the job requirements and the routing information (optimal path to reach those resources. Ant Colony optimization chooses the best resource among all matching resources for the job. The objective of this approach is to converge to the optimal schedule faster, minimize the make span of the job, improve load balancing of resources and efficient utilization of available resources.

  12. Adaptation and hybridization in computational intelligence

    CERN Document Server

    Jr, Iztok

    2015-01-01

      This carefully edited book takes a walk through recent advances in adaptation and hybridization in the Computational Intelligence (CI) domain. It consists of ten chapters that are divided into three parts. The first part illustrates background information and provides some theoretical foundation tackling the CI domain, the second part deals with the adaptation in CI algorithms, while the third part focuses on the hybridization in CI. This book can serve as an ideal reference for researchers and students of computer science, electrical and civil engineering, economy, and natural sciences that are confronted with solving the optimization, modeling and simulation problems. It covers the recent advances in CI that encompass Nature-inspired algorithms, like Artificial Neural networks, Evolutionary Algorithms and Swarm Intelligence –based algorithms.  

  13. Solar PV power generation forecasting using hybrid intelligent algorithms and uncertainty quantification based on bootstrap confidence intervals

    Science.gov (United States)

    AlHakeem, Donna Ibrahim

    This thesis focuses on short-term photovoltaic forecasting (STPVF) for the power generation of a solar PV system using probabilistic forecasts and deterministic forecasts. Uncertainty estimation, in the form of a probabilistic forecast, is emphasized in this thesis to quantify the uncertainties of the deterministic forecasts. Two hybrid intelligent models are proposed in two separate chapters to perform the STPVF. In Chapter 4, the framework of the deterministic proposed hybrid intelligent model is presented, which is a combination of wavelet transform (WT) that is a data filtering technique and a soft computing model (SCM) that is generalized regression neural network (GRNN). Additionally, this chapter proposes a model that is combined as WT+GRNN and is utilized to conduct the forecast of two random days in each season for 1-hour-ahead to find the power generation. The forecasts are analyzed utilizing accuracy measures equations to determine the model performance and compared with another SCM. In Chapter 5, the framework of the proposed model is presented, which is a combination of WT, a SCM based on radial basis function neural network (RBFNN), and a population-based stochastic particle swarm optimization (PSO). Chapter 5 proposes a model combined as a deterministic approach that is represented as WT+RBFNN+PSO, and then a probabilistic forecast is conducted utilizing bootstrap confidence intervals to quantify uncertainty from the output of WT+RBFNN+PSO. In Chapter 5, the forecasts are conducted by furthering the tests done in Chapter 4. Chapter 5 forecasts the power generation of two random days in each season for 1-hour-ahead, 3-hour-ahead, and 6-hour-ahead. Additionally, different types of days were also forecasted in each season such as a sunny day (SD), cloudy day (CD), and a rainy day (RD). These forecasts were further analyzed using accuracy measures equations, variance and uncertainty estimation. The literature that is provided supports that the proposed

  14. Powertrain Matching and Optimization of Dual-Motor Hybrid Driving System for Electric Vehicle Based on Quantum Genetic Intelligent Algorithm

    Directory of Open Access Journals (Sweden)

    Yong Wang

    2014-01-01

    Full Text Available In order to increase the driving range and improve the overall performance of all-electric vehicles, a new dual-motor hybrid driving system with two power sources was proposed. This system achieved torque-speed coupling between the two power sources and greatly improved the high performance working range of the motors; at the same time, continuously variable transmission (CVT was achieved to efficiently increase the driving range. The power system parameters were determined using the “global optimization method”; thus, the vehicle’s dynamics and economy were used as the optimization indexes. Based on preliminary matches, quantum genetic algorithm was introduced to optimize the matching in the dual-motor hybrid power system. Backward simulation was performed on the combined simulation platform of Matlab/Simulink and AVL-Cruise to optimize, simulate, and verify the system parameters of the transmission system. Results showed that quantum genetic algorithms exhibited good global optimization capability and convergence in dealing with multiobjective and multiparameter optimization. The dual-motor hybrid-driving system for electric cars satisfied the dynamic performance and economy requirements of design, efficiently increasing the driving range of the car, having high performance, and reducing energy consumption of 15.6% compared with the conventional electric vehicle with single-speed reducers.

  15. A New Hybrid Model Based on Data Preprocessing and an Intelligent Optimization Algorithm for Electrical Power System Forecasting

    Directory of Open Access Journals (Sweden)

    Ping Jiang

    2015-01-01

    Full Text Available The establishment of electrical power system cannot only benefit the reasonable distribution and management in energy resources, but also satisfy the increasing demand for electricity. The electrical power system construction is often a pivotal part in the national and regional economic development plan. This paper constructs a hybrid model, known as the E-MFA-BP model, that can forecast indices in the electrical power system, including wind speed, electrical load, and electricity price. Firstly, the ensemble empirical mode decomposition can be applied to eliminate the noise of original time series data. After data preprocessing, the back propagation neural network model is applied to carry out the forecasting. Owing to the instability of its structure, the modified firefly algorithm is employed to optimize the weight and threshold values of back propagation to obtain a hybrid model with higher forecasting quality. Three experiments are carried out to verify the effectiveness of the model. Through comparison with other traditional well-known forecasting models, and models optimized by other optimization algorithms, the experimental results demonstrate that the hybrid model has the best forecasting performance.

  16. Intelligent hybrid genetic algorithm for container ship loading%集装箱船装载问题的混合遗传智能优化算法

    Institute of Scientific and Technical Information of China (English)

    朱莹; 向先波; 杨运桃; 王英伟

    2015-01-01

    For the purpose of optimizing the efficiency of the container,a mathematical model of con-tainer ship loading problem was established with the goal of maximizing the utilization of space.An intelligent hybrid genetic algorithm combined with a new encoding method consisting of the sequence and the placement of the cargo was presented.The genetic operators including partial mapped cross-over operator,two-point crossover operator,sequence reversed mutation operator and basic bit muta-tion operator were applied to the loading problem.Simulations were performed to validate the pro-posed algorithm.By taking two sets of test data in the classic Loh′s algorithm test,the space utiliza-tion respectively reached 94.31% and 91.41% which had an obvious improvement compared with the other algorithms.The results show the effectiveness of the intelligent hybrid genetic algorithm for ad-dressing the container ship loading problem.%为了提高集装箱的利用率,以空间利用率最大化为优化目标,建立集装箱船装载问题的数学模型,提出了一种新型混合遗传智能算法.算法中设计了一种包含货物装填顺序和放置状态的两段编码方式,构造适应集装箱船装载问题的部分映射交叉算子、两点交叉算子、顺序逆转变异算子和基本位变异算子,并对此算法进行了仿真验证.以 Loh 和 Nee 的两组经典测试数据为实例进行算法测试,空间利用率分别达到94.3%和91.4%,与相同类型装箱算法进行对比,空间利用率有明显提升,验证了混合遗传智能优化算法的有效性.

  17. Recent advances on hybrid approaches for designing intelligent systems

    CERN Document Server

    Melin, Patricia; Pedrycz, Witold; Kacprzyk, Janusz

    2014-01-01

    This book describes recent advances on hybrid intelligent systems using soft computing techniques for diverse areas of application, such as intelligent control and robotics, pattern recognition, time series prediction and optimization complex problems. Soft Computing (SC) consists of several intelligent computing paradigms, including fuzzy logic, neural networks, and bio-inspired optimization algorithms, which can be used to produce powerful hybrid intelligent systems. The book is organized in five main parts, which contain a group of papers around a similar subject. The first part consists of papers with the main theme of type-2 fuzzy logic, which basically consists of papers that propose new models and applications for type-2 fuzzy systems. The second part contains papers with the main theme of bio-inspired optimization algorithms, which are basically papers using nature-inspired techniques to achieve optimization of complex optimization problems in diverse areas of application. The third part contains pape...

  18. Optimization of fractional PID controller based on hybrid computation intelligent learning algorithm%基于混合计算智能的分数阶PID控制器参数优化

    Institute of Scientific and Technical Information of China (English)

    毛书军; 盛贤君

    2014-01-01

    In order to solve the challenging problem of optimization of five-dimensional parameters in fractional PID controller, based on the introduction of swarm intelligence algorithm and evolutionary computing, a hybrid computation intelligent learning algorithm was proposed, which combined Glowworm Swarm Optimization ( GSO) with Genetic Algorithm ( GA) . The hybrid algorithm was based on the swarm intelligence and individual evolution of creatures, which can greatly increase the accuracy of optimization and ensure that algorithm evolves to optimum. A series of experiments verify that the proposed hybrid algorithm can shorten the time of computing and increase the accuracy of simulation.%为解决分数阶PID控制器五维参数优化的难题,设计了一种把萤火虫算法和遗传算法相结合的混合计算智能算法,阐述了计算智能中的群智能算法和进化计算的基本原理和数学算法。该方法基于生物的群体智能和个体进化相结合的思想,能够有效地提高寻优精度,并使算法向最优方向不断进化。经过仿真验证,混合算法在分数阶PID参数整定方面具有运算时间短、仿真精度高等优点。

  19. The Shortest Path with Intelligent Algorithm

    Directory of Open Access Journals (Sweden)

    Surachai Panich

    2010-01-01

    Full Text Available Problem statement: Path planning algorithms need to be developed and implemented in a suitable manner to give better understanding about the intelligent system and also stimulates technological supply to enormous demands in an intelligent vehicle industry. Approach: This study concerned with intelligent path planning using A* search algorithm. Results: This study introduced intelligent path planning with A* search algorithm, which use to generate the most efficient path to goal. The algorithm was tested on simulator. Conclusion: This study is an implementation of a path planning for an intelligent path planning. The implementations are tested and verified with the simulation software. The path planning algorithms were selected for the implementation and to verify them.

  20. Learning Intelligent Genetic Algorithms Using Japanese Nonograms

    Science.gov (United States)

    Tsai, Jinn-Tsong; Chou, Ping-Yi; Fang, Jia-Cen

    2012-01-01

    An intelligent genetic algorithm (IGA) is proposed to solve Japanese nonograms and is used as a method in a university course to learn evolutionary algorithms. The IGA combines the global exploration capabilities of a canonical genetic algorithm (CGA) with effective condensed encoding, improved fitness function, and modified crossover and…

  1. Learning Intelligent Genetic Algorithms Using Japanese Nonograms

    Science.gov (United States)

    Tsai, Jinn-Tsong; Chou, Ping-Yi; Fang, Jia-Cen

    2012-01-01

    An intelligent genetic algorithm (IGA) is proposed to solve Japanese nonograms and is used as a method in a university course to learn evolutionary algorithms. The IGA combines the global exploration capabilities of a canonical genetic algorithm (CGA) with effective condensed encoding, improved fitness function, and modified crossover and…

  2. Autonomous intelligent vehicles theory, algorithms, and implementation

    CERN Document Server

    Cheng, Hong

    2011-01-01

    Here is the latest on intelligent vehicles, covering object and obstacle detection and recognition and vehicle motion control. Includes a navigation approach using global views; introduces algorithms for lateral and longitudinal motion control and more.

  3. Electronic Commerce Logistics Network Optimization Based on Swarm Intelligent Algorithm

    Directory of Open Access Journals (Sweden)

    Yabing Jiao

    2013-09-01

    Full Text Available This article establish an efficient electronic commerce logistics operation system to reduce distribution costs and build a logistics network operation model based on around the B2C electronic commerce enterprise logistics network operation system. B2C electronic commerce transactions features in the enterprise network platform. To solve the NP-hard problem this article use hybrid ant colony algorithm, particle swarm algorithm and group swarm intelligence algorithm to get a best solution. According to the intelligent algorithm, design of electronic commerce logistics network optimization system, enter the national 22 electronic commerce logistics network for validation. Through the experiment to verify the optimized logistics cost greatly decreased. This research can help B2C electronic commerce enterprise logistics network to optimize decision-making under the premise of ensuring the interests of consumers and service levels also can be an effective way for enterprises to improve the efficiency of logistics services and reduce operation costs

  4. Combined Intelligent Control (CIC: An Intelligent decision making algorithm

    Directory of Open Access Journals (Sweden)

    Moteaal Asadi Shirzi

    2008-11-01

    Full Text Available The focus of this research is to introduce the concept of combined intelligent control (CIC as an effective architecture for decision making and control of intelligent agents and multi robot sets. Basically, the CIC is a combination of various architectures and methods from fields such as artificial intelligence, Distributed Artificial Intelligence (DAI, control and biological computing. Although any intelligent architecture may be very effective for some specific applications, it could be less for others. Therefore, CIC combines and arranges them in a way that the strengths of any approach cover the weaknesses of others. In this paper first, we introduce some intelligent architectures from a new aspect. Afterward, we offer the CIC by combining them. CIC has been executed in a multi agent set. In this set, robots must cooperate to perform some various tasks in a complex and nondeterministic environment with a low sensory feedback and relationship. In order to investigate, improve, and correct the combined intelligent control method, simulation software has been designed which will be presented and considered. To show the ability of the CIC algorithm as a distributed architecture, a central algorithm is designed and compared with the CIC.

  5. Algorithms for Efficient Intelligence Collection

    Science.gov (United States)

    2013-09-01

    Software Implementation . . . . . . . . . . . . . . . . . . . . . . . 11 3 Creating Sample Intelligence Networks 15 3.1 The Enron Corpus...graphical model. . . . 10 Figure 3.1 A distribution of the edge pe values in the complete Enron network. . . 18 Figure 3.2 A histogram showing the...distribution of the number of total items avail- able for screening on the edges of the complete Enron network. . . . . 18 Figure 3.3 A small intelligence

  6. Nature-inspired design of hybrid intelligent systems

    CERN Document Server

    Castillo, Oscar; Kacprzyk, Janusz

    2017-01-01

    This book highlights recent advances in the design of hybrid intelligent systems based on nature-inspired optimization and their application in areas such as intelligent control and robotics, pattern recognition, time series prediction, and optimization of complex problems. The book is divided into seven main parts, the first of which addresses theoretical aspects of and new concepts and algorithms based on type-2 and intuitionistic fuzzy logic systems. The second part focuses on neural network theory, and explores the applications of neural networks in diverse areas, such as time series prediction and pattern recognition. The book’s third part presents enhancements to meta-heuristics based on fuzzy logic techniques and describes new nature-inspired optimization algorithms that employ fuzzy dynamic adaptation of parameters, while the fourth part presents diverse applications of nature-inspired optimization algorithms. In turn, the fifth part investigates applications of fuzzy logic in diverse areas, such as...

  7. Hybrid intelligent monironing systems for thermal power plant trips

    Science.gov (United States)

    Barsoum, Nader; Ismail, Firas Basim

    2012-11-01

    Steam boiler is one of the main equipment in thermal power plants. If the steam boiler trips it may lead to entire shutdown of the plant, which is economically burdensome. Early boiler trips monitoring is crucial to maintain normal and safe operational conditions. In the present work two artificial intelligent monitoring systems specialized in boiler trips have been proposed and coded within the MATLAB environment. The training and validation of the two systems has been performed using real operational data captured from the plant control system of selected power plant. An integrated plant data preparation framework for seven boiler trips with related operational variables has been proposed for IMSs data analysis. The first IMS represents the use of pure Artificial Neural Network system for boiler trip detection. All seven boiler trips under consideration have been detected by IMSs before or at the same time of the plant control system. The second IMS represents the use of Genetic Algorithms and Artificial Neural Networks as a hybrid intelligent system. A slightly lower root mean square error was observed in the second system which reveals that the hybrid intelligent system performed better than the pure neural network system. Also, the optimal selection of the most influencing variables performed successfully by the hybrid intelligent system.

  8. Intelligent control algorithm for ship dynamic positioning

    Directory of Open Access Journals (Sweden)

    Meng Wang

    2014-12-01

    Full Text Available Ship motion in the sea is a complex nonlinear kinematics. The hydrodynamic coefficients of ship model are very difficult to accurately determine. Establishing accurate mathematical model of ship motion is difficult because of changing random factors in the marine environment. Aiming at seeking a method of control to realize ship positioning, intelligent control algorithms are adopt utilizing operator's experience. Fuzzy controller and the neural network controller are respectively designed. Through simulations and experiments, intelligent control algorithm can deal with the complex nonlinear motion, and has good robustness. The ship dynamic positioning system with neural network control has high positioning accuracy and performance.

  9. Study of the Artificial Fish Swarm Algorithm for Hybrid Clustering

    Directory of Open Access Journals (Sweden)

    Hongwei Zhao

    2015-06-01

    Full Text Available The basic Artificial Fish Swarm (AFS Algorithm is a new type of an heuristic swarm intelligence algorithm, but it is difficult to optimize to get high precision due to the randomness of the artificial fish behavior, which belongs to the intelligence algorithm. This paper presents an extended AFS algorithm, namely the Cooperative Artificial Fish Swarm (CAFS, which significantly improves the original AFS in solving complex optimization problems. K-medoids clustering algorithm is being used to classify data, but the approach is sensitive to the initial selection of the centers with low quality of the divided cluster. A novel hybrid clustering method based on the CAFS and K-medoids could be used for solving clustering problems. In this work, first, CAFS algorithm is used for optimizing six widely-used benchmark functions, coming up with comparative results produced by AFS and CAFS, then Particle Swarm Optimization (PSO is studied. Second, the hybrid algorithm with K-medoids and CAFS algorithms is used for data clustering on several benchmark data sets. The performance of the hybrid algorithm based on K-medoids and CAFS is compared with AFS and CAFS algorithms on a clustering problem. The simulation results show that the proposed CAFS outperforms the other two algorithms in terms of accuracy and robustness.

  10. Algorithms and architectures of artificial intelligence

    CERN Document Server

    Tyugu, E

    2007-01-01

    This book gives an overview of methods developed in artificial intelligence for search, learning, problem solving and decision-making. It gives an overview of algorithms and architectures of artificial intelligence that have reached the degree of maturity when a method can be presented as an algorithm, or when a well-defined architecture is known, e.g. in neural nets and intelligent agents. It can be used as a handbook for a wide audience of application developers who are interested in using artificial intelligence methods in their software products. Parts of the text are rather independent, so that one can look into the index and go directly to a description of a method presented in the form of an abstract algorithm or an architectural solution. The book can be used also as a textbook for a course in applied artificial intelligence. Exercises on the subject are added at the end of each chapter. Neither programming skills nor specific knowledge in computer science are expected from the reader. However, some p...

  11. Intelligence Course Scheduling System Based on Hybrid Algorithm%基于混合算法的智能排课系统

    Institute of Scientific and Technical Information of China (English)

    赵耀锋

    2011-01-01

    传统采用单一排课算法设计的排课系统,编排出的课程表总是与期望结果相差太大.为了使课表编排结果能满足教学要求,在此对排课约束条件进行了详细分析,采用基于遗传算法和贪婪算法的混合算法进行排课系统设计,将排课分为时间安排和地点安排2部分进行,时间安排采用遗传算法设计,地点安排采用贪婪算法设计,时间安排和地点安排过程可以人工干预,编排的课程表基本符合教务管理需求.混合算法设计的智能排课系统编排的课程表更加科学化、合理化和人性化.%The school timetable generated by the traditional course scheduling system designed with the single course scheduling algorithm is far from the expeetation. In order to make the result of course scheduling satisfy the teaching requirements, the constraint condition of course scheduling is analyzed. The hybrid algorithm based on the genetic algorithms and greedy algorithm is adopted to design the course scheduling system. The caurse scheduling is divided into time arrangement and classroom arrangement. The former is designed with genetic algorithms and the later with greedy algorithm. The process of both arrangements can be intervened manually. The school timetable designed in this way can basically meet the requirements of teaching management, and is more scientific, rational and humanized.

  12. A Hybrid Architecture Approach for Quantum Algorithms

    Directory of Open Access Journals (Sweden)

    Mohammad R.S. Aghaei

    2009-01-01

    Full Text Available Problem statement: In this study, a general plan of hybrid architecture for quantum algorithms is proposed. Approach: Analysis of the quantum algorithms shows that these algorithms were hybrid with two parts. First, the relationship of classical and quantum parts of the hybrid algorithms was extracted. Then a general plan of hybrid structure was designed. Results: This plan was illustrated the hybrid architecture and the relationship of classical and quantum parts of the algorithms. This general plan was used to increase implementation performance of quantum algorithms. Conclusion/Recommendations: Moreover, simulation results of quantum algorithms on the hybrid architecture proved that quantum algorithms can be implemented on the general plan as well.

  13. Symbolic Algorithmic Analysis of Rectangular Hybrid Systems

    Institute of Scientific and Technical Information of China (English)

    Hai-Bin Zhang; Zhen-Hua Duan

    2009-01-01

    This paper investigates symbolic algorithmic analysis of rectangular hybrid systems. To deal with the symbolic reachability problem, a restricted constraint system called hybrid zone is formalized for the representation and manipulation of rectangular automata state-spaces. Hybrid zones are proved to be closed over symbolic reachability operations of rectangular hybrid systems. They are also applied to model-checking procedures for verifying some important classes of timed computation tree logic formulas. To represent hybrid zones, a data structure called difference constraint matrix is defined.These enable us to deal with the symbolic algorithmic analysis of rectangular hybrid systems in an efficient way.

  14. The Random Fuzzy Multi-objective Assignment Problem Based on A Hybrid Intelligent Algorithm%基于混合智能算法的随机模糊多目标指派问题

    Institute of Scientific and Technical Information of China (English)

    肖继先; 寇春蕾

    2015-01-01

    文中从不确定理论出发,将随机模糊约束规划理论引入对随机模糊多目标指派问题的研究。构建了多目标指派问题的随机模糊规划机会约束模型,并设计了将随机模糊模拟、神经网络和遗传算法结合在一起的混合智能算法对模型进行求解。%This paper based on the uncertainty theory,put the theory of random fuzzy constraint programming introduce into the study of random fuzzy multi-objective assignment problem.Build random fuzzy planning opportunities constraint model of the Multi -objective Assignment problem.And design a hybrid intelligent algorithm, which combined the random fuzzy simulation,neural network and genetic algorithm,to solve the model.

  15. 15th International conference on Hybrid Intelligent Systems

    CERN Document Server

    Han, Sang; Al-Sharhan, Salah; Liu, Hongbo

    2016-01-01

    This book is devoted to the hybridization of intelligent systems which is a promising research field of modern computational intelligence concerned with the development of the next generation of intelligent systems. This Volume contains the papers presented in the Fifteenth International conference on Hybrid Intelligent Systems (HIS 2015) held in Seoul, South Korea during November 16-18, 2015. The 26 papers presented in this Volume were carefully reviewed and selected from 90 paper submissions. The Volume will be a valuable reference to researchers, students and practitioners in the computational intelligence field.

  16. Intelligent decision support algorithm for distribution system restoration.

    Science.gov (United States)

    Singh, Reetu; Mehfuz, Shabana; Kumar, Parmod

    2016-01-01

    Distribution system is the means of revenue for electric utility. It needs to be restored at the earliest if any feeder or complete system is tripped out due to fault or any other cause. Further, uncertainty of the loads, result in variations in the distribution network's parameters. Thus, an intelligent algorithm incorporating hybrid fuzzy-grey relation, which can take into account the uncertainties and compare the sequences is discussed to analyse and restore the distribution system. The simulation studies are carried out to show the utility of the method by ranking the restoration plans for a typical distribution system. This algorithm also meets the smart grid requirements in terms of an automated restoration plan for the partial/full blackout of network.

  17. A Hybrid Chaotic Quantum Evolutionary Algorithm

    DEFF Research Database (Denmark)

    Cai, Y.; Zhang, M.; Cai, H.

    2010-01-01

    A hybrid chaotic quantum evolutionary algorithm is proposed to reduce amount of computation, speed up convergence and restrain premature phenomena of quantum evolutionary algorithm. The proposed algorithm adopts the chaotic initialization method to generate initial population which will form...... and enhance the global search ability. A large number of tests show that the proposed algorithm has higher convergence speed and better optimizing ability than quantum evolutionary algorithm, real-coded quantum evolutionary algorithm and hybrid quantum genetic algorithm. Tests also show that when chaos...... is introduced to quantum evolutionary algorithm, the hybrid chaotic search strategy is superior to the carrier chaotic strategy, and has better comprehensive performance than the chaotic mutation strategy in most of cases. Especially, the proposed algorithm is the only one that has 100% convergence rate in all...

  18. Intelligent perturbation algorithms for space scheduling optimization

    Science.gov (United States)

    Kurtzman, Clifford R.

    1990-01-01

    The optimization of space operations is examined in the light of optimization heuristics for computer algorithms and iterative search techniques. Specific attention is given to the search concepts known collectively as intelligent perturbation algorithms (IPAs) and their application to crew/resource allocation problems. IPAs iteratively examine successive schedules which become progressively more efficient, and the characteristics of good perturbation operators are listed. IPAs can be applied to aerospace systems to efficiently utilize crews, payloads, and resources in the context of systems such as Space-Station scheduling. A program is presented called the MFIVE Space Station Scheduling Worksheet which generates task assignments and resource usage structures. The IPAs can be used to develop flexible manifesting and scheduling for the Industrial Space Facility.

  19. Hybrid Intelligent Control for Submarine Stabilization

    Directory of Open Access Journals (Sweden)

    Minghui Wang

    2013-05-01

    Full Text Available While sailing near the sea surface, submarines will often undergo rolling motion caused by wave disturbance. Fierce rolling motion seriously affects their normal operation and even threatens their security. We propose a new control method for roll stabilization. This paper studies hybrid intelligent control combining a fuzzy control, a neural network and extension control technology. Every control strategy can achieve the ideal control effect within the scope of its effective control. The neuro‐fuzzy control strategy is used to improve the robustness of the controller. The speed control strategy and the course control strategy are conducted to extend the control range. The paper also proposes the design of the controller and carries out the simulation experiment in different sea conditions. The simulation results show that the control method proposed can indeed effectively improve the control performance of submarine stabilization.

  20. Hybrid Intelligent Control for Submarine Stabilization

    Directory of Open Access Journals (Sweden)

    Minghui Wang

    2013-05-01

    Full Text Available Abstract While sailing near the sea surface, submarines will often undergo rolling motion caused by wave disturbance. Fierce rolling motion seriously affects their normal operation and even threatens their security. We propose a new control method for roll stabilization. This paper studies hybrid intelligent control combining a fuzzy control, a neural network and extension control technology. Every control strategy can achieve the ideal control effect within the scope of its effective control. The neuro-fuzzy control strategy is used to improve the robustness of the controller. The speed control strategy and the course control strategy are conducted to extend the control range. The paper also proposes the design of the controller and carries out the simulation experiment in different sea conditions. The simulation results show that the control method proposed can indeed effectively improve the control performance of submarine stabilization.

  1. Multithreaded Implementation of Hybrid String Matching Algorithm

    Directory of Open Access Journals (Sweden)

    Akhtar Rasool

    2012-03-01

    Full Text Available Reading and taking reference from many books and articles, and then analyzing the Navies algorithm, Boyer Moore algorithm and Knuth Morris Pratt (KMP algorithm and a variety of improved algorithms, summarizes various advantages and disadvantages of the pattern matching algorithms. And on this basis, a new algorithm – Multithreaded Hybrid algorithm is introduced. The algorithm refers to Boyer Moore algorithm, KMP algorithm and the thinking of improved algorithms. Utilize the last character of the string, the next character and the method to compare from side to side, and then advance a new hybrid pattern matching algorithm. And it adjusted the comparison direction and the order of the comparison to make the maximum moving distance of each time to reduce the pattern matching time. The algorithm reduces the comparison number and greatlyreduces the moving number of the pattern and improves the matching efficiency. Multithreaded implementation of hybrid, pattern matching algorithm performs the parallel string searching on different text data by executing a number of threads simultaneously. This approach is advantageous from all other string-pattern matching algorithm in terms of time complexity. This again improves the overall string matching efficiency.

  2. The Rational Hybrid Monte Carlo Algorithm

    CERN Document Server

    Clark, M A

    2006-01-01

    The past few years have seen considerable progress in algorithmic development for the generation of gauge fields including the effects of dynamical fermions. The Rational Hybrid Monte Carlo (RHMC) algorithm, where Hybrid Monte Carlo is performed using a rational approximation in place the usual inverse quark matrix kernel is one of these developments. This algorithm has been found to be extremely beneficial in many areas of lattice QCD (chiral fermions, finite temperature, Wilson fermions etc.). We review the algorithm and some of these benefits, and we compare against other recent algorithm developements. We conclude with an update of the Berlin wall plot comparing costs of all popular fermion formulations.

  3. The Rational Hybrid Monte Carlo algorithm

    Science.gov (United States)

    Clark, Michael

    2006-12-01

    The past few years have seen considerable progress in algorithmic development for the generation of gauge fields including the effects of dynamical fermions. The Rational Hybrid Monte Carlo (RHMC) algorithm, where Hybrid Monte Carlo is performed using a rational approximation in place the usual inverse quark matrix kernel is one of these developments. This algorithm has been found to be extremely beneficial in many areas of lattice QCD (chiral fermions, finite temperature, Wilson fermions etc.). We review the algorithm and some of these benefits, and we compare against other recent algorithm developements. We conclude with an update of the Berlin wall plot comparing costs of all popular fermion formulations.

  4. WEEDS IDENTIFICATION USING EVOLUTIONARY ARTIFICIAL INTELLIGENCE ALGORITHM

    Directory of Open Access Journals (Sweden)

    Ahmed M. Tobal

    2014-01-01

    Full Text Available In a world reached a population of six billion humans increasingly demand it for food, feed with a water shortage and the decline of agricultural land and the deterioration of the climate needs 1.5 billion hectares of agricultural land and in case of failure to combat pests needs about 4 billion hectares. Weeds represent 34% of the whole pests while insects, diseases and the deterioration of agricultural land present the remaining percentage. Weeds Identification has been one of the most interesting classification problems for Artificial Intelligence (AI and image processing. The most common case is to identify weeds within the field as they reduce the productivity and harm the existing crops. Success in this area results in an increased productivity, profitability and at the same time decreases the cost of operation. On the other hand, when AI algorithms combined with appropriate imagery tools may present the right solution to the weed identification problem. In this study, we introduce an evolutionary artificial neural network to minimize the time of classification training and minimize the error through the optimization of the neuron parameters by means of a genetic algorithm. The genetic algorithm, with its global search capability, finds the optimum histogram vectors used for network training and target testing through a fitness measure that reflects the result accuracy and avoids the trial-and-error process of estimating the network inputs according to the histogram data.

  5. Intelligent Control Scheme of Engineering Machinery of Cluster Hybrid System

    Institute of Scientific and Technical Information of China (English)

    GAO Qiang; WANG Hongli

    2005-01-01

    In a hybrid system, the subsystems with discrete dynamics play a central role in a hybrid system. In the course of engineering machinery of cluster construction, the discrete control law is hard to obtain because the construction environment is complex and there exist many affecting factors. In this paper, hierarchically intelligent control, expert control and fuzzy control are introduced into the discrete subsystems of engineering machinery of cluster hybrid system, so as to rebuild the hybrid system and make the discrete control law easily and effectively obtained. The structures, reasoning mechanism and arithmetic of intelligent control are replanted to discrete dynamic, conti-nuous process and the interface of the hybrid system. The structures of three types of intelligent hybrid system are presented and the human experiences summarized from engineering machinery of cluster are taken into account.

  6. DESIGNING A HYBRID INTELLIGENT MINING SYSTEM FOR CREDIT RISK EVALUATION

    Institute of Scientific and Technical Information of China (English)

    2008-01-01

    In this study,a novel hybrid intelligent mining system integrating rough sets theory and support vector machines is developed to extract efficiently association rules from original information table for credit risk evaluation and analysis.In the proposed hybrid intelligent system,support vector machines are used as a tool to extract typical features and filter its noise,which are different from the previous studies where rough sets were only used as a preprocessor for support vector machines.Such an approach could reduce the information table and generate the final knowledge from the reduced information table by rough sets.Therefore,the proposed hybrid intelligent system overcomes the diffi-culty of extracting rules from a trained support vector machine classifier and possesses the robustness which is lacking for rough-set-based approaches.In addition,the effectiveness of the proposed hybrid intelligent system is illustrated with two real-world credit datasets.

  7. Hybrid intelligent optimization methods for engineering problems

    Science.gov (United States)

    Pehlivanoglu, Yasin Volkan

    quantification studies, we improved new mutation strategies and operators to provide beneficial diversity within the population. We called this new approach as multi-frequency vibrational GA or PSO. They were applied to different aeronautical engineering problems in order to study the efficiency of these new approaches. These implementations were: applications to selected benchmark test functions, inverse design of two-dimensional (2D) airfoil in subsonic flow, optimization of 2D airfoil in transonic flow, path planning problems of autonomous unmanned aerial vehicle (UAV) over a 3D terrain environment, 3D radar cross section minimization problem for a 3D air vehicle, and active flow control over a 2D airfoil. As demonstrated by these test cases, we observed that new algorithms outperform the current popular algorithms. The principal role of this multi-frequency approach was to determine which individuals or particles should be mutated, when they should be mutated, and which ones should be merged into the population. The new mutation operators, when combined with a mutation strategy and an artificial intelligent method, such as, neural networks or fuzzy logic process, they provided local and global diversities during the reproduction phases of the generations. Additionally, the new approach also introduced random and controlled diversity. Due to still being population-based techniques, these methods were as robust as the plain GA or PSO algorithms. Based on the results obtained, it was concluded that the variants of the present multi-frequency vibrational GA and PSO were efficient algorithms, since they successfully avoided all local optima within relatively short optimization cycles.

  8. A SCALABLE HYBRID MODULAR MULTIPLICATION ALGORITHM

    Institute of Scientific and Technical Information of China (English)

    Meng Qiang; Chen Tao; Dai Zibin; Chen Quji

    2008-01-01

    Based on the analysis of several familiar large integer modular multiplication algorithms,this paper proposes a new Scalable Hybrid modular multiplication (SHyb) algorithm which has scalable operands, and presents an RSA algorithm model with scalable key size. Theoretical analysis shows that SHyb algorithm requires m2n/2+2m iterations to complete an mn-bit modular multiplication with the application of an n-bit modular addition hardware circuit. The number of the required iterations can be reduced to a half of that of the scalable Montgomery algorithm. Consequently, the application scope of the RSA cryptosystem is expanded and its operation speed is enhanced based on SHyb algorithm.

  9. Fitting PAC spectra with a hybrid algorithm

    Energy Technology Data Exchange (ETDEWEB)

    Alves, M. A., E-mail: mauro@sepn.org [Instituto de Aeronautica e Espaco (Brazil); Carbonari, A. W., E-mail: carbonar@ipen.br [Instituto de Pesquisas Energeticas e Nucleares (Brazil)

    2008-01-15

    A hybrid algorithm (HA) that blends features of genetic algorithms (GA) and simulated annealing (SA) was implemented for simultaneous fits of perturbed angular correlation (PAC) spectra. The main characteristic of the HA is the incorporation of a selection criterion based on SA into the basic structure of GA. The results obtained with the HA compare favorably with fits performed with conventional methods.

  10. 基于混合智能算法的电力系统经济负荷分配%Economic Load Dispatch of Power System Based on Hybrid Intelligent Algorithm

    Institute of Scientific and Technical Information of China (English)

    周广闯; 陈璟华; 郭壮志; 潘帅; 刘春香

    2014-01-01

    为解决复杂、不连续、不可导、非线性的电力系统经济负荷分配(economic load dispatch,ELD)问题,提出粒子群算法(particle swarm optimization,PSO)结合单纯形算法(simplex method,NM)的混合智能算法(simplex method-particle swarm optimization,NMPSO)。利用NMPSO解决ELD问题时,综合考虑了发电机组的阀点效应和系统网损,使ELD更接近实际情况,充分利用 PSO 随机性的全局寻优能力和 NM快速确定性的局部寻优能力,弥补了 PSO和NM分别单独应用时的不足。仿真结果表明,NMPSO应用于 ELD 问题,具有较好的优化效果。%For solving problem of economic load dispatch of complex,discontinuous,unguided and nonlinear power system,a kind of hybrid intelligent algorithm combining particle swarm optimization and simplex method was proposed.When using NMPSO to solve ELD problem,valve point effect and system transmission losses of the generator unit were comprehensively considered which made ELD more closely approximate to physical truth.By fully using global optimization of PSO random and partial optimization of NM rapid certainty,it was able to make up shortages of independent PSO and NM.Simulation results indicated that application of NMPSO in ELD was of better optimization effect.

  11. Impulse denoising using Hybrid Algorithm

    Directory of Open Access Journals (Sweden)

    Ms.Arumugham Rajamani

    2015-03-01

    Full Text Available Many real time images facing a problem of salt and pepper noise contaminated,due to poor illumination and environmental factors. Many filters and algorithms are used to remove salt and pepper noise from the image, but it also removes image information. This paper proposes a new effective algorithm for diagnosing and removing salt and pepper noise is presented. The existing standard algorithms like Median Filter (MF, Weighted Median Filter (WMF, Standard Median Filter (SMF and so on, will yield poor performance particularly at high noise density. The suggested algorithm is compared with the above said standard algorithms using the metrics Mean Square Error (MSE and Peak Signal to Noise Ratio (PSNR value.The proposed algorithm exhibits more competitive performance results at all noise densities. The joint sorting and diagonal averaging algorithm has lower computational time,better quantitative results and improved qualitative result by a better visual appearance at all noise densities.

  12. An Effective Hybrid Artificial Bee Colony Algorithm for Nonnegative Linear Least Squares Problems

    Directory of Open Access Journals (Sweden)

    Xiangyu Kong

    2014-07-01

    Full Text Available An effective hybrid artificial bee colony algorithm is proposed in this paper for nonnegative linear least squares problems. To further improve the performance of algorithm, orthogonal initialization method is employed to generate the initial swarm. Furthermore, to balance the exploration and exploitation abilities, a new search mechanism is designed. The performance of this algorithm is verified by using 27 benchmark functions and 5 nonnegative linear least squares test problems. And the comparison analyses are given between the proposed algorithm and other swarm intelligence algorithms. Numerical results demonstrate that the proposed algorithm displays a high performance compared with other algorithms for global optimization problems and nonnegative linear least squares problems.

  13. Beyond AI: Multi-Intelligence (MI Combining Natural and Artificial Intelligences in Hybrid Beings and Systems

    Directory of Open Access Journals (Sweden)

    Stephen Fox

    2017-06-01

    Full Text Available Framing strongly influences actions among technology proponents and end-users. Underlying much debate about artificial intelligence (AI are several fundamental shortcomings in its framing. First, discussion of AI is atheoretical, and therefore has limited potential for addressing the complexity of causation. Second, intelligence is considered from an anthropocentric perspective that sees human intelligence, and intelligence developed by humans, as superior to all other intelligences. Thus, the extensive post-anthropocentric research into intelligence is not given sufficient consideration. Third, AI is discussed often in reductionist mechanistic terms. Rather than in organicist emergentist terms as a contributor to multi-intelligence (MI hybrid beings and/or systems. Thus, current framing of AI can be a self-validating reduction within which AI development is focused upon AI becoming the single-variable mechanism causing future effects. In this paper, AI is reframed as a contributor to MI.

  14. An intelligent hybrid behavior coordination system for an autonomous mobile robot

    Science.gov (United States)

    Luo, Chaomin; Krishnan, Mohan; Paulik, Mark; Fallouh, Samer

    2013-12-01

    In this paper, development of a low-cost PID controller with an intelligent behavior coordination system for an autonomous mobile robot is described that is equipped with IR sensors, ultrasonic sensors, regulator, and RC filters on the robot platform based on HCS12 microcontroller and embedded systems. A novel hybrid PID controller and behavior coordination system is developed for wall-following navigation and obstacle avoidance of an autonomous mobile robot. Adaptive control used in this robot is a hybrid PID algorithm associated with template and behavior coordination models. Software development contains motor control, behavior coordination intelligent system and sensor fusion. In addition, the module-based programming technique is adopted to improve the efficiency of integrating the hybrid PID and template as well as behavior coordination model algorithms. The hybrid model is developed to synthesize PID control algorithms, template and behavior coordination technique for wall-following navigation with obstacle avoidance systems. The motor control, obstacle avoidance, and wall-following navigation algorithms are developed to propel and steer the autonomous mobile robot. Experiments validate how this PID controller and behavior coordination system directs an autonomous mobile robot to perform wall-following navigation with obstacle avoidance. Hardware configuration and module-based technique are described in this paper. Experimental results demonstrate that the robot is successfully capable of being guided by the hybrid PID controller and behavior coordination system for wall-following navigation with obstacle avoidance.

  15. High Precision Motion Control of Hybrid Five-Bar Mechanism with an Intelligent Control

    Institute of Scientific and Technical Information of China (English)

    ZHANG Ke; WANG Sheng-ze

    2009-01-01

    Hybrid mechanism is a new type of planar controllable mechanism. Position control accuracy of system determines the output acctracy of the mechanism In order to achieve the desired high accuracy, nonlinear factors as friction must be accurately compensated in the real-time servo control algarithm. In this paper, the model of a hybrid flve-bar mechanism is introduced In terms of the characteristics of the hybrid mechanism, a hybrid intelligent control algorithm based on proportional-integral-derivative(PID) control and cerebellar model articulation control techniques was presented and used to perform control of hybrid five-bar mechanism for the first time. The simulation results show that the hybrid control method can improve the control effect remarkably, compared with the traditional PID control strategy.

  16. Parallel Robot Scheduling to Minimize Mean Tardiness with Unequal Release Date and Precedence Constraints Using a Hybrid Intelligent System

    Directory of Open Access Journals (Sweden)

    Tarık Çakar

    2012-12-01

    Full Text Available This paper considers the problem of scheduling a given number of jobs on a specified number of identical parallel robots with unequal release dates and precedence constraints in order to minimize mean tardiness. This problem is strongly NP-hard. The author proposes a hybrid intelligent solution system, which uses Genetic Algorithms and Simulated Annealing (GA+SA. A genetic algorithm, as is well known, is an efficient tool for the solution of combinatorial optimization problems. Solutions for problems of different scales are found using genetic algorithms, simulated annealing and a Hybrid Intelligent Solution System (HISS. Computational results of empirical experiments show that the Hybrid Intelligent Solution System (HISS is successful with regards to solution quality and computational time.

  17. Algorithmic Randomness as Foundation of Inductive Reasoning and Artificial Intelligence

    CERN Document Server

    Hutter, Marcus

    2011-01-01

    This article is a brief personal account of the past, present, and future of algorithmic randomness, emphasizing its role in inductive inference and artificial intelligence. It is written for a general audience interested in science and philosophy. Intuitively, randomness is a lack of order or predictability. If randomness is the opposite of determinism, then algorithmic randomness is the opposite of computability. Besides many other things, these concepts have been used to quantify Ockham's razor, solve the induction problem, and define intelligence.

  18. A Hybrid Evolutionary Algorithm for Discrete Optimization

    Directory of Open Access Journals (Sweden)

    J. Bhuvana

    2015-03-01

    Full Text Available Most of the real world multi-objective problems demand us to choose one Pareto optimal solution out of a finite set of choices. Flexible job shop scheduling problem is one such problem whose solutions are required to be selected from a discrete solution space. In this study we have designed a hybrid genetic algorithm to solve this scheduling problem. Hybrid genetic algorithms combine both the aspects of the search, exploration and exploitation of the search space. Proposed algorithm, Hybrid GA with Discrete Local Search, performs global search through the GA and exploits the locality through discrete local search. Proposed hybrid algorithm not only has the ability to generate Pareto optimal solutions and also identifies them with less computation. Five different benchmark test instances are used to evaluate the performance of the proposed algorithm. Results observed shown that the proposed algorithm has produced the known Pareto optimal solutions through exploration and exploitation of the search space with less number of functional evaluations.

  19. An Innovative Thinking-Based Intelligent Information Fusion Algorithm

    Directory of Open Access Journals (Sweden)

    Huimin Lu

    2013-01-01

    Full Text Available This study proposes an intelligent algorithm that can realize information fusion in reference to the relative research achievements in brain cognitive theory and innovative computation. This algorithm treats knowledge as core and information fusion as a knowledge-based innovative thinking process. Furthermore, the five key parts of this algorithm including information sense and perception, memory storage, divergent thinking, convergent thinking, and evaluation system are simulated and modeled. This algorithm fully develops innovative thinking skills of knowledge in information fusion and is a try to converse the abstract conception of brain cognitive science to specific and operable research routes and strategies. Furthermore, the influences of each parameter of this algorithm on algorithm performance are analyzed and compared with those of classical intelligent algorithms trough test. Test results suggest that the algorithm proposed in this study can obtain the optimum problem solution by less target evaluation times, improve optimization effectiveness, and achieve the effective fusion of information.

  20. Using Genetic Algorithms in Secured Business Intelligence Mobile Applications

    OpenAIRE

    Silvia TRIF

    2011-01-01

    The paper aims to assess the use of genetic algorithms for training neural networks used in secured Business Intelligence Mobile Applications. A comparison is made between classic back-propagation method and a genetic algorithm based training. The design of these algorithms is presented. A comparative study is realized for determining the better way of training neural networks, from the point of view of time and memory usage. The results show that genetic algorithms based training offer bette...

  1. Order to Disorder Transitions in Hybrid Intelligent Systems: a Hatch to the Interactions of Nations -Governments

    CERN Document Server

    Owladeghaffari, Hamed

    2008-01-01

    In this study, under general frame of MAny Connected Intelligent Particles Systems (MACIPS), we reproduce two new simple subsets of such intelligent complex network, namely hybrid intelligent systems, involved a few prominent intelligent computing and approximate reasoning methods: self organizing feature map (SOM), Neuro-Fuzzy Inference System and Rough Set Theory (RST). Over this, we show how our algorithms can be construed as a linkage of government-society interaction, where government catches various fashions of behavior: solid (absolute) or flexible. So, transition of such society, by changing of connectivity parameters (noise) from order to disorder is inferred. Add to this, one may find an indirect mapping among finical systems and eventual market fluctuations with MACIPS.

  2. A HYBRID FIREFLY ALGORITHM WITH FUZZY-C MEAN ALGORITHM FOR MRI BRAIN SEGMENTATION

    Directory of Open Access Journals (Sweden)

    Mutasem K. Alsmadi

    2014-01-01

    Full Text Available Image processing is one of the essential tasks to extract suspicious region and robust features from the Magnetic Resonance Imaging (MRI. A numbers of the segmentation algorithms were developed in order to satisfy and increasing the accuracy of brain tumor detection. In the medical image processing brain image segmentation is considered as a complex and challenging part. Fuzzy c-means is unsupervised method that has been implemented for clustering of the MRI and different purposes such as recognition of the pattern of interest and image segmentation. However; fuzzy c-means algorithm still suffers many drawbacks, such as low convergence rate, getting stuck in the local minima and vulnerable to initialization sensitivity. Firefly algorithm is a new population-based optimization method that has been used successfully for solving many complex problems. This paper proposed a new dynamic and intelligent clustering method for brain tumor segmentation using the hybridization of Firefly Algorithm (FA with Fuzzy C-Means algorithm (FCM. In order to automatically segment MRI brain images and improve the capability of the FCM to automatically elicit the proper number and location of cluster centres and the number of pixels in each cluster in the abnormal (multiple sclerosis lesions MRI images. The experimental results proved the effectiveness of the proposed FAFCM in enhancing the performance of the traditional FCM clustering. Moreover; the superiority of the FAFCM with other state-of-the-art segmentation methods is shown qualitatively and quantitatively. Conclusion: A novel efficient and reliable clustering algorithm presented in this work, which is called FAFCM based on the hybridization of the firefly algorithm with fuzzy c-mean clustering algorithm. Automatically; the hybridized algorithm has the capability to cluster and segment MRI brain images.

  3. Hybrid Genetic Algorithms with Fuzzy Logic Controller

    Institute of Scientific and Technical Information of China (English)

    2001-01-01

    In this paper, a new implementation of genetic algorithms (GAs) is developed for the machine scheduling problem, which is abundant among the modern manufacturing systems. The performance measure of early and tardy completion of jobs is very natural as one's aim, which is usually to minimize simultaneously both earliness and tardiness of all jobs. As the problem is NP-hard and no effective algorithms exist, we propose a hybrid genetic algorithms approach to deal with it. We adjust the crossover and mutation probabilities by fuzzy logic controller whereas the hybrid genetic algorithm does not require preliminary experiments to determine probabilities for genetic operators. The experimental results show the effectiveness of the GAs method proposed in the paper.``

  4. Multicast Routing Based on Hybrid Genetic Algorithm

    Institute of Scientific and Technical Information of China (English)

    CAO Yuan-da; CAI Gui

    2005-01-01

    A new multicast routing algorithm based on the hybrid genetic algorithm (HGA) is proposed. The coding pattern based on the number of routing paths is used. A fitness function that is computed easily and makes algorithm quickly convergent is proposed. A new approach that defines the HGA's parameters is provided. The simulation shows that the approach can increase largely the convergent ratio, and the fitting values of the parameters of this algorithm are different from that of the original algorithms. The optimal mutation probability of HGA equals 0.50 in HGA in the experiment, but that equals 0.07 in SGA. It has been concluded that the population size has a significant influence on the HGA's convergent ratio when it's mutation probability is bigger. The algorithm with a small population size has a high average convergent rate. The population size has little influence on HGA with the lower mutation probability.

  5. Credit Scoring Model Hybridizing Artificial Intelligence with Logistic Regression

    Directory of Open Access Journals (Sweden)

    Han Lu

    2013-01-01

    Full Text Available Today the most commonly used techniques for credit scoring are artificial intelligence and statistics. In this paper, we started a new way to use these two kinds of models. Through logistic regression filters the variables with a high degree of correlation, artificial intelligence models reduce complexity and accelerate convergence, while these models hybridizing logistic regression have better explanations in statistically significance, thus improve the effect of artificial intelligence models. With experiments on German data set, we find an interesting phenomenon defined as ‘Dimensional interference’ with support vector machine and from cross validation it can be seen that the new method gives a lot of help with credit scoring.

  6. New Hybrid Algorithm for Question Answering

    Directory of Open Access Journals (Sweden)

    Jaspreet Kaur

    2013-08-01

    Full Text Available With technical advancement, Question Answering has emerged as the main area for the researchers. User is provided with specific answers instead of large number of documents or passages in question answering. Question answering proposes the solution to acquire efficient and exact answers to user question asked in natural language rather than language query. The major goal of this paper is to develop a hybrid algorithm for question answering. For this task different question answering systems for different languages were studied. After deep study, we are able to develop an algorithm that comprises the best features from excellent systems. An algorithm developed by us performs well.

  7. A Hybrid Algorithm for Optimizing Multi- Modal Functions

    Institute of Scientific and Technical Information of China (English)

    Li Qinghua; Yang Shida; Ruan Youlin

    2006-01-01

    A new genetic algorithm is presented based on the musical performance. The novelty of this algorithm is that a new genetic algorithm, mimicking the musical process of searching for a perfect state of harmony, which increases the robustness of it greatly and gives a new meaning of it in the meantime, has been developed. Combining the advantages of the new genetic algorithm, simplex algorithm and tabu search, a hybrid algorithm is proposed. In order to verify the effectiveness of the hybrid algorithm, it is applied to solving some typical numerical function optimization problems which are poorly solved by traditional genetic algorithms. The experimental results show that the hybrid algorithm is fast and reliable.

  8. A hybrid differential evolution algorithm to vehicle routing problem with fuzzy demands

    Science.gov (United States)

    Erbao, Cao; Mingyong, Lai

    2009-09-01

    In this paper, the vehicle routing problem with fuzzy demands (VRPFD) is considered, and a fuzzy chance constrained program model is designed, based on fuzzy credibility theory. Then stochastic simulation and differential evolution algorithm are integrated to design a hybrid intelligent algorithm to solve the fuzzy chance constrained program model. Moreover, the influence of the dispatcher preference index on the final objective of the problem is discussed using stochastic simulation, and the best value of the dispatcher preference index is obtained.

  9. Using Genetic Algorithms in Secured Business Intelligence Mobile Applications

    Directory of Open Access Journals (Sweden)

    Silvia TRIF

    2011-01-01

    Full Text Available The paper aims to assess the use of genetic algorithms for training neural networks used in secured Business Intelligence Mobile Applications. A comparison is made between classic back-propagation method and a genetic algorithm based training. The design of these algorithms is presented. A comparative study is realized for determining the better way of training neural networks, from the point of view of time and memory usage. The results show that genetic algorithms based training offer better performance and memory usage than back-propagation and they are fit to be implemented on mobile devices.

  10. A Hybrid Intelligent Multisensor Positioning Methodology for Reliable Vehicle Navigation

    Directory of Open Access Journals (Sweden)

    Xu Li

    2015-01-01

    Full Text Available With the rapid development of intelligent transportation systems worldwide, it becomes more important to realize accurate and reliable vehicle positioning in various environments whether GPS is available or not. This paper proposes a hybrid intelligent multisensor positioning methodology fusing the information from low-cost sensors including GPS, MEMS-based strapdown inertial navigation system (SINS and electronic compass, and velocity constraint, which can achieve a significant performance improvement over the integration scheme only including GPS and MEMS-based SINS. First, the filter model of SINS aided by multiple sensors is presented in detail and then an improved Kalman filter with sequential measurement-update processing is developed to realize the filtering fusion. Further, a least square support vector machine- (LS SVM- based intelligent module is designed and augmented with the improved KF to constitute the hybrid positioning system. In case of GPS outages, the LS SVM-based intelligent module trained recently is used to predict the position error to achieve more accurate positioning performance. Finally, the proposed hybrid positioning method is evaluated and compared with traditional methods through real field test data. The experimental results validate the feasibility and effectiveness of the proposed method.

  11. A New Efficient Hybrid Intelligent Model for Biodegradation Process of DMP with Fuzzy Wavelet Neural Networks

    Science.gov (United States)

    Huang, Mingzhi; Zhang, Tao; Ruan, Jujun; Chen, Xiaohong

    2017-01-01

    A new efficient hybrid intelligent approach based on fuzzy wavelet neural network (FWNN) was proposed for effectively modeling and simulating biodegradation process of Dimethyl phthalate (DMP) in an anaerobic/anoxic/oxic (AAO) wastewater treatment process. With the self learning and memory abilities of neural networks (NN), handling uncertainty capacity of fuzzy logic (FL), analyzing local details superiority of wavelet transform (WT) and global search of genetic algorithm (GA), the proposed hybrid intelligent model can extract the dynamic behavior and complex interrelationships from various water quality variables. For finding the optimal values for parameters of the proposed FWNN, a hybrid learning algorithm integrating an improved genetic optimization and gradient descent algorithm is employed. The results show, compared with NN model (optimized by GA) and kinetic model, the proposed FWNN model have the quicker convergence speed, the higher prediction performance, and smaller RMSE (0.080), MSE (0.0064), MAPE (1.8158) and higher R2 (0.9851) values. which illustrates FWNN model simulates effluent DMP more accurately than the mechanism model.

  12. A New Efficient Hybrid Intelligent Model for Biodegradation Process of DMP with Fuzzy Wavelet Neural Networks

    Science.gov (United States)

    Huang, Mingzhi; Zhang, Tao; Ruan, Jujun; Chen, Xiaohong

    2017-01-01

    A new efficient hybrid intelligent approach based on fuzzy wavelet neural network (FWNN) was proposed for effectively modeling and simulating biodegradation process of Dimethyl phthalate (DMP) in an anaerobic/anoxic/oxic (AAO) wastewater treatment process. With the self learning and memory abilities of neural networks (NN), handling uncertainty capacity of fuzzy logic (FL), analyzing local details superiority of wavelet transform (WT) and global search of genetic algorithm (GA), the proposed hybrid intelligent model can extract the dynamic behavior and complex interrelationships from various water quality variables. For finding the optimal values for parameters of the proposed FWNN, a hybrid learning algorithm integrating an improved genetic optimization and gradient descent algorithm is employed. The results show, compared with NN model (optimized by GA) and kinetic model, the proposed FWNN model have the quicker convergence speed, the higher prediction performance, and smaller RMSE (0.080), MSE (0.0064), MAPE (1.8158) and higher R2 (0.9851) values. which illustrates FWNN model simulates effluent DMP more accurately than the mechanism model. PMID:28120889

  13. Hybrid Genetic Algorithms for University Course Timetabling

    Directory of Open Access Journals (Sweden)

    Meysam Shahvali Kohshori

    2012-03-01

    Full Text Available University course timetabling is one of the important and time consuming issues that each University is involved with it at the beginning of each. This problem is in class of NP-hard problem and is very difficult to solve by classic algorithms. Therefore optimization techniques are used to solve them and produce optimal or near optimal feasible solutions instead of exact solutions. Genetic algorithms, because of multidirectional search property of them, are considered as an efficient approach for solving this type of problems. In this paper three new hybrid genetic algorithms for solving the university course timetabling problem (UCTP are proposed: FGARI, FGASA and FGATS. In proposed algorithms, fuzzy logic is used to measure violation of soft constraints in fitness function to deal with inherent uncertainly and vagueness involved in real life data. Also, randomized iterative local search, simulated annealing and tabu search are applied, respectively, to improve exploitive search ability and prevent genetic algorithm to be trapped in local optimum. The experimental results indicate that the proposed algorithms are able to produce promising results for the UCTP.

  14. [Algorithms, machine intelligence, big data : general considerations].

    Science.gov (United States)

    Radermacher, F J

    2015-08-01

    We are experiencing astonishing developments in the areas of big data and artificial intelligence. They follow a pattern that we have now been observing for decades: according to Moore's Law,the performance and efficiency in the area of elementary arithmetic operations increases a thousand-fold every 20 years. Although we have not achieved the status where in the singular sense machines have become as "intelligent" as people, machines are becoming increasingly better. The Internet of Things has again helped to massively increase the efficiency of machines. Big data and suitable analytics do the same. If we let these processes simply continue, our civilization may be endangerd in many instances. If the "containment" of these processes succeeds in the context of a reasonable political global governance, a worldwide eco-social market economy, andan economy of green and inclusive markets, many desirable developments that are advantageous for our future may result. Then, at some point in time, the constant need for more and faster innovation may even stop. However, this is anything but certain. We are facing huge challenges.

  15. Genetic Algorithms, Neural Networks, and Time Effectiveness Algorithm Based Air Combat Intelligence Simulation System

    Institute of Scientific and Technical Information of China (English)

    曾宪钊; 成冀; 安欣; 方礼明

    2002-01-01

    This paper introduces a new Air Combat Intelligence Simulation System (ACISS) in a 32 versus 32 air combat, describes three methods: Genetic Algorithms (GA) in the multi-targeting decision and Evading Missile Rule Base learning, Neural Networks (NN) in the maneuvering decision, and Time Effectiveness Algorithm (TEA) in the adjudicating an air combat and the evaluating evading missile effectiveness.

  16. A solution quality assessment method for swarm intelligence optimization algorithms.

    Science.gov (United States)

    Zhang, Zhaojun; Wang, Gai-Ge; Zou, Kuansheng; Zhang, Jianhua

    2014-01-01

    Nowadays, swarm intelligence optimization has become an important optimization tool and wildly used in many fields of application. In contrast to many successful applications, the theoretical foundation is rather weak. Therefore, there are still many problems to be solved. One problem is how to quantify the performance of algorithm in finite time, that is, how to evaluate the solution quality got by algorithm for practical problems. It greatly limits the application in practical problems. A solution quality assessment method for intelligent optimization is proposed in this paper. It is an experimental analysis method based on the analysis of search space and characteristic of algorithm itself. Instead of "value performance," the "ordinal performance" is used as evaluation criteria in this method. The feasible solutions were clustered according to distance to divide solution samples into several parts. Then, solution space and "good enough" set can be decomposed based on the clustering results. Last, using relative knowledge of statistics, the evaluation result can be got. To validate the proposed method, some intelligent algorithms such as ant colony optimization (ACO), particle swarm optimization (PSO), and artificial fish swarm algorithm (AFS) were taken to solve traveling salesman problem. Computational results indicate the feasibility of proposed method.

  17. Improving Search Algorithms by Using Intelligent Coordinates

    Science.gov (United States)

    Wolpert, David H.; Tumer, Kagan; Bandari, Esfandiar

    2004-01-01

    We consider algorithms that maximize a global function G in a distributed manner, using a different adaptive computational agent to set each variable of the underlying space. Each agent eta is self-interested; it sets its variable to maximize its own function g (sub eta). Three factors govern such a distributed algorithm's performance, related to exploration/exploitation, game theory, and machine learning. We demonstrate how to exploit alI three factors by modifying a search algorithm's exploration stage: rather than random exploration, each coordinate of the search space is now controlled by a separate machine-learning-based player engaged in a noncooperative game. Experiments demonstrate that this modification improves simulated annealing (SA) by up to an order of magnitude for bin packing and for a model of an economic process run over an underlying network. These experiments also reveal interesting small-world phenomena.

  18. Hybrid Systems for Knowledge Representation in Artificial Intelligence

    Directory of Open Access Journals (Sweden)

    Rajeswari P.V N

    2012-11-01

    Full Text Available There are few knowledge representation (KR techniques available for efficiently representing knowledge. However, with the increase in complexity, better methods are needed. Some researchers came up with hybrid mechanisms by combining two or more methods. In an effort to construct an intelligent computer system, a primary consideration is to represent large amounts of knowledge in a way that allows effective use and efficiently organizing information to facilitate making the recommended inferences. There are merits and demerits of combinations, and standardized method of KR is needed. In this paper, various hybrid schemes of KR were explored at length and details presented.

  19. [Heart rate measurement algorithm based on artificial intelligence].

    Science.gov (United States)

    Chengxian, Cai; Wei, Wang

    2010-01-01

    Based on the heart rate measurement method using time-lapse image of human cheek, this paper proposes a novel measurement algorithm based on Artificial Intelligence. The algorithm combining with fuzzy logic theory acquires the heart beat point by using the defined fuzzy membership function of each sampled point. As a result, it calculates the heart rate by counting the heart beat points in a certain time period. Experiment shows said algorithm satisfies in operability, accuracy and robustness, which leads to constant practical value.

  20. AN INTELLIGENT VERTICAL HANDOVER DECISION ALGORITHM FOR WIRELESS HETEROGENEOUS NETWORKS

    Directory of Open Access Journals (Sweden)

    V. Anantha Narayanan

    2014-01-01

    Full Text Available The Next Generation Wireless Networks (NGWN should be compatible with other communication technologies to offer the best connectivity to the mobile terminal which can access any IP based services at any time from any network without the knowledge of its user. It requires an intelligent vertical handover decision making algorithm to migrate between technologies that enable seamless mobility, always best connection and minimal terminal power consumption. Currently existing decision engines are simple, proprietary and its handover is only based on the received signal strength which has been proven unintelligent. The proposed decision algorithm gains intelligence by combining fuzzy logic system to handle imprecise data, multiple attribute decision making to handle multiple attributes for decision making and context aware strategies to reduce unnecessary handover. The proposed intelligent decision algorithm detects new network which offers best connectivity than current network and does authentication and mobile IP registration before making the handover; thereby reducing the packet loss to ensure high quality of service. This algorithm is capable of forwarding data packets to appropriate attachment point to maximize battery lifetime and also to maintain load balancing. The performance analysis shows that the proposed algorithm efficiently uses the network resources by switching between 3G and Wi-Fi under the different RF environmental conditions to offer best connectivity with minimal service cost to the users. It is observed that average handover delay for the experiment is 30-40ms and the integration of cellular network with WLAN using the proposed intelligent decision algorithm reduces the call dropping rate (<0.006 and call blocking probability (<0.00607 as well as unnecessary handover in heterogeneous networks.

  1. Adaptive Identification of Logging Lithology Based on VPSO-ENN Hybrid Algorithm

    Institute of Scientific and Technical Information of China (English)

    GUO Jian; WANG Yuan-han; LI Yin-ping

    2008-01-01

    Particle swarm optimization (PSO) was modified by variation method of particle velocity, and a variation PSO (VPSO) algorithm was proposed to overcome the shortcomings of PSO, such as premature convergence and local optimization. The VPSO algorithm is combined with Elman neural network (ENN) to form a VPSO-ENN hybrid algorithm. Compared with the hybrid algorithm of genetic algorithm (GA) and BP neural network (GA-BP), VPSO-ENN has less adjustable parameters, faster convergence speed and higher identification precision in the numerical experiment. A system for identifying logging parameters was established based on VPSO-ENN. The results of an engineering case indicate that the intelligent identification system is effective in the lithology identification.

  2. Cluster hybrid Monte Carlo simulation algorithms

    Science.gov (United States)

    Plascak, J. A.; Ferrenberg, Alan M.; Landau, D. P.

    2002-06-01

    We show that addition of Metropolis single spin flips to the Wolff cluster-flipping Monte Carlo procedure leads to a dramatic increase in performance for the spin-1/2 Ising model. We also show that adding Wolff cluster flipping to the Metropolis or heat bath algorithms in systems where just cluster flipping is not immediately obvious (such as the spin-3/2 Ising model) can substantially reduce the statistical errors of the simulations. A further advantage of these methods is that systematic errors introduced by the use of imperfect random-number generation may be largely healed by hybridizing single spin flips with cluster flipping.

  3. A hybrid CS-SA intelligent approach to solve uncertain dynamic facility layout problems considering dependency of demands

    Science.gov (United States)

    Moslemipour, Ghorbanali

    2017-07-01

    This paper aims at proposing a quadratic assignment-based mathematical model to deal with the stochastic dynamic facility layout problem. In this problem, product demands are assumed to be dependent normally distributed random variables with known probability density function and covariance that change from period to period at random. To solve the proposed model, a novel hybrid intelligent algorithm is proposed by combining the simulated annealing and clonal selection algorithms. The proposed model and the hybrid algorithm are verified and validated using design of experiment and benchmark methods. The results show that the hybrid algorithm has an outstanding performance from both solution quality and computational time points of view. Besides, the proposed model can be used in both of the stochastic and deterministic situations.

  4. INTELLIGENT APRIORI ALGORITHM FOR COMPLEX ACTIVITY MINING IN SUPERMARKET APPLICATIONS

    Directory of Open Access Journals (Sweden)

    V. Ganesh Kumar

    2013-01-01

    Full Text Available As shopping becomes a shared experience and joint process with friends or family members nowadays, the most important problems arise with variety of products and the product information available in the supermarkets. This study proposes a system that uses Intelligent Apriori algorithm to support consumers in getting the required items from various supermarkets. Also this work intelligently suggests the best movement and reducing unwanted movement of the customer and quickly finds out the next operation which includes the next supermarket which is visited by the customer for the next item he/she purchases. This approach can further be extended to the world of mobile communication where the next movement of the mobile user can be predicted and used intelligently to arrange necessary requirements at the destination before he actually reaches. The feasibility of this approach is tested under simple conditions and the results are presented in this study.

  5. A Hybrid Algorithm Based on ACO and PSO for Capacitated Vehicle Routing Problems

    Directory of Open Access Journals (Sweden)

    Yucheng Kao

    2012-01-01

    Full Text Available The vehicle routing problem (VRP is a well-known combinatorial optimization problem. It has been studied for several decades because finding effective vehicle routes is an important issue of logistic management. This paper proposes a new hybrid algorithm based on two main swarm intelligence (SI approaches, ant colony optimization (ACO and particle swarm optimization (PSO, for solving capacitated vehicle routing problems (CVRPs. In the proposed algorithm, each artificial ant, like a particle in PSO, is allowed to memorize the best solution ever found. After solution construction, only elite ants can update pheromone according to their own best-so-far solutions. Moreover, a pheromone disturbance method is embedded into the ACO framework to overcome the problem of pheromone stagnation. Two sets of benchmark problems were selected to test the performance of the proposed algorithm. The computational results show that the proposed algorithm performs well in comparison with existing swarm intelligence approaches.

  6. A Review of Intelligent Driving Style Analysis Systems and Related Artificial Intelligence Algorithms.

    Science.gov (United States)

    Meiring, Gys Albertus Marthinus; Myburgh, Hermanus Carel

    2015-12-04

    In this paper the various driving style analysis solutions are investigated. An in-depth investigation is performed to identify the relevant machine learning and artificial intelligence algorithms utilised in current driver behaviour and driving style analysis systems. This review therefore serves as a trove of information, and will inform the specialist and the student regarding the current state of the art in driver style analysis systems, the application of these systems and the underlying artificial intelligence algorithms applied to these applications. The aim of the investigation is to evaluate the possibilities for unique driver identification utilizing the approaches identified in other driver behaviour studies. It was found that Fuzzy Logic inference systems, Hidden Markov Models and Support Vector Machines consist of promising capabilities to address unique driver identification algorithms if model complexity can be reduced.

  7. DIAGNOSIS WINDOWS PROBLEMS BASED ON HYBRID INTELLIGENCE SYSTEMS

    Directory of Open Access Journals (Sweden)

    SAFWAN O. HASOON

    2013-10-01

    Full Text Available This paper describes the artificial intelligence technologies by integrating Radial Basis Function networks with expert systems to construct a robust hybrid system. The purpose of building the hybrid system is to give recommendations to repair the operating system (Windows problems and troubleshoot the problems that can be repaired. The neural network has unique characteristics which it can complete the uncompleted data, the expert system can't deal with data that is incomplete, but using the neural network individually has some disadvantages which it can't give explanations and recommendations to the problems. The expert system has the ability to explain and give recommendations by using the rules and the human expert in some conditions. Therefore, we have combined the two technologies. The paper will explain the integration methods between the two technologies and which method is suitable to be used in the proposed hybrid system.

  8. Hybrid swarm intelligence optimization approach for optimal data storage position identification in wireless sensor networks.

    Science.gov (United States)

    Mohanasundaram, Ranganathan; Periasamy, Pappampalayam Sanmugam

    2015-01-01

    The current high profile debate with regard to data storage and its growth have become strategic task in the world of networking. It mainly depends on the sensor nodes called producers, base stations, and also the consumers (users and sensor nodes) to retrieve and use the data. The main concern dealt here is to find an optimal data storage position in wireless sensor networks. The works that have been carried out earlier did not utilize swarm intelligence based optimization approaches to find the optimal data storage positions. To achieve this goal, an efficient swam intelligence approach is used to choose suitable positions for a storage node. Thus, hybrid particle swarm optimization algorithm has been used to find the suitable positions for storage nodes while the total energy cost of data transmission is minimized. Clustering-based distributed data storage is utilized to solve clustering problem using fuzzy-C-means algorithm. This research work also considers the data rates and locations of multiple producers and consumers to find optimal data storage positions. The algorithm is implemented in a network simulator and the experimental results show that the proposed clustering and swarm intelligence based ODS strategy is more effective than the earlier approaches.

  9. Hybrid Swarm Intelligence Optimization Approach for Optimal Data Storage Position Identification in Wireless Sensor Networks

    Directory of Open Access Journals (Sweden)

    Ranganathan Mohanasundaram

    2015-01-01

    Full Text Available The current high profile debate with regard to data storage and its growth have become strategic task in the world of networking. It mainly depends on the sensor nodes called producers, base stations, and also the consumers (users and sensor nodes to retrieve and use the data. The main concern dealt here is to find an optimal data storage position in wireless sensor networks. The works that have been carried out earlier did not utilize swarm intelligence based optimization approaches to find the optimal data storage positions. To achieve this goal, an efficient swam intelligence approach is used to choose suitable positions for a storage node. Thus, hybrid particle swarm optimization algorithm has been used to find the suitable positions for storage nodes while the total energy cost of data transmission is minimized. Clustering-based distributed data storage is utilized to solve clustering problem using fuzzy-C-means algorithm. This research work also considers the data rates and locations of multiple producers and consumers to find optimal data storage positions. The algorithm is implemented in a network simulator and the experimental results show that the proposed clustering and swarm intelligence based ODS strategy is more effective than the earlier approaches.

  10. Innovative computational intelligence a rough guide to 134 clever algorithms

    CERN Document Server

    Xing, Bo

    2014-01-01

    The present book Innovative Computational Intelligence: A Rough Guide to 134 Clever Algorithms is compilation of recent trends in computational intelligence (CI) research using inspiration from various sources such as biology, physics, chemistry, and mathematics. Innovative CI, unlike its counterparts, i.e., highly developed and refined traditional CI, is a new CI category introduced in the present book. The major notable feature of this book is its innovation and comprehensiveness: 134 new paradigms of CI are covered and most of them are usually spread over a number of unrelated publishing directions. This book is useful to multidisciplinary students including such as aeronautic engineering, mechanical engineering, industrial engineering, electrical and electronic engineering, chemical engineering, computer science, applied mathematics, physics, economy, biology, and social science, particularly those pursuing postgraduate studies in advanced subjects. Moreover, the algorithms introduced in this book can mot...

  11. AN INTELLIGENT VERTICAL HANDOVER DECISION ALGORITHM FOR WIRELESS HETEROGENEOUS NETWORKS

    OpenAIRE

    V. Anantha Narayanan; A. Rajeswari; V. Sureshkumar

    2014-01-01

    The Next Generation Wireless Networks (NGWN) should be compatible with other communication technologies to offer the best connectivity to the mobile terminal which can access any IP based services at any time from any network without the knowledge of its user. It requires an intelligent vertical handover decision making algorithm to migrate between technologies that enable seamless mobility, always best connection and minimal terminal power consumption. Currently existing decision engines are...

  12. Ouroboros: A Tool for Building Generic, Hybrid, Divide& Conquer Algorithms

    Energy Technology Data Exchange (ETDEWEB)

    Johnson, J R; Foster, I

    2003-05-01

    A hybrid divide and conquer algorithm is one that switches from a divide and conquer to an iterative strategy at a specified problem size. Such algorithms can provide significant performance improvements relative to alternatives that use a single strategy. However, the identification of the optimal problem size at which to switch for a particular algorithm and platform can be challenging. We describe an automated approach to this problem that first conducts experiments to explore the performance space on a particular platform and then uses the resulting performance data to construct an optimal hybrid algorithm on that platform. We implement this technique in a tool, ''Ouroboros'', that automatically constructs a high-performance hybrid algorithm from a set of registered algorithms. We present results obtained with this tool for several classical divide and conquer algorithms, including matrix multiply and sorting, and report speedups of up to six times achieved over non-hybrid algorithms.

  13. An intelligent active force control algorithm to control an upper extremity exoskeleton for motor recovery

    Science.gov (United States)

    Hasbullah Mohd Isa, Wan; Taha, Zahari; Mohd Khairuddin, Ismail; Majeed, Anwar P. P. Abdul; Fikri Muhammad, Khairul; Abdo Hashem, Mohammed; Mahmud, Jamaluddin; Mohamed, Zulkifli

    2016-02-01

    This paper presents the modelling and control of a two degree of freedom upper extremity exoskeleton by means of an intelligent active force control (AFC) mechanism. The Newton-Euler formulation was used in deriving the dynamic modelling of both the anthropometry based human upper extremity as well as the exoskeleton that consists of the upper arm and the forearm. A proportional-derivative (PD) architecture is employed in this study to investigate its efficacy performing joint-space control objectives. An intelligent AFC algorithm is also incorporated into the PD to investigate the effectiveness of this hybrid system in compensating disturbances. The Mamdani Fuzzy based rule is employed to approximate the estimated inertial properties of the system to ensure the AFC loop responds efficiently. It is found that the IAFC-PD performed well against the disturbances introduced into the system as compared to the conventional PD control architecture in performing the desired trajectory tracking.

  14. Development of hybrid genetic algorithms for product line designs.

    Science.gov (United States)

    Balakrishnan, P V Sundar; Gupta, Rakesh; Jacob, Varghese S

    2004-02-01

    In this paper, we investigate the efficacy of artificial intelligence (AI) based meta-heuristic techniques namely genetic algorithms (GAs), for the product line design problem. This work extends previously developed methods for the single product design problem. We conduct a large scale simulation study to determine the effectiveness of such an AI based technique for providing good solutions and bench mark the performance of this against the current dominant approach of beam search (BS). We investigate the potential advantages of pursuing the avenue of developing hybrid models and then implement and study such hybrid models using two very distinct approaches: namely, seeding the initial GA population with the BS solution, and employing the BS solution as part of the GA operator's process. We go on to examine the impact of two alternate string representation formats on the quality of the solutions obtained by the above proposed techniques. We also explicitly investigate a critical managerial factor of attribute importance in terms of its impact on the solutions obtained by the alternate modeling procedures. The alternate techniques are then evaluated, using statistical analysis of variance, on a fairy large number of data sets, as to the quality of the solutions obtained with respect to the state-of-the-art benchmark and in terms of their ability to provide multiple, unique product line options.

  15. New Hybrid Genetic Algorithm for Vertex Cover Problems

    Institute of Scientific and Technical Information of China (English)

    霍红卫; 许进

    2003-01-01

    This paper presents a new hybrid genetic algorithm for the vertex cover problems in which scan-repair and local improvement techniques are used for local optimization. With the hybrid approach, genetic algorithms are used to perform global exploration in a population, while neighborhood search methods are used to perform local exploitation around the chromosomes. The experimental results indicate that hybrid genetic algorithms can obtain solutions of excellent quality to the problem instances with different sizes. The pure genetic algorithms are outperformed by the neighborhood search heuristics procedures combined with genetic algorithms.

  16. Solving the Quadratic Assignment Problem by a Hybrid Algorithm

    Directory of Open Access Journals (Sweden)

    Aldy Gunawan

    2011-01-01

    Full Text Available This paper presents a hybrid algorithm to solve the Quadratic Assignment Problem (QAP. The proposed algorithm involves using the Greedy Randomized Adaptive Search Procedure (GRASP to obtain an initial solution, and then using a combined Simulated Annealing (SA and Tabu Search (TS algorithm to improve the solution. Experimental results  indicate that the hybrid algorithm is able to obtain good quality solutions for QAPLIB test problems within reasonable computation time.

  17. Swarm Intelligence-Based Hybrid Models for Short-Term Power Load Prediction

    Directory of Open Access Journals (Sweden)

    Jianzhou Wang

    2014-01-01

    Full Text Available Swarm intelligence (SI is widely and successfully applied in the engineering field to solve practical optimization problems because various hybrid models, which are based on the SI algorithm and statistical models, are developed to further improve the predictive abilities. In this paper, hybrid intelligent forecasting models based on the cuckoo search (CS as well as the singular spectrum analysis (SSA, time series, and machine learning methods are proposed to conduct short-term power load prediction. The forecasting performance of the proposed models is augmented by a rolling multistep strategy over the prediction horizon. The test results are representative of the out-performance of the SSA and CS in tuning the seasonal autoregressive integrated moving average (SARIMA and support vector regression (SVR in improving load forecasting, which indicates that both the SSA-based data denoising and SI-based intelligent optimization strategy can effectively improve the model’s predictive performance. Additionally, the proposed CS-SSA-SARIMA and CS-SSA-SVR models provide very impressive forecasting results, demonstrating their strong robustness and universal forecasting capacities in terms of short-term power load prediction 24 hours in advance.

  18. Improved hand tracking algorithm in video sequences for intelligent rehabilitation

    Institute of Scientific and Technical Information of China (English)

    LI Ling; LUO Yuan; ZHANG Yi; ZHANG Bai-sheng

    2009-01-01

    Intelligent rehabilitation system is an active research topic. It is motivated by the increased number of limb disabled patients. Human motion tracking is the key technology of intelligent rehabilitation system, because the movement of limb disabled patients needs to be localized and learned so that any undesired motion behavior can be corrected in order to reach an expectation. This paper introduces a real-time tracking system of human hand motion, specifically intent to be used for home rehabilitation. Vision sensor (camera) is employed in this system to track the hand movement, and the improved Camshift algorithm and Kalman filter are used to implement dynamic hand tracking in the video. CAMSHIFT algorithm is able to track any kind of target colors by building a histogram distribution of the H channel in HSV color space from the region of interests selected by users at the initial stage. Kalman filter is able to predict hand location in one image frame based on its location data detected in the previous frame. The experimental results show that this system can track 2D hand motion and has acceptable accuracy by using the two algorithms properly. The new algorithm proposed in this paper can not only deal with the skin color interference problems, but also deal well with the track of complex background.

  19. ARTIFICIAL NEURAL NETWORKS BASED GEARS MATERIAL SELECTION HYBRID INTELLIGENT SYSTEM

    Institute of Scientific and Technical Information of China (English)

    X.C. Li; W.X. Zhu; G. Chen; D.S. Mei; J. Zhang; K.M. Chen

    2003-01-01

    An artificial neural networks(ANNs) based gear material selection hybrid intelligent system is established by analyzing the individual advantages and weakness of expert system (ES) and ANNs and the applications in material select of them. The system mainly consists of tow parts: ES and ANNs. By being trained with much data samples,the back propagation (BP) ANN gets the knowledge of gear materials selection, and is able to inference according to user input. The system realizes the complementing of ANNs and ES. Using this system, engineers without materials selection experience can conveniently deal with gear materials selection.

  20. A Hybrid Aggressive Space Mapping Algorithm for EM Optimization

    DEFF Research Database (Denmark)

    Bakr, M.; Bandler, J. W.; Georgieva, N.;

    1999-01-01

    We present a novel, Hybrid Aggressive Space Mapping (HASM) optimization algorithm. HASM is a hybrid approach exploiting both the Trust Region Aggressive Space Mapping (TRASM) algorithm and direct optimization. It does not assume that the final space-mapped design is the true optimal design and is...

  1. New MPPT algorithm based on hybrid dynamical theory

    KAUST Repository

    Elmetennani, Shahrazed

    2014-11-01

    This paper presents a new maximum power point tracking algorithm based on the hybrid dynamical theory. A multiceli converter has been considered as an adaptation stage for the photovoltaic chain. The proposed algorithm is a hybrid automata switching between eight different operating modes, which has been validated by simulation tests under different working conditions. © 2014 IEEE.

  2. A Hybrid Intelligent Method of Predicting Stock Returns

    Directory of Open Access Journals (Sweden)

    Akhter Mohiuddin Rather

    2014-01-01

    Full Text Available This paper proposes a novel method for predicting stock returns by means of a hybrid intelligent model. Initially predictions are obtained by a linear model, and thereby prediction errors are collected and fed into a recurrent neural network which is actually an autoregressive moving reference neural network. Recurrent neural network results in minimized prediction errors because of nonlinear processing and also because of its configuration. These prediction errors are used to obtain final predictions by summation method as well as by multiplication method. The proposed model is thus hybrid of both a linear and a nonlinear model. The model has been tested on stock data obtained from National Stock Exchange of India. The results indicate that the proposed model can be a promising approach in predicting future stock movements.

  3. Pitch Based Wind Turbine Intelligent Speed Setpoint Adjustment Algorithms

    Directory of Open Access Journals (Sweden)

    Asier González-González

    2014-06-01

    Full Text Available This work is aimed at optimizing the wind turbine rotor speed setpoint algorithm. Several intelligent adjustment strategies have been investigated in order to improve a reward function that takes into account the power captured from the wind and the turbine speed error. After different approaches including Reinforcement Learning, the best results were obtained using a Particle Swarm Optimization (PSO-based wind turbine speed setpoint algorithm. A reward improvement of up to 10.67% has been achieved using PSO compared to a constant approach and 0.48% compared to a conventional approach. We conclude that the pitch angle is the most adequate input variable for the turbine speed setpoint algorithm compared to others such as rotor speed, or rotor angular acceleration.

  4. Hybrid intelligent methodology to design translation invariant morphological operators for Brazilian stock market prediction.

    Science.gov (United States)

    Araújo, Ricardo de A

    2010-12-01

    This paper presents a hybrid intelligent methodology to design increasing translation invariant morphological operators applied to Brazilian stock market prediction (overcoming the random walk dilemma). The proposed Translation Invariant Morphological Robust Automatic phase-Adjustment (TIMRAA) method consists of a hybrid intelligent model composed of a Modular Morphological Neural Network (MMNN) with a Quantum-Inspired Evolutionary Algorithm (QIEA), which searches for the best time lags to reconstruct the phase space of the time series generator phenomenon and determines the initial (sub-optimal) parameters of the MMNN. Each individual of the QIEA population is further trained by the Back Propagation (BP) algorithm to improve the MMNN parameters supplied by the QIEA. Also, for each prediction model generated, it uses a behavioral statistical test and a phase fix procedure to adjust time phase distortions observed in stock market time series. Furthermore, an experimental analysis is conducted with the proposed method through four Brazilian stock market time series, and the achieved results are discussed and compared to results found with random walk models and the previously introduced Time-delay Added Evolutionary Forecasting (TAEF) and Morphological-Rank-Linear Time-lag Added Evolutionary Forecasting (MRLTAEF) methods.

  5. A Fast Hybrid Algorithm for the Exact String Matching Problem

    Directory of Open Access Journals (Sweden)

    Abdulwahab A. Al-mazroi

    2011-01-01

    Full Text Available Problem statement: Due to huge amount and complicated nature of data being generated recently, the usage of one algorithm for string searching was not sufficient to ensure faster search and matching of patterns. So there is the urgent need to integrate two or more algorithms to form a hybrid algorithm (called BRSS to ensure speedy results. Approach: This study proposes the combination of two algorithms namely Berry-Ravindran and Skip Search Algorithms to form a hybrid algorithm in order to boost search performance. Results: The proposed hybrid algorithm contributes to better results by reducing the number of attempts, number of character comparisons and searching time. The performance of the hybrid was tested using different types of data-DNA, Protein and English text. The percentage of the improvements of the hybrid algorithm compared to Berry-Ravindran in DNA, Protein and English text are 50%, 43% and 44% respectively. The percentage of the improvements over Skip Search algorithm in DNA, Protein and English text are 20%, 30% and 18% respectively. The criteria applied for evaluation are number of attempts, number of character comparisons and searching time. Conclusion: The study shows how the integration of two algorithms gives better results than the original algorithms even the same data size and pattern lengths are applied as test evaluation on each of the algorithms.

  6. Video Analytics Algorithm for Automatic Vehicle Classification (Intelligent Transport System

    Directory of Open Access Journals (Sweden)

    ArtaIftikhar

    2013-04-01

    Full Text Available Automated Vehicle detection and classification is an important component of intelligent transport system. Due to significant importance in various fields such as traffic accidents avoidance, toll collection, congestion avoidance, terrorist activities monitoring, security and surveillance systems, intelligent transport system has become important field of study. Various technologies have been used for detecting and classifying vehicles automatically. Automated vehicle detection is broadly divided into two types- Hardware based and software based detection. Various algorithms have been implemented to classify different vehicles from videos. In this paper an efficient and economical solution for automatic vehicle detection and classification is proposed. The proposed system first isolates the object through background subtraction followed by vehicle detection using ontology. Vehicle detection is based on low level features such as shape, size, and spatial location. Finally system classifies vehicles into one of the known classes of vehicle based on size.

  7. An Intelligent Model for Pairs Trading Using Genetic Algorithms.

    Science.gov (United States)

    Huang, Chien-Feng; Hsu, Chi-Jen; Chen, Chi-Chung; Chang, Bao Rong; Li, Chen-An

    2015-01-01

    Pairs trading is an important and challenging research area in computational finance, in which pairs of stocks are bought and sold in pair combinations for arbitrage opportunities. Traditional methods that solve this set of problems mostly rely on statistical methods such as regression. In contrast to the statistical approaches, recent advances in computational intelligence (CI) are leading to promising opportunities for solving problems in the financial applications more effectively. In this paper, we present a novel methodology for pairs trading using genetic algorithms (GA). Our results showed that the GA-based models are able to significantly outperform the benchmark and our proposed method is capable of generating robust models to tackle the dynamic characteristics in the financial application studied. Based upon the promising results obtained, we expect this GA-based method to advance the research in computational intelligence for finance and provide an effective solution to pairs trading for investment in practice.

  8. An Intelligent Model for Pairs Trading Using Genetic Algorithms

    Science.gov (United States)

    Hsu, Chi-Jen; Chen, Chi-Chung; Li, Chen-An

    2015-01-01

    Pairs trading is an important and challenging research area in computational finance, in which pairs of stocks are bought and sold in pair combinations for arbitrage opportunities. Traditional methods that solve this set of problems mostly rely on statistical methods such as regression. In contrast to the statistical approaches, recent advances in computational intelligence (CI) are leading to promising opportunities for solving problems in the financial applications more effectively. In this paper, we present a novel methodology for pairs trading using genetic algorithms (GA). Our results showed that the GA-based models are able to significantly outperform the benchmark and our proposed method is capable of generating robust models to tackle the dynamic characteristics in the financial application studied. Based upon the promising results obtained, we expect this GA-based method to advance the research in computational intelligence for finance and provide an effective solution to pairs trading for investment in practice. PMID:26339236

  9. An Efficient Multi-path Routing Algorithm Based on Hybrid Firefly Algorithm for Wireless Mesh Networks

    Directory of Open Access Journals (Sweden)

    K. Kumaravel

    2015-05-01

    Full Text Available Wireless Mesh Network (WMN uses the latest technology which helps in providing end users a high quality service referred to as the Internet’s “last mile”. Also considering WMN one of the most important technologies that are employed is multicast communication. Among the several issues routing which is significantly an important issue is addressed by every WMN technologies and this is done during the process of data transmission. The IEEE 802.11s Standard entails and sets procedures which need to be followed to facilitate interconnection and thus be able to devise an appropriate WMN. There has been introduction of several protocols by many authors which are mainly devised on the basis of machine learning and artificial intelligence. Multi-path routing may be considered as one such routing method which facilitates transmission of data over several paths, proving its capabilities as a useful strategy for achieving reliability in WMN. Though, multi-path routing in any manner cannot really guarantee deterministic transmission. As here there are multiple paths available for enabling data transmission from source to destination node. The algorithm that had been employed before in the studies conducted did not take in to consideration routing metrics which include energy aware metrics that are used for path selection during transferring of data. The following study proposes use of the hybrid multipath routing algorithm while taking in to consideration routing metrics which include energy, minimal loss for efficient path selection and transferring of data. Proposed algorithm here has two phases. In the first phase prim’s algorithm has been proposed so that in networks route discovery may be possible. For the second one the Hybrid firefly algorithm which is based on harmony search has been employed for selection of the most suitable and best through proper analysis of metrics which include energy awareness and minimal loss for every path that has

  10. Body Fat Percentage Prediction Using Intelligent Hybrid Approaches

    Directory of Open Access Journals (Sweden)

    Yuehjen E. Shao

    2014-01-01

    Full Text Available Excess of body fat often leads to obesity. Obesity is typically associated with serious medical diseases, such as cancer, heart disease, and diabetes. Accordingly, knowing the body fat is an extremely important issue since it affects everyone’s health. Although there are several ways to measure the body fat percentage (BFP, the accurate methods are often associated with hassle and/or high costs. Traditional single-stage approaches may use certain body measurements or explanatory variables to predict the BFP. Diverging from existing approaches, this study proposes new intelligent hybrid approaches to obtain fewer explanatory variables, and the proposed forecasting models are able to effectively predict the BFP. The proposed hybrid models consist of multiple regression (MR, artificial neural network (ANN, multivariate adaptive regression splines (MARS, and support vector regression (SVR techniques. The first stage of the modeling includes the use of MR and MARS to obtain fewer but more important sets of explanatory variables. In the second stage, the remaining important variables are served as inputs for the other forecasting methods. A real dataset was used to demonstrate the development of the proposed hybrid models. The prediction results revealed that the proposed hybrid schemes outperformed the typical, single-stage forecasting models.

  11. Design and Implementation of Navigation Algorithm for Intelligent Racing Car

    Directory of Open Access Journals (Sweden)

    Praween Sinha

    2011-02-01

    Full Text Available Design and implementation of navigation algorithm for intelligent racing car. The paper describes the implementation of intelligent racing car that can recognize the track automatically to run onthe specifically designed complex racing track. The objective is to recognize and and modify the actual performance of the movements of the car during its pathway by getting information in real time from IRsensors in the system. The travel trajectory consists of continuous black line of about 25 millimeters in width, on a white background in order to have acceptable functioning. Analyzing of the sensor readingswas done during the travel, capturing data at the fixed sampling rate and this data was used as inputs to the newly developed algorithm to achieve corrections on the decision speed and control movements. Amicrocontroller assigns the required movement turn and speeds to optimize the performance in order to get a closer behavior as humans could do it without a vision system to catch its environment. The task of this work was to develop an efficient navigation algorithm and it has been successfully implemented in a Motorola S12X 16-bit microcontroller.

  12. A HYBRID THINNING ALGORITHM FOR BINARY TOPOGRAPHY MAP

    Institute of Scientific and Technical Information of China (English)

    2001-01-01

    A hybrid thinning algorithm for binary topography maps is proposed on the basis of parallel thinning templates in this paper.The algorithm has a high processing speed and the strong ability of noise immunity and preservation of connectivity and skeleton symmetry. Experimental results show that the algorithm can solve t he thinning problem of binary maps effectively.

  13. A Hybrid Differential Invasive Weed Algorithm for Congestion Management

    Science.gov (United States)

    Basak, Aniruddha; Pal, Siddharth; Pandi, V. Ravikumar; Panigrahi, B. K.; Das, Swagatam

    This work is dedicated to solve the problem of congestion management in restructured power systems. Nowadays we have open access market which pushes the power system operation to their limits for maximum economic benefits but at the same time making the system more susceptible to congestion. In this regard congestion management is absolutely vital. In this paper we try to remove congestion by generation rescheduling where the cost involved in the rescheduling process is minimized. The proposed algorithm is a hybrid of Invasive Weed Optimization (IWO) and Differential Evolution (DE). The resultant hybrid algorithm was applied on standard IEEE 30 bus system and observed to beat existing algorithms like Simple Bacterial foraging (SBF), Genetic Algorithm (GA), Invasive Weed Optimization (IWO), Differential Evolution (DE) and hybrid algorithms like Hybrid Bacterial Foraging and Differential Evolution (HBFDE) and Adaptive Bacterial Foraging with Nelder Mead (ABFNM).

  14. Swarm Intelligence for Optimizing Hybridized Smoothing Filter in Image Edge Enhancement

    Science.gov (United States)

    Rao, B. Tirumala; Dehuri, S.; Dileep, M.; Vindhya, A.

    In this modern era, image transmission and processing plays a major role. It would be impossible to retrieve information from satellite and medical images without the help of image processing techniques. Edge enhancement is an image processing step that enhances the edge contrast of an image or video in an attempt to improve its acutance. Edges are the representations of the discontinuities of image intensity functions. For processing these discontinuities in an image, a good edge enhancement technique is essential. The proposed work uses a new idea for edge enhancement using hybridized smoothening filters and we introduce a promising technique of obtaining best hybrid filter using swarm algorithms (Artificial Bee Colony (ABC), Particle Swarm Optimization (PSO) and Ant Colony Optimization (ACO)) to search for an optimal sequence of filters from among a set of rather simple, representative image processing filters. This paper deals with the analysis of the swarm intelligence techniques through the combination of hybrid filters generated by these algorithms for image edge enhancement.

  15. A PRODUCT HYBRID GMRES ALGORITHM FOR NONSYMMETRIC LINEAR SYSTEMS

    Institute of Scientific and Technical Information of China (English)

    Bao-jiang Zhong

    2005-01-01

    It has been observed that the residual polynomials resulted from successive restarting cycles of GMRES(m) may differ from one another meaningfully. In this paper, it is further shown that the polynomials can complement one another harmoniously in reducing the iterative residual. This characterization of GMRES(m) is exploited to formulate an efficient hybrid iterative scheme, which can be widely applied to existing hybrid algorithms for solving large nonsymmetric systems of linear equations. In particular, a variant of the hybrid GMRES algorithm of Nachtigal, Reichel and Trefethen (1992) is presented. It is described how the new algorithm may offer significant performance improvements over the original one.

  16. Intelligent Mobile Olfaction of Swarm Robots

    National Research Council Canada - National Science Library

    Siti Nurmaini; Bambang Tutuko; Aulia Rahman Thoharsin

    2013-01-01

      This work presents intelligent mobile olfaction design and experimental results of intelligent swarm robots to detection a gas/odour source in an indoor environment by using multi agent based on hybrid algorithm...

  17. Hybrid Algorithm for Optimal Load Sharing in Grid Computing

    Directory of Open Access Journals (Sweden)

    A. Krishnan

    2012-01-01

    Full Text Available Problem statement: Grid Computing is the fast growing industry, which shares the resources in the organization in an effective manner. Resource sharing requires more optimized algorithmic structure, otherwise the waiting time and response time are increased and the resource utilization is reduced. Approach: In order to avoid such reduction in the performances of the grid system, an optimal resource sharing algorithm is required. In recent days, many load sharing technique are proposed, which provides feasibility but there are many critical issues are still present in these algorithms. Results: In this study a hybrid algorithm for optimization of load sharing is proposed. The hybrid algorithm contains two components which are Hash Table (HT and Distributed Hash Table (DHT. Conclusion: The results of the proposed study show that the hybrid algorithm will optimize the task than existing systems.

  18. A hybrid genetic algorithm to optimize simple distillation column sequences

    Institute of Scientific and Technical Information of China (English)

    GAN YongSheng; Andreas Linninger

    2004-01-01

    Based on the principles of Genetic Algorithms (GAs), a hybrid genetic algorithm used to optimize simple distillation column sequences was established. A new data structure, a novel arithmetic crossover operator and a dynamic mutation operator were proposed. Together with the feasibility test of distillation columns, they are capable to obtain the optimum simple column sequence at one time without the limitation of the number of mixture components, ideal or non-ideal mixtures and sloppy or sharp splits. Compared with conventional algorithms, this hybrid genetic algorithm avoids solving complicated nonlinear equations and demands less derivative information and computation time. Result comparison between this genetic algorithm and Underwood method and Doherty method shows that this hybrid genetic algorithm is reliable.

  19. Hybrid power system intelligent operation and protection involving distributed architectures and pulsed loads

    Science.gov (United States)

    Mohamed, Ahmed

    Efficient and reliable techniques for power delivery and utilization are needed to account for the increased penetration of renewable energy sources in electric power systems. Such methods are also required for current and future demands of plug-in electric vehicles and high-power electronic loads. Distributed control and optimal power network architectures will lead to viable solutions to the energy management issue with high level of reliability and security. This dissertation is aimed at developing and verifying new techniques for distributed control by deploying DC microgrids, involving distributed renewable generation and energy storage, through the operating AC power system. To achieve the findings of this dissertation, an energy system architecture was developed involving AC and DC networks, both with distributed generations and demands. The various components of the DC microgrid were designed and built including DC-DC converters, voltage source inverters (VSI) and AC-DC rectifiers featuring novel designs developed by the candidate. New control techniques were developed and implemented to maximize the operating range of the power conditioning units used for integrating renewable energy into the DC bus. The control and operation of the DC microgrids in the hybrid AC/DC system involve intelligent energy management. Real-time energy management algorithms were developed and experimentally verified. These algorithms are based on intelligent decision-making elements along with an optimization process. This was aimed at enhancing the overall performance of the power system and mitigating the effect of heavy non-linear loads with variable intensity and duration. The developed algorithms were also used for managing the charging/discharging process of plug-in electric vehicle emulators. The protection of the proposed hybrid AC/DC power system was studied. Fault analysis and protection scheme and coordination, in addition to ideas on how to retrofit currently available

  20. A Hybrid Algorithm for Satellite Data Transmission Schedule Based on Genetic Algorithm

    Institute of Scientific and Technical Information of China (English)

    LI Yun-feng; WU Xiao-yue

    2008-01-01

    A hybrid scheduling algorithm based on genetic algorithm is proposed in this paper for reconnaissance satellite data transmission. At first, based on description of satellite data transmission request, satellite data transmission task modal and satellite data transmission scheduling problem model are established. Secondly, the conflicts in scheduling are discussed. According to the meaning of possible conflict, the method to divide possible conflict task set is given. Thirdly, a hybrid algorithm which consists of genetic algorithm and heuristic information is presented. The heuristic information comes from two concepts, conflict degree and conflict number. Finally, an example shows the algorithm's feasibility and performance better than other traditional algorithms.

  1. Hybrid Intelligent Control Method to Improve the Frequency Support Capability of Wind Energy Conversion Systems

    Directory of Open Access Journals (Sweden)

    Shin Young Heo

    2015-10-01

    Full Text Available This paper presents a hybrid intelligent control method that enables frequency support control for permanent magnet synchronous generators (PMSGs wind turbines. The proposed method for a wind energy conversion system (WECS is designed to have PMSG modeling and full-scale back-to-back insulated-gate bipolar transistor (IGBT converters comprising the machine and grid side. The controller of the machine side converter (MSC and the grid side converter (GSC are designed to achieve maximum power point tracking (MPPT based on an improved hill climb searching (IHCS control algorithm and de-loaded (DL operation to obtain a power margin. Along with this comprehensive control of maximum power tracking mode based on the IHCS, a method for kinetic energy (KE discharge control of the supporting primary frequency control scheme with DL operation is developed to regulate the short-term frequency response and maintain reliable operation of the power system. The effectiveness of the hybrid intelligent control method is verified by a numerical simulation in PSCAD/EMTDC. Simulation results show that the proposed approach can improve the frequency regulation capability in the power system.

  2. Ground Motion Data Profile of Western Turkey with Intelligent Hybrid Processing

    Science.gov (United States)

    Korkmaz, Kasim A.; Demir, Fuat

    2016-09-01

    The recent earthquakes caused severe damages on the existing buildings. By this motivation, an important amount of research work has been conducted to determine the seismic risk of seismically active regions. For an accurate seismic risk assessment, processing of ground motions would provide an advantage. Using the current technology, it is not possible to precisely predict the future earthquakes. Therefore, most of the current seismic risk assessment methodologies are based on statistical evaluation by using recurrence and magnitude of the earthquakes hit the specified region. Because of the limited number of records on earthquakes, the quality of definitions is questionable. Fuzzy logic algorithm can be used to improve the quality of the definition. In the present study, ground motion data profile of western Turkey is defined using an intelligent hybrid processing. The approach is given in a practical way for an easier and faster calculation. Earthquake data between 1970 and 1999 from western part of Turkey have been used for training. The results are tested and validated with the earthquake data between 2000 and 2015 of the same region. Enough approximation was validated between calculated values and the earthquake data by using the intelligent hybrid processing.

  3. Ground Motion Data Profile of Western Turkey with Intelligent Hybrid Processing

    Science.gov (United States)

    Korkmaz, Kasim A.; Demir, Fuat

    2017-01-01

    The recent earthquakes caused severe damages on the existing buildings. By this motivation, an important amount of research work has been conducted to determine the seismic risk of seismically active regions. For an accurate seismic risk assessment, processing of ground motions would provide an advantage. Using the current technology, it is not possible to precisely predict the future earthquakes. Therefore, most of the current seismic risk assessment methodologies are based on statistical evaluation by using recurrence and magnitude of the earthquakes hit the specified region. Because of the limited number of records on earthquakes, the quality of definitions is questionable. Fuzzy logic algorithm can be used to improve the quality of the definition. In the present study, ground motion data profile of western Turkey is defined using an intelligent hybrid processing. The approach is given in a practical way for an easier and faster calculation. Earthquake data between 1970 and 1999 from western part of Turkey have been used for training. The results are tested and validated with the earthquake data between 2000 and 2015 of the same region. Enough approximation was validated between calculated values and the earthquake data by using the intelligent hybrid processing.

  4. New Intelligent Transmission Concept for Hybrid Mobile Robot Speed Control

    Directory of Open Access Journals (Sweden)

    Nazim Mir-Nasiri

    2005-09-01

    Full Text Available This paper presents a new concept of a mobile robot speed control by using two degree of freedom gear transmission. The developed intelligent speed controller utilizes a gear box which comprises of epicyclic gear train with two inputs, one coupled with the engine shaft and another with the shaft of a variable speed dc motor. The net output speed is a combination of the two input speeds and is governed by the transmission ratio of the planetary gear train. This new approach eliminates the use of a torque converter which is otherwise an indispensable part of all available automatic transmissions, thereby reducing the power loss that occurs in the box during the fluid coupling. By gradually varying the speed of the dc motor a stepless transmission has been achieved. The other advantages of the developed controller are pulling over and reversing the vehicle, implemented by intelligent mixing of the dc motor and engine speeds. This approach eliminates traditional braking system in entire vehicle design. The use of two power sources, IC engine and battery driven DC motor, utilizes the modern idea of hybrid vehicles. The new mobile robot speed controller is capable of driving the vehicle even in extreme case of IC engine failure, for example, due to gas depletion.

  5. New Intelligent Transmission Concept for Hybrid Mobile Robot Speed Control

    Directory of Open Access Journals (Sweden)

    Nazim Mir-Nasiri

    2008-11-01

    Full Text Available This paper presents a new concept of a mobile robot speed control by using two degree of freedom gear transmission. The developed intelligent speed controller utilizes a gear box which comprises of epicyclic gear train with two inputs, one coupled with the engine shaft and another with the shaft of a variable speed dc motor. The net output speed is a combination of the two input speeds and is governed by the transmission ratio of the planetary gear train. This new approach eliminates the use of a torque converter which is otherwise an indispensable part of all available automatic transmissions, thereby reducing the power loss that occurs in the box during the fluid coupling. By gradually varying the speed of the dc motor a stepless transmission has been achieved. The other advantages of the developed controller are pulling over and reversing the vehicle, implemented by intelligent mixing of the dc motor and engine speeds. This approach eliminates traditional braking system in entire vehicle design. The use of two power sources, IC engine and battery driven DC motor, utilizes the modern idea of hybrid vehicles. The new mobile robot speed controller is capable of driving the vehicle even in extreme case of IC engine failure, for example, due to gas depletion..

  6. THE USE OF GENETIC ALGORITHM IN DIMENSIONING HYBRID AUTONOMOUS SYSTEMS

    Directory of Open Access Journals (Sweden)

    RUS T.

    2016-03-01

    Full Text Available In this paper is presented the working principle of genetic algorithms used to dimension autonomous hybrid systems. It is presented a study case in which is dimensioned and optimized an autonomous hybrid system for a residential house located in Cluj-Napoca. After the autonomous hybrid system optimization is performed, it is achieved a reduction of the total cost of system investment, a reduction of energy produced in excess and a reduction of CO2 emissions.

  7. A hybrid algorithm for unrelated parallel machines scheduling

    Directory of Open Access Journals (Sweden)

    Mohsen Shafiei Nikabadi

    2016-09-01

    Full Text Available In this paper, a new hybrid algorithm based on multi-objective genetic algorithm (MOGA using simulated annealing (SA is proposed for scheduling unrelated parallel machines with sequence-dependent setup times, varying due dates, ready times and precedence relations among jobs. Our objective is to minimize makespan (Maximum completion time of all machines, number of tardy jobs, total tardiness and total earliness at the same time which can be more advantageous in real environment than considering each of objectives separately. For obtaining an optimal solution, hybrid algorithm based on MOGA and SA has been proposed in order to gain both good global and local search abilities. Simulation results and four well-known multi-objective performance metrics, indicate that the proposed hybrid algorithm outperforms the genetic algorithm (GA and SA in terms of each objective and significantly in minimizing the total cost of the weighted function.

  8. Intelligence algorithms for autonomous navigation in a ground vehicle

    Science.gov (United States)

    Petkovsek, Steve; Shakya, Rahul; Shin, Young Ho; Gautam, Prasanna; Norton, Adam; Ahlgren, David J.

    2012-01-01

    This paper will discuss the approach to autonomous navigation used by "Q," an unmanned ground vehicle designed by the Trinity College Robot Study Team to participate in the Intelligent Ground Vehicle Competition (IGVC). For the 2011 competition, Q's intelligence was upgraded in several different areas, resulting in a more robust decision-making process and a more reliable system. In 2010-2011, the software of Q was modified to operate in a modular parallel manner, with all subtasks (including motor control, data acquisition from sensors, image processing, and intelligence) running simultaneously in separate software processes using the National Instruments (NI) LabVIEW programming language. This eliminated processor bottlenecks and increased flexibility in the software architecture. Though overall throughput was increased, the long runtime of the image processing process (150 ms) reduced the precision of Q's realtime decisions. Q had slow reaction times to obstacles detected only by its cameras, such as white lines, and was limited to slow speeds on the course. To address this issue, the image processing software was simplified and also pipelined to increase the image processing throughput and minimize the robot's reaction times. The vision software was also modified to detect differences in the texture of the ground, so that specific surfaces (such as ramps and sand pits) could be identified. While previous iterations of Q failed to detect white lines that were not on a grassy surface, this new software allowed Q to dynamically alter its image processing state so that appropriate thresholds could be applied to detect white lines in changing conditions. In order to maintain an acceptable target heading, a path history algorithm was used to deal with local obstacle fields and GPS waypoints were added to provide a global target heading. These modifications resulted in Q placing 5th in the autonomous challenge and 4th in the navigation challenge at IGVC.

  9. Intelligent Routing using Ant Algorithms for Wireless Ad Hoc Networks

    Directory of Open Access Journals (Sweden)

    S. Menaka

    2013-08-01

    Full Text Available Wireless network is one of the niche areas and has been a growing interest owing to their ability to control the physical environment even from remote locations. Intelligent routing, bandwidth allocation and power control techniques are the known critical factors for this network communication. It is customary to find a feasible path between the communication end point which is a challenging task in this type of network. The present study proposes an Ant Mobility Model (AMM, an on-demand, multi-path routing algorithm that exercises power control and coordinate the nodes to communicate with one another in wireless network. The main goal of this protocol is to reduce the overhead, congestion, and stagnation, while increasing the throughput of the network. It can be realized from the simulation results that AMM proves to be a promising solution for the mobility pattern in wireless networks like MANETs.

  10. Computational intelligence in optimization

    CERN Document Server

    Tenne, Yoel

    2010-01-01

    This volume presents a collection of recent studies covering the spectrum of computational intelligence applications with emphasis on their application to challenging real-world problems. Topics covered include: Intelligent agent-based algorithms, Hybrid intelligent systems, Cognitive and evolutionary robotics, Knowledge-Based Engineering, fuzzy sets and systems, Bioinformatics and Bioengineering, Computational finance and Computational economics, Data mining, Machine learning, and Expert systems. ""Computational Intelligence in Optimization"" is a comprehensive reference for researchers, prac

  11. A novel hybrid algorithm of GSA with Kepler algorithm for numerical optimization

    Directory of Open Access Journals (Sweden)

    Soroor Sarafrazi

    2015-07-01

    Full Text Available It is now well recognized that pure algorithms can be promisingly improved by hybridization with other techniques. One of the relatively new metaheuristic algorithms is Gravitational Search Algorithm (GSA which is based on the Newton laws. In this paper, to enhance the performance of GSA, a novel algorithm called “Kepler”, inspired by the astrophysics, is introduced. The Kepler algorithm is based on the principle of the first Kepler law. The hybridization of GSA and Kepler algorithm is an efficient approach to provide much stronger specialization in intensification and/or diversification. The performance of GSA–Kepler is evaluated by applying it to 14 benchmark functions with 20–1000 dimensions and the optimal approximation of linear system as a practical optimization problem. The results obtained reveal that the proposed hybrid algorithm is robust enough to optimize the benchmark functions and practical optimization problems.

  12. Improved hybrid optimization algorithm for 3D protein structure prediction.

    Science.gov (United States)

    Zhou, Changjun; Hou, Caixia; Wei, Xiaopeng; Zhang, Qiang

    2014-07-01

    A new improved hybrid optimization algorithm - PGATS algorithm, which is based on toy off-lattice model, is presented for dealing with three-dimensional protein structure prediction problems. The algorithm combines the particle swarm optimization (PSO), genetic algorithm (GA), and tabu search (TS) algorithms. Otherwise, we also take some different improved strategies. The factor of stochastic disturbance is joined in the particle swarm optimization to improve the search ability; the operations of crossover and mutation that are in the genetic algorithm are changed to a kind of random liner method; at last tabu search algorithm is improved by appending a mutation operator. Through the combination of a variety of strategies and algorithms, the protein structure prediction (PSP) in a 3D off-lattice model is achieved. The PSP problem is an NP-hard problem, but the problem can be attributed to a global optimization problem of multi-extremum and multi-parameters. This is the theoretical principle of the hybrid optimization algorithm that is proposed in this paper. The algorithm combines local search and global search, which overcomes the shortcoming of a single algorithm, giving full play to the advantage of each algorithm. In the current universal standard sequences, Fibonacci sequences and real protein sequences are certified. Experiments show that the proposed new method outperforms single algorithms on the accuracy of calculating the protein sequence energy value, which is proved to be an effective way to predict the structure of proteins.

  13. REVIEW OF HEART DISEASE PREDICTION SYSTEM USING DATA MINING AND HYBRID INTELLIGENT TECHNIQUES

    Directory of Open Access Journals (Sweden)

    R. Chitra

    2013-07-01

    Full Text Available The Healthcare industry generally clinical diagnosis is done mostly by doctor’s expertise and experience. Computer Aided Decision Support System plays a major role in medical field. With the growing research on heart disease predicting system, it has become important to categories the research outcomes and provides readers with an overview of the existing heart disease prediction techniques in each category. Neural Networks are one of many data mining analytical tools that can be utilized to make predictions for medical data. From the study it is observed that Hybrid Intelligent Algorithm improves the accuracy of the heart disease prediction system. The commonly used techniques for Heart Disease Prediction and their complexities are summarized in this paper.

  14. 16th International Conference on Hybrid Intelligent Systems and the 8th World Congress on Nature and Biologically Inspired Computing

    CERN Document Server

    Haqiq, Abdelkrim; Alimi, Adel; Mezzour, Ghita; Rokbani, Nizar; Muda, Azah

    2017-01-01

    This book presents the latest research in hybrid intelligent systems. It includes 57 carefully selected papers from the 16th International Conference on Hybrid Intelligent Systems (HIS 2016) and the 8th World Congress on Nature and Biologically Inspired Computing (NaBIC 2016), held on November 21–23, 2016 in Marrakech, Morocco. HIS - NaBIC 2016 was jointly organized by the Machine Intelligence Research Labs (MIR Labs), USA; Hassan 1st University, Settat, Morocco and University of Sfax, Tunisia. Hybridization of intelligent systems is a promising research field in modern artificial/computational intelligence and is concerned with the development of the next generation of intelligent systems. The conference’s main aim is to inspire further exploration of the intriguing potential of hybrid intelligent systems and bio-inspired computing. As such, the book is a valuable resource for practicing engineers /scientists and researchers working in the field of computational intelligence and artificial intelligence.

  15. Hybrid ant colony algorithm for traveling salesman problem

    Institute of Scientific and Technical Information of China (English)

    2003-01-01

    A hybrid approach based on ant colony algorithm for the traveling salesman problem is proposed, which is an improved algorithm characterized by adding a local search mechanism, a cross-removing strategy and candidate lists. Experimental results show that it is competitive in terms of solution quality and computation time.

  16. An intelligent algorithm for unmanned aerial vehicle surveillance

    Science.gov (United States)

    Bhargave, Ashish; Ambrose, Barry; Lin, Freddie; Kazantzidis, Manthos

    2007-04-01

    An intelligent swarm-based guidance and path planning algorithm for the Unmanned Arial Vehicles (UAV) provides the ability to efficiently carry out grid surveillance, taking into account specific UAV constraints such as maximum speed, maximum flight time and battery re-charging intervals to allow for continuous surveillance. The swarm-based flight planning is based on enhancements of distributed computing concepts that have been developed for NASA's launch danger zone protection. The algorithm is a modified version of an ant colony optimization theory describing ant food foraging. Ants initially follow random paths from the nest, but if food is found, the ant deposits a pheromone (modifying the local environment), which influences other ants to travel the same path. Once the food source is exhausted, the pheromone decays naturally, which causes the trail to disappear. When an ant is on an established trail, it may at any time decide to follow a new random path, allowing for new exploration. Using these concepts, in our system for UAV, we use two units, the Rendezvous unit and the Patrol unit. The Rendezvous units will act as pheromone deposit sites keeping a record of trails of interest (extra pheromone that decays over time), and obstacles (no pheromone). The search area is divided into a grid of areas. Each area unit is assigned a pheromone weight. The patrol unit picks an area unit based on a probabilistic formula consisting of parameters like the relative weight of trail intensity, area visibility to the unit, the distance of the patrol unit from the area, and the pheromone decay factor. Simulation of a UAV surveillance system based on the above algorithm showed that it has the ability to perform independently and reliably without human intervention, and the emergent nature of the algorithm has the ability to incorporate important aspects of unmanned surveillance.

  17. Cost Optimization Using Hybrid Evolutionary Algorithm in Cloud Computing

    Directory of Open Access Journals (Sweden)

    B. Kavitha

    2015-07-01

    Full Text Available The main aim of this research is to design the hybrid evolutionary algorithm for minimizing multiple problems of dynamic resource allocation in cloud computing. The resource allocation is one of the big problems in the distributed systems when the client wants to decrease the cost for the resource allocation for their task. In order to assign the resource for the task, the client must consider the monetary cost and computational cost. Allocation of resources by considering those two costs is difficult. To solve this problem in this study, we make the main task of client into many subtasks and we allocate resources for each subtask instead of selecting the single resource for the main task. The allocation of resources for the each subtask is completed through our proposed hybrid optimization algorithm. Here, we hybrid the Binary Particle Swarm Optimization (BPSO and Binary Cuckoo Search algorithm (BCSO by considering monetary cost and computational cost which helps to minimize the cost of the client. Finally, the experimentation is carried out and our proposed hybrid algorithm is compared with BPSO and BCSO algorithms. Also we proved the efficiency of our proposed hybrid optimization algorithm.

  18. Hybrid pre training algorithm of Deep Neural Networks

    Directory of Open Access Journals (Sweden)

    Drokin I. S.

    2016-01-01

    Full Text Available This paper proposes a hybrid algorithm of pre training deep networks, using both marked and unmarked data. The algorithm combines and extends the ideas of Self-Taught learning and pre training of neural networks approaches on the one hand, as well as supervised learning and transfer learning on the other. Thus, the algorithm tries to integrate in itself the advantages of each approach. The article gives some examples of applying of the algorithm, as well as its comparison with the classical approach to pre training of neural networks. These examples show the effectiveness of the proposed algorithm.

  19. A hybrid monkey search algorithm for clustering analysis.

    Science.gov (United States)

    Chen, Xin; Zhou, Yongquan; Luo, Qifang

    2014-01-01

    Clustering is a popular data analysis and data mining technique. The k-means clustering algorithm is one of the most commonly used methods. However, it highly depends on the initial solution and is easy to fall into local optimum solution. In view of the disadvantages of the k-means method, this paper proposed a hybrid monkey algorithm based on search operator of artificial bee colony algorithm for clustering analysis and experiment on synthetic and real life datasets to show that the algorithm has a good performance than that of the basic monkey algorithm for clustering analysis.

  20. A Hybrid Monkey Search Algorithm for Clustering Analysis

    Directory of Open Access Journals (Sweden)

    Xin Chen

    2014-01-01

    Full Text Available Clustering is a popular data analysis and data mining technique. The k-means clustering algorithm is one of the most commonly used methods. However, it highly depends on the initial solution and is easy to fall into local optimum solution. In view of the disadvantages of the k-means method, this paper proposed a hybrid monkey algorithm based on search operator of artificial bee colony algorithm for clustering analysis and experiment on synthetic and real life datasets to show that the algorithm has a good performance than that of the basic monkey algorithm for clustering analysis.

  1. A Hybrid Computational Intelligence Approach Combining Genetic Programming And Heuristic Classification for Pap-Smear Diagnosis

    DEFF Research Database (Denmark)

    Tsakonas, Athanasios; Dounias, Georgios; Jantzen, Jan

    2001-01-01

    The paper suggests the combined use of different computational intelligence (CI) techniques in a hybrid scheme, as an effective approach to medical diagnosis. Getting to know the advantages and disadvantages of each computational intelligence technique in the recent years, the time has come for p...

  2. Intelligent emission-sensitive routing for plugin hybrid electric vehicles.

    Science.gov (United States)

    Sun, Zhonghao; Zhou, Xingshe

    2016-01-01

    The existing transportation sector creates heavily environmental impacts and is a prime cause for the current climate change. The need to reduce emissions from this sector has stimulated efforts to speed up the application of electric vehicles (EVs). A subset of EVs, called plug-in hybrid electric vehicles (PHEVs), backup batteries with combustion engine, which makes PHEVs have a comparable driving range to conventional vehicles. However, this hybridization comes at a cost of higher emissions than all-electric vehicles. This paper studies the routing problem for PHEVs to minimize emissions. The existing shortest-path based algorithms cannot be applied to solving this problem, because of the several new challenges: (1) an optimal route may contain circles caused by detour for recharging; (2) emissions of PHEVs not only depend on the driving distance, but also depend on the terrain and the state of charge (SOC) of batteries; (3) batteries can harvest energy by regenerative braking, which makes some road segments have negative energy consumption. To address these challenges, this paper proposes a green navigation algorithm (GNA) which finds the optimal strategies: where to go and where to recharge. GNA discretizes the SOC, then makes the PHEV routing problem to satisfy the principle of optimality. Finally, GNA adopts dynamic programming to solve the problem. We evaluate GNA using synthetic maps generated by the delaunay triangulation. The results show that GNA can save more than 10 % energy and reduce 10 % emissions when compared to the shortest path algorithm. We also observe that PHEVs with the battery capacity of 10-15 KWh detour most and nearly no detour when larger than 30 KWh. This observation gives some insights when developing PHEVs.

  3. When the lowest energy does not induce native structures: parallel minimization of multi-energy values by hybridizing searching intelligences.

    Directory of Open Access Journals (Sweden)

    Qiang Lü

    Full Text Available BACKGROUND: Protein structure prediction (PSP, which is usually modeled as a computational optimization problem, remains one of the biggest challenges in computational biology. PSP encounters two difficult obstacles: the inaccurate energy function problem and the searching problem. Even if the lowest energy has been luckily found by the searching procedure, the correct protein structures are not guaranteed to obtain. RESULTS: A general parallel metaheuristic approach is presented to tackle the above two problems. Multi-energy functions are employed to simultaneously guide the parallel searching threads. Searching trajectories are in fact controlled by the parameters of heuristic algorithms. The parallel approach allows the parameters to be perturbed during the searching threads are running in parallel, while each thread is searching the lowest energy value determined by an individual energy function. By hybridizing the intelligences of parallel ant colonies and Monte Carlo Metropolis search, this paper demonstrates an implementation of our parallel approach for PSP. 16 classical instances were tested to show that the parallel approach is competitive for solving PSP problem. CONCLUSIONS: This parallel approach combines various sources of both searching intelligences and energy functions, and thus predicts protein conformations with good quality jointly determined by all the parallel searching threads and energy functions. It provides a framework to combine different searching intelligence embedded in heuristic algorithms. It also constructs a container to hybridize different not-so-accurate objective functions which are usually derived from the domain expertise.

  4. Adaptive Beamforming using Hybrid Algorithm of RLS-LMS for Wireless Power Transmission

    Directory of Open Access Journals (Sweden)

    Rana Liaqat Ali, Shahid A Khan, Noman Raza, Safdar Ali, C. Xydeas, Hussan Ahmed

    2013-06-01

    Full Text Available Efficient wireless power transmission requires highly directive radiation pattern and maximum signal to noise interference ratio which can be achieved by Beamforming algorithms. A Hybrid Combination of Recursive Least Mean Square (RLS and Least Mean Square (LMS algorithm is proposed which converges to adequate results in terms of highly directive radiation pattern and maximum signal to noise interference ratio. This has been achieved by taking the favorable features of both RLS and LMS algorithms through intelligent switching between them, using a principle factor depending on minimum mean square error. Simulation results of proposed solution have verified its advantage in terms of interference rejection despite having the capability of faster convergence rate and efficient tracking of the targeted users.

  5. Multiscale modeling for classification of SAR imagery using hybrid EM algorithm and genetic algorithm

    Institute of Scientific and Technical Information of China (English)

    Xianbin Wen; Hua Zhang; Jianguang Zhang; Xu Jiao; Lei Wang

    2009-01-01

    A novel method that hybridizes genetic algorithm (GA) and expectation maximization (EM) algorithm for the classification of syn-thetic aperture radar (SAR) imagery is proposed by the finite Gaussian mixtures model (GMM) and multiscale autoregressive (MAR)model. This algorithm is capable of improving the global optimality and consistency of the classification performance. The experiments on the SAR images show that the proposed algorithm outperforms the standard EM method significantly in classification accuracy.

  6. A hybrid algorithm for speckle noise reduction of ultrasound images.

    Science.gov (United States)

    Singh, Karamjeet; Ranade, Sukhjeet Kaur; Singh, Chandan

    2017-09-01

    Medical images are contaminated by multiplicative speckle noise which significantly reduce the contrast of ultrasound images and creates a negative effect on various image interpretation tasks. In this paper, we proposed a hybrid denoising approach which collaborate the both local and nonlocal information in an efficient manner. The proposed hybrid algorithm consist of three stages in which at first stage the use of local statistics in the form of guided filter is used to reduce the effect of speckle noise initially. Then, an improved speckle reducing bilateral filter (SRBF) is developed to further reduce the speckle noise from the medical images. Finally, to reconstruct the diffused edges we have used the efficient post-processing technique which jointly considered the advantages of both bilateral and nonlocal mean (NLM) filter for the attenuation of speckle noise efficiently. The performance of proposed hybrid algorithm is evaluated on synthetic, simulated and real ultrasound images. The experiments conducted on various test images demonstrate that our proposed hybrid approach outperforms the various traditional speckle reduction approaches included recently proposed NLM and optimized Bayesian-based NLM. The results of various quantitative, qualitative measures and by visual inspection of denoise synthetic and real ultrasound images demonstrate that the proposed hybrid algorithm have strong denoising capability and able to preserve the fine image details such as edge of a lesion better than previously developed methods for speckle noise reduction. The denoising and edge preserving capability of hybrid algorithm is far better than existing traditional and recently proposed speckle reduction (SR) filters. The success of proposed algorithm would help in building the lay foundation for inventing the hybrid algorithms for denoising of ultrasound images. Copyright © 2017 Elsevier B.V. All rights reserved.

  7. A Hybrid Algorithm for Strip Packing Problem with Rotation Constraint

    Directory of Open Access Journals (Sweden)

    Chen Huan

    2016-01-01

    Full Text Available Strip packing is a well-known NP-hard problem and it was widely applied in engineering fields. This paper considers a two-dimensional orthogonal strip packing problem. Until now some exact algorithm and mainly heuristics were proposed for two-dimensional orthogonal strip packing problem. While this paper proposes a two-stage hybrid algorithm for it. In the first stage, a heuristic algorithm based on layering idea is developed to construct a solution. In the second stage, a great deluge algorithm is used to further search a better solution. Computational results on several classes of benchmark problems have revealed that the hybrid algorithm improves the results of layer-heuristic, and can compete with other heuristics from the literature.

  8. Hybrid Ant Algorithm and Applications for Vehicle Routing Problem

    Science.gov (United States)

    Xiao, Zhang; Jiang-qing, Wang

    Ant colony optimization (ACO) is a metaheuristic method that inspired by the behavior of real ant colonies. ACO has been successfully applied to several combinatorial optimization problems, but it has some short-comings like its slow computing speed and local-convergence. For solving Vehicle Routing Problem, we proposed Hybrid Ant Algorithm (HAA) in order to improve both the performance of the algorithm and the quality of solutions. The proposed algorithm took the advantages of Nearest Neighbor (NN) heuristic and ACO for solving VRP, it also expanded the scope of solution space and improves the global ability of the algorithm through importing mutation operation, combining 2-opt heuristics and adjusting the configuration of parameters dynamically. Computational results indicate that the hybrid ant algorithm can get optimal resolution of VRP effectively.

  9. Impact of Hybrid Intelligent Computing in Identifying Constructive Weather Parameters for Modeling Effective Rainfall Prediction

    Directory of Open Access Journals (Sweden)

    M. Sudha

    2015-12-01

    Full Text Available Uncertain atmosphere is a prevalent factor affecting the existing prediction approaches. Rough set and fuzzy set theories as proposed by Pawlak and Zadeh have become an effective tool for handling vagueness and fuzziness in the real world scenarios. This research work describes the impact of Hybrid Intelligent System (HIS for strategic decision support in meteorology. In this research a novel exhaustive search based Rough set reduct Selection using Genetic Algorithm (RSGA is introduced to identify the significant input feature subset. The proposed model could identify the most effective weather parameters efficiently than other existing input techniques. In the model evaluation phase two adaptive techniques were constructed and investigated. The proposed Artificial Neural Network based on Back Propagation learning (ANN-BP and Adaptive Neuro Fuzzy Inference System (ANFIS was compared with existing Fuzzy Unordered Rule Induction Algorithm (FURIA, Structural Learning Algorithm on Vague Environment (SLAVE and Particle Swarm OPtimization (PSO. The proposed rainfall prediction models outperformed when trained with the input generated using RSGA. A meticulous comparison of the performance indicates ANN-BP model as a suitable HIS for effective rainfall prediction. The ANN-BP achieved 97.46% accuracy with a nominal misclassification rate of 0.0254 %.

  10. Hybrid intelligent PID control design for PEMFC anode system

    Institute of Scientific and Technical Information of China (English)

    Rui-min WANG; Ying-ying ZHANG; Guang-yi CAO

    2008-01-01

    Control design is important for proton exchange membrane fuel cell (PEMFC) generator. This work researched the anode system of a 60-kW PEMFC generator. Both anode pressure and humidity must he maintained at ideal levels during steady operation. In view of characteristics and requirements of the system, a hybrid intelligent PID controller is designed specifically based on dynamic simulation. A single neuron PI controller is used for anode humidity by adjusting the water injection to the hydrogen cell. Another incremental PID controller, based on the diagonal recurrent neural network (DRNN) dynamic identification, is used to control anode pressure to be more stable and exact by adjusting the hydrogen flow rate. This control strategy can avoid the coupling problem of the PEMFC and achieve a more adaptive ability. Simulation results showed that the control strategy can maintain both anode humidity and pressure at ideal levels regardless of variable load, nonlinear dynamic and coupling characteristics of the system. This work will give some guides for further control design and applications of the total PEMFC generator.

  11. 混合智能算法在电子商务个性化推荐中的研究%A Study of Hybrid Intelligence Algorithm of Personalized Recommendation in E- commerce

    Institute of Scientific and Technical Information of China (English)

    刘利民; 刘晓莉

    2011-01-01

    针对传统协同过滤推荐算法出现的推荐精度下降、邻近用户缺乏多样性等问题,本文将免疫遗传模糊c-均值聚类算法应用于传统协同过滤推荐算法中以求解决上述问题.免疫遗传算法收敛速度快、搜索精度高、稳健性强等特点与模糊c-均值聚类算法柔性模糊划分的特点相结合,可以快速的收敛到全局最优解,有效的克服了模糊聚类中的弱点,从而提高了个性化推荐系统的推荐质量.%According to some issues like the recommended accuracy down and lack of diversity due to applying to the traditional Collaborative Filtering recommendation algorithm, this article discusses how Immune Genetic Fuzzy c - means Clustering Algorithm is applied to the traditional Collaborative Filtering recommendation technology. It is a combination of advantages of Immune Genetic Algorithm and Fuzzy c - means Cluster Algorithm,integrating fast rate of convergence, high searching precision, strong robustness of Immune Genetic Algorithm and flexible fuzzy classification of Fuzzy c - means Cluster Algorithm. It converges optimal solution of the entity and overcomes disadvantages of fuzzy partition, improving the accuracy of recommended results.

  12. A Novel Hybrid Algorithm for Task Graph Scheduling

    Directory of Open Access Journals (Sweden)

    Vahid Majid Nezhad

    2011-03-01

    Full Text Available One of the important problems in multiprocessor systems is Task Graph Scheduling. Task Graph Scheduling is an NP-Hard problem. Both learning automata and genetic algorithms are search tools which are used for solving many NP-Hard problems. In this paper a new hybrid method based on Genetic Algorithm and Learning Automata is proposed. The proposed algorithm begins with an initial population of randomly generated chromosomes and after some stages, each chromosome maps to an automaton. Experimental results show that superiority of the proposed algorithm over the current approaches.

  13. An Effective Hybrid Optimization Algorithm for Capacitated Vehicle Routing Problem

    Institute of Scientific and Technical Information of China (English)

    2006-01-01

    Capacitated vehicle routing problem (CVRP) is an important combinatorial optimization problem. However, it is quite difficult to achieve an optimal solution with the traditional optimization methods owing to the high computational complexity. A hybrid algorithm was developed to solve the problem, in which an artificial immune clonal algorithm (AICA) makes use of the global search ability to search the optimal results and simulated annealing (SA) algorithm employs certain probability to avoid becoming trapped in a local optimum. The results obtained from the computational study show that the proposed algorithm is a feasible and effective method for capacitated vehicle routing problem.

  14. A Parallel Genetic Simulated Annealing Hybrid Algorithm for Task Scheduling

    Institute of Scientific and Technical Information of China (English)

    SHU Wanneng; ZHENG Shijue

    2006-01-01

    In this paper combined with the advantages of genetic algorithm and simulated annealing, brings forward a parallel genetic simulated annealing hybrid algorithm (PGSAHA) and applied to solve task scheduling problem in grid computing .It first generates a new group of individuals through genetic operation such as reproduction, crossover, mutation, etc, and than simulated anneals independently all the generated individuals respectively.When the temperature in the process of cooling no longer falls, the result is the optimal solution on the whole.From the analysis and experiment result, it is concluded that this algorithm is superior to genetic algorithm and simulated annealing.

  15. An Efficient Hybrid Algorithm for Mining Web Frequent Access Patterns

    Institute of Scientific and Technical Information of China (English)

    ZHAN Li-qiang; LIU Da-xin

    2004-01-01

    We propose an efficient hybrid algorithm WDHP in this paper for mining frequent access patterns.WDHP adopts the techniques of DHP to optimize its performance, which is using hash table to filter candidate set and trimming database.Whenever the database is trimmed to a size less than a specified threshold, the algorithm puts the database into main memory by constructing a tree, and finds frequent patterns on the tree.The experiment shows that WDHP outperform algorithm DHP and main memory based algorithm WAP in execution efficiency.

  16. A Novel Hybrid Algorithm for Task Graph Scheduling

    CERN Document Server

    Nezhad, Vahid Majid; Efimov, Evgueni

    2011-01-01

    One of the important problems in multiprocessor systems is Task Graph Scheduling. Task Graph Scheduling is an NP-Hard problem. Both learning automata and genetic algorithms are search tools which are used for solving many NP-Hard problems. In this paper a new hybrid method based on Genetic Algorithm and Learning Automata is proposed. The proposed algorithm begins with an initial population of randomly generated chromosomes and after some stages, each chromosome maps to an automaton. Experimental results show that superiority of the proposed algorithm over the current approaches.

  17. A New Class of Hybrid Particle Swarm Optimization Algorithm

    Institute of Scientific and Technical Information of China (English)

    Da-Qing Guo; Yong-Jin Zhao; Hui Xiong; Xiao Li

    2007-01-01

    A new class of hybrid particle swarm optimization (PSO) algorithm is developed for solving the premature convergence caused by some particles in standard PSO fall into stagnation. In this algorithm, the linearly decreasing inertia weight technique (LDIW) and the mutative scale chaos optimization algorithm (MSCOA) are combined with standard PSO, which are used to balance the global and local exploration abilities and enhance the local searching abilities, respectively. In order to evaluate the performance of the new method, three benchmark functions are used. The simulation results confirm the proposed algorithm can greatly enhance the searching ability and effectively improve the premature convergence.

  18. A HYBRID HEURISTIC ALGORITHM FOR THE CLUSTERED TRAVELING SALESMAN PROBLEM

    Directory of Open Access Journals (Sweden)

    Mário Mestria

    2016-04-01

    Full Text Available ABSTRACT This paper proposes a hybrid heuristic algorithm, based on the metaheuristics Greedy Randomized Adaptive Search Procedure, Iterated Local Search and Variable Neighborhood Descent, to solve the Clustered Traveling Salesman Problem (CTSP. Hybrid Heuristic algorithm uses several variable neighborhood structures combining the intensification (using local search operators and diversification (constructive heuristic and perturbation routine. In the CTSP, the vertices are partitioned into clusters and all vertices of each cluster have to be visited contiguously. The CTSP is -hard since it includes the well-known Traveling Salesman Problem (TSP as a special case. Our hybrid heuristic is compared with three heuristics from the literature and an exact method. Computational experiments are reported for different classes of instances. Experimental results show that the proposed hybrid heuristic obtains competitive results within reasonable computational time.

  19. Fast Algorithms for Hybrid Control System Design

    Science.gov (United States)

    2007-11-02

    Controls for Petri Nets with Unobservable Transitions", Proceedings of the 1997 American Control Conference, pp. 2354- 2358, Albuquerque, New Mexico , June...Automation Conference, April 20-25, 1997, 1997, Albuquerque New Mexico . - Invited Speaker at special session on "Intelligent Control Systems" at the 3rd...0 (11) Moreover, if either (hence, both) of these statements hold, then one controller that renders iVa (Ji(P, K)) < 7 is ffiven by A + B2J- aYaC2

  20. Compact cancer biomarkers discovery using a swarm intelligence feature selection algorithm.

    Science.gov (United States)

    Martinez, Emmanuel; Alvarez, Mario Moises; Trevino, Victor

    2010-08-01

    Biomarker discovery is a typical application from functional genomics. Due to the large number of genes studied simultaneously in microarray data, feature selection is a key step. Swarm intelligence has emerged as a solution for the feature selection problem. However, swarm intelligence settings for feature selection fail to select small features subsets. We have proposed a swarm intelligence feature selection algorithm based on the initialization and update of only a subset of particles in the swarm. In this study, we tested our algorithm in 11 microarray datasets for brain, leukemia, lung, prostate, and others. We show that the proposed swarm intelligence algorithm successfully increase the classification accuracy and decrease the number of selected features compared to other swarm intelligence methods.

  1. A test sheet generating algorithm based on intelligent genetic algorithm and hierarchical planning

    Science.gov (United States)

    Gu, Peipei; Niu, Zhendong; Chen, Xuting; Chen, Wei

    2013-03-01

    In recent years, computer-based testing has become an effective method to evaluate students' overall learning progress so that appropriate guiding strategies can be recommended. Research has been done to develop intelligent test assembling systems which can automatically generate test sheets based on given parameters of test items. A good multisubject test sheet depends on not only the quality of the test items but also the construction of the sheet. Effective and efficient construction of test sheets according to multiple subjects and criteria is a challenging problem. In this paper, a multi-subject test sheet generation problem is formulated and a test sheet generating approach based on intelligent genetic algorithm and hierarchical planning (GAHP) is proposed to tackle this problem. The proposed approach utilizes hierarchical planning to simplify the multi-subject testing problem and adopts genetic algorithm to process the layered criteria, enabling the construction of good test sheets according to multiple test item requirements. Experiments are conducted and the results show that the proposed approach is capable of effectively generating multi-subject test sheets that meet specified requirements and achieve good performance.

  2. Improved RMR Rock Mass Classification Using Artificial Intelligence Algorithms

    Science.gov (United States)

    Gholami, Raoof; Rasouli, Vamegh; Alimoradi, Andisheh

    2013-09-01

    Rock mass classification systems such as rock mass rating (RMR) are very reliable means to provide information about the quality of rocks surrounding a structure as well as to propose suitable support systems for unstable regions. Many correlations have been proposed to relate measured quantities such as wave velocity to rock mass classification systems to limit the associated time and cost of conducting the sampling and mechanical tests conventionally used to calculate RMR values. However, these empirical correlations have been found to be unreliable, as they usually overestimate or underestimate the RMR value. The aim of this paper is to compare the results of RMR classification obtained from the use of empirical correlations versus machine-learning methodologies based on artificial intelligence algorithms. The proposed methods were verified based on two case studies located in northern Iran. Relevance vector regression (RVR) and support vector regression (SVR), as two robust machine-learning methodologies, were used to predict the RMR for tunnel host rocks. RMR values already obtained by sampling and site investigation at one tunnel were taken into account as the output of the artificial networks during training and testing phases. The results reveal that use of empirical correlations overestimates the predicted RMR values. RVR and SVR, however, showed more reliable results, and are therefore suggested for use in RMR classification for design purposes of rock structures.

  3. G/SPLINES: A hybrid of Friedman's Multivariate Adaptive Regression Splines (MARS) algorithm with Holland's genetic algorithm

    Science.gov (United States)

    Rogers, David

    1991-01-01

    G/SPLINES are a hybrid of Friedman's Multivariable Adaptive Regression Splines (MARS) algorithm with Holland's Genetic Algorithm. In this hybrid, the incremental search is replaced by a genetic search. The G/SPLINE algorithm exhibits performance comparable to that of the MARS algorithm, requires fewer least squares computations, and allows significantly larger problems to be considered.

  4. A hybrid ACO/PSO based algorithm for QoS multicast routing problem

    Directory of Open Access Journals (Sweden)

    Manoj Kumar Patel

    2014-03-01

    Full Text Available Many Internet multicast applications such as videoconferencing, distance education, and online simulation require to send information from a source to some selected destinations. These applications have stringent Quality-of-Service (QoS requirements that include delay, loss rate, bandwidth, and delay jitter. This leads to the problem of routing multicast traffic satisfying QoS requirements. The above mentioned problem is known as the QoS constrained multicast routing problem and is NP Complete. In this paper, we present a swarming agent based intelligent algorithm using a hybrid Ant Colony Optimization (ACO/Particle Swarm Optimization (PSO technique to optimize the multicast tree. The algorithm starts with generating a large amount of mobile agents in the search space. The ACO algorithm guides the agents’ movement by pheromones in the shared environment locally, and the global maximum of the attribute values are obtained through the random interaction between the agents using PSO algorithm. The performance of the proposed algorithm is evaluated through simulation. The simulation results reveal that our algorithm performs better than the existing algorithms.

  5. A Hybrid Backtracking Search Optimization Algorithm with Differential Evolution

    Directory of Open Access Journals (Sweden)

    Lijin Wang

    2015-01-01

    Full Text Available The backtracking search optimization algorithm (BSA is a new nature-inspired method which possesses a memory to take advantage of experiences gained from previous generation to guide the population to the global optimum. BSA is capable of solving multimodal problems, but it slowly converges and poorly exploits solution. The differential evolution (DE algorithm is a robust evolutionary algorithm and has a fast convergence speed in the case of exploitive mutation strategies that utilize the information of the best solution found so far. In this paper, we propose a hybrid backtracking search optimization algorithm with differential evolution, called HBD. In HBD, DE with exploitive strategy is used to accelerate the convergence by optimizing one worse individual according to its probability at each iteration process. A suit of 28 benchmark functions are employed to verify the performance of HBD, and the results show the improvement in effectiveness and efficiency of hybridization of BSA and DE.

  6. SOLUTION OF THE SATELLITE TRANSFER PROBLEM WITH HYBRID MEMETIC ALGORITHM

    Directory of Open Access Journals (Sweden)

    A. V. Panteleyev

    2014-01-01

    Full Text Available This paper presents a hybrid memetic algorithm (MA to solve the problem of finding the optimal program control of nonlinear continuous deterministic systems based on the concept of the meme, which is one of the promising solutions obtained in the course of implementing the procedure for searching the extremes. On the basis of the proposed algorithm the software complex is formed in C#. The solution of satellite transfer problem is presented.

  7. A New Hybrid Watermarking Algorithm for Images in Frequency Domain

    Directory of Open Access Journals (Sweden)

    AhmadReza Naghsh-Nilchi

    2008-03-01

    Full Text Available In recent years, digital watermarking has become a popular technique for digital images by hiding secret information which can protect the copyright. The goal of this paper is to develop a hybrid watermarking algorithm. This algorithm used DCT coefficient and DWT coefficient to embedding watermark, and the extracting procedure is blind. The proposed approach is robust to a variety of signal distortions, such as JPEG, image cropping and scaling.

  8. A Hybrid Genetic Algorithm for the Job Shop Scheduling Problem

    OpenAIRE

    Gonçalves, José Fernando; Mendes, J. J. M.; Resende, Maurício G. C.

    2005-01-01

    This paper presents a hybrid genetic algorithm for the Job Shop Scheduling problem. The chromosome representation of the problem is based on random keys. The schedules are constructed using a priority rule in which the priorities are defined by the genetic algorithm. Schedules are constructed using a procedure that generates parameterized active schedules. After a schedule is obtained a local search heuristic is applied to improve the solution. The approach is tested on a set o...

  9. A new hybrid imperialist competitive algorithm on data clustering

    Indian Academy of Sciences (India)

    Taher Niknam; Elahe Taherian Fard; Shervin Ehrampoosh; Alireza Rousta

    2011-06-01

    Clustering is a process for partitioning datasets. This technique is very useful for optimum solution. -means is one of the simplest and the most famous methods that is based on square error criterion. This algorithm depends on initial states and converges to local optima. Some recent researches show that -means algorithm has been successfully applied to combinatorial optimization problems for clustering. In this paper, we purpose a novel algorithm that is based on combining two algorithms of clustering; -means and Modify Imperialist Competitive Algorithm. It is named hybrid K-MICA. In addition, we use a method called modified expectation maximization (EM) to determine number of clusters. The experimented results show that the new method carries out better results than the ACO, PSO, Simulated Annealing (SA), Genetic Algorithm (GA), Tabu Search (TS), Honey Bee Mating Optimization (HBMO) and -means.

  10. Research of information classification and strategy intelligence extract algorithm based on military strategy hall

    Science.gov (United States)

    Chen, Lei; Li, Dehua; Yang, Jie

    2007-12-01

    Constructing virtual international strategy environment needs many kinds of information, such as economy, politic, military, diploma, culture, science, etc. So it is very important to build an information auto-extract, classification, recombination and analysis management system with high efficiency as the foundation and component of military strategy hall. This paper firstly use improved Boost algorithm to classify obtained initial information, then use a strategy intelligence extract algorithm to extract strategy intelligence from initial information to help strategist to analysis information.

  11. Hybrid Genetic Algorithm with PSO Effect for Combinatorial Optimisation Problems

    Directory of Open Access Journals (Sweden)

    M. H. Mehta

    2012-12-01

    Full Text Available In engineering field, many problems are hard to solve in some definite interval of time. These problems known as “combinatorial optimisation problems” are of the category NP. These problems are easy to solve in some polynomial time when input size is small but as input size grows problems become toughest to solve in some definite interval of time. Long known conventional methods are not able to solve the problems and thus proper heuristics is necessary. Evolutionary algorithms based on behaviours of different animals and species have been invented and studied for this purpose. Genetic Algorithm is considered a powerful algorithm for solving combinatorial optimisation problems. Genetic algorithms work on these problems mimicking the human genetics. It follows principle of “survival of the fittest” kind of strategy. Particle swarm optimisation is a new evolutionary approach that copies behaviour of swarm in nature. However, neither traditional genetic algorithms nor particle swarm optimisation alone has been completely successful for solving combinatorial optimisation problems. Here a hybrid algorithm is proposed in which strengths of both algorithms are merged and performance of proposed algorithm is compared with simple genetic algorithm. Results show that proposed algorithm works definitely better than the simple genetic algorithm.

  12. Improving the performance of DCT-based fragile watermarking using intelligent optimization algorithms

    Science.gov (United States)

    Aslantas, Veysel; Ozer, Saban; Ozturk, Serkan

    2009-07-01

    The performance of a fragile watermarking method based on discrete cosine transform (DCT) has been improved in this paper by using intelligent optimization algorithms (IOA), namely genetic algorithm, differential evolution algorithm, clonal selection algorithm and particle swarm optimization algorithm. In DCT based fragile watermarking techniques, watermark embedding can usually be achieved by modifying the least significant bits of the transformation coefficients. After the embedding process is completed, transforming the modified coefficients from the frequency domain to the spatial domain produces some rounding errors due to the conversion of real numbers to integers. The rounding errors caused by this transformation process were corrected by the use of intelligent optimization algorithms mentioned above. This paper gives experimental results which show the feasibility of using these optimization algorithms for the fragile watermarking and demonstrate the accuracy of these methods. The performance comparison of the algorithms was also realized.

  13. Hybridizing Evolutionary Algorithms with Opportunistic Local Search

    DEFF Research Database (Denmark)

    Gießen, Christian

    2013-01-01

    There is empirical evidence that memetic algorithms (MAs) can outperform plain evolutionary algorithms (EAs). Recently the first runtime analyses have been presented proving the aforementioned conjecture rigorously by investigating Variable-Depth Search, VDS for short (Sudholt, 2008). Sudholt...... raised the question if there are problems where VDS performs badly. We answer this question in the affirmative in the following way. We analyze MAs with VDS, which is also known as Kernighan-Lin for the TSP, on an artificial problem and show that MAs with a simple first-improvement local search...... outperform VDS. Moreover, we show that the performance gap is exponential. We analyze the features leading to a failure of VDS and derive a new local search operator, coined Opportunistic Local Search, that can easily overcome regions of the search space where local optima are clustered. The power...

  14. Hybrid Architectures for Evolutionary Computing Algorithms

    Science.gov (United States)

    2008-01-01

    Clarkson Univ., at AFRL, summer 2005 (yellow) Genetic Algorithm FPGA Core Burns P1026/MAPLD 200524 GA Core Datapath – Top-level Module • EA parameters and...Statistics are read from I/O ports Burns P1026/MAPLD 200525 GA Core Datapath – Population Module • Array of individuals • Population size register...Permutation generator • Current permutation element register • Current index register Burns P1026/MAPLD 200526 GA Core Datapath – PRNG Module • When

  15. A Hybrid Immigrants Scheme for Genetic Algorithms in Dynamic Environments

    Institute of Scientific and Technical Information of China (English)

    Shengxiang Yang; Renato Tinós

    2007-01-01

    Dynamic optimization problems are a kind of optimization problems that involve changes over time. They pose a serious challenge to traditional optimization methods as well as conventional genetic algorithms since the goal is no longer to search for the optimal solution(s) of a fixed problem but to track the moving optimum over time. Dynamic optimization problems have attracted a growing interest from the genetic algorithm community in recent years. Several approaches have been developed to enhance the performance of genetic algorithms in dynamic environments. One approach is to maintain the diversity of the population via random immigrants. This paper proposes a hybrid immigrants scheme that combines the concepts of elitism, dualism and random immigrants for genetic algorithms to address dynamic optimization problems. In this hybrid scheme, the best individual, i.e., the elite, from the previous generation and its dual individual are retrieved as the bases to create immigrants via traditional mutation scheme. These elitism-based and dualism-based immigrants together with some random immigrants are substituted into the current population, replacing the worst individuals in the population. These three kinds of immigrants aim to address environmental changes of slight, medium and significant degrees respectively and hence efficiently adapt genetic algorithms to dynamic environments that are subject to different severities of changes. Based on a series of systematically constructed dynamic test problems, experiments are carried out to investigate the performance of genetic algorithms with the hybrid immigrants scheme and traditional random immigrants scheme. Experimental results validate the efficiency of the proposed hybrid immigrants scheme for improving the performance of genetic algorithms in dynamic environments.

  16. Performance Assessment of Hybrid Data Fusion and Tracking Algorithms

    DEFF Research Database (Denmark)

    Sand, Stephan; Mensing, Christian; Laaraiedh, Mohamed

    2009-01-01

    This paper presents an overview on the performance of hybrid data fusion and tracking algorithms evaluated in the WHERE consortium. The focus is on three scenarios. For the small scale indoor scenario with ultra wideband (UWB) complementing cellular communication systems, the accuracy can vary in...

  17. Hybrid Probabilistic Logics: Theoretical Aspects, Algorithms and Experiments

    NARCIS (Netherlands)

    Michels, S.

    2016-01-01

    Steffen Michels Hybrid Probabilistic Logics: Theoretical Aspects, Algorithms and Experiments Probabilistic logics aim at combining the properties of logic, that is they provide a structured way of expressing knowledge and a mechanical way of reasoning about such knowledge, with the ability of prob

  18. A Hybrid Aggressive Space Mapping Algorithm for EM Optimization

    DEFF Research Database (Denmark)

    Bakr, Mohamed H.; Bandler, John W.; Georgieva, N.;

    1999-01-01

    We propose a novel hybrid aggressive space-mapping (HASM) optimization algorithm. HASM exploits both the trust-region aggressive space-mapping (TRASM) strategy and direct optimization. Severe differences between the coarse and fine models and nonuniqueness of the parameter extraction procedure ma...

  19. Hybrid Bee Ant Colony Algorithm for Effective Load Balancing And ...

    African Journals Online (AJOL)

    PROF. OLIVER OSUAGWA

    Genetic Algorithm (MO-GA) for dynamic job scheduling ... selection of a data centre. 2.2 Load ... An artificial ant colony, that was capable of .... Scheduling in Hybrid Cloud,” International Journal of Engineering and Technology Volume 2. No.

  20. Hybrid routing and spectrum assignment algorithms based on distance-adaptation combined coevolution and heuristics in elastic optical networks

    Science.gov (United States)

    Ding, Zhe; Xu, Zhanqi; Zeng, Xiaodong; Ma, Tao; Yang, Fan

    2014-04-01

    By adopting the orthogonal frequency division multiplexing technology, spectrum-sliced elastic optical path networks can offer flexible bandwidth to each connection request and utilize the spectrum resources efficiently. The routing and spectrum assignment (RSA) problems in SLICE networks are solved by using heuristic algorithms in most prior studies and addressed by intelligent algorithms in few investigations. The performance of RSA algorithms can be further improved if we could combine such two types of algorithms. Therefore, we propose three hybrid RSA algorithms: DACE-GMSF, DACE-GLPF, and DACE-GEMkPSF, which are the combination of the heuristic algorithm and coevolution based on distance-adaptive policy. In the proposed algorithms, we first groom the connection requests, then sort the connection requests by using the heuristic algorithm (most subcarriers first, longest path first, and extended most k paths' slots first), and finally search the approximately optimal solution with the coevolutionary policy. We present a model of the RSA problem by using integral linear programming, and key elements in the proposed algorithms are addressed in detail. Simulations under three topologies show that the proposed hybrid RSA algorithms can save spectrum resources efficiently.

  1. Priority Based Dynamic Round Robin (PBDRR) Algorithm with Intelligent Time Slice for Soft Real Time Systems

    OpenAIRE

    Prof. Rakesh Mohanty; Prof H.S Behera; Khusbu Patwari; Monisha Dash; M. Lakshmi Prasanna

    2011-01-01

    In this paper, a new variant of Round Robin (RR) algorithm is proposed which is suitable for soft real time systems. RR algorithm performs optimally in timeshared systems, but it is not suitable for soft real time systems. Because it gives more number of context switches, larger waiting time and larger response time. We have proposed a novel algorithm, known as Priority Based Dynamic Round Robin Algorithm(PBDRR), which calculates intelligent time slice for individual processes and changes aft...

  2. Hybrid Active Noise Control using Adjoint LMS Algorithms

    Energy Technology Data Exchange (ETDEWEB)

    Nam, Hyun Do; Hong, Sik Ki [Dankook University (Korea, Republic of)

    1998-07-01

    A multi-channel hybrid active noise control(MCHANC) is derived by combining hybrid active noise control techniques and adjoint LMS algorithms, and this algorithm is applied to an active noise control system in a three dimensional enclosure. A MCHANC system uses feed forward and feedback filters simultaneously to cancel noises in an enclosure. The adjoint LMs algorithm, in which the error is filtered through an adjoint filter of the secondary channel, is also used to reduce the computational burden of adaptive filters. The overall attenuation performance and convergence characteristics of MCHANC algorithm is better than both multiple-channel feed forward algorithms and multiple-channel feedback algorithms. In a large enclosure, the acoustic reverberation can be very long, which means a very high order feed forward filter must be used to cancel the reverberation noises. Strong reverberation noises are generally narrow band and low frequency, which can be effectively predicted and canceled by a feedback adaptive filters. So lower order feed forward filter taps can be used in MCHANC algorithm which combines advantages of fast convergence and small excess mean square error. In this paper, computer simulations and real time implementations is carried out on a TMS320C31 processor to evaluate the performance of the MCHANC systems. (author). 11 refs., 11 figs., 1 tab.

  3. Multiple Intelligences in Online, Hybrid, and Traditional Business Statistics Courses

    Science.gov (United States)

    Lopez, Salvador; Patron, Hilde

    2012-01-01

    According to Howard Gardner, Professor of Cognition and Education at Harvard University, intelligence of humans cannot be measured with a single factor such as the IQ level. Instead, he and others have suggested that humans have different types of intelligence. This paper examines whether students registered in online or mostly online courses have…

  4. A hybrid evolutionary algorithm for distribution feeder reconfiguration

    Indian Academy of Sciences (India)

    Taher Niknam; Reza Khorshidi; Bahman Bahmani Firouzi

    2010-04-01

    Distribution feeder reconfiguration (DFR) is formulated as a multiobjective optimization problem which minimizes real power losses, deviation of the node voltages and the number of switching operations and also balances the loads on the feeders. In the proposed method, the distance ($\\lambda_2$ norm) between the vectorvalued objective function and the worst-case vector-valued objective function in the feasible set is maximized. In the algorithm, the status of tie and sectionalizing switches are considered as the control variables. The proposed DFR problem is a non-differentiable optimization problem. Therefore, a new hybrid evolutionary algorithm based on combination of fuzzy adaptive particle swarm optimization (FAPSO) and ant colony optimization (ACO), called HFAPSO, is proposed to solve it. The performance of HFAPSO is evaluated and compared with other methods such as genetic algorithm (GA), ACO, the original PSO, Hybrid PSO and ACO (HPSO) considering different distribution test systems.

  5. A New Hybrid Algorithm for Association Rule Mining

    Institute of Scientific and Technical Information of China (English)

    ZHANG Min-cong; YAN Cun-liang; ZHU Kai-yu

    2007-01-01

    HA (hashing array), a new algorithm, for mining frequent itemsets of large database is proposed. It employs a structure hash array, ItemArray ( ) to store the information of database and then uses it instead of database in later iteration. By this improvement, only twice scanning of the whole database is necessary, thereby the computational cost can be reduced significantly. To overcome the performance bottleneck of frequent 2-itemsets mining, a modified algorithm of HA, DHA (direct-addressing hashing and array) is proposed, which combines HA with direct-addressing hashing technique. The new hybrid algorithm, DHA, not only overcomes the performance bottleneck but also inherits the advantages of HA. Extensive simulations are conducted in this paper to evaluate the performance of the proposed new algorithm, and the results prove the new algorithm is more efficient and reasonable.

  6. ANOMALY DETECTION IN NETWORKING USING HYBRID ARTIFICIAL IMMUNE ALGORITHM

    Directory of Open Access Journals (Sweden)

    D. Amutha Guka

    2012-01-01

    Full Text Available Especially in today’s network scenario, when computers are interconnected through internet, security of an information system is very important issue. Because no system can be absolutely secure, the timely and accurate detection of anomalies is necessary. The main aim of this research paper is to improve the anomaly detection by using Hybrid Artificial Immune Algorithm (HAIA which is based on Artificial Immune Systems (AIS and Genetic Algorithm (GA. In this research work, HAIA approach is used to develop Network Anomaly Detection System (NADS. The detector set is generated by using GA and the anomalies are identified using Negative Selection Algorithm (NSA which is based on AIS. The HAIA algorithm is tested with KDD Cup 99 benchmark dataset. The detection rate is used to measure the effectiveness of the NADS. The results and consistency of the HAIA are compared with earlier approaches and the results are presented. The proposed algorithm gives best results when compared to the earlier approaches.

  7. Research on intelligent fault diagnosis based on time series analysis algorithm

    Institute of Scientific and Technical Information of China (English)

    CHEN Gang; LIU Yang; ZHOU Wen-an; SONG Jun-de

    2008-01-01

    Aiming to realize fast and accurate fault diagnosisin complex network environment, this article proposes a set ofanomaly detection algorithm and intelligent fault diagnosismodel. Firstly, a novel anomaly detection algorithm based ontime series analysis is put forward to improve the generalizedlikelihood ratio (GLR) test, and thus, detection accuracy isenhanced and the algorithm complexity is reduced. Secondly,the intelligent fault diagnosis model is established byintroducing neural network technology, and thereby, theanomaly information of each node in end-to-end network isintegrated and processed in parallel to intelligently diagnosethe fault cause. Finally, server backup solution in enterpriseinformation network is taken as the simulation scenario. Theresults demonstrate that the proposed method can not onlydetect fault occurrence in time, but can also implement onlinediagnosis for fault cause, and thus, real-time and intelligent faultmanagement process is achieved.

  8. Hooke–Jeeves Method-used Local Search in a Hybrid Global Optimization Algorithm

    Directory of Open Access Journals (Sweden)

    V. D. Sulimov

    2014-01-01

    Full Text Available Modern methods for optimization investigation of complex systems are based on development and updating the mathematical models of systems because of solving the appropriate inverse problems. Input data desirable for solution are obtained from the analysis of experimentally defined consecutive characteristics for a system or a process. Causal characteristics are the sought ones to which equation coefficients of mathematical models of object, limit conditions, etc. belong. The optimization approach is one of the main ones to solve the inverse problems. In the main case it is necessary to find a global extremum of not everywhere differentiable criterion function. Global optimization methods are widely used in problems of identification and computation diagnosis system as well as in optimal control, computing to-mography, image restoration, teaching the neuron networks, other intelligence technologies. Increasingly complicated systems of optimization observed during last decades lead to more complicated mathematical models, thereby making solution of appropriate extreme problems significantly more difficult. A great deal of practical applications may have the problem con-ditions, which can restrict modeling. As a consequence, in inverse problems the criterion functions can be not everywhere differentiable and noisy. Available noise means that calculat-ing the derivatives is difficult and unreliable. It results in using the optimization methods without calculating the derivatives.An efficiency of deterministic algorithms of global optimization is significantly restrict-ed by their dependence on the extreme problem dimension. When the number of variables is large they use the stochastic global optimization algorithms. As stochastic algorithms yield too expensive solutions, so this drawback restricts their applications. Developing hybrid algo-rithms that combine a stochastic algorithm for scanning the variable space with deterministic local search

  9. Time Series Analysis and Forecasting for Wind Speeds Using Support Vector Regression Coupled with Artificial Intelligent Algorithms

    Directory of Open Access Journals (Sweden)

    Ping Jiang

    2015-01-01

    Full Text Available Wind speed/power has received increasing attention around the earth due to its renewable nature as well as environmental friendliness. With the global installed wind power capacity rapidly increasing, wind industry is growing into a large-scale business. Reliable short-term wind speed forecasts play a practical and crucial role in wind energy conversion systems, such as the dynamic control of wind turbines and power system scheduling. In this paper, an intelligent hybrid model for short-term wind speed prediction is examined; the model is based on cross correlation (CC analysis and a support vector regression (SVR model that is coupled with brainstorm optimization (BSO and cuckoo search (CS algorithms, which are successfully utilized for parameter determination. The proposed hybrid models were used to forecast short-term wind speeds collected from four wind turbines located on a wind farm in China. The forecasting results demonstrate that the intelligent hybrid models outperform single models for short-term wind speed forecasting, which mainly results from the superiority of BSO and CS for parameter optimization.

  10. Combining ptychographical algorithms with the Hybrid Input-Output (HIO) algorithm.

    Science.gov (United States)

    Konijnenberg, A P; Coene, W M J; Pereira, S F; Urbach, H P

    2016-12-01

    In this article we combine the well-known Ptychographical Iterative Engine (PIE) with the Hybrid Input-Output (HIO) algorithm. The important insight is that the HIO feedback function should be kept strictly separate from the reconstructed object, which is done by introducing a separate feedback function per probe position. We have also combined HIO with floating PIE (fPIE) and extended PIE (ePIE). Simulations indicate that the combined algorithm performs significantly better in many situations. Although we have limited our research to a combination with HIO, the same insight can be used to combine ptychographical algorithms with any phase retrieval algorithm that uses a feedback function.

  11. Intelligent Power Management of hybrid Wind/ Fuel Cell/ Energy Storage Power Generation System

    Directory of Open Access Journals (Sweden)

    A. Hajizadeh

    2013-12-01

    Full Text Available This paper presents an intelligent power management strategy for hybrid wind/ fuel cell/ energy storage power generation system. The dynamic models of wind turbine, fuel cell and energy storage have been used for simulation of hybrid power system. In order to design power flow control strategy, a fuzzy logic control has been implemented to manage the power between power sources. The optimal operation of the hybrid power system is a main goal of designing power management strategy. The hybrid power system is simulated in MATLAB/ SIMIULINK environment and different operating conditions have been considered to evaluate the response of power management strategy.

  12. Adaptive and Reliable Control Algorithm for Hybrid System Architecture

    Directory of Open Access Journals (Sweden)

    Osama Abdel Hakeem Abdel Sattar

    2012-01-01

    Full Text Available A stand-alone system is defined as an autonomous system that supplies electricity without being connected to the electric grid. Hybrid systems combined renewable energy source, that are never depleted (such solar (photovoltaic (PV, wind, hydroelectric, etc. , With other sources of energy, like Diesel. If these hybrid systems are optimally designed, they can be more cost effective and reliable than single systems. However, the design of hybrid systems is complex because of the uncertain renewable energy supplies, load demands and the non-linear characteristics of some components, so the design problem cannot be solved easily by classical optimisation methods. The use of heuristic techniques, such as the genetic algorithms, can give better results than classical methods. This paper presents to a hybrid system control algorithm and also dispatches strategy design in which wind is the primary energy resource with photovoltaic cells. The dimension of the design (max. load is 2000 kW and the sources is implemented as flow 1500 kw from wind, 500 kw from solar and diesel 2000 kw. The main task of the preposed algorithm is to take full advantage of the wind energy and solar energy when it is available and to minimize diesel fuel consumption.

  13. Intelligent Systems for Engineers and Scientists

    CERN Document Server

    Hopgood, Adrian A

    2011-01-01

    The third edition of this bestseller examines the principles of artificial intelligence and their application to engineering and science, as well as techniques for developing intelligent systems to solve practical problems. Covering the full spectrum of intelligent systems techniques, it incorporates knowledge-based systems, computational intelligence, and their hybrids. Using clear and concise language, Intelligent Systems for Engineers and Scientists, Third Edition features updates and improvements throughout all chapters. It includes expanded and separated chapters on genetic algorithms and

  14. Multiple Intelligences in Online, Hybrid, and Traditional Business Statistics Courses

    Directory of Open Access Journals (Sweden)

    Salvador Lopez

    Full Text Available According to Howard Garner, Professor of Cognition and Education at Harvard University, intelligence of humans cannot be measured with a single factor such as the IQ level. Instead, he and others have suggested that humans have different types of intelligence. This paper examines whether students registered in online or mostly online courses have a different type of intelligence from students registered in traditional face-to-face courses. At the beginning of the fall semester of 2011, a group of 128 students from four different courses in Business Statistics completed a survey to determine their types of intelligence. Our findings reveal surprising results with important consequences in terms of teaching styles that better fit our students.

  15. Hybrid Taguchi DNA Swarm Intelligence for Optimal Inverse Kinematics Redundancy Resolution of Six-DOF Humanoid Robot Arms

    Directory of Open Access Journals (Sweden)

    Hsu-Chih Huang

    2014-01-01

    Full Text Available This paper presents a hybrid Taguchi deoxyribonucleic acid (DNA swarm intelligence for solving the inverse kinematics redundancy problem of six degree-of-freedom (DOF humanoid robot arms. The inverse kinematics problem of the multi-DOF humanoid robot arm is redundant and has no general closed-form solutions or analytical solutions. The optimal joint configurations are obtained by minimizing the predefined performance index in DNA algorithm for real-world humanoid robotics application. The Taguchi method is employed to determine the DNA parameters to search for the joint solutions of the six-DOF robot arms more efficiently. This approach circumvents the disadvantage of time-consuming tuning procedure in conventional DNA computing. Simulation results are conducted to illustrate the effectiveness and merit of the proposed methods. This Taguchi-based DNA (TDNA solver outperforms the conventional solvers, such as geometric solver, Jacobian-based solver, genetic algorithm (GA solver and ant, colony optimization (ACO solver.

  16. The Hybrid Dynamic Prototype Construction and Parameter Optimization with Genetic Algorithm for Support Vector Machine

    Directory of Open Access Journals (Sweden)

    Chun-Liang Lu

    2015-10-01

    Full Text Available The optimized hybrid artificial intelligence model is a potential tool to deal with construction engineering and management problems. Support vector machine (SVM has achieved excellent performance in a wide variety of applications. Nevertheless, how to effectively reduce the training complexity for SVM is still a serious challenge. In this paper, a novel order-independent approach for instance selection, called the dynamic condensed nearest neighbor (DCNN rule, is proposed to adaptively construct prototypes in the training dataset and to reduce the redundant or noisy instances in a classification process for the SVM. Furthermore, a hybrid model based on the genetic algorithm (GA is proposed to simultaneously optimize the prototype construction and the SVM kernel parameters setting to enhance the classification accuracy. Several UCI benchmark datasets are considered to compare the proposed hybrid GA-DCNN-SVM approach with the previously published GA-based method. The experimental results illustrate that the proposed hybrid model outperforms the existing method and effectively improves the classification performance for the SVM.

  17. The Ordered Clustered Travelling Salesman Problem: A Hybrid Genetic Algorithm

    Directory of Open Access Journals (Sweden)

    Zakir Hussain Ahmed

    2014-01-01

    Full Text Available The ordered clustered travelling salesman problem is a variation of the usual travelling salesman problem in which a set of vertices (except the starting vertex of the network is divided into some prespecified clusters. The objective is to find the least cost Hamiltonian tour in which vertices of any cluster are visited contiguously and the clusters are visited in the prespecified order. The problem is NP-hard, and it arises in practical transportation and sequencing problems. This paper develops a hybrid genetic algorithm using sequential constructive crossover, 2-opt search, and a local search for obtaining heuristic solution to the problem. The efficiency of the algorithm has been examined against two existing algorithms for some asymmetric and symmetric TSPLIB instances of various sizes. The computational results show that the proposed algorithm is very effective in terms of solution quality and computational time. Finally, we present solution to some more symmetric TSPLIB instances.

  18. The ordered clustered travelling salesman problem: a hybrid genetic algorithm.

    Science.gov (United States)

    Ahmed, Zakir Hussain

    2014-01-01

    The ordered clustered travelling salesman problem is a variation of the usual travelling salesman problem in which a set of vertices (except the starting vertex) of the network is divided into some prespecified clusters. The objective is to find the least cost Hamiltonian tour in which vertices of any cluster are visited contiguously and the clusters are visited in the prespecified order. The problem is NP-hard, and it arises in practical transportation and sequencing problems. This paper develops a hybrid genetic algorithm using sequential constructive crossover, 2-opt search, and a local search for obtaining heuristic solution to the problem. The efficiency of the algorithm has been examined against two existing algorithms for some asymmetric and symmetric TSPLIB instances of various sizes. The computational results show that the proposed algorithm is very effective in terms of solution quality and computational time. Finally, we present solution to some more symmetric TSPLIB instances.

  19. Hybrid Algorithm for the Optimization of Training Convolutional Neural Network

    Directory of Open Access Journals (Sweden)

    Hayder M. Albeahdili

    2015-10-01

    Full Text Available The training optimization processes and efficient fast classification are vital elements in the development of a convolution neural network (CNN. Although stochastic gradient descend (SGD is a Prevalence algorithm used by many researchers for the optimization of training CNNs, it has vast limitations. In this paper, it is endeavor to diminish and tackle drawbacks inherited from SGD by proposing an alternate algorithm for CNN training optimization. A hybrid of genetic algorithm (GA and particle swarm optimization (PSO is deployed in this work. In addition to SGD, PSO and genetic algorithm (PSO-GA are also incorporated as a combined and efficient mechanism in achieving non trivial solutions. The proposed unified method achieves state-of-the-art classification results on the different challenge benchmark datasets such as MNIST, CIFAR-10, and SVHN. Experimental results showed that the results outperform and achieve superior results to most contemporary approaches.

  20. The theory of variational hybrid quantum-classical algorithms

    CERN Document Server

    McClean, Jarrod R; Babbush, Ryan; Aspuru-Guzik, Alán

    2015-01-01

    Many quantum algorithms have daunting resource requirements when compared to what is available today. To address this discrepancy, a quantum-classical hybrid optimization scheme known as "the quantum variational eigensolver" was developed with the philosophy that even minimal quantum resources could be made useful when used in conjunction with classical routines. In this work we extend the general theory of this algorithm and suggest algorithmic improvements for practical implementations. Specifically, we develop a variational adiabatic ansatz and explore unitary coupled cluster where we establish a connection from second order unitary coupled cluster to universal gate sets through relaxation of exponential splitting. We introduce the concept of quantum variational error suppression that allows some errors to be suppressed naturally in this algorithm on a pre-threshold quantum device. Additionally, we analyze truncation and correlated sampling in Hamiltonian averaging as ways to reduce the cost of this proced...

  1. Hybrid Collision Detection Algorithm based on Image Space

    Directory of Open Access Journals (Sweden)

    XueLi Shen

    2013-07-01

    Full Text Available Collision detection is an important application in the field of virtual reality, and efficiently completing collision detection has become the research focus. For the poorly real-time defect of collision detection, this paper has presented an algorithm based on the hybrid collision detection, detecting the potential collision object sets quickly with the mixed bounding volume hierarchy tree, and then using the streaming pattern collision detection algorithm to make an accurate detection. With the above methods, it can achieve the purpose of balancing load of the CPU and GPU and speeding up the detection rate. The experimental results show that compared with the classic Rapid algorithm, this algorithm can effectively improve the efficiency of collision detection.

  2. Application of hybrid clustering using parallel k-means algorithm and DIANA algorithm

    Science.gov (United States)

    Umam, Khoirul; Bustamam, Alhadi; Lestari, Dian

    2017-03-01

    DNA is one of the carrier of genetic information of living organisms. Encoding, sequencing, and clustering DNA sequences has become the key jobs and routine in the world of molecular biology, in particular on bioinformatics application. There are two type of clustering, hierarchical clustering and partitioning clustering. In this paper, we combined two type clustering i.e. K-Means (partitioning clustering) and DIANA (hierarchical clustering), therefore it called Hybrid clustering. Application of hybrid clustering using Parallel K-Means algorithm and DIANA algorithm used to clustering DNA sequences of Human Papillomavirus (HPV). The clustering process is started with Collecting DNA sequences of HPV are obtained from NCBI (National Centre for Biotechnology Information), then performing characteristics extraction of DNA sequences. The characteristics extraction result is store in a matrix form, then normalize this matrix using Min-Max normalization and calculate genetic distance using Euclidian Distance. Furthermore, the hybrid clustering is applied by using implementation of Parallel K-Means algorithm and DIANA algorithm. The aim of using Hybrid Clustering is to obtain better clusters result. For validating the resulted clusters, to get optimum number of clusters, we use Davies-Bouldin Index (DBI). In this study, the result of implementation of Parallel K-Means clustering is data clustered become 5 clusters with minimal IDB value is 0.8741, and Hybrid Clustering clustered data become 13 sub-clusters with minimal IDB values = 0.8216, 0.6845, 0.3331, 0.1994 and 0.3952. The IDB value of hybrid clustering less than IBD value of Parallel K-Means clustering only that perform at 1ts stage. Its means clustering using Hybrid Clustering have the better result to clustered DNA sequence of HPV than perform parallel K-Means Clustering only.

  3. Multiphase Return Trajectory Optimization Based on Hybrid Algorithm

    Directory of Open Access Journals (Sweden)

    Yi Yang

    2016-01-01

    Full Text Available A hybrid trajectory optimization method consisting of Gauss pseudospectral method (GPM and natural computation algorithm has been developed and utilized to solve multiphase return trajectory optimization problem, where a phase is defined as a subinterval in which the right-hand side of the differential equation is continuous. GPM converts the optimal control problem to a nonlinear programming problem (NLP, which helps to improve calculation accuracy and speed of natural computation algorithm. Through numerical simulations, it is found that the multiphase optimal control problem could be solved perfectly.

  4. Intelligent Controller Design for DC Motor Speed Control based on Fuzzy Logic-Genetic Algorithms Optimization

    OpenAIRE

    Boumediene ALLAOUA; Laoufi, Abdellah; Brahim GASBAOUI; Nasri, Abdelfatah; Abdessalam ABDERRAHMANI

    2008-01-01

    In this paper, an intelligent controller of the DC (Direct current) Motor drive is designed using fuzzy logic-genetic algorithms optimization. First, a controller is designed according to fuzzy rules such that the systems are fundamentally robust. To obtain the globally optimal values, parameters of the fuzzy controller are improved by genetic algorithms optimization model. Computer MATLAB work space demonstrate that the fuzzy controller associated to the genetic algorithms approach became ve...

  5. RH+: A Hybrid Localization Algorithm for Wireless Sensor Networks

    Science.gov (United States)

    Basaran, Can; Baydere, Sebnem; Kucuk, Gurhan

    Today, localization of nodes in Wireless Sensor Networks (WSNs) is a challenging problem. Especially, it is almost impossible to guarantee that one algorithm giving optimal results for one topology will give optimal results for any other random topology. In this study, we propose a centralized, range- and anchor-based, hybrid algorithm called RH+ that aims to combine the powerful features of two orthogonal techniques: Classical Multi-Dimensional Scaling (CMDS) and Particle Spring Optimization (PSO). As a result, we find that our hybrid approach gives a fast-converging solution which is resilient to range-errors and very robust to topology changes. Across all topologies we studied, the average estimation error is less than 0.5m. when the average node density is 10 and only 2.5% of the nodes are beacons.

  6. A hybrid variational-perturbational nuclear motion algorithm

    Science.gov (United States)

    Fábri, Csaba; Furtenbacher, Tibor; Császár, Attila G.

    2014-09-01

    A hybrid variational-perturbational nuclear motion algorithm based on the perturbative treatment of the Coriolis coupling terms of the Eckart-Watson kinetic energy operator following a variational treatment of the rest of the operator is described. The algorithm has been implemented in the quantum chemical code DEWE. Performance of the hybrid treatment is assessed by comparing selected numerically exact variational vibration-only and rovibrational energy levels of the C2H4, C2D4, and CH4 molecules with their perturbatively corrected counterparts. For many of the rotational-vibrational states examined, numerical tests reveal excellent agreement between the variational and even the first-order perturbative energy levels, whilst the perturbative approach is able to reduce the computational cost of the matrix-vector product evaluations, needed by the iterative Lanczos eigensolver, by almost an order of magnitude.

  7. Solving Timetabling Problems by Hybridizing Genetic Algorithms and Taboo Search

    OpenAIRE

    Rahoual, Malek; Saad, Rachid

    2006-01-01

    International audience; As demand for Education increases and diversifies, so does the difficulty of designing workable timetables for schools and academic institutions. Besides the intractability of the basic problem, there is an increasing variety of constraints that come into play. In this paper we present a hybrid of two metaheuristics (genetic algorithm and tabu search) to tackle the problem in its most general setting. Promising experimental results are shown.

  8. An empirical study on collective intelligence algorithms for video games problem-solving

    OpenAIRE

    Antonio Gonzalez-Pardo; Fernando Palero; David Camacho

    2015-01-01

    Computational intelligence (CI), such as evolutionary computation or swarm intelligence methods, is a set of bio-inspired algorithms that have been widely used to solve problems in areas like planning, scheduling or constraint satisfaction problems. Constrained satisfaction problems (CSP) have taken an important attention from the research community due to their applicability to real problems. Any CSP problem is usually modelled as a constrained graph where the edges represent a set of restri...

  9. A new hybrid intelligent system for accurate detection of Parkinson's disease.

    Science.gov (United States)

    Hariharan, M; Polat, Kemal; Sindhu, R

    2014-03-01

    Elderly people are commonly affected by Parkinson's disease (PD) which is one of the most common neurodegenerative disorders due to the loss of dopamine-producing brain cells. People with PD's (PWP) may have difficulty in walking, talking or completing other simple tasks. Variety of medications is available to treat PD. Recently, researchers have found that voice signals recorded from the PWP is becoming a useful tool to differentiate them from healthy controls. Several dysphonia features, feature reduction/selection techniques and classification algorithms were proposed by researchers in the literature to detect PD. In this paper, hybrid intelligent system is proposed which includes feature pre-processing using Model-based clustering (Gaussian mixture model), feature reduction/selection using principal component analysis (PCA), linear discriminant analysis (LDA), sequential forward selection (SFS) and sequential backward selection (SBS), and classification using three supervised classifiers such as least-square support vector machine (LS-SVM), probabilistic neural network (PNN) and general regression neural network (GRNN). PD dataset was used from University of California-Irvine (UCI) machine learning database. The strength of the proposed method has been evaluated through several performance measures. The experimental results show that the combination of feature pre-processing, feature reduction/selection methods and classification gives a maximum classification accuracy of 100% for the Parkinson's dataset. Copyright © 2014 Elsevier Ireland Ltd. All rights reserved.

  10. Optimization of Antennas using a Hybrid Genetic-Algorithm Space-Mapping Algorithm

    DEFF Research Database (Denmark)

    Pantoja, M.F.; Bretones, A.R.; Meincke, Peter;

    2006-01-01

    A hybrid global-local optimization technique for the design of antennas is presented. It consists of the subsequent application of a Genetic Algorithm (GA) that employs coarse models in the simulations and a space mapping (SM) that refines the solution found in the previous stage. The technique...

  11. Intelligent open learning systems concepts, models and algorithms

    CERN Document Server

    Rózewski, Przemyslaw; Tadeusiewicz, Ryszard; Zaikin, Oleg

    2011-01-01

    In presented book the Intelligent Open Learning Systems (IOLS) are proposed, described, discussed, and evaluated. The IOLS is a system in which traditional methods of online teaching are enhanced through the use of artificial intelligence and cognitive science. This is the main topic of the book. It consists of ten chapters and is divided into three parts. The first part concentrates on the Open Learning System (OLS) analysis, in particular: the social and educational meanings of the OLS, the new role of the teacher and the new requirements regarding the structure of didactic material. Moreove

  12. Performance evaluation for intelligent optimization algorithms in self-potential data inversion

    Institute of Scientific and Technical Information of China (English)

    崔益安; 朱肖雄; 陈志学; 刘嘉文; 柳建新

    2016-01-01

    The self-potential method is widely used in environmental and engineering geophysics. Four intelligent optimization algorithms are adopted to design the inversion to interpret self-potential data more accurately and efficiently: simulated annealing, genetic, particle swarm optimization, and ant colony optimization. Using both noise-free and noise-added synthetic data, it is demonstrated that all four intelligent algorithms can perform self-potential data inversion effectively. During the numerical experiments, the model distribution in search space, the relative errors of model parameters, and the elapsed time are recorded to evaluate the performance of the inversion. The results indicate that all the intelligent algorithms have good precision and tolerance to noise. Particle swarm optimization has the fastest convergence during iteration because of its good balanced searching capability between global and local minimisation.

  13. A Hybrid Demon Algorithm for the Two-Dimensional Orthogonal Strip Packing Problem

    Directory of Open Access Journals (Sweden)

    Bili Chen

    2015-01-01

    Full Text Available This paper develops a hybrid demon algorithm for a two-dimensional orthogonal strip packing problem. This algorithm combines a placement procedure based on an improved heuristic, local search, and demon algorithm involved in setting one parameter. The hybrid algorithm is tested on a wide set of benchmark instances taken from the literature and compared with other well-known algorithms. The computation results validate the quality of the solutions and the effectiveness of the proposed algorithm.

  14. Comparative intelligibility investigation of single-channel noise-reduction algorithms for Chinese, Japanese, and English.

    Science.gov (United States)

    Li, Junfeng; Yang, Lin; Zhang, Jianping; Yan, Yonghong; Hu, Yi; Akagi, Masato; Loizou, Philipos C

    2011-05-01

    A large number of single-channel noise-reduction algorithms have been proposed based largely on mathematical principles. Most of these algorithms, however, have been evaluated with English speech. Given the different perceptual cues used by native listeners of different languages including tonal languages, it is of interest to examine whether there are any language effects when the same noise-reduction algorithm is used to process noisy speech in different languages. A comparative evaluation and investigation is taken in this study of various single-channel noise-reduction algorithms applied to noisy speech taken from three languages: Chinese, Japanese, and English. Clean speech signals (Chinese words and Japanese words) were first corrupted by three types of noise at two signal-to-noise ratios and then processed by five single-channel noise-reduction algorithms. The processed signals were finally presented to normal-hearing listeners for recognition. Intelligibility evaluation showed that the majority of noise-reduction algorithms did not improve speech intelligibility. Consistent with a previous study with the English language, the Wiener filtering algorithm produced small, but statistically significant, improvements in intelligibility for car and white noise conditions. Significant differences between the performances of noise-reduction algorithms across the three languages were observed.

  15. Hybrid Binary Imperialist Competition Algorithm and Tabu Search Approach for Feature Selection Using Gene Expression Data

    Science.gov (United States)

    Aorigele; Zeng, Weiming; Hong, Xiaomin

    2016-01-01

    Gene expression data composed of thousands of genes play an important role in classification platforms and disease diagnosis. Hence, it is vital to select a small subset of salient features over a large number of gene expression data. Lately, many researchers devote themselves to feature selection using diverse computational intelligence methods. However, in the progress of selecting informative genes, many computational methods face difficulties in selecting small subsets for cancer classification due to the huge number of genes (high dimension) compared to the small number of samples, noisy genes, and irrelevant genes. In this paper, we propose a new hybrid algorithm HICATS incorporating imperialist competition algorithm (ICA) which performs global search and tabu search (TS) that conducts fine-tuned search. In order to verify the performance of the proposed algorithm HICATS, we have tested it on 10 well-known benchmark gene expression classification datasets with dimensions varying from 2308 to 12600. The performance of our proposed method proved to be superior to other related works including the conventional version of binary optimization algorithm in terms of classification accuracy and the number of selected genes. PMID:27579323

  16. A Hybrid Graph Representation for Recursive Backtracking Algorithms

    Science.gov (United States)

    Abu-Khzam, Faisal N.; Langston, Michael A.; Mouawad, Amer E.; Nolan, Clinton P.

    Many exact algorithms for NP-hard graph problems adopt the old Davis-Putman branch-and-reduce paradigm. The performance of these algorithms often suffers from the increasing number of graph modifications, such as deletions, that reduce the problem instance and have to be "taken back" frequently during the search process. The use of efficient data structures is necessary for fast graph modification modules as well as fast take-back procedures. In this paper, we investigate practical implementation-based aspects of exact algorithms by providing a hybrid graph representation that addresses the take-back challenge and combines the advantage of {O}(1) adjacency-queries in adjacency-matrices with the advantage of efficient neighborhood traversal in adjacency-lists.

  17. ENHANCED HYBRID PSO – ACO ALGORITHM FOR GRID SCHEDULING

    Directory of Open Access Journals (Sweden)

    P. Mathiyalagan

    2010-07-01

    Full Text Available Grid computing is a high performance computing environment to solve larger scale computational demands. Grid computing contains resource management, task scheduling, security problems, information management and so on. Task scheduling is a fundamental issue in achieving high performance in grid computing systems. A computational GRID is typically heterogeneous in the sense that it combines clusters of varying sizes, and different clusters typically contains processing elements with different level of performance. In this, heuristic approaches based on particle swarm optimization and ant colony optimization algorithms are adopted for solving task scheduling problems in grid environment. Particle Swarm Optimization (PSO is one of the latest evolutionary optimization techniques by nature. It has the better ability of global searching and has been successfully applied to many areas such as, neural network training etc. Due to the linear decreasing of inertia weight in PSO the convergence rate becomes faster, which leads to the minimal makespan time when used for scheduling. To make the convergence rate faster, the PSO algorithm is improved by modifying the inertia parameter, such that it produces better performance and gives an optimized result. The ACO algorithm is improved by modifying the pheromone updating rule. ACO algorithm is hybridized with PSO algorithm for efficient result and better convergence in PSO algorithm.

  18. Multi Population Hybrid Genetic Algorithms for University Course Timetabling Problem

    Directory of Open Access Journals (Sweden)

    Leila Jadidi

    2012-06-01

    Full Text Available University course timetabling is one of the important and time consuming issues that each University is involved with it at the beginning of each. This problem is in class of NP-hard problem and is very difficult to solve by classic algorithms. Therefore optimization techniques are used to solve them and produce optimal or near optimal feasible solutions instead of exact solutions. Genetic algorithms, because of multidirectional search property of them, are considered as an efficient approach for solving this type of problems. In this paper three new hybrid genetic algorithms for solving the university course timetabling problem (UCTP are proposed: FGARI, FGASA and FGATS. In proposed algorithms, fuzzy logic is used to measure violation of soft constraints in fitness function to deal with inherent uncertainly and vagueness involved in real life data. Also, randomized iterative local search, simulated annealing and tabu search are applied, respectively, to improve exploitive search ability and prevent genetic algorithm to be trapped in local optimum. The experimental results indicate that the proposed algorithms are able to produce promising results for the UCTP.

  19. Multi Population Hybrid Genetic Algorithms for University Course Timetabling

    Directory of Open Access Journals (Sweden)

    Mehrnaz Shirani LIRI

    2012-08-01

    Full Text Available University course timetabling is one of the important and time consuming issues that each University is involved with at the beginning of each university year. This problem is in class of NP-hard problem and is very difficult to solve by classic algorithms. Therefore optimization techniques are used to solve them and produce optimal or almost optimal feasible solutions instead of exact solutions. Genetic algorithms, because of their multidirectional search property, are considered as an efficient approach for solving this type of problems. In this paper three new hybrid genetic algorithms for solving the university course timetabling problem (UCTP are proposed: FGARI, FGASA and FGATS. In the proposed algorithms, fuzzy logic is used to measure violation of soft constraints in fitness function to deal with inherent uncertainty and vagueness involved in real life data. Also, randomized iterative local search, simulated annealing and tabu search are applied, respectively, to improve exploitive search ability and prevent genetic algorithm to be trapped in local optimum. The experimental results indicate that the proposed algorithms are able to produce promising results for the UCTP

  20. Coordination of the STATCOM and Power System Stabilizer Using Hybrid BF-NM Algorithm

    Directory of Open Access Journals (Sweden)

    Mohammdjavad Morshed

    2011-05-01

    Full Text Available Recent developments of Facts devices increase the importance of their coordination with the power system controllers. With regard to nonlinearities of power system, changes in the operating points, reaction between power system and STATCOM, linear methods cannot be used to design parameters of stabilizers. Therefore, in this paper, a nonlinear model of power system is considered for the coordination design of PSS and STATCOM. A hybrid method which combines bacterial foraging (BF algorithm with Nelder-Mead (NM method (BF-NM is employed to coordinately design the PSS and STATCOM controllers. By combining these two methods, the search power of the intelligent methods and the precision of conventional methods are simultaneously employed. To evaluate the performance of the proposed method, it is applied on a four machine power system. Simulation results confirm the efficiency of the proposed method for stabilizing power system oscillations.

  1. International Conference on Artificial Intelligence and Evolutionary Algorithms in Engineering Systems

    CERN Document Server

    Dash, Subhransu; Panigrahi, Bijaya

    2015-01-01

      The book is a collection of high-quality peer-reviewed research papers presented in Proceedings of International Conference on Artificial Intelligence and Evolutionary Algorithms in Engineering Systems (ICAEES 2014) held at Noorul Islam Centre for Higher Education, Kumaracoil, India. These research papers provide the latest developments in the broad area of use of artificial intelligence and evolutionary algorithms in engineering systems. The book discusses wide variety of industrial, engineering and scientific applications of the emerging techniques. It presents invited papers from the inventors/originators of new applications and advanced technologies.

  2. An improved hybrid encoding cuckoo search algorithm for 0-1 knapsack problems.

    Science.gov (United States)

    Feng, Yanhong; Jia, Ke; He, Yichao

    2014-01-01

    Cuckoo search (CS) is a new robust swarm intelligence method that is based on the brood parasitism of some cuckoo species. In this paper, an improved hybrid encoding cuckoo search algorithm (ICS) with greedy strategy is put forward for solving 0-1 knapsack problems. First of all, for solving binary optimization problem with ICS, based on the idea of individual hybrid encoding, the cuckoo search over a continuous space is transformed into the synchronous evolution search over discrete space. Subsequently, the concept of confidence interval (CI) is introduced; hence, the new position updating is designed and genetic mutation with a small probability is introduced. The former enables the population to move towards the global best solution rapidly in every generation, and the latter can effectively prevent the ICS from trapping into the local optimum. Furthermore, the greedy transform method is used to repair the infeasible solution and optimize the feasible solution. Experiments with a large number of KP instances show the effectiveness of the proposed algorithm and its ability to achieve good quality solutions.

  3. Hybrid Intelligent Diagnosis Technology Based on Granular Computing%应用粒计算的混合智能故障诊断技术研究

    Institute of Scientific and Technical Information of China (English)

    张周锁; 侯照文; 孙闯; 何正嘉

    2011-01-01

    Aiming at lacking hybrid modes and common algorithms in existing hybrid intelligent diagnosis, a new model of hybrid intelligent fault diagnosis based on granular computing is proposed. In the model, the core features sets (CFS) are extracted in different granular levels by the reduction algorithm based on neighborhood rough set, then, CFS are chosen to train artificial neural network and support vector machines as sub-classifiers in corresponding levels. And the results of sub-classifiers in different granular levels are combined by criterion matrix algorithm as output of hybrid intelligent diagnosis. The model is applied to fault diagnosis of roller bearings in high-speed locomotive. The application results demonstrate that the classification accuracy is raised with the increasing granular levels, and the accuracy of hybrid results is higher than the one of any sub-classifier. The proposed model exhibits the effect of granulation and the advantages complementation among different intelligent methods to provide a new way for hybrid intelligent diagnosis.%针对现有的混合智能故障诊断模型缺乏通用方法和混合框架,未能实现不同智能诊断方法的实质性融合和优势互补的问题,提出并构建了一种基于粒计算的混合智能故障诊断模型.该模型的核心是在邻域粗糙集中求取不同的邻域值,对故障特征集进行分层粒化,在不同粒度下获得核属性集.利用核属性集在相应粒度下构建人工神经网络和支持向量机子分类器,通过评估矩阵算法对所有粒度下全部子分类器的诊断结果进行融合集成.模型应用结果表明,分类精度随着粒度层的增加而不断提高,集成后的分类精度高于不同粒度下的所有子分类器,从而体现了粒化分层的优势和不同智能诊断方法的优势互补,为混合智能诊断提供了一种新途径.

  4. An Intelligent Broadcasting Algorithm for Early Warning Message Dissemination in VANETs

    Directory of Open Access Journals (Sweden)

    Ihn-Han Bae

    2015-01-01

    Full Text Available Vehicular ad hoc network (VANET has gained much attention recently to improve road safety, reduce traffic congestion, and enable efficient traffic management because of its many important applications in transportation. In this paper, an early warning intelligence broadcasting algorithm is proposed, EW-ICAST, to disseminate a safety message for VANETs. The proposed EW-ICAST uses not only the early warning system on the basis of time to collision (TTC but also the intelligent broadcasting algorithm on the basis of fuzzy logic. Thus, the EW-ICAST resolves effectively broadcast storm problem and meets time-critical requirement. The performance of EW-ICAST is evaluated through simulation and compared with that of other alert message dissemination algorithms. From the simulation results, we know that EW-ICAST is superior to Simple, P-persistence, and EDB algorithms.

  5. Development of Hybrid Intelligent Systems and their Applications from Engineering Systems to Complex Systems

    CERN Document Server

    Owladeghaffari, Hamed

    2008-01-01

    In this study, we introduce general frame of MAny Connected Intelligent Particles Systems (MACIPS). Connections and interconnections between particles get a complex behavior of such merely simple system (system in system).Contribution of natural computing, under information granulation theory, are the main topic of this spacious skeleton. Upon this clue, we organize different algorithms involved a few prominent intelligent computing and approximate reasoning methods such as self organizing feature map (SOM)[9], Neuro- Fuzzy Inference System[10], Rough Set Theory (RST)[11], collaborative clustering, Genetic Algorithm and Ant Colony System. Upon this, we have employed our algorithms on the several engineering systems, especially emerged systems in Civil and Mineral processing. In other process, we investigated how our algorithms can be taken as a linkage of government-society interaction, where government catches various fashions of behavior: solid (absolute) or flexible. So, transition of such society, by chan...

  6. Modeling, control, and simulation of grid connected intelligent hybrid battery/photovoltaic system using new hybrid fuzzy-neural method.

    Science.gov (United States)

    Rezvani, Alireza; Khalili, Abbas; Mazareie, Alireza; Gandomkar, Majid

    2016-07-01

    Nowadays, photovoltaic (PV) generation is growing increasingly fast as a renewable energy source. Nevertheless, the drawback of the PV system is its dependence on weather conditions. Therefore, battery energy storage (BES) can be considered to assist for a stable and reliable output from PV generation system for loads and improve the dynamic performance of the whole generation system in grid connected mode. In this paper, a novel topology of intelligent hybrid generation systems with PV and BES in a DC-coupled structure is presented. Each photovoltaic cell has a specific point named maximum power point on its operational curve (i.e. current-voltage or power-voltage curve) in which it can generate maximum power. Irradiance and temperature changes affect these operational curves. Therefore, the nonlinear characteristic of maximum power point to environment has caused to development of different maximum power point tracking techniques. In order to capture the maximum power point (MPP), a hybrid fuzzy-neural maximum power point tracking (MPPT) method is applied in the PV system. Obtained results represent the effectiveness and superiority of the proposed method, and the average tracking efficiency of the hybrid fuzzy-neural is incremented by approximately two percentage points in comparison to the conventional methods. It has the advantages of robustness, fast response and good performance. A detailed mathematical model and a control approach of a three-phase grid-connected intelligent hybrid system have been proposed using Matlab/Simulink.

  7. A Novel Hybrid Data Clustering Algorithm Based on Artificial Bee Colony Algorithm and K-Means

    Institute of Scientific and Technical Information of China (English)

    TRAN Dang Cong; WU Zhijian; WANG Zelin; DENG Changshou

    2015-01-01

    To improve the performance of K-means clustering algorithm, this paper presents a new hybrid ap-proach of Enhanced artificial bee colony algorithm and K-means (EABCK). In EABCK, the original artificial bee colony algorithm (called ABC) is enhanced by a new mu-tation operation and guided by the global best solution (called EABC). Then, the best solution is updated by K-means in each iteration for data clustering. In the experi-ments, a set of benchmark functions was used to evaluate the performance of EABC with other comparative ABC variants. To evaluate the performance of EABCK on data clustering, eleven benchmark datasets were utilized. The experimental results show that EABC and EABCK out-perform other comparative ABC variants and data clus-tering algorithms, respectively.

  8. Priority Based Dynamic Round Robin (PBDRR) Algorithm with Intelligent Time Slice for Soft Real Time Systems

    CERN Document Server

    Mohanty, Rakesh; Patwari, Khusbu; Dash, Monisha; Prasanna, M Lakshmi

    2011-01-01

    In this paper, a new variant of Round Robin (RR) algorithm is proposed which is suitable for soft real time systems. RR algorithm performs optimally in timeshared systems, but it is not suitable for soft real time systems. Because it gives more number of context switches, larger waiting time and larger response time. We have proposed a novel algorithm, known as Priority Based Dynamic Round Robin Algorithm(PBDRR),which calculates intelligent time slice for individual processes and changes after every round of execution. The proposed scheduling algorithm is developed by taking dynamic time quantum concept into account. Our experimental results show that our proposed algorithm performs better than algorithm in [8] in terms of reducing the number of context switches, average waiting time and average turnaround time.

  9. ROBUST-HYBRID GENETIC ALGORITHM FOR A FLOW-SHOP SCHEDULING PROBLEM (A Case Study at PT FSCM Manufacturing Indonesia

    Directory of Open Access Journals (Sweden)

    Johan Soewanda

    2007-01-01

    Full Text Available This paper discusses the application of Robust Hybrid Genetic Algorithm to solve a flow-shop scheduling problem. The proposed algorithm attempted to reach minimum makespan. PT. FSCM Manufacturing Indonesia Plant 4's case was used as a test case to evaluate the performance of the proposed algorithm. The proposed algorithm was compared to Ant Colony, Genetic-Tabu, Hybrid Genetic Algorithm, and the company's algorithm. We found that Robust Hybrid Genetic produces statistically better result than the company's, but the same as Ant Colony, Genetic-Tabu, and Hybrid Genetic. In addition, Robust Hybrid Genetic Algorithm required less computational time than Hybrid Genetic Algorithm

  10. Development of Intelligent Suits for Disuse Atrophy of Musculoskeletal System Using Hybrid Exercise Method

    Science.gov (United States)

    Shiba, Naoto; Yoshimitsu, Kazuhiro; Matsugaki, Tohru; Narita, Arata; Maeda, Takashi; Inada, Tomohisa; Tagawa, Yoshihiko; Numada, Kiyoshi; Nishi, Tetsuya

    We developed ‘Hybrid exercise’ method that was designed to maintain the musculoskeletal system by using electrically stimulated antagonist muscles to resist volitional contraction of agonist muscles. This approach also produces a minimum of inertial reaction forces and has the advantage that it may minimize the need for external stabilization that is currently necessary during exercise in a weightlessness environment. The purpose of this study was to develop the intelligent suits with virtual reality (VR) system that had function of preventing disuse atrophy of musculoskeletal system using hybrid exercise system. Installing of the hybrid exercise system to the subject became easy by the intelligent suits. VR system realized the sense of sight by computer graphics animation synchronized with subjects' motion, and sense of force induced by electrical stimulation. By using VR system, the management of the exercise accomplishment degree was enabled easily because the device could record the exercise history. Intelligent suits with VR hybrid exercise system might become one of the useful countermeasures for the disuse musculoskeletal system in the space.

  11. A Hybrid Genetic Algorithm for the Multiple Crossdocks Problem

    Directory of Open Access Journals (Sweden)

    Zhaowei Miao

    2012-01-01

    Full Text Available We study a multiple crossdocks problem with supplier and customer time windows, where any violation of time windows will incur a penalty cost and the flows through the crossdock are constrained by fixed transportation schedules and crossdock capacities. We prove this problem to be NP-hard in the strong sense and therefore focus on developing efficient heuristics. Based on the problem structure, we propose a hybrid genetic algorithm (HGA integrating greedy technique and variable neighborhood search method to solve the problem. Extensive experiments under different scenarios were conducted, and results show that HGA outperforms CPLEX solver, providing solutions in realistic timescales.

  12. Aligning multiple protein sequences by parallel hybrid genetic algorithm.

    Science.gov (United States)

    Nguyen, Hung Dinh; Yoshihara, Ikuo; Yamamori, Kunihito; Yasunaga, Moritoshi

    2002-01-01

    This paper presents a parallel hybrid genetic algorithm (GA) for solving the sum-of-pairs multiple protein sequence alignment. A new chromosome representation and its corresponding genetic operators are proposed. A multi-population GENITOR-type GA is combined with local search heuristics. It is then extended to run in parallel on a multiprocessor system for speeding up. Experimental results of benchmarks from the BAliBASE show that the proposed method is superior to MSA, OMA, and SAGA methods with regard to quality of solution and running time. It can be used for finding multiple sequence alignment as well as testing cost functions.

  13. Effective pathfinding for four-wheeled robot based on combining Theta* and hybrid A* algorithms

    Directory of Open Access Journals (Sweden)

    Віталій Геннадійович Михалько

    2016-07-01

    Full Text Available Effective pathfinding algorithm based on Theta* and Hybrid A* algorithms was developed for four-wheeled robot. Pseudocode for algorithm was showed and explained. Algorithm and simulator for four-wheeled robot were implemented using Java programming language. Algorithm was tested on U-obstacles, complex maps and for parking problem

  14. Evolving Quantum Oracles with Hybrid Quantum-inspired Evolutionary Algorithm

    CERN Document Server

    Ding, S; Yang, Q; Ding, Shengchao; Jin, Zhi; Yang, Qing

    2006-01-01

    Quantum oracles play key roles in the studies of quantum computation and quantum information. But implementing quantum oracles efficiently with universal quantum gates is a hard work. Motivated by genetic programming, this paper proposes a novel approach to evolve quantum oracles with a hybrid quantum-inspired evolutionary algorithm. The approach codes quantum circuits with numerical values and combines the cost and correctness of quantum circuits into the fitness function. To speed up the calculation of matrix multiplication in the evaluation of individuals, a fast algorithm of matrix multiplication with Kronecker product is also presented. The experiments show the validity and the effects of some parameters of the presented approach. And some characteristics of the novel approach are discussed too.

  15. Genetic Algorithm Based Hybrid Fuzzy System for Assessing Morningness

    Directory of Open Access Journals (Sweden)

    Animesh Biswas

    2014-01-01

    Full Text Available This paper describes a real life case example on the assessment process of morningness of individuals using genetic algorithm based hybrid fuzzy system. It is observed that physical and mental performance of human beings in different time slots of a day are majorly influenced by morningness orientation of those individuals. To measure the morningness of people various self-reported questionnaires were developed by different researchers in the past. Among them reduced version of Morningness-Eveningness Questionnaire is mostly accepted. Almost all of the linguistic terms used in questionnaires are fuzzily defined. So, assessing them in crisp environments with their responses does not seem to be justifiable. Fuzzy approach based research works for assessing morningness of people are very few in the literature. In this paper, genetic algorithm is used to tune the parameters of a Mamdani fuzzy inference model to minimize error with their predicted outputs for assessing morningness of people.

  16. Healing Temperature of Hybrid Structures Based on Genetic Algorithm

    Institute of Scientific and Technical Information of China (English)

    赵中伟; 陈志华; 刘红波

    2016-01-01

    The healing temperature of suspen-dome with stacked arches(SDSA)and arch-supported single-layer lattice shell structures was investigated based on the genetic algorithm. The temperature field of arch under solar radiation was derived by FLUENT to investigate the influence of solar radiation on the determination of the healing temperature. Moreover, a multi-scale model was established to apply the complex temperature field under solar radiation. The change in the mechanical response of these two kinds of structures with the healing temperature was discussed. It can be concluded that solar radiation has great influence on the healing temperature, and the genetic algorithm can be effectively used in the optimization of the healing temperature for hybrid structures.

  17. Research on intelligent algorithm of electro - hydraulic servo control system

    Science.gov (United States)

    Wang, Yannian; Zhao, Yuhui; Liu, Chengtao

    2017-09-01

    In order to adapt the nonlinear characteristics of the electro-hydraulic servo control system and the influence of complex interference in the industrial field, using a fuzzy PID switching learning algorithm is proposed and a fuzzy PID switching learning controller is designed and applied in the electro-hydraulic servo controller. The designed controller not only combines the advantages of the fuzzy control and PID control, but also introduces the learning algorithm into the switching function, which makes the learning of the three parameters in the switching function can avoid the instability of the system during the switching between the fuzzy control and PID control algorithms. It also makes the switch between these two control algorithm more smoother than that of the conventional fuzzy PID.

  18. Gas demand forecasting by a new artificial intelligent algorithm

    Science.gov (United States)

    Khatibi. B, Vahid; Khatibi, Elham

    2012-01-01

    Energy demand forecasting is a key issue for consumers and generators in all energy markets in the world. This paper presents a new forecasting algorithm for daily gas demand prediction. This algorithm combines a wavelet transform and forecasting models such as multi-layer perceptron (MLP), linear regression or GARCH. The proposed method is applied to real data from the UK gas markets to evaluate their performance. The results show that the forecasting accuracy is improved significantly by using the proposed method.

  19. The intelligent web search, smart algorithms, and big data

    CERN Document Server

    Shroff, Gautam

    2013-01-01

    As we use the Web for social networking, shopping, and news, we leave a personal trail. These days, linger over a Web page selling lamps, and they will turn up at the advertising margins as you move around the Internet, reminding you, tempting you to make that purchase. Search engines such as Google can now look deep into the data on the Web to pull out instances of the words you are looking for. And there are pages that collect and assess information to give you a snapshot ofchanging political opinion. These are just basic examples of the growth of ""Web intelligence"", as increasingly sophis

  20. VLSI Implementation of Hybrid Algorithm Architecture for Speech Enhancement

    Directory of Open Access Journals (Sweden)

    Jigar Shah

    2012-07-01

    Full Text Available The speech enhancement techniques are required to improve the speech signal quality without causing any offshoot in many applications. Recently the growing use of cellular and mobile phones, hands free systems, VoIP phones, voice messaging service, call service centers etc. require efficient real time speech enhancement and detection strategies to make them superior over conventional speech communication systems. The speech enhancement algorithms are required to deal with additive noise and convolutive distortion that occur in any wireless communication system. Also the single channel (one microphone signal is available in real environments. Hence a single channel hybrid algorithm is used which combines minimum mean square error-log spectral amplitude (MMSE-LSA algorithm for additive noise removal and the relative spectral amplitude (RASTA algorithm for reverberation cancellation. The real time and embedded implementation on directly available DSP platforms like TMS320C6713 shows some defects. Hence the VLSI implementation using semi-custom (e.g. FPGA or full-custom approach is required. One such architecture is proposed in this paper.

  1. CURE-SMOTE algorithm and hybrid algorithm for feature selection and parameter optimization based on random forests.

    Science.gov (United States)

    Ma, Li; Fan, Suohai

    2017-03-14

    The random forests algorithm is a type of classifier with prominent universality, a wide application range, and robustness for avoiding overfitting. But there are still some drawbacks to random forests. Therefore, to improve the performance of random forests, this paper seeks to improve imbalanced data processing, feature selection and parameter optimization. We propose the CURE-SMOTE algorithm for the imbalanced data classification problem. Experiments on imbalanced UCI data reveal that the combination of Clustering Using Representatives (CURE) enhances the original synthetic minority oversampling technique (SMOTE) algorithms effectively compared with the classification results on the original data using random sampling, Borderline-SMOTE1, safe-level SMOTE, C-SMOTE, and k-means-SMOTE. Additionally, the hybrid RF (random forests) algorithm has been proposed for feature selection and parameter optimization, which uses the minimum out of bag (OOB) data error as its objective function. Simulation results on binary and higher-dimensional data indicate that the proposed hybrid RF algorithms, hybrid genetic-random forests algorithm, hybrid particle swarm-random forests algorithm and hybrid fish swarm-random forests algorithm can achieve the minimum OOB error and show the best generalization ability. The training set produced from the proposed CURE-SMOTE algorithm is closer to the original data distribution because it contains minimal noise. Thus, better classification results are produced from this feasible and effective algorithm. Moreover, the hybrid algorithm's F-value, G-mean, AUC and OOB scores demonstrate that they surpass the performance of the original RF algorithm. Hence, this hybrid algorithm provides a new way to perform feature selection and parameter optimization.

  2. Real-time intelligent pattern recognition algorithm for surface EMG signals

    Directory of Open Access Journals (Sweden)

    Jahed Mehran

    2007-12-01

    Full Text Available Abstract Background Electromyography (EMG is the study of muscle function through the inquiry of electrical signals that the muscles emanate. EMG signals collected from the surface of the skin (Surface Electromyogram: sEMG can be used in different applications such as recognizing musculoskeletal neural based patterns intercepted for hand prosthesis movements. Current systems designed for controlling the prosthetic hands either have limited functions or can only be used to perform simple movements or use excessive amount of electrodes in order to achieve acceptable results. In an attempt to overcome these problems we have proposed an intelligent system to recognize hand movements and have provided a user assessment routine to evaluate the correctness of executed movements. Methods We propose to use an intelligent approach based on adaptive neuro-fuzzy inference system (ANFIS integrated with a real-time learning scheme to identify hand motion commands. For this purpose and to consider the effect of user evaluation on recognizing hand movements, vision feedback is applied to increase the capability of our system. By using this scheme the user may assess the correctness of the performed hand movement. In this work a hybrid method for training fuzzy system, consisting of back-propagation (BP and least mean square (LMS is utilized. Also in order to optimize the number of fuzzy rules, a subtractive clustering algorithm has been developed. To design an effective system, we consider a conventional scheme of EMG pattern recognition system. To design this system we propose to use two different sets of EMG features, namely time domain (TD and time-frequency representation (TFR. Also in order to decrease the undesirable effects of the dimension of these feature sets, principle component analysis (PCA is utilized. Results In this study, the myoelectric signals considered for classification consists of six unique hand movements. Features chosen for EMG signal

  3. A study of image reconstruction algorithms for hybrid intensity interferometers

    Science.gov (United States)

    Crabtree, Peter N.; Murray-Krezan, Jeremy; Picard, Richard H.

    2011-09-01

    Phase retrieval is explored for image reconstruction using outputs from both a simulated intensity interferometer (II) and a hybrid system that combines the II outputs with partially resolved imagery from a traditional imaging telescope. Partially resolved imagery provides an additional constraint for the iterative phase retrieval process, as well as an improved starting point. The benefits of this additional a priori information are explored and include lower residual phase error for SNR values above 0.01, increased sensitivity, and improved image quality. Results are also presented for image reconstruction from II measurements alone, via current state-of-the-art phase retrieval techniques. These results are based on the standard hybrid input-output (HIO) algorithm, as well as a recent enhancement to HIO that optimizes step lengths in addition to step directions. The additional step length optimization yields a reduction in residual phase error, but only for SNR values greater than about 10. Image quality for all algorithms studied is quite good for SNR>=10, but it should be noted that the studied phase-recovery techniques yield useful information even for SNRs that are much lower.

  4. Analysis of first prototype universal intelligence tests: evaluating and comparing AI algorithms and humans

    CERN Document Server

    Insa-Cabrera, Javier

    2011-01-01

    Today, available methods that assess AI systems are focused on using empirical techniques to measure the performance of algorithms in some specific tasks (e.g., playing chess, solving mazes or land a helicopter). However, these methods are not appropriate if we want to evaluate the general intelligence of AI and, even less, if we compare it with human intelligence. The ANYNT project has designed a new method of evaluation that tries to assess AI systems using well known computational notions and problems which are as general as possible. This new method serves to assess general intelligence (which allows us to learn how to solve any new kind of problem we face) and not only to evaluate performance on a set of specific tasks. This method not only focuses on measuring the intelligence of algorithms, but also to assess any intelligent system (human beings, animals, AI, aliens?,...), and letting us to place their results on the same scale and, therefore, to be able to compare them. This new approach will allow us...

  5. Classification of ETM+ Remote Sensing Image Based on Hybrid Algorithm of Genetic Algorithm and Back Propagation Neural Network

    Directory of Open Access Journals (Sweden)

    Haisheng Song

    2013-01-01

    Full Text Available The back propagation neural network (BPNN algorithm can be used as a supervised classification in the processing of remote sensing image classification. But its defects are obvious: falling into the local minimum value easily, slow convergence speed, and being difficult to determine intermediate hidden layer nodes. Genetic algorithm (GA has the advantages of global optimization and being not easy to fall into local minimum value, but it has the disadvantage of poor local searching capability. This paper uses GA to generate the initial structure of BPNN. Then, the stable, efficient, and fast BP classification network is gotten through making fine adjustments on the improved BP algorithm. Finally, we use the hybrid algorithm to execute classification on remote sensing image and compare it with the improved BP algorithm and traditional maximum likelihood classification (MLC algorithm. Results of experiments show that the hybrid algorithm outperforms improved BP algorithm and MLC algorithm.

  6. Application of Computational Intelligence in Order to Develop Hybrid Orbit Propagation Methods

    Directory of Open Access Journals (Sweden)

    Iván Pérez

    2013-01-01

    Full Text Available We present a new approach in astrodynamics and celestial mechanics fields, called hybrid perturbation theory. A hybrid perturbation theory combines an integrating technique, general perturbation theory or special perturbation theory or semianalytical method, with a forecasting technique, statistical time series model or computational intelligence method. This combination permits an increase in the accuracy of the integrating technique, through the modeling of higher-order terms and other external forces not considered in the integrating technique. In this paper, neural networks have been used as time series forecasters in order to help two economic general perturbation theories describe the motion of an orbiter only perturbed by the Earth’s oblateness.

  7. Intelligent Controller Design for DC Motor Speed Control based on Fuzzy Logic-Genetic Algorithms Optimization

    Directory of Open Access Journals (Sweden)

    Boumediene ALLAOUA

    2008-12-01

    Full Text Available In this paper, an intelligent controller of the DC (Direct current Motor drive is designed using fuzzy logic-genetic algorithms optimization. First, a controller is designed according to fuzzy rules such that the systems are fundamentally robust. To obtain the globally optimal values, parameters of the fuzzy controller are improved by genetic algorithms optimization model. Computer MATLAB work space demonstrate that the fuzzy controller associated to the genetic algorithms approach became very strong, gives a very good results and possesses good robustness.

  8. Swarm intelligence for atmospheric compensation in free space optical communication-Modified shuffled frog leaping algorithm

    Science.gov (United States)

    Li, Zhaokun; Cao, Jingtai; Zhao, Xiaohui; Liu, Wei

    2015-03-01

    A conventional adaptive optics (AO) system is widely used to compensate atmospheric turbulence in free space optical (FSO) communication systems, but wavefront measurements based on phase-conjugation principle are not desired under strong scintillation circumstances. In this study we propose a novel swarm intelligence optimization algorithm, which is called modified shuffled frog leaping algorithm (MSFL), to compensate the wavefront aberration. Simulation and experiments results show that MSFL algorithm performs well in the atmospheric compensation and it can increase the coupling efficiency in receiver terminal and significantly improve the performance of the FSO communication systems.

  9. Blind Recognition Algorithm of Turbo Codes for Communication Intelligence Systems

    Directory of Open Access Journals (Sweden)

    Ali Naseri

    2011-11-01

    Full Text Available Turbo codes are widely used in land and space radio communication systems, and because of complexity of structure, are custom in military communication systems. In electronic warfare, COMINT systems make attempt to recognize codes by blind ways. In this Paper, the algorithm is proposed for blind recognition of turbo code parameters like code kind, code-word length, code rate, length of interleaver and delay blocks number of convolution code. The algorithm calculations volume is0.5L3+1.25L, therefore it is suitable for real time systems.

  10. Hybrid Algorithms for Solving Variational Inequalities, Variational Inclusions, Mixed Equilibria, and Fixed Point Problems

    Directory of Open Access Journals (Sweden)

    Lu-Chuan Ceng

    2014-01-01

    Full Text Available We present a hybrid iterative algorithm for finding a common element of the set of solutions of a finite family of generalized mixed equilibrium problems, the set of solutions of a finite family of variational inequalities for inverse strong monotone mappings, the set of fixed points of an infinite family of nonexpansive mappings, and the set of solutions of a variational inclusion in a real Hilbert space. Furthermore, we prove that the proposed hybrid iterative algorithm has strong convergence under some mild conditions imposed on algorithm parameters. Here, our hybrid algorithm is based on Korpelevič’s extragradient method, hybrid steepest-descent method, and viscosity approximation method.

  11. A New Hybrid Fuzzy Intelligent Filter for Medical Image Noise Reduction

    OpenAIRE

    Somaye Aliakbari Dehkordi; Mohammad Ghasemzadeh; Vali Derhami

    2014-01-01

    Medical imaging comprises different imaging modalities and processes to image human body for diagnostic and treatment purposes and, therefore has an important role in the improvement of public health in all population groups. In this paper, we present an intelligent hybrid noise reduction filter which is based on Neuro-Fuzzy systems. It is especially beneficial in medical image noise reduction. First stage we feed the input image into four general noise reduction filters in parallel. These ge...

  12. Hybrid Computation Model for Intelligent System Design by Synergism of Modified EFC with Neural Network

    OpenAIRE

    2015-01-01

    In recent past, it has been seen in many applications that synergism of computational intelligence techniques outperforms over an individual technique. This paper proposes a new hybrid computation model which is a novel synergism of modified evolutionary fuzzy clustering with associated neural networks. It consists of two modules: fuzzy distribution and neural classifier. In first module, mean patterns are distributed into the number of clusters based on the modified evolutionary fuzzy cluste...

  13. Intelligent Hybrid Control Strategy for Trajectory Tracking of Robot Manipulators

    Directory of Open Access Journals (Sweden)

    Yi Zuo

    2008-01-01

    Full Text Available We address the problem of robust tracking control using a PD-plus-feedforward controller and an intelligent adaptive robust compensator for a rigid robotic manipulator with uncertain dynamics and external disturbances. A key feature of this scheme is that soft computer methods are used to learn the upper bound of system uncertainties and adjust the width of the boundary layer base. In this way, the prior knowledge of the upper bound of the system uncertainties does need not to be required. Moreover, chattering can be effectively eliminated, and asymptotic error convergence can be guaranteed. Numerical simulations and experiments of two-DOF rigid robots are presented to show effectiveness of the proposed scheme.

  14. Speech Intelligibility Prediction Intended for State-of-the-Art Noise Estimation Algorithms

    Directory of Open Access Journals (Sweden)

    Nasir Saleem

    2014-01-01

    Full Text Available Noise estimation is critical factor of any speech enhancement system. In presence of additive non-stationary background noise, it is difficult to understand speech for normal hearing particularly for hearing impaired person. The background interfering noise reduces the intelligibility and perceptual quality of speech. Speech enhancement with various noise estimation techniques attempts to minimize the interfering components and enhance the intelligibility and perceptual aspects of damaged speech. This study addresses the selection of right noise estimation algorithm in speech enhancement system for intelligent hearing. A noisy environment of airport is considered. The clean speech is corrupted by noisy environment for different noise levels ranging from 0 to 15 dB. Six diverse noise estimation algorithms are selected to estimate the noise including Minimum Controlled Recursive Average (MCRA, MCRA-2, improved MCRA, Martin minimum tracking, continuous spectral minimum tracking, and weighted spectral average. Spectral subtraction algorithm is used for enhancing the noisy speech. The intelligibility of enhanced speech is assessed by the fractional Articulation Index (fAI and SNRLOSS.

  15. Operation management of daily economic dispatch using novel hybrid particle swarm optimization and gravitational search algorithm with hybrid mutation strategy

    Science.gov (United States)

    Wang, Yan; Huang, Song; Ji, Zhicheng

    2017-07-01

    This paper presents a hybrid particle swarm optimization and gravitational search algorithm based on hybrid mutation strategy (HGSAPSO-M) to optimize economic dispatch (ED) including distributed generations (DGs) considering market-based energy pricing. A daily ED model was formulated and a hybrid mutation strategy was adopted in HGSAPSO-M. The hybrid mutation strategy includes two mutation operators, chaotic mutation, Gaussian mutation. The proposed algorithm was tested on IEEE-33 bus and results show that the approach is effective for this problem.

  16. A Fast Hybrid Algorithm Approach for the Exact String Matching Problem Via Berry Ravindran and Alpha Skip Search Algorithms

    Directory of Open Access Journals (Sweden)

    A. A. Almazroi

    2011-01-01

    Full Text Available Problem statement: String matching algorithm had been an essential means for searching biological sequence database. With the constant expansion in scientific data such as DNA and Protein; the development of enhanced algorithms have even become more critical as the major concern had always been how to raise the performances of these search algorithms to meet challenges of scientific information. Approach: Therefore a new hybrid algorithm comprising Berry Ravindran (BR and Alpha Skip Search (ASS is presented. The concept is based on BR shift function and combines with ASS to ensure improved performance. Results: The results obtained in percentages from the proposed hybrid algorithm displayed superior results in terms of number of attempts and number of character comparisons than the original algorithms when various types of data namely DNA, Protein and English text are applied to appraise the hybrid performances. The enhancement of the proposed hybrid algorithm performs better at 71%, 60% and 63% when compared to Berry-Ravindran in DNA, Protein and English text correspondingly. Moreover the rate of enhancement over Alpha Skip Search algorithm in DNA, Protein and English text are 48%, 28% and 36% respectively. Conclusion: The new proposed hybrid algorithm is relevant for searching biological science sequence database and also other string search systems.

  17. A fast hybrid algorithm for exoplanetary transit searches

    CERN Document Server

    Cameron, A C; Street, R A; Lister, T A; West, R G; Wilson, D M; Pont, F; Christian, D J; Clarkson, W I; Enoch, B; Evans, A; Fitzsimmons, A; Haswell, C A; Hellier, C; Hodgkin, S T; Horne, K; Irwin, J; Kane, S R; Keenan, F P; Norton, A J; Parley, N R; Osborne, J; Ryans, R; Skillen, I; Wheatley, P J

    2006-01-01

    We present a fast and efficient hybrid algorithm for selecting exoplanetary candidates from wide-field transit surveys. Our method is based on the widely-used SysRem and Box Least-Squares (BLS) algorithms. Patterns of systematic error that are common to all stars on the frame are mapped and eliminated using the SysRem algorithm. The remaining systematic errors caused by spatially localised flat-fielding and other errors are quantified using a boxcar-smoothing method. We show that the dimensions of the search-parameter space can be reduced greatly by carrying out an initial BLS search on a coarse grid of reduced dimensions, followed by Newton-Raphson refinement of the transit parameters in the vicinity of the most significant solutions. We illustrate the method's operation by applying it to data from one field of the SuperWASP survey, comprising 2300 observations of 7840 stars brighter than V=13.0. We identify 11 likely transit candidates. We reject stars that exhibit significant ellipsoidal variations indicat...

  18. Evaluation of hybrids algorithms for mass detection in digitalized mammograms

    Energy Technology Data Exchange (ETDEWEB)

    Cordero, Jose; Garzon Reyes, Johnson, E-mail: josecorderog@hotmail.com [Grupo de Optica y Espectroscopia GOE, Centro de Ciencia Basica, Universidad Pontifica Bolivariana de Medellin (Colombia)

    2011-01-01

    The breast cancer remains being a significant public health problem, the early detection of the lesions can increase the success possibilities of the medical treatments. The mammography is an image modality effective to early diagnosis of abnormalities, where the medical image is obtained of the mammary gland with X-rays of low radiation, this allows detect a tumor or circumscribed mass between two to three years before that it was clinically palpable, and is the only method that until now achieved reducing the mortality by breast cancer. In this paper three hybrids algorithms for circumscribed mass detection on digitalized mammograms are evaluated. In the first stage correspond to a review of the enhancement and segmentation techniques used in the processing of the mammographic images. After a shape filtering was applied to the resulting regions. By mean of a Bayesian filter the survivors regions were processed, where the characteristics vector for the classifier was constructed with few measurements. Later, the implemented algorithms were evaluated by ROC curves, where 40 images were taken for the test, 20 normal images and 20 images with circumscribed lesions. Finally, the advantages and disadvantages in the correct detection of a lesion of every algorithm are discussed.

  19. Developing energy forecasting model using hybrid artificial intelligence method

    Institute of Scientific and Technical Information of China (English)

    Shahram Mollaiy-Berneti

    2015-01-01

    An important problem in demand planning for energy consumption is developing an accurate energy forecasting model. In fact, it is not possible to allocate the energy resources in an optimal manner without having accurate demand value. A new energy forecasting model was proposed based on the back-propagation (BP) type neural network and imperialist competitive algorithm. The proposed method offers the advantage of local search ability of BP technique and global search ability of imperialist competitive algorithm. Two types of empirical data regarding the energy demand (gross domestic product (GDP), population, import, export and energy demand) in Turkey from 1979 to 2005 and electricity demand (population, GDP, total revenue from exporting industrial products and electricity consumption) in Thailand from 1986 to 2010 were investigated to demonstrate the applicability and merits of the present method. The performance of the proposed model is found to be better than that of conventional back-propagation neural network with low mean absolute error.

  20. Validation and incremental value of the hybrid algorithm for CTO PCI.

    Science.gov (United States)

    Pershad, Ashish; Eddin, Moneer; Girotra, Sudhakar; Cotugno, Richard; Daniels, David; Lombardi, William

    2014-10-01

    To evaluate the outcomes and benefits of using the hybrid algorithm for chronic total occlusion (CTO) percutaneous coronary intervention (PCI). The hybrid algorithm harmonizes antegrade and retrograde techniques for performing CTO PCI. It has the potential to increase success rates and improve efficiency for CTO PCI. No previous data have analyzed the impact of this algorithm on CTO PCI success rates and procedural efficiency. Retrospective analysis of contemporary CTO PCI performed at two high-volume centers with adoption of the hybrid technique was compared to previously published CTO outcomes in a well matched group of patients and lesion subsets. After adoption of the hybrid algorithm, technical success was significantly higher in the post hybrid algorithm group 189/198 (95.4%) vs the pre-algorithm group 367/462 (79.4%) (P CTO PCI. © 2014 Wiley Periodicals, Inc.

  1. A new-style clustering algorithm based on swarm intelligent theory

    Institute of Scientific and Technical Information of China (English)

    CHEN Zhuo; LIU Xiang-shuang

    2007-01-01

    Traditional clustering algorithms generally have some problems, such as the sensitivity to initializing parameter, difficulty in finding out the optimization clustering result and the validity of clustering. In this paper, a FSM and a mathematic model of a new-style clustering algorithm based on the swarm intelligence are provided. In this algorithm, the clustering main body moves in a three-dimensional space and has the abilities of memory, communication, analysis, judgment and coordinating information. Experimental results conform that this algorithm has many merits such as insensitive to the order of the data, capable of dealing with exceptional,high-dimension or complicated data. The algorithm can be used in the fields of Web mining, incremental clustering, economic analysis, pattern recognition, document classification and so on.

  2. The Weighted Support Vector Machine Based on Hybrid Swarm Intelligence Optimization for Icing Prediction of Transmission Line

    Directory of Open Access Journals (Sweden)

    Xiaomin Xu

    2015-01-01

    Full Text Available Not only can the icing coat on transmission line cause the electrical fault of gap discharge and icing flashover but also it will lead to the mechanical failure of tower, conductor, insulators, and others. It will bring great harm to the people’s daily life and work. Thus, accurate prediction of ice thickness has important significance for power department to control the ice disaster effectively. Based on the analysis of standard support vector machine, this paper presents a weighted support vector machine regression model based on the similarity (WSVR. According to the different importance of samples, this paper introduces the weighted support vector machine and optimizes its parameters by hybrid swarm intelligence optimization algorithm with the particle swarm and ant colony (PSO-ACO, which improves the generalization ability of the model. In the case study, the actual data of ice thickness and climate in a certain area of Hunan province have been used to predict the icing thickness of the area, which verifies the validity and applicability of this proposed method. The predicted results show that the intelligent model proposed in this paper has higher precision and stronger generalization ability.

  3. Intelligent micro blood typing system using a fuzzy algorithm

    Science.gov (United States)

    Kang, Taeyun; Lee, Seung-Jae; Kim, Yonggoo; Lee, Gyoo-Whung; Cho, Dong-Woo

    2010-01-01

    ABO typing is the first analysis performed on blood when it is tested for transfusion purposes. The automated machines used in hospitals for this purpose are typically very large and the process is complicated. In this paper, we present a new micro blood typing system that is an improved version of our previous system (Kang et al 2004 Trans. ASME, J. Manuf. Sci. Eng. 126 766, Lee et al 2005 Sensors Mater. 17 113). This system, fabricated using microstereolithography, has a passive valve for controlling the flow of blood and antibodies. The intelligent micro blood typing system has two parts: a single-line micro blood typing device and a fuzzy expert system for grading the strength of agglutination. The passive valve in the single-line micro blood typing device makes the blood stop at the entrance of a micro mixer and lets it flow again after the blood encounters antibodies. Blood and antibodies are mixed in the micro mixer and agglutination occurs in the chamber. The fuzzy expert system then determines the degree of agglutination from images of the agglutinated blood. Blood typing experiments using this device were successful, and the fuzzy expert system produces a grading decision comparable to that produced by an expert conducting a manual analysis.

  4. Intelligent energy allocation strategy for PHEV charging station using gravitational search algorithm

    Science.gov (United States)

    Rahman, Imran; Vasant, Pandian M.; Singh, Balbir Singh Mahinder; Abdullah-Al-Wadud, M.

    2014-10-01

    Recent researches towards the use of green technologies to reduce pollution and increase penetration of renewable energy sources in the transportation sector are gaining popularity. The development of the smart grid environment focusing on PHEVs may also heal some of the prevailing grid problems by enabling the implementation of Vehicle-to-Grid (V2G) concept. Intelligent energy management is an important issue which has already drawn much attention to researchers. Most of these works require formulation of mathematical models which extensively use computational intelligence-based optimization techniques to solve many technical problems. Higher penetration of PHEVs require adequate charging infrastructure as well as smart charging strategies. We used Gravitational Search Algorithm (GSA) to intelligently allocate energy to the PHEVs considering constraints such as energy price, remaining battery capacity, and remaining charging time.

  5. A HYBRID CLASSIFICATION ALGORITHM TO CLASSIFY ENGINEERING STUDENTS’ PROBLEMS AND PERKS

    Directory of Open Access Journals (Sweden)

    Mitali Desai

    2016-03-01

    Full Text Available The social networking sites have brought a new horizon for expressing views and opinions of individuals. Moreover, they provide medium to students to share their sentiments including struggles and joy during the learning process. Such informal information has a great venue for decision making. The large and growing scale of information needs automatic classification techniques. Sentiment analysis is one of the automated techniques to classify large data. The existing predictive sentiment analysis techniques are highly used to classify reviews on E-commerce sites to provide business intelligence. However, they are not much useful to draw decisions in education system since they classify the sentiments into merely three pre-set categories: positive, negative and neutral. Moreover, classifying the students’ sentiments into positive or negative category does not provide deeper insight into their problems and perks. In this paper, we propose a novel Hybrid Classification Algorithm to classify engineering students’ sentiments. Unlike traditional predictive sentiment analysis techniques, the proposed algorithm makes sentiment analysis process descriptive. Moreover, it classifies engineering students’ perks in addition to problems into several categories to help future students and education system in decision making.

  6. Intelligent uninterruptible power supply system with back-up fuel cell/battery hybrid power source

    Science.gov (United States)

    Zhan, Yuedong; Guo, Youguang; Zhu, Jianguo; Wang, Hua

    2008-05-01

    This paper presents the development of an intelligent uninterruptible power supply (UPS) system with a hybrid power source that comprises a proton-exchange membrane fuel cell (PEMFC) and a battery. Attention is focused on the architecture of the UPS hybrid system and the data acquisition and control of the PEMFC. Specifically, the hybrid UPS system consists of a low-cost 60-cell 300 W PEMFC stack, a 3-cell lead-acid battery, an active power factor correction ac-dc rectifier, a half-bridge dc-ac inverter, a dc-dc converter, an ac-dc charger and their control units based on a digital signal processor TMS320F240, other integrated circuit chips, and a simple network management protocol adapter. Experimental tests and theoretical studies are conducted. First, the major parameters of the PEMFC are experimentally obtained and evaluated. Then an intelligent control strategy for the PEMFC stack is proposed and implemented. Finally, the performance of the hybrid UPS system is measured and analyzed.

  7. Evaluation of frequency-lowering algorithms for intelligibility of Chinese speech in hearing-aid users

    Institute of Scientific and Technical Information of China (English)

    Xianbo Xiao; Hui Zhang; Guangshu Hu; Chunhong Liu; Jia Liu

    2009-01-01

    Despite the attention being given to and the knowledge of the benefits of evaluating frequency-lowering algorithms for hearing-impaired people, the causality between these algorithms and their benefits is still not clear. This is aggravated by the fact that comparative research on the methodologies and skills required for fitting an appropriate algorithm to individual patients is lacking. Against this back-drop, the current study has attempted to make progress in this area. In this experiment, six experienced traditional hearing-aid users with severe impairments in the high frequencies were fitted with two different frequency-lowering methods, and weekly hearing tests were con-ducted to track the benefits of such methods. After the experiment, five of the listeners accepted the frequency-lowering algorithms. Both methods showed superior results when compared with the listeners' own hearing aids in most of the tests, and the segmented compression algorithm was indicated to have better "anti-noise" quality and speech intelligibility improvement capabilities. A preference for the appli-cation of proportional compression to unvoiced speech was also found in this algorithm. Unlike in previous studies, all speech materials here are recorded in Chinese. Therefore, the results could also be used to evaluate the benefits of frequency-lowering to the intelligibility of Chinese speech for patients. As a result, an improvement was found, especially in the recognition of consonants. Moreover, no adverse effect was found in intonation recognition.

  8. Training Artificial Neural Networks by a Hybrid PSO-CS Algorithm

    Directory of Open Access Journals (Sweden)

    Jeng-Fung Chen

    2015-06-01

    Full Text Available Presenting a satisfactory and efficient training algorithm for artificial neural networks (ANN has been a challenging task in the supervised learning area. Particle swarm optimization (PSO is one of the most widely used algorithms due to its simplicity of implementation and fast convergence speed. On the other hand, Cuckoo Search (CS algorithm has been proven to have a good ability for finding the global optimum; however, it has a slow convergence rate. In this study, a hybrid algorithm based on PSO and CS is proposed to make use of the advantages of both PSO and CS algorithms. The proposed hybrid algorithm is employed as a new training method for feedforward neural networks (FNNs. To investigate the performance of the proposed algorithm, two benchmark problems are used and the results are compared with those obtained from FNNs trained by original PSO and CS algorithms. The experimental results show that the proposed hybrid algorithm outperforms both PSO and CS in training FNNs.

  9. Resizing Technique-Based Hybrid Genetic Algorithm for Optimal Drift Design of Multistory Steel Frame Buildings

    Directory of Open Access Journals (Sweden)

    Hyo Seon Park

    2014-01-01

    Full Text Available Since genetic algorithm-based optimization methods are computationally expensive for practical use in the field of structural optimization, a resizing technique-based hybrid genetic algorithm for the drift design of multistory steel frame buildings is proposed to increase the convergence speed of genetic algorithms. To reduce the number of structural analyses required for the convergence, a genetic algorithm is combined with a resizing technique that is an efficient optimal technique to control the drift of buildings without the repetitive structural analysis. The resizing technique-based hybrid genetic algorithm proposed in this paper is applied to the minimum weight design of three steel frame buildings. To evaluate the performance of the algorithm, optimum weights, computational times, and generation numbers from the proposed algorithm are compared with those from a genetic algorithm. Based on the comparisons, it is concluded that the hybrid genetic algorithm shows clear improvements in convergence properties.

  10. Hybrid Monte Carlo algorithm with fat link fermion actions

    CERN Document Server

    Kamleh, Waseem; Williams, Anthony G; 10.1103/PhysRevD.70.014502

    2004-01-01

    The use of APE smearing or other blocking techniques in lattice fermion actions can provide many advantages. There are many variants of these fat link actions in lattice QCD currently, such as flat link irrelevant clover (FLIC) fermions. The FLIC fermion formalism makes use of the APE blocking technique in combination with a projection of the blocked links back into the special unitary group. This reunitarization is often performed using an iterative maximization of a gauge invariant measure. This technique is not differentiable with respect to the gauge field and thus prevents the use of standard Hybrid Monte Carlo simulation algorithms. The use of an alternative projection technique circumvents this difficulty and allows the simulation of dynamical fat link fermions with standard HMC and its variants. The necessary equations of motion for FLIC fermions are derived, and some initial simulation results are presented. The technique is more general however, and is straightforwardly applicable to other smearing ...

  11. A hybrid algorithm for parallel molecular dynamics simulations

    CERN Document Server

    Mangiardi, Chris M

    2016-01-01

    This article describes an algorithm for hybrid parallelization and SIMD vectorization of molecular dynamics simulations with short-ranged forces. The parallelization method combines domain decomposition with a thread-based parallelization approach. The goal of the work is to enable efficient simulations of very large (tens of millions of atoms) and inhomogeneous systems on many-core processors with hundreds or thousands of cores and SIMD units with large vector sizes. In order to test the efficiency of the method, simulations of a variety of configurations with up to 74 million atoms have been performed. Results are shown that were obtained on multi-core systems with AVX and AVX-2 processors as well as Xeon-Phi co-processors.

  12. A hybrid nested partitions algorithm for banking facility location problems

    KAUST Repository

    Xia, Li

    2010-07-01

    The facility location problem has been studied in many industries including banking network, chain stores, and wireless network. Maximal covering location problem (MCLP) is a general model for this type of problems. Motivated by a real-world banking facility optimization project, we propose an enhanced MCLP model which captures the important features of this practical problem, namely, varied costs and revenues, multitype facilities, and flexible coverage functions. To solve this practical problem, we apply an existing hybrid nested partitions algorithm to the large-scale situation. We further use heuristic-based extensions to generate feasible solutions more efficiently. In addition, the upper bound of this problem is introduced to study the quality of solutions. Numerical results demonstrate the effectiveness and efficiency of our approach. © 2010 IEEE.

  13. A study of speech emotion recognition based on hybrid algorithm

    Science.gov (United States)

    Zhu, Ju-xia; Zhang, Chao; Lv, Zhao; Rao, Yao-quan; Wu, Xiao-pei

    2011-10-01

    To effectively improve the recognition accuracy of the speech emotion recognition system, a hybrid algorithm which combines Continuous Hidden Markov Model (CHMM), All-Class-in-One Neural Network (ACON) and Support Vector Machine (SVM) is proposed. In SVM and ACON methods, some global statistics are used as emotional features, while in CHMM method, instantaneous features are employed. The recognition rate by the proposed method is 92.25%, with the rejection rate to be 0.78%. Furthermore, it obtains the relative increasing of 8.53%, 4.69% and 0.78% compared with ACON, CHMM and SVM methods respectively. The experiment result confirms the efficiency of distinguishing anger, happiness, neutral and sadness emotional states.

  14. A hybrid algorithm for parallel molecular dynamics simulations

    Science.gov (United States)

    Mangiardi, Chris M.; Meyer, R.

    2017-10-01

    This article describes algorithms for the hybrid parallelization and SIMD vectorization of molecular dynamics simulations with short-range forces. The parallelization method combines domain decomposition with a thread-based parallelization approach. The goal of the work is to enable efficient simulations of very large (tens of millions of atoms) and inhomogeneous systems on many-core processors with hundreds or thousands of cores and SIMD units with large vector sizes. In order to test the efficiency of the method, simulations of a variety of configurations with up to 74 million atoms have been performed. Results are shown that were obtained on multi-core systems with Sandy Bridge and Haswell processors as well as systems with Xeon Phi many-core processors.

  15. Synthesis of supervised classification algorithm using intelligent and statistical tools

    Directory of Open Access Journals (Sweden)

    Ali Douik

    2009-09-01

    Full Text Available A fundamental task in detecting foreground objects in both static and dynamic scenes is to take the best choice of color system representation and the efficient technique for background modeling. We propose in this paper a non-parametric algorithm dedicated to segment and to detect objects in color images issued from a football sports meeting. Indeed segmentation by pixel concern many applications and revealed how the method is robust to detect objects, even in presence of strong shadows and highlights. In the other hand to refine their playing strategy such as in football, handball, volley ball, Rugby, the coach need to have a maximum of technical-tactics information about the on-going of the game and the players. We propose in this paper a range of algorithms allowing the resolution of many problems appearing in the automated process of team identification, where each player is affected to his corresponding team relying on visual data. The developed system was tested on a match of the Tunisian national competition. This work is prominent for many next computer vision studies as it's detailed in this study.

  16. Synthesis of supervised classification algorithm using intelligent and statistical tools

    CERN Document Server

    Douik, Ali

    2009-01-01

    A fundamental task in detecting foreground objects in both static and dynamic scenes is to take the best choice of color system representation and the efficient technique for background modeling. We propose in this paper a non-parametric algorithm dedicated to segment and to detect objects in color images issued from a football sports meeting. Indeed segmentation by pixel concern many applications and revealed how the method is robust to detect objects, even in presence of strong shadows and highlights. In the other hand to refine their playing strategy such as in football, handball, volley ball, Rugby..., the coach need to have a maximum of technical-tactics information about the on-going of the game and the players. We propose in this paper a range of algorithms allowing the resolution of many problems appearing in the automated process of team identification, where each player is affected to his corresponding team relying on visual data. The developed system was tested on a match of the Tunisian national c...

  17. Intelligent Music Composition using Genetic Algorithm based on Motif Uniform Mutation

    Directory of Open Access Journals (Sweden)

    Faria Nassiri-Mofakham

    2015-03-01

    Full Text Available Nowadays, fields of music and artificial intelligence are closer together through research in both areas. Music composition using artificial intelligence (AI solutions has created a challenging research area. Automatic music composition will not only help researchers understand human’s musical thinking, but also helps composers and musicians improve music theory significantly by using the computing power of computers. In this study, an automatic music composition is presented. The system is implemented by using Markov chain and Lindenmayer systems as well as genetic algorithm. Fitness evaluation of the generated music is achord-based. The evaluations show the fast evolution of the results by genetic algorithm using uniform mutation. Creativity in music composition is beyond the present borders of AI and much work is still ahead in this field.

  18. Energy management of a power-split plug-in hybrid electric vehicle based on genetic algorithm and quadratic programming

    Science.gov (United States)

    Chen, Zheng; Mi, Chris Chunting; Xiong, Rui; Xu, Jun; You, Chenwen

    2014-02-01

    This paper introduces an online and intelligent energy management controller to improve the fuel economy of a power-split plug-in hybrid electric vehicle (PHEV). Based on analytic analysis between fuel-rate and battery current at different driveline power and vehicle speed, quadratic equations are applied to simulate the relationship between battery current and vehicle fuel-rate. The power threshold at which engine is turned on is optimized by genetic algorithm (GA) based on vehicle fuel-rate, battery state of charge (SOC) and driveline power demand. The optimal battery current when the engine is on is calculated using quadratic programming (QP) method. The proposed algorithm can control the battery current effectively, which makes the engine work more efficiently and thus reduce the fuel-consumption. Moreover, the controller is still applicable when the battery is unhealthy. Numerical simulations validated the feasibility of the proposed controller.

  19. A hybrid multiview stereo algorithm for modeling urban scenes.

    Science.gov (United States)

    Lafarge, Florent; Keriven, Renaud; Brédif, Mathieu; Vu, Hoang-Hiep

    2013-01-01

    We present an original multiview stereo reconstruction algorithm which allows the 3D-modeling of urban scenes as a combination of meshes and geometric primitives. The method provides a compact model while preserving details: Irregular elements such as statues and ornaments are described by meshes, whereas regular structures such as columns and walls are described by primitives (planes, spheres, cylinders, cones, and tori). We adopt a two-step strategy consisting first in segmenting the initial meshbased surface using a multilabel Markov Random Field-based model and second in sampling primitive and mesh components simultaneously on the obtained partition by a Jump-Diffusion process. The quality of a reconstruction is measured by a multi-object energy model which takes into account both photo-consistency and semantic considerations (i.e., geometry and shape layout). The segmentation and sampling steps are embedded into an iterative refinement procedure which provides an increasingly accurate hybrid representation. Experimental results on complex urban structures and large scenes are presented and compared to state-of-the-art multiview stereo meshing algorithms.

  20. Beam Pattern Synthesis Based on Hybrid Optimization Algorithm

    Institute of Scientific and Technical Information of China (English)

    YU Yan-li; WANG Ying-min; LI Lei

    2010-01-01

    As conventional methods for beam pattern synthesis can not always obtain the desired optimum pattern for the arbitrary underwater acoustic sensor arrays, a hybrid numerical synthesis method based on adaptive principle and genetic algorithm was presented in this paper. First, based on the adaptive theory, a given array was supposed as an adaptive array and its sidelobes were reduced by assigning a number of interference signals in the sidelobe region. An initial beam pattern was obtained after several iterations and adjustments of the interference intensity, and based on its parameters, a desired pattern was created. Then, an objective function based on the difference between the designed and desired patterns can be constructed. The pattern can be optimized by using the genetic algorithm to minimize the objective function. A design example for a double-circular array demonstrates the effectiveness of this method. Compared with the approaches existing before, the proposed method can reduce the sidelobe effectively and achieve less synthesis magnitude error in the mainlobe.The method can search for optimum attainable pattern for the specific elements if the desired pattern can not be found.

  1. Comprehensive Angular Response Study of LLNL Panasonic Dosimeter Configurations and Artificial Intelligence Algorithm

    Energy Technology Data Exchange (ETDEWEB)

    Stone, D. K. [Lawrence Livermore National Lab. (LLNL), Livermore, CA (United States)

    2017-06-30

    In April of 2016, the Lawrence Livermore National Laboratory External Dosimetry Program underwent a Department of Energy Laboratory Accreditation Program (DOELAP) on-site assessment. The assessment reported a concern that the study performed in 2013 Angular Dependence Study Panasonic UD-802 and UD-810 Dosimeters LLNL Artificial Intelligence Algorithm was incomplete. Only the responses at ±60° and 0° were evaluated and independent data from dosimeters was not used to evaluate the algorithm. Additionally, other configurations of LLNL dosimeters were not considered in this study. This includes nuclear accident dosimeters (NAD) which are placed in the wells surrounding the TLD in the dosimeter holder.

  2. The radial self-positioning algorithm of intelligent ultrasonic probe array in oil/gas pipeline

    Institute of Scientific and Technical Information of China (English)

    Song Shoupeng; Que Peiwen

    2007-01-01

    The working principle of the pipeline intelligent pig and the structure of ultrasonic probe array used to detect defects in oil/gas pipeline are introduced.The effects of the array'S radial position in pipe on defect resolution are analyzed.The causes leading to radial positioning error are investigated.An algorithm for the radial self-positioning is presented.The experimental results show that the radial self-positioning algorithm can eliminate the array'S space position error effectively and improve the defect resolution.

  3. Fractional snow cover mapping from MODIS data using wavelet-artificial intelligence hybrid models

    Science.gov (United States)

    Moosavi, Vahid; Malekinezhad, Hossein; Shirmohammadi, Bagher

    2014-04-01

    This study was carried out to evaluate the wavelet-artificial intelligence hybrid models to produce fractional snow cover maps. At first, cloud cover was removed from MODIS data and cloud free images were produced. SVM-based binary classified ETM+ imagery were then used as reference maps in order to obtain train and test data for sub-pixel classification models. ANN and ANFIS-based modeling were performed using raw data (without wavelet-based preprocessing). In the next step, several mother wavelets and levels were used in order to decompose the original data to obtain wavelet coefficients. Then, the decomposed data were used for further modeling processes. ANN, ANFIS, wavelet-ANN and wavelet-ANFIS models were compared to evaluate the effect of wavelet transformation on the ability of artificial intelligence models. It was demonstrated that wavelet transformation as a preprocessing approach can significantly enhance the performance of ANN and ANFIS models. This study indicated an overall accuracy of 92.45% for wavelet-ANFIS model, 86.13% for wavelet-ANN, 72.23% for ANFIS model and 66.78% for ANN model. In fact, hybrid wavelet-artificial intelligence models can extract the characteristics of the original signals (i.e. model inputs) accurately through decomposing the non-stationary and complex signals into several stationary and simpler signals. The positive effect of fuzzification as well as wavelet transformation in the wavelet-ANFIS model was also confirmed.

  4. ROBUST-HYBRID GENETIC ALGORITHM FOR A FLOW-SHOP SCHEDULING PROBLEM (A Case Study at PT FSCM Manufacturing Indonesia)

    OpenAIRE

    Johan Soewanda; Tanti Octavia; Iwan Halim Sahputra

    2007-01-01

    This paper discusses the application of Robust Hybrid Genetic Algorithm to solve a flow-shop scheduling problem. The proposed algorithm attempted to reach minimum makespan. PT. FSCM Manufacturing Indonesia Plant 4's case was used as a test case to evaluate the performance of the proposed algorithm. The proposed algorithm was compared to Ant Colony, Genetic-Tabu, Hybrid Genetic Algorithm, and the company's algorithm. We found that Robust Hybrid Genetic produces statistically better result than...

  5. Intelligent Control Algorithm of PTZ System Driven by Two-DOF Ultrasonic Motor

    Institute of Scientific and Technical Information of China (English)

    Wu Songsen; Leng Xuefei; Jin Jiamei; Wang Bihui; Mao Xingyun

    2015-01-01

    It is difficult for the traditional pan-tilt-zoom (PTZ) system driven by electromagnetic motor to meet the growing demand for video surveillance system .The key challenge is high positioning accuracy ,high dynamic per-formance and miniaturization of the PTZ system .Here a PTZ system driven by two degree-of-freedom obelisk-shaped ultrasonic motor with single stator is presented ,and its intelligent control algorithm is studied .The struc-ture and driving mechanism of the presented PTZ system are analyzed by both simulation and experiment .To solve the complex nonlinear factors ,e .g .time-variation ,dead zone ,the fuzzy PID control algorithm and the variable gain cross-coupled control strategy are combined to improve the control performance .The results show that the proposed algorithm has faster response ,higher precision than traditional control algorithm ,and it also has a good robustness to prevent the effect of interference .

  6. A swarm intelligence based memetic algorithm for task allocation in distributed systems

    Science.gov (United States)

    Sarvizadeh, Raheleh; Haghi Kashani, Mostafa

    2012-01-01

    This paper proposes a Swarm Intelligence based Memetic algorithm for Task Allocation and scheduling in distributed systems. The tasks scheduling in distributed systems is known as an NP-complete problem. Hence, many genetic algorithms have been proposed for searching optimal solutions from entire solution space. However, these existing approaches are going to scan the entire solution space without considering the techniques that can reduce the complexity of the optimization. Spending too much time for doing scheduling is considered the main shortcoming of these approaches. Therefore, in this paper memetic algorithm has been used to cope with this shortcoming. With regard to load balancing efficiently, Bee Colony Optimization (BCO) has been applied as local search in the proposed memetic algorithm. Extended experimental results demonstrated that the proposed method outperformed the existing GA-based method in terms of CPU utilization.

  7. Double Motor Coordinated Control Based on Hybrid Genetic Algorithm and CMAC

    Science.gov (United States)

    Cao, Shaozhong; Tu, Ji

    A novel hybrid cerebellar model articulation controller (CMAC) and online adaptive genetic algorithm (GA) controller is introduced to control two Brushless DC motor (BLDCM) which applied in a biped robot. Genetic Algorithm simulates the random learning among the individuals of a group, and CMAC simulates the self-learning of an individual. To validate the ability and superiority of the novel algorithm, experiments have been done in MATLAB/SIMULINK. Analysis among GA, hybrid GA-CMAC and CMAC feed-forward control is also given. The results prove that the torque ripple of the coordinated control system is eliminated by using the hybrid GA-CMAC algorithm.

  8. Optimum Performance-Based Seismic Design Using a Hybrid Optimization Algorithm

    Directory of Open Access Journals (Sweden)

    S. Talatahari

    2014-01-01

    Full Text Available A hybrid optimization method is presented to optimum seismic design of steel frames considering four performance levels. These performance levels are considered to determine the optimum design of structures to reduce the structural cost. A pushover analysis of steel building frameworks subject to equivalent-static earthquake loading is utilized. The algorithm is based on the concepts of the charged system search in which each agent is affected by local and global best positions stored in the charged memory considering the governing laws of electrical physics. Comparison of the results of the hybrid algorithm with those of other metaheuristic algorithms shows the efficiency of the hybrid algorithm.

  9. Overall intelligent hybrid control system for a fossil-fuel power unit

    Energy Technology Data Exchange (ETDEWEB)

    Garduno-Ramirez, Raul

    2000-08-01

    -level hierarchical intelligent hybrid multi-agent coordinated control system. Results show the feasibility of the proposed ICCS paradigm. An open purposeful self-governing overall unit control system for a FFPU can be systematically designed, built and upgrade to effectively satisfy arbitrary operation conditions. Remarkably, the ICCS paradigm provides a convenient conceptual framework such that the integration of applications can be carried out making use of best characteristics that either algorithmic or heuristic techniques have to offer, while keeping large system complexity manageable. [Spanish] Se presenta una metodologia para disenar un sistema unitario generalizado de control total para una unidad generadora de combustible fosil (FFPU) y se desarrolla un prototipo minimo para demostrar su factibilidad. Con miras a la meta mencionada, se emprendio el proyecto asociado de investigacion como un proceso de innovacion tecnologica con sus dos fines identificados como sigue. Primero, se reconoce que las estrategias de control combinado constituyen el mas alto nivel de control en las actuales FFPUs, y de esta manera son responsables de manejar el conjunto caldera-turbina-generador como una sola entidad. Segundo, una FFPU se visualiza como un proceso complejo, sujeto a muchas condiciones cambiantes de operacion, que debe de comportarse como un sistema inteligente, para lo cual se requiere un concepto de control integral avanzado. Por lo tanto, como un resultado del proceso de innovacion se propone un concepto de control integral de unidad generalizado que amplia el potencial de los esquemas actuales de control coordinado. Este concepto se presenta como el paradigma del Sistema de Control Coordinado Inteligente (ICCS), que establece un marco de referencia abierto para el desarrollo de esquemas de control unitario en conjunto. Las metas del sistema ICCS se identifican usando conceptos de ingenieria de procesos de centrales electricas y conceptos de ingenieria de sistemas inteligentes

  10. Accurate Intelligent Map Matching Algorithms for Vehicle Positioning System

    Directory of Open Access Journals (Sweden)

    M. Pashaian

    2012-03-01

    Full Text Available The purpose of a navigation system installed on a car is to help drivers in order to select an optimal path to reach the destination. In most of these systems, Global Positioning System (GPS are used to determine vehicle position. There are number of error sources that undermine the quality of GPS measurements for car navigation systems. For this reason, technique like Map Matching (MM is required to identify the road of a car is that moving on, with a high degree of confidence. MM in car navigation systems, has a task of determining the current position of vehicle on the city's map. In this paper, two new MM methods based on Fuzzy Logic (FL and Neural Network (NN are proposed to solve the matching problem in car navigation systems. For the experiments, a car navigation system is implemented with a low cost GPS receiver. The proposed fuzzy algorithm is easy to calculate. It requires little computation time without need to extra sensors and can find effectively the mobile exact position which moves on the road.

  11. A hybrid intelligence approach to artifact recognition in digital publishing

    Science.gov (United States)

    Vega-Riveros, J. Fernando; Santos Villalobos, Hector J.

    2006-02-01

    The system presented integrates rule-based and case-based reasoning for artifact recognition in Digital Publishing. In Variable Data Printing (VDP) human proofing could result prohibitive since a job could contain millions of different instances that may contain two types of artifacts: 1) evident defects, like a text overflow or overlapping 2) style-dependent artifacts, subtle defects that show as inconsistencies with regard to the original job design. We designed a Knowledge-Based Artifact Recognition tool for document segmentation, layout understanding, artifact detection, and document design quality assessment. Document evaluation is constrained by reference to one instance of the VDP job proofed by a human expert against the remaining instances. Fundamental rules of document design are used in the rule-based component for document segmentation and layout understanding. Ambiguities in the design principles not covered by the rule-based system are analyzed by case-based reasoning, using the Nearest Neighbor Algorithm, where features from previous jobs are used to detect artifacts and inconsistencies within the document layout. We used a subset of XSL-FO and assembled a set of 44 document samples. The system detected all the job layout changes, while obtaining an overall average accuracy of 84.56%, with the highest accuracy of 92.82%, for overlapping and the lowest, 66.7%, for the lack-of-white-space.

  12. Cell Assignment in Hybrid CMOS/Nanodevices Architecture Using a PSO/SA Hybrid Algorithm

    Directory of Open Access Journals (Sweden)

    Sadiq M. Sait

    2013-10-01

    anowire\\MOLecular Hybrid, higher circuit densities are possible. In CMOL there is an additional layer of nanofabric on top of CMOS stack. Nanodevices that lie between overlapping nanowires are programmable and can implement any combinational logic using a netlist of NOR gates. The limitation on the length of nanowires put a constraint on the connectivity domain of a circuit. The gates connected to each other must be within a connectivity radius; otherwise an extra buffer is inserted to connect them. Particle swarm optimization (PSO has been used in a variety of problems that are NP- hard. PSO compared to the other iterative heuristic techniques is simpler to implement. Besides, it delivers comparable results. In this paper, a hybrid of PSO and simulated annealing (SA for solving the cell assignment in CMOL, an NP-hard problem, is proposed. The proposed method takes advantage of the exploration and exploitation factors of PSO and the intrinsic hill climbing feature of SA to reduce the number of buffers to be inserted. Experiments conducted on ISCAS'89 benchmark circuits and a comparison with other heuristic techniques, are presented. Results showed that the proposed hybrid algorithm achieved better solution in terms of buffer count in reasonable time.

  13. AutoBeeConf : A swarm intelligence algorithm for MANET administration

    Directory of Open Access Journals (Sweden)

    Luca Caputo

    2013-02-01

    Full Text Available In a mobile ad-hoc network (MANET nodes are self-organized without any infrastructure support: they move arbitrarily causing the network to experience quick and random topology changes, have to act as routers as well as forwarding nodes, some of them do not communicate directly with each other. Routing and IP address auto-configuration are among the most challenging tasks in the MANET domain. Swarm Intelligence is a property of natural and artificial systems involving minimally skilled individuals that exhibit a collective intelligent behavior derived from the interaction with each other by means of the environment. Colonies of ants and bees are the most prominent examples of swarm intelligence systems. Flexibility, robustness, and self-organization make swarm intelligence a successful design paradigm for difficult combinatorial optimization problems, such as routing and IP address allocation in MANET. This paper proposes AutoBeeConf, a new IP address auto-configuration algorithm based on a bee swarm labor that may be applied to large scale MANET with low complexity, low communication overhead, even address distribution, and low latency. Both the protocol description and the simulation experiments are presented to demonstrate the advantages of AutoBeeConf over two known algorithms, namely Buddy and Antbased protocols. Eventually, future research directions are established, especially toward the principle that swarm intelligence paradigms may be usefully employed in the redefinition or modifications of each layer in the TCP/IP suite in such a way that it can efficiently work even in the infrastructure-less and dynamic nature of MANET environment.

  14. A Hybrid Computational Intelligence Approach Combining Genetic Programming And Heuristic Classification for Pap-Smear Diagnosis

    DEFF Research Database (Denmark)

    Tsakonas, Athanasios; Dounias, Georgios; Jantzen, Jan;

    2001-01-01

    The paper suggests the combined use of different computational intelligence (CI) techniques in a hybrid scheme, as an effective approach to medical diagnosis. Getting to know the advantages and disadvantages of each computational intelligence technique in the recent years, the time has come...... diagnoses. The final result is a short but robust rule based classification scheme, achieving high degree of classification accuracy (exceeding 90% of accuracy for most classes) in a meaningful and user-friendly representation form for the medical expert. The domain of application analyzed through the paper...... is the well-known Pap-Test problem, corresponding to a numerical database, which consists of 450 medical records, 25 diagnostic attributes and 5 different diagnostic classes. Experimental data are divided in two equal parts for the training and testing phase, and 8 mutually dependent rules for diagnosis...

  15. Hybrid intelligent control of combustion process for ore-roasting furnace

    Institute of Scientific and Technical Information of China (English)

    Aijun YAN; Tianyou CHAI; Fenghua WU; Pu WANG

    2008-01-01

    Because of its synthetic and complex characteristics, the combustion process of the shaft ore-roasting furnace is very difficult to control stably. A hybrid intelligent control approach is developed which consists of two systems: one is a cascade fuzzy control system with a temperature soft-sensor, and the other is a ratio control system for air flow with a compensation model for heating gas flow and air-fuel ratio. This approach combined intelligent control, soft-sensing and fault diagnosis with conventional control. It can adjust both the heating gas flow and the air-fuel ratio in real time. By this way, the difficulty of online measurement of the furnace temperature is solved, the fault ratios during combustion process is decreased, the steady control of the furnace temperature is achieved, and the gas consumption is reduced. The successful application in shaft furnaces of a mineral processing plant in China indicates its effectiveness.

  16. A Hybrid Intelligent Diagnosis Approach for Quick Screening of Alzheimer’s Disease Based on Multiple Neuropsychological Rating Scales

    Directory of Open Access Journals (Sweden)

    Ziming Yin

    2015-01-01

    Full Text Available Neuropsychological testing is an effective means for the screening of Alzheimer’s disease. Multiple neuropsychological rating scales should be used together to get subjects’ comprehensive cognitive state due to the limitation of a single scale, but it is difficult to operate in primary clinical settings because of the inadequacy of time and qualified clinicians. Aiming at identifying AD’s stages more accurately and conveniently in screening, we proposed a computer-aided diagnosis approach based on critical items extracted from multiple neuropsychological scales. The proposed hybrid intelligent approach combines the strengths of rough sets, genetic algorithm, and Bayesian network. There are two stages: one is attributes reduction technique based on rough sets and genetic algorithm, which can find out the most discriminative items for AD diagnosis in scales; the other is uncertain reasoning technique based on Bayesian network, which can forecast the probability of suffering from AD. The experimental data set consists of 500 cases collected by a top hospital in China and each case is determined by the expert panel. The results showed that the proposed approach could not only reduce items drastically with the same classification precision, but also perform better on identifying different stages of AD comparing with other existing scales.

  17. A Hybrid Quantum Search Engine: A Fast Quantum Algorithm for Multiple Matches

    CERN Document Server

    Younes, A; Miller, J; Younes, Ahmed; Rowe, Jon; Miller, Julian

    2003-01-01

    In this paper we will present a quantum algorithm which works very efficiently in case of multiple matches within the search space and in the case of few matches, the algorithm performs classically. This allows us to propose a hybrid quantum search engine that integrates Grover's algorithm and the proposed algorithm here to have general performance better that any pure classical or quantum search algorithm.

  18. Multiuser Detection in MIMO-OFDM Wireless Communication System Using Hybrid Firefly Algorithm

    Directory of Open Access Journals (Sweden)

    B. Sathish Kumar

    2014-05-01

    Full Text Available In recent years, future generation wireless communication technologies are most the prominent fields in which many innovative techniques are used for effective communication. Orthogonal frequency-division multiplexing is one of the important technologies used for communication in future generation technologies. Although it gives efficient results, it has some problems during the implementation in real-time. MIMO and OFDM are integrated to have both their benefits. But, noise and interference are the major issues in the MIMO OFDM systems. To overcome these issues multiuser detection method is used in MIMO OFDM. Several algorithms and mathematical formulations have been presented for solving multiuser detection problem in MIMO OFDM systems. The algorithms such as genetic simulated annealing algorithm, hybrid ant colony optimization algorithm are used for multiuser detection problem in previous studies. But, due to the limitations of those optimization algorithms, the results obtained are not significant. In this research, to overcome the noise and interference problems, hybrid firefly optimization algorithm based on the evolutionary algorithm is proposed. The proposed algorithm is compared with the existing multiuser detection algorithm such as particle swarm optimization, CEFM-GADA [complementary error function mutation (CEFM and a differential algorithm (DA genetic algorithm (GA] and Hybrid firefly optimization algorithm based on evolutionary algorithm. The simulation results shows that performance of the proposed algorithm is better than the existing algorithm and it provides a satisfactory trade-off between computational complexity and detection performance

  19. 三维欧氏 Steiner 最小树的 Delaunay 四面体网格混合智能算法%A Hybrid Intelligent Algorithm Based on Delaunay Tetrahedron Mesh Generation for Euclidean Steiner Minimum Tree Problem in 3-space

    Institute of Scientific and Technical Information of China (English)

    王家桢; 马良; 张惠珍

    2015-01-01

    Euclidean Steiner minimum tree problem , a classical NP-hard problem in combination optimization , has been widely studied in many fields .Euclidean Steiner minimal tree problem in 3-space is the generalization of Euclidean Steiner minimum tree problem in 2-space .The research results on Euclidean Steiner minimal tree problem in 3-space have been rarely published because of their difficulties .In this paper , a hybrid intelligent method is designed by using Delaunay tetrahedron mesh generation technology to solve the Euclidean Steiner min -imal tree problem in 3-space , which can not only avoid falling into local optima , but also has good effects in solving large scale problems .Promising results are obtained by using this hybrid method coded in MATLAB to solve series of Euclidean Steiner minimum tree problem instances in 3-space .%Steiner最小树问题是组合优化中经典的NP难题,在许多实际问题中有着广泛的应用,而三维欧氏Stei-ner最小树问题是对二维欧氏Steiner最小树问题的推广。由于三维欧氏Steiner树问题的求解非常困难,至今为止的相关成果较为少见。本文针对该问题,利用Delaunay四面体网格剖分技术,提出了一种混合型智能求解方法,不仅可以尽量避免拓扑结构陷入局部最优,且对较大规模的问题求解亦有良好的效果。算法在Matlab环境下编程实现,经实例测试,获得了满意的效果。

  20. HYBRID APPROACH FOR OPTIMAL CLUSTER HEAD SELECTION IN WSN USING LEACH AND MONKEY SEARCH ALGORITHMS

    Directory of Open Access Journals (Sweden)

    T. SHANKAR

    2017-02-01

    Full Text Available Wireless Sensor Networks (WSNs are being widely used with low-cost, lowpower, multifunction sensors based on the development of wireless communication, which has enabled a wide variety of new applications. In WSN, the main concern is that it contains a limited power battery and is constrained in energy consumption hence energy and lifetime are of paramount importance. To achieve high energy efficiency and prolong network lifetime in WSNs, clustering techniques have been widely adopted. The proposed algorithm is hybridization of well-known Low-Energy Adaptive Clustering Hierarchy (LEACH algorithm with a distinctive Monkey Search (MS algorithm, which is an optimization algorithm used for optimal cluster head selection. The proposed hybrid algorithm exhibit high throughput, residual energy and improved lifetime. Comparison of the proposed hybrid algorithm is made with the well-known cluster-based protocols for WSNs, namely, LEACH and monkey search algorithm, individually.

  1. A HYBRID GRANULARITY PARALLEL ALGORITHM FOR PRECISE INTEGRATION OF STRUCTURAL DYNAMIC RESPONSES

    Institute of Scientific and Technical Information of China (English)

    Yuanyin Li; Xianlong Jin; Genguo Li

    2008-01-01

    Precise integration methods to solve structural dynamic responses and the corre-sponding time integration formula are composed of two parts: the multiplication of an exponential matrix with a vector and the integration term. The second term can be solved by the series solu-tion. Two hybrid granularity parallel algorithms are designed, that is, the exponential matrix and the first term are computed by the fine-grained parallel algorithm and the second term is com-puted by the coarse-grained parallel algorithm. Numerical examples show that these two hybrid granularity parallel algorithms obtain higher speedup and parallel efficiency than two existing parallel algorithms.

  2. A ROBUST PHASE-ONLY DIRECT DATA DOMAIN ALGORITHM BASED ON GENERALIZED RAYLEIGH QUOTIENT OPTIMIZATION USING HYBRID GENETIC ALGORITHM

    Institute of Scientific and Technical Information of China (English)

    Shao Wei; Qian Zuping; Yuan Feng

    2007-01-01

    A robust phase-only Direct Data Domain Least Squares (D3LS) algorithm based on generalized Rayleigh quotient optimization using hybrid Genetic Algorithm (GA) is presented in this letter. The optimization efficiency and computational speed are improved via the hybrid GA composed of standard GA and Nelder-Mead simplex algorithms. First, the objective function, with a form of generalized Rayleigh quotient, is derived via the standard D3LS algorithm. It is then taken as a fitness function and the unknown phases of all adaptive weights are taken as decision variables.Then, the nonlinear optimization is performed via the hybrid GA to obtain the optimized solution of phase-only adaptive weights. As a phase-only adaptive algorithm, the proposed algorithm is simpler than conventional algorithms when it comes to hardware implementation. Moreover, it processes only a single snapshot data as opposed to forming sample covariance matrix and operating matrix inversion. Simulation results show that the proposed algorithm has a good signal recovery and interferences nulling performance, which are superior to that of the phase-only D3LS algorithm based on standard GA.

  3. Enhanced hybrid search algorithm for protein structure prediction using the 3D-HP lattice model.

    Science.gov (United States)

    Zhou, Changjun; Hou, Caixia; Zhang, Qiang; Wei, Xiaopeng

    2013-09-01

    The problem of protein structure prediction in the hydrophobic-polar (HP) lattice model is the prediction of protein tertiary structure. This problem is usually referred to as the protein folding problem. This paper presents a method for the application of an enhanced hybrid search algorithm to the problem of protein folding prediction, using the three dimensional (3D) HP lattice model. The enhanced hybrid search algorithm is a combination of the particle swarm optimizer (PSO) and tabu search (TS) algorithms. Since the PSO algorithm entraps local minimum in later evolution extremely easily, we combined PSO with the TS algorithm, which has properties of global optimization. Since the technologies of crossover and mutation are applied many times to PSO and TS algorithms, so enhanced hybrid search algorithm is called the MCMPSO-TS (multiple crossover and mutation PSO-TS) algorithm. Experimental results show that the MCMPSO-TS algorithm can find the best solutions so far for the listed benchmarks, which will help comparison with any future paper approach. Moreover, real protein sequences and Fibonacci sequences are verified in the 3D HP lattice model for the first time. Compared with the previous evolutionary algorithms, the new hybrid search algorithm is novel, and can be used effectively to predict 3D protein folding structure. With continuous development and changes in amino acids sequences, the new algorithm will also make a contribution to the study of new protein sequences.

  4. Analisis Perbandingan Performansi Penjadwalan Paket Antara Homogeneous Algorithm Dengan Hybrid Algorithm Pada Jaringan Point-To-Multipoint Wimax

    Directory of Open Access Journals (Sweden)

    Dadiek Pranindito

    2014-11-01

    Full Text Available Saat ini, dalam dunia telekomunikasi, (Worldwide Interoperability for Microwave Access WiMaX merupakan teknologi nirkabel yang menyediakan hubungan jalur lebar dalam jarak jauh, memiliki kecepatan akses yang tinggi dan jangkauan yang luas serta menyediakan berbagai macam jenis layanan. Masalah yang menarik dan menantang pada WiMaX adalah dalam hal menyediakan jaminan kualitas pelayanan (QoS untuk jenis layanan yang berbeda dengan bermacam-macam kebutuhan QoS-nya. Untuk memenuhi kebutuhan QoS tersebut, maka diperlukan suatu algoritma penjadwalan. Dalam penelitian ini dilakukan simulasi jaringan WiMaX menerapkan algoritma penjadwalan dengan metode homogeneous algorithm dan hybrid algorithm. Perwakilan pada metode homogeneous algorithm akan menggunakan algoritma penjadwalan Weighted Fair Queuing (WFQ dan Deficit Round Robin (DRR, sedangkan pada metode hybrid algorithm menggunakan penggabungan antara algoritma penjadwalan DRR dan WFQ. Pengujian kinerja algoritma penjadwalan tersebut dilakukan dengan membandingkan kedalam 5 jenis kelas QoS pada WiMAX yaitu UGS,  rtPS, nrtPS, ertPS, dan Best Effort. Dari hasil pengujian, hybrid algorithm memberikan nilai QoS yang lebih baik jika dibandingkan dengan homogeneous algorithm. hybrid algorithm sangat cocok jika diterapkan pada kondisi jaringan yang memiliki trafik dengan paket data yang bervariasi, karena dapat menghasilkan throughput yang tinggi, serta dapat menghasilkan nilai delay dan jitter yang rendah

  5. Methodology, Algorithms, and Emerging Tool for Automated Design of Intelligent Integrated Multi-Sensor Systems

    Directory of Open Access Journals (Sweden)

    Andreas König

    2009-11-01

    Full Text Available The emergence of novel sensing elements, computing nodes, wireless communication and integration technology provides unprecedented possibilities for the design and application of intelligent systems. Each new application system must be designed from scratch, employing sophisticated methods ranging from conventional signal processing to computational intelligence. Currently, a significant part of this overall algorithmic chain of the computational system model still has to be assembled manually by experienced designers in a time and labor consuming process. In this research work, this challenge is picked up and a methodology and algorithms for automated design of intelligent integrated and resource-aware multi-sensor systems employing multi-objective evolutionary computation are introduced. The proposed methodology tackles the challenge of rapid-prototyping of such systems under realization constraints and, additionally, includes features of system instance specific self-correction for sustained operation of a large volume and in a dynamically changing environment. The extension of these concepts to the reconfigurable hardware platform renders so called self-x sensor systems, which stands, e.g., for self-monitoring, -calibrating, -trimming, and -repairing/-healing systems. Selected experimental results prove the applicability and effectiveness of our proposed methodology and emerging tool. By our approach, competitive results were achieved with regard to classification accuracy, flexibility, and design speed under additional design constraints.

  6. Bioinspired Intelligent Algorithm and Its Applications for Mobile Robot Control: A Survey

    Directory of Open Access Journals (Sweden)

    Jianjun Ni

    2016-01-01

    Full Text Available Bioinspired intelligent algorithm (BIA is a kind of intelligent computing method, which is with a more lifelike biological working mechanism than other types. BIAs have made significant progress in both understanding of the neuroscience and biological systems and applying to various fields. Mobile robot control is one of the main application fields of BIAs which has attracted more and more attention, because mobile robots can be used widely and general artificial intelligent algorithms meet a development bottleneck in this field, such as complex computing and the dependence on high-precision sensors. This paper presents a survey of recent research in BIAs, which focuses on the research in the realization of various BIAs based on different working mechanisms and the applications for mobile robot control, to help in understanding BIAs comprehensively and clearly. The survey has four primary parts: a classification of BIAs from the biomimetic mechanism, a summary of several typical BIAs from different levels, an overview of current applications of BIAs in mobile robot control, and a description of some possible future directions for research.

  7. Hybrid differential evolution algorithm for fuzzy dependent-chance programming model%求解模糊相关机会规划模型的混合差分进化算法

    Institute of Scientific and Technical Information of China (English)

    王林; 富庆亮; 曾宇容

    2011-01-01

    针对不确定规划领域中存在的模糊相关机会规划模型,基于群体智能的差分进化算法,设计一种新的求解模糊相关机会规划模型的混合智能算法.该算法基于粒子群优化算法对差分进化算法进行改进,并运用模糊模拟技术对模糊相关机会规划模型进行分析和数值求解,无需像传统的基于遗传算法的混合智能算法需要很长时间并经过复杂的计算才能得到合理的结果.最后,通过实例表明了所提混合智能算法的合理性和有效性.%Aiming at the existing fuzzy dependent-chance programming model in uncertainty planning field and the optimization approach of group intelligence-differential evolution algorithm, a novel hybrid intelligent algorithm for fuzzy dependent-chance programming models is designed. The proposed algorithm uses hybrid differential evolution algorithm improved by particle swarm optimization algorithm and fuzzy simulation to solve this kind of programming problems. It does not need a long time and complex calculations to get reasonable results like the hybrid intelligent algorithm based on traditional genetic algorithm. Numerical examples show the rationality and effectiveness of the proposed hybrid intelligent algorithm.

  8. A Comparative Study of Several Hybrid Particle Swarm Algorithms for Function Optimization

    Directory of Open Access Journals (Sweden)

    Yanhua Zhong

    2012-11-01

    Full Text Available Currently, the researchers have made a lot of hybrid particle swarm algorithm in order to solve the shortcomings that the Particle Swarm Algorithms is easy to converge to local extremum, these algorithms declare that there has been better than the standard particle swarm. This study selects three kinds of representative hybrid particle swarm optimizations (differential evolution particle swarm optimization, GA particle swarm optimization, quantum particle swarm optimization and the standard particle swarm optimization to test with three objective functions. We compare evolutionary algorithm performance by a fixed number of iterations of the convergence speed and accuracy and the number of iterations under the fixed convergence precision; analyzing these types of hybrid particle swarm optimization results and practical performance. Test results show hybrid particle algorithm performance has improved significantly.

  9. A Comparative Study of Several Hybrid Particle Swarm Algorithms for Function Optimization

    Directory of Open Access Journals (Sweden)

    Yanhua Zhong

    2013-01-01

    Full Text Available Currently, the researchers have made a lot of hybrid particle swarm algorithm in order to solve the shortcomings that the Particle Swarm Algorithms is easy to converge to local extremum, these algorithms declare that there has been better than the standard particle swarm. This study selects three kinds of representative hybrid particle swarm optimizations (differential evolution particle swarm optimization, GA particle swarm optimization, quantum particle swarm optimization and the standard particle swarm optimization to test with three objective functions. We compare evolutionary algorithm performance by a fixed number of iterations of the convergence speed and accuracy and the number of iterations under the fixed convergence precision, analyzing these types of hybrid particle swarm optimization results and practical performance. Test results show hybrid particle algorithm performance has improved significantly.

  10. An effective hybrid self-adapting differential evolution algorithm for the joint replenishment and location-inventory problem in a three-level supply chain.

    Science.gov (United States)

    Wang, Lin; Qu, Hui; Chen, Tao; Yan, Fang-Ping

    2013-01-01

    The integration with different decisions in the supply chain is a trend, since it can avoid the suboptimal decisions. In this paper, we provide an effective intelligent algorithm for a modified joint replenishment and location-inventory problem (JR-LIP). The problem of the JR-LIP is to determine the reasonable number and location of distribution centers (DCs), the assignment policy of customers, and the replenishment policy of DCs such that the overall cost is minimized. However, due to the JR-LIP's difficult mathematical properties, simple and effective solutions for this NP-hard problem have eluded researchers. To find an effective approach for the JR-LIP, a hybrid self-adapting differential evolution algorithm (HSDE) is designed. To verify the effectiveness of the HSDE, two intelligent algorithms that have been proven to be effective algorithms for the similar problems named genetic algorithm (GA) and hybrid DE (HDE) are chosen to compare with it. Comparative results of benchmark functions and randomly generated JR-LIPs show that HSDE outperforms GA and HDE. Moreover, a sensitive analysis of cost parameters reveals the useful managerial insight. All comparative results show that HSDE is more stable and robust in handling this complex problem especially for the large-scale problem.

  11. An Effective Hybrid Self-Adapting Differential Evolution Algorithm for the Joint Replenishment and Location-Inventory Problem in a Three-Level Supply Chain

    Directory of Open Access Journals (Sweden)

    Lin Wang

    2013-01-01

    Full Text Available The integration with different decisions in the supply chain is a trend, since it can avoid the suboptimal decisions. In this paper, we provide an effective intelligent algorithm for a modified joint replenishment and location-inventory problem (JR-LIP. The problem of the JR-LIP is to determine the reasonable number and location of distribution centers (DCs, the assignment policy of customers, and the replenishment policy of DCs such that the overall cost is minimized. However, due to the JR-LIP’s difficult mathematical properties, simple and effective solutions for this NP-hard problem have eluded researchers. To find an effective approach for the JR-LIP, a hybrid self-adapting differential evolution algorithm (HSDE is designed. To verify the effectiveness of the HSDE, two intelligent algorithms that have been proven to be effective algorithms for the similar problems named genetic algorithm (GA and hybrid DE (HDE are chosen to compare with it. Comparative results of benchmark functions and randomly generated JR-LIPs show that HSDE outperforms GA and HDE. Moreover, a sensitive analysis of cost parameters reveals the useful managerial insight. All comparative results show that HSDE is more stable and robust in handling this complex problem especially for the large-scale problem.

  12. Development of a Decision Making Algorithm for Traffic Jams Reduction Applied to Intelligent Transportation Systems

    Directory of Open Access Journals (Sweden)

    David Gómez

    2016-01-01

    Full Text Available This paper is aimed at developing a decision making algorithm for traffic jams reduction that can be applied to Intelligent Transportation Systems. To do so, these algorithms must address two main challenges that arise in this context. On one hand, there are uncertainties in the data received from sensor networks produced by incomplete information or because the information loses some of the precision during information processing and display. On the other hand, there is the variability of the context in which these types of systems are operating. More specifically, Analytic Hierarchy Process (AHP algorithm has been adapted to ITS, taking into account the mentioned challenges. After explaining the proposed decision making method, it is validated in a specific scenario: a smart traffic management system.

  13. Comparison of Intelligent Algorithms for Economically Optimum Harmonic Passive Filter Design in Radial Distribution Systems

    Directory of Open Access Journals (Sweden)

    M. Mohammadi

    2015-01-01

    Full Text Available This paper presents the optimal planning of harmonic passive filters in distribution system using three intelligent methods including genetic algorithm (GA, particle swarm optimization (PSO, artificial bee colony (ABC and as a new research is compared with biogeography based optimization (BBO algorithm. In this work, the considered objective function is to minimize the value of investment cost of filters and total harmonic distortion of three-phase current. It is shown that through an economical placement and sizing of LC passive filters the total voltage harmonic distortion and cost could be minimized simultaneously. BBO is a novel evolutionary algorithm that is based on the mathematics of biogeography. In the BBO model, problem solutions are represented as islands, and the sharing of features between solutions is represented as immigration and emigration between the islands. The simulation results show that the proposed method is efficient for solving the presented problem.

  14. Hybrid genetic algorithm approach for selective harmonic control

    Energy Technology Data Exchange (ETDEWEB)

    Dahidah, Mohamed S.A. [Faculty of Engineering, Multimedia University, 63100, Jalan Multimedia-Cyberjaya, Selangor (Malaysia); Agelidis, Vassilios G. [School of Electrical and Information Engineering, The University of Sydney, NSW (Australia); Rao, Machavaram V. [Faculty of Engineering and Technology, Multimedia University, 75450, Jalan Ayer Keroh Lama-Melaka (Malaysia)

    2008-02-15

    The paper presents an optimal solution for a selective harmonic elimination pulse width modulated (SHE-PWM) technique suitable for a high power inverter used in constant frequency utility applications. The main challenge of solving the associated non-linear equations, which are transcendental in nature and, therefore, have multiple solutions, is the convergence, and therefore, an initial point selected considerably close to the exact solution is required. The paper discusses an efficient hybrid real coded genetic algorithm (HRCGA) that reduces significantly the computational burden, resulting in fast convergence. An objective function describing a measure of the effectiveness of eliminating selected orders of harmonics while controlling the fundamental, namely a weighted total harmonic distortion (WTHD) is derived, and a comparison of different operating points is reported. It is observed that the method was able to find the optimal solution for a modulation index that is higher than unity. The theoretical considerations reported in this paper are verified through simulation and experimentally on a low power laboratory prototype. (author)

  15. The novel generating algorithm and properties of hybrid-P-ary generalized bridge functions

    Institute of Scientific and Technical Information of China (English)

    2006-01-01

    In this paper, we develop novel non-sine functions, named hybrid-P-ary generalized bridge functions, based on the copy and shift methods. The generating algorithm of hybrid-P-ary generalized bridge functions is introduced based on the hybrid-P-ary generalized Walsh function's copy algorithm. The main property, product property, is also discussed. This function may be viewed as the generalization of the theory of bridge functions. And a lot of non-sine orthogonal functions are the special subset of these novel functions. The hybrid-P-ary generalized bridge functions can be used to search many unknown non-sine functions by defining different parameters.

  16. Application of Genetic Algorithm on Quality Graded Networks for Intelligent Routing

    CERN Document Server

    Nair, T R Gopalakrishnan; 10.1109/WICT.2011.6141306

    2012-01-01

    In the past decade, significant research has been carried out for realizing intelligent network routing using advertisement, position and near-optimum node selection schemes. In this paper, a grade-based two-level node selection method along with genetic algorithm (GA) is proposed for realizing an efficient routing scheme. This method assumes that the nodes are intelligent and that there exists a knowledge base about the environment in their local memory. There are two levels for approaching the effective route selection process through grading. At the first level, grade-based selection is applied and at the second level, the optimum path is explored using GA. The simulation has been carried out on different topological structures, and a significant reduction in time is achieved for determining the optimal path through this method compared to the non-graded networks.

  17. A hybrid approach using chaotic dynamics and global search algorithms for combinatorial optimization problems

    Science.gov (United States)

    Igeta, Hideki; Hasegawa, Mikio

    Chaotic dynamics have been effectively applied to improve various heuristic algorithms for combinatorial optimization problems in many studies. Currently, the most used chaotic optimization scheme is to drive heuristic solution search algorithms applicable to large-scale problems by chaotic neurodynamics including the tabu effect of the tabu search. Alternatively, meta-heuristic algorithms are used for combinatorial optimization by combining a neighboring solution search algorithm, such as tabu, gradient, or other search method, with a global search algorithm, such as genetic algorithms (GA), ant colony optimization (ACO), or others. In these hybrid approaches, the ACO has effectively optimized the solution of many benchmark problems in the quadratic assignment problem library. In this paper, we propose a novel hybrid method that combines the effective chaotic search algorithm that has better performance than the tabu search and global search algorithms such as ACO and GA. Our results show that the proposed chaotic hybrid algorithm has better performance than the conventional chaotic search and conventional hybrid algorithms. In addition, we show that chaotic search algorithm combined with ACO has better performance than when combined with GA.

  18. Application of Hybrid Optimization Algorithm in the Synthesis of Linear Antenna Array

    Directory of Open Access Journals (Sweden)

    Ezgi Deniz Ülker

    2014-01-01

    Full Text Available The use of hybrid algorithms for solving real-world optimization problems has become popular since their solution quality can be made better than the algorithms that form them by combining their desirable features. The newly proposed hybrid method which is called Hybrid Differential, Particle, and Harmony (HDPH algorithm is different from the other hybrid forms since it uses all features of merged algorithms in order to perform efficiently for a wide variety of problems. In the proposed algorithm the control parameters are randomized which makes its implementation easy and provides a fast response. This paper describes the application of HDPH algorithm to linear antenna array synthesis. The results obtained with the HDPH algorithm are compared with three merged optimization techniques that are used in HDPH. The comparison shows that the performance of the proposed algorithm is comparatively better in both solution quality and robustness. The proposed hybrid algorithm HDPH can be an efficient candidate for real-time optimization problems since it yields reliable performance at all times when it gets executed.

  19. Intelligent controller of a flexible hybrid robot machine for ITER assembly and maintenance

    Energy Technology Data Exchange (ETDEWEB)

    Al-saedi, Mazin I., E-mail: mazin.al-saedi@lut.fi; Wu, Huapeng; Handroos, Heikki

    2014-10-15

    Highlights: • Studying flexible multibody dynamic of hybrid parallel robot. • Investigating fuzzy-PD controller to control a hybrid flexible hydraulically driven robot. • Investigating ANFIS-PD controller to control a hybrid flexible robot. Compare to traditional PID this method gives better performance. • Using the equilibrium of reaction forces between the parallel and serial parts of hybrid robot to control the serial part hydraulically driven. - Abstract: The assembly and maintenance of International Thermonuclear Experimental Reactor (ITER) vacuum vessel (VV) is highly challenging since the tasks performed by the robot involve welding, material handling, and machine cutting from inside the VV. To fulfill the tasks in ITER application, this paper presents a hybrid redundant manipulator with four DOFs provided by serial kinematic axes and six DOFs by parallel mechanism. Thus, in machining, to achieve greater end-effector trajectory tracking accuracy for surface quality, a robust control of the actuators for the flexible link has to be deduced. In this paper, the intelligent control of a hydraulically driven parallel robot part based on the dynamic model and two control schemes have been investigated: (1) fuzzy-PID self tuning controller composed of the conventional PID control and with fuzzy logic; (2) adaptive neuro-fuzzy inference system-PID (ANFIS-PID) self tuning of the gains of the PID controller, which are implemented independently to control each hydraulic cylinder of the parallel robot based on rod position predictions. The obtained results of the fuzzy-PID and ANFIS-PID self tuning controller can reduce more tracking errors than the conventional PID controller. Subsequently, the serial component of the hybrid robot can be analyzed using the equilibrium of reaction forces at the universal joint connections of the hexa-element. To achieve precise positional control of the end effector for maximum precision machining, the hydraulic cylinder should

  20. Ergodynamics in the Reliability of Power Plant Operators and Prospective Hybrid Intelligence Systems.

    Science.gov (United States)

    Venda; Chachko

    1996-01-01

    Based on ergodynamics and the hybrid intelligence theory, an analysis of the nuclear power plant operator's performance is given at the levels of strategies, tactics, and actions. Special attention is paid to the strategies used in the course of severe accidents at nuclear power plants. Data from Ukrainian and Russian power plants and training centres, and from accidents around the world were collected and processed. It is shown that in an emergency it is essential for the human operator to be flexible. This flexibility includes two main training and personal factors: a large set of strategies and tactics the operator manages to use, and quick transformations between the strategies (tactics). It was also found that some emergency tasks are too complicated: They require simultaneous use of different strategies, with time strictly limited by nuclear power plant dynamics. Those tasks cannot be successfully solved by any individual operator. Hybrid intelligence systems involving different specialists should be used in those cases in order to avoid failures in emergency problem solving and macroergonomic organizational design.

  1. Intelligent algorithm tuning PID method of function electrical stimulation using knee joint angle.

    Science.gov (United States)

    Qiu, Shuang; He, Feng; Tang, Jiabei; Xu, Jiapeng; Zhang, Lixin; Zhao, Xin; Qi, Hongzhi; Zhou, Peng; Cheng, Xiaoman; Wan, Baikun; Ming, Dong

    2014-01-01

    Functional electrical stimulation (FES) could restore motor functions for individuals with spinal cord injury (SCI). By applying electric current pulses, FES system could produce muscle contractions, generate joint torques, and thus, achieve joint movements automatically. Since the muscle system is highly nonlinear and time-varying, feedback control is quite necessary for precision control of the preset action. In the present study, we applied two methods (Proportional Integral Derivative (PID) controller based on Back Propagation (BP) neural network and that based on Genetic Algorithm (GA)), to control the knee joint angle for the FES system, while the traditional Ziegler-Nichols method was used in the control group for comparison. They were tested using a muscle model of the quadriceps. The results showed that intelligent algorithm tuning PID controller displayed superior performance than classic Ziegler-Nichols method with constant parameters. More particularly, PID controller tuned by BP neural network was superior on controlling precision to make the feedback signal track the desired trajectory whose error was less than 1.2°±0.16°, while GA-PID controller, seeking the optimal parameters from multipoint simultaneity, resulted in shortened delay in the response. Both strategies showed promise in application of intelligent algorithm tuning PID methods in FES system.

  2. Advanced Emergency Braking Control Based on a Nonlinear Model Predictive Algorithm for Intelligent Vehicles

    Directory of Open Access Journals (Sweden)

    Ronghui Zhang

    2017-05-01

    Full Text Available Focusing on safety, comfort and with an overall aim of the comprehensive improvement of a vision-based intelligent vehicle, a novel Advanced Emergency Braking System (AEBS is proposed based on Nonlinear Model Predictive Algorithm. Considering the nonlinearities of vehicle dynamics, a vision-based longitudinal vehicle dynamics model is established. On account of the nonlinear coupling characteristics of the driver, surroundings, and vehicle itself, a hierarchical control structure is proposed to decouple and coordinate the system. To avoid or reduce the collision risk between the intelligent vehicle and collision objects, a coordinated cost function of tracking safety, comfort, and fuel economy is formulated. Based on the terminal constraints of stable tracking, a multi-objective optimization controller is proposed using the theory of non-linear model predictive control. To quickly and precisely track control target in a finite time, an electronic brake controller for AEBS is designed based on the Nonsingular Fast Terminal Sliding Mode (NFTSM control theory. To validate the performance and advantages of the proposed algorithm, simulations are implemented. According to the simulation results, the proposed algorithm has better integrated performance in reducing the collision risk and improving the driving comfort and fuel economy of the smart car compared with the existing single AEBS.

  3. An evolutionary algorithm technique for intelligence, surveillance, and reconnaissance plan optimization

    Science.gov (United States)

    Langton, John T.; Caroli, Joseph A.; Rosenberg, Brad

    2008-04-01

    To support an Effects Based Approach to Operations (EBAO), Intelligence, Surveillance, and Reconnaissance (ISR) planners must optimize collection plans within an evolving battlespace. A need exists for a decision support tool that allows ISR planners to rapidly generate and rehearse high-performing ISR plans that balance multiple objectives and constraints to address dynamic collection requirements for assessment. To meet this need we have designed an evolutionary algorithm (EA)-based "Integrated ISR Plan Analysis and Rehearsal System" (I2PARS) to support Effects-based Assessment (EBA). I2PARS supports ISR mission planning and dynamic replanning to coordinate assets and optimize their routes, allocation and tasking. It uses an evolutionary algorithm to address the large parametric space of route-finding problems which is sometimes discontinuous in the ISR domain because of conflicting objectives such as minimizing asset utilization yet maximizing ISR coverage. EAs are uniquely suited for generating solutions in dynamic environments and also allow user feedback. They are therefore ideal for "streaming optimization" and dynamic replanning of ISR mission plans. I2PARS uses the Non-dominated Sorting Genetic Algorithm (NSGA-II) to automatically generate a diverse set of high performing collection plans given multiple objectives, constraints, and assets. Intended end users of I2PARS include ISR planners in the Combined Air Operations Centers and Joint Intelligence Centers. Here we show the feasibility of applying the NSGA-II algorithm and EAs in general to the ISR planning domain. Unique genetic representations and operators for optimization within the ISR domain are presented along with multi-objective optimization criteria for ISR planning. Promising results of the I2PARS architecture design, early software prototype, and limited domain testing of the new algorithm are discussed. We also present plans for future research and development, as well as technology

  4. A novel hybrid classification model of genetic algorithms, modified k-Nearest Neighbor and developed backpropagation neural network.

    Science.gov (United States)

    Salari, Nader; Shohaimi, Shamarina; Najafi, Farid; Nallappan, Meenakshii; Karishnarajah, Isthrinayagy

    2014-01-01

    Among numerous artificial intelligence approaches, k-Nearest Neighbor algorithms, genetic algorithms, and artificial neural networks are considered as the most common and effective methods in classification problems in numerous studies. In the present study, the results of the implementation of a novel hybrid feature selection-classification model using the above mentioned methods are presented. The purpose is benefitting from the synergies obtained from combining these technologies for the development of classification models. Such a combination creates an opportunity to invest in the strength of each algorithm, and is an approach to make up for their deficiencies. To develop proposed model, with the aim of obtaining the best array of features, first, feature ranking techniques such as the Fisher's discriminant ratio and class separability criteria were used to prioritize features. Second, the obtained results that included arrays of the top-ranked features were used as the initial population of a genetic algorithm to produce optimum arrays of features. Third, using a modified k-Nearest Neighbor method as well as an improved method of backpropagation neural networks, the classification process was advanced based on optimum arrays of the features selected by genetic algorithms. The performance of the proposed model was compared with thirteen well-known classification models based on seven datasets. Furthermore, the statistical analysis was performed using the Friedman test followed by post-hoc tests. The experimental findings indicated that the novel proposed hybrid model resulted in significantly better classification performance compared with all 13 classification methods. Finally, the performance results of the proposed model was benchmarked against the best ones reported as the state-of-the-art classifiers in terms of classification accuracy for the same data sets. The substantial findings of the comprehensive comparative study revealed that performance of the

  5. Intelligent Soft Computing on Forex: Exchange Rates Forecasting with Hybrid Radial Basis Neural Network

    OpenAIRE

    Lukas Falat; Dusan Marcek; Maria Durisova

    2016-01-01

    This paper deals with application of quantitative soft computing prediction models into financial area as reliable and accurate prediction models can be very helpful in management decision-making process. The authors suggest a new hybrid neural network which is a combination of the standard RBF neural network, a genetic algorithm, and a moving average. The moving average is supposed to enhance the outputs of the network using the error part of the original neural network. Authors test the sug...

  6. Design of intelligent locks based on the triple KeeLoq algorithm

    Directory of Open Access Journals (Sweden)

    Huibin Chen

    2016-04-01

    Full Text Available KeeLoq algorithm with high security was usually used in wireless codec. Its security lack is indicated in this article according to the detailed rationale and the introduction of previous attack researches. Taking examples from Triple Data Encryption Standard algorithm, the triple KeeLoq codec algorithm was first proposed. Experimental results showed that the algorithm would not reduce powerful rolling effect and in consideration of limited computing power of embedded microcontroller three 64-bit keys were suitable to increase the crack difficulties and further improved its security. The method was applied to intelligent door access system for experimental verification. 16F690 extended Bluetooth or WiFi interface was employed to design the lock system on door. Key application was constructed on Android platform. The wireless communication between the lock on door and Android key application employed triple KeeLoq algorithm to ensure the higher security. Due to flexibility and multiformity (an Android key application with various keys of software-based keys, the solution owned overwhelmed advantages of low cost, high security, humanity, and green environmental protection.

  7. An energy-efficient and secure hybrid algorithm for wireless sensor networks using a mobile data collector

    Science.gov (United States)

    Dayananda, Karanam Ravichandran; Straub, Jeremy

    2017-05-01

    This paper proposes a new hybrid algorithm for security, which incorporates both distributed and hierarchal approaches. It uses a mobile data collector (MDC) to collect information in order to save energy of sensor nodes in a wireless sensor network (WSN) as, in most networks, these sensor nodes have limited energy. Wireless sensor networks are prone to security problems because, among other things, it is possible to use a rogue sensor node to eavesdrop on or alter the information being transmitted. To prevent this, this paper introduces a security algorithm for MDC-based WSNs. A key use of this algorithm is to protect the confidentiality of the information sent by the sensor nodes. The sensor nodes are deployed in a random fashion and form group structures called clusters. Each cluster has a cluster head. The cluster head collects data from the other nodes using the time-division multiple access protocol. The sensor nodes send their data to the cluster head for transmission to the base station node for further processing. The MDC acts as an intermediate node between the cluster head and base station. The MDC, using its dynamic acyclic graph path, collects the data from the cluster head and sends it to base station. This approach is useful for applications including warfighting, intelligent building and medicine. To assess the proposed system, the paper presents a comparison of its performance with other approaches and algorithms that can be used for similar purposes.

  8. A FLEXIBLE HYBRID GMRES ALGORITHM%一种灵活的混合GMRES算法

    Institute of Scientific and Technical Information of China (English)

    钟宝江

    2001-01-01

    A variant of the hybrid GMRES algorithm of N.M. Nachtigal, L. Reichel, and L. N. Trefethen for solving large nonsymmetric systems of linear equations is presented. This algorithm allows the GMRES polynomial re-applied later being constructed in the course of a restarted GMRES iteration. It is described how the new hybrid scheme may offer significant performance improvements over the old one.

  9. A Simple Sizing Algorithm for Stand-Alone PV/Wind/Battery Hybrid Microgrids

    OpenAIRE

    Jing Li; Wei Wei; Ji Xiang

    2012-01-01

    In this paper, we develop a simple algorithm to determine the required number of generating units of wind-turbine generator and photovoltaic array, and the associated storage capacity for stand-alone hybrid microgrid. The algorithm is based on the observation that the state of charge of battery should be periodically invariant. The optimal sizing of hybrid microgrid is given in the sense that the life cycle cost of system is minimized while the given load power demand can be satisfied without...

  10. Hybrid algorithm for accelerating the double series of Floquet vector modes

    Institute of Scientific and Technical Information of China (English)

    LI Weidong; HONG Wei; HAO Zhangcheng; ZHOU Houxing

    2006-01-01

    In this paper, a hybrid algorithm for accelerating the double series of Floquet vector modes arising in the analysis of frequency selective surfaces (FSS) is presented. The asymptotic terms with slow convergence in the double series are first accelerated by Poisson transformation and Ewald method, and then the remained series is accelerated by Shank transformation. It results in significant savings in memory and computing time. Numerical examples verify the validity of the hybrid acceleration algorithm.

  11. Application of Intelligence Based Genetic Algorithm for Job Sequencing Problem on Parallel Mixed-Model Assembly Line

    Directory of Open Access Journals (Sweden)

    A. Norozi

    2010-01-01

    Full Text Available Problem statement: In the area of globalization the degree of competition in the market increased and many companies attempted to manufacture the products efficiently to overcome the challenges faced. Approach: Mixed model assembly line was able to provide continuous flow of material and flexibility with regard to model change. The problem under study attempted to describe the mathematical programming limitation for minimizing the overall make-span and balancing objective for set of parallel lines. Results: A proposed mixed-integer model only able to find the best job sequence in each line to meet the problem objectives for the given number of job allotted to each line. Hence using the proposed mathematical model for large size problem was time consuming and inefficient as so many job allocation values should be checked. This study presented an intelligence based genetic algorithm approach to optimize the considered problem objectives through reducing the problem complexity. A heuristic algorithm was introduced to generate the initial population for intelligence based genetic algorithm. Then, it started to find the best sequence of jobs for each line based on the generated population by heuristic algorithm. By this means, intelligence based genetic algorithm only concentrated on those initial populations that produce better solutions instead of probing the entire search space. Conclusion/Recommendations: The results obtained from intelligence based genetic algorithm were used as an initial point for fine-tuning by simulated annealing to increase the quality of solution. In order to check the capability of proposed algorithm, several experimentations on the set of problems were done. As the total objective values in most of problems could not be improved by simulated algorithm, it proved the well performing of proposed intelligence based genetic algorithm in reaching the near optimal solutions.

  12. An Allele Real-Coded Quantum Evolutionary Algorithm Based on Hybrid Updating Strategy.

    Science.gov (United States)

    Zhang, Yu-Xian; Qian, Xiao-Yi; Peng, Hui-Deng; Wang, Jian-Hui

    2016-01-01

    For improving convergence rate and preventing prematurity in quantum evolutionary algorithm, an allele real-coded quantum evolutionary algorithm based on hybrid updating strategy is presented. The real variables are coded with probability superposition of allele. A hybrid updating strategy balancing the global search and local search is presented in which the superior allele is defined. On the basis of superior allele and inferior allele, a guided evolutionary process as well as updating allele with variable scale contraction is adopted. And H ε gate is introduced to prevent prematurity. Furthermore, the global convergence of proposed algorithm is proved by Markov chain. Finally, the proposed algorithm is compared with genetic algorithm, quantum evolutionary algorithm, and double chains quantum genetic algorithm in solving continuous optimization problem, and the experimental results verify the advantages on convergence rate and search accuracy.

  13. An Allele Real-Coded Quantum Evolutionary Algorithm Based on Hybrid Updating Strategy

    Directory of Open Access Journals (Sweden)

    Yu-Xian Zhang

    2016-01-01

    Full Text Available For improving convergence rate and preventing prematurity in quantum evolutionary algorithm, an allele real-coded quantum evolutionary algorithm based on hybrid updating strategy is presented. The real variables are coded with probability superposition of allele. A hybrid updating strategy balancing the global search and local search is presented in which the superior allele is defined. On the basis of superior allele and inferior allele, a guided evolutionary process as well as updating allele with variable scale contraction is adopted. And Hε gate is introduced to prevent prematurity. Furthermore, the global convergence of proposed algorithm is proved by Markov chain. Finally, the proposed algorithm is compared with genetic algorithm, quantum evolutionary algorithm, and double chains quantum genetic algorithm in solving continuous optimization problem, and the experimental results verify the advantages on convergence rate and search accuracy.

  14. Parameter estimation for chaotic systems using a hybrid adaptive cuckoo search with simulated annealing algorithm

    Energy Technology Data Exchange (ETDEWEB)

    Sheng, Zheng, E-mail: 19994035@sina.com [College of Meteorology and Oceanography, PLA University of Science and Technology, Nanjing 211101 (China); Wang, Jun; Zhou, Bihua [National Defense Key Laboratory on Lightning Protection and Electromagnetic Camouflage, PLA University of Science and Technology, Nanjing 210007 (China); Zhou, Shudao [College of Meteorology and Oceanography, PLA University of Science and Technology, Nanjing 211101 (China); Collaborative Innovation Center on Forecast and Evaluation of Meteorological Disasters, Nanjing University of Information Science and Technology, Nanjing 210044 (China)

    2014-03-15

    This paper introduces a novel hybrid optimization algorithm to establish the parameters of chaotic systems. In order to deal with the weaknesses of the traditional cuckoo search algorithm, the proposed adaptive cuckoo search with simulated annealing algorithm is presented, which incorporates the adaptive parameters adjusting operation and the simulated annealing operation in the cuckoo search algorithm. Normally, the parameters of the cuckoo search algorithm are kept constant that may result in decreasing the efficiency of the algorithm. For the purpose of balancing and enhancing the accuracy and convergence rate of the cuckoo search algorithm, the adaptive operation is presented to tune the parameters properly. Besides, the local search capability of cuckoo search algorithm is relatively weak that may decrease the quality of optimization. So the simulated annealing operation is merged into the cuckoo search algorithm to enhance the local search ability and improve the accuracy and reliability of the results. The functionality of the proposed hybrid algorithm is investigated through the Lorenz chaotic system under the noiseless and noise condition, respectively. The numerical results demonstrate that the method can estimate parameters efficiently and accurately in the noiseless and noise condition. Finally, the results are compared with the traditional cuckoo search algorithm, genetic algorithm, and particle swarm optimization algorithm. Simulation results demonstrate the effectiveness and superior performance of the proposed algorithm.

  15. Parameter estimation for chaotic systems using a hybrid adaptive cuckoo search with simulated annealing algorithm

    Science.gov (United States)

    Sheng, Zheng; Wang, Jun; Zhou, Shudao; Zhou, Bihua

    2014-03-01

    This paper introduces a novel hybrid optimization algorithm to establish the parameters of chaotic systems. In order to deal with the weaknesses of the traditional cuckoo search algorithm, the proposed adaptive cuckoo search with simulated annealing algorithm is presented, which incorporates the adaptive parameters adjusting operation and the simulated annealing operation in the cuckoo search algorithm. Normally, the parameters of the cuckoo search algorithm are kept constant that may result in decreasing the efficiency of the algorithm. For the purpose of balancing and enhancing the accuracy and convergence rate of the cuckoo search algorithm, the adaptive operation is presented to tune the parameters properly. Besides, the local search capability of cuckoo search algorithm is relatively weak that may decrease the quality of optimization. So the simulated annealing operation is merged into the cuckoo search algorithm to enhance the local search ability and improve the accuracy and reliability of the results. The functionality of the proposed hybrid algorithm is investigated through the Lorenz chaotic system under the noiseless and noise condition, respectively. The numerical results demonstrate that the method can estimate parameters efficiently and accurately in the noiseless and noise condition. Finally, the results are compared with the traditional cuckoo search algorithm, genetic algorithm, and particle swarm optimization algorithm. Simulation results demonstrate the effectiveness and superior performance of the proposed algorithm.

  16. A Hybrid Bacterial Foraging Algorithm For Solving Job Shop Scheduling Problems

    OpenAIRE

    Narendhar, S.; T Amudha

    2012-01-01

    Bio-Inspired computing is the subset of Nature-Inspired computing. Job Shop Scheduling Problem is categorized under popular scheduling problems. In this research work, Bacterial Foraging Optimization was hybridized with Ant Colony Optimization and a new technique Hybrid Bacterial Foraging Optimization for solving Job Shop Scheduling Problem was proposed. The optimal solutions obtained by proposed Hybrid Bacterial Foraging Optimization algorithms are much better when compared with the solution...

  17. A Business Intelligence Model to Predict Bankruptcy using Financial Domain Ontology with Association Rule Mining Algorithm

    CERN Document Server

    Martin, A; Venkatesan, Dr V Prasanna

    2011-01-01

    Today in every organization financial analysis provides the basis for understanding and evaluating the results of business operations and delivering how well a business is doing. This means that the organizations can control the operational activities primarily related to corporate finance. One way that doing this is by analysis of bankruptcy prediction. This paper develops an ontological model from financial information of an organization by analyzing the Semantics of the financial statement of a business. One of the best bankruptcy prediction models is Altman Z-score model. Altman Z-score method uses financial rations to predict bankruptcy. From the financial ontological model the relation between financial data is discovered by using data mining algorithm. By combining financial domain ontological model with association rule mining algorithm and Zscore model a new business intelligence model is developed to predict the bankruptcy.

  18. A Real-Time Lane Detection Algorithm Based on Intelligent CCD Parameters Regulation

    Directory of Open Access Journals (Sweden)

    Ping-shu Ge

    2012-01-01

    Full Text Available Lane departure warning system (LDWS has been regarded as an efficient method to lessen the damages of road traffic accident resulting from driver fatigue or inattention. Lane detection is one of the key techniques for LDWS. To overcome the contradiction between complexity of algorithm and the real-time requirement for vehicle onboard system, this paper introduces a new lane detection method based on intelligent CCD parameters regulation. In order to improve the real-time capability of the system, a CCD parameters regulating method is proposed which enhances the contrast between lane line and road surfaces and reduces image noise, so it lays a good foundation for the following lane detection. Hough transform algorithm is improved by selection and classification of seed points. Finally the lane line is extracted through some restrictions. Experimental results verify the effectiveness of the proposed method, which improves not only real-time capability but also the accuracy of the system.

  19. Knee Joint Optimization Design of Intelligent Bionic Leg Based on Genetic Algorithm

    Directory of Open Access Journals (Sweden)

    Hualong Xie

    2014-09-01

    Full Text Available Intelligent bionic leg (IBL is an advanced prosthesis which can maximum functionally simulate and approach the motion trajectory of human leg. Knee joint is the most important bone of human leg and its bionic design has great significance to prosthesis performance. The structural components of IBL are introduced and virtual prototype is given. The advantages of 4-bar knee joint are analyzed and are adopted in IBL design. The kinematics model of 4-bar knee joint is established. The objective function, constraint condition, parameters selection and setting of genetic algorithm are discussed in detail. Based on genetic algorithm, the optimization design of IBL knee joint is done. The optimization results indicate that the 4-bar mechanism can achieve better anthropomorphic characteristics of human knee joint.

  20. CHAOS-REGULARIZATION HYBRID ALGORITHM FOR NONLINEAR TWO-DIMENSIONAL INVERSE HEAT CONDUCTION PROBLEM

    Institute of Scientific and Technical Information of China (English)

    王登刚; 刘迎曦; 李守巨

    2002-01-01

    A numerical model of nonlinear two-dimensional steady inverse heat conduction problem was established considering the thermal conductivity changing with temperature.Combining the chaos optimization algorithm with the gradient regularization method, a chaos-regularization hybrid algorithm was proposed to solve the established numerical model.The hybrid algorithm can give attention to both the advantages of chaotic optimization algorithm and those of gradient regularization method. The chaos optimization algorithm was used to help the gradient regalarization method to escape from local optima in the hybrid algorithm. Under the assumption of temperature-dependent thermal conductivity changing with temperature in linear rule, the thermal conductivity and the linear rule were estimated by using the present method with the aid of boundary temperature measurements. Numerical simulation results show that good estimation on the thermal conductivity and the linear function can be obtained with arbitrary initial guess values, and that the present hybrid algorithm is much more efficient than conventional genetic algorithm and chaos optimization algorithm.

  1. Effective hybrid evolutionary computational algorithms for global optimization and applied to construct prion AGAAAAGA fibril models

    CERN Document Server

    Zhang, Jiapu

    2010-01-01

    Evolutionary algorithms are parallel computing algorithms and simulated annealing algorithm is a sequential computing algorithm. This paper inserts simulated annealing into evolutionary computations and successful developed a hybrid Self-Adaptive Evolutionary Strategy $\\mu+\\lambda$ method and a hybrid Self-Adaptive Classical Evolutionary Programming method. Numerical results on more than 40 benchmark test problems of global optimization show that the hybrid methods presented in this paper are very effective. Lennard-Jones potential energy minimization is another benchmark for testing new global optimization algorithms. It is studied through the amyloid fibril constructions by this paper. To date, there is little molecular structural data available on the AGAAAAGA palindrome in the hydrophobic region (113-120) of prion proteins.This region belongs to the N-terminal unstructured region (1-123) of prion proteins, the structure of which has proved hard to determine using NMR spectroscopy or X-ray crystallography ...

  2. A Novel Hybrid Intelligent Indoor Location Method for Mobile Devices by Zones Using Wi-Fi Signals

    Directory of Open Access Journals (Sweden)

    Manuel Castañón–Puga

    2015-12-01

    Full Text Available The increasing use of mobile devices in indoor spaces brings challenges to location methods. This work presents a hybrid intelligent method based on data mining and Type-2 fuzzy logic to locate mobile devices in an indoor space by zones using Wi-Fi signals from selected access points (APs. This approach takes advantage of wireless local area networks (WLANs over other types of architectures and implements the complete method in a mobile application using the developed tools. Besides, the proposed approach is validated by experimental data obtained from case studies and the cross-validation technique. For the purpose of generating the fuzzy rules that conform to the Takagi–Sugeno fuzzy system structure, a semi-supervised data mining technique called subtractive clustering is used. This algorithm finds centers of clusters from the radius map given by the collected signals from APs. Measurements of Wi-Fi signals can be noisy due to several factors mentioned in this work, so this method proposed the use of Type-2 fuzzy logic for modeling and dealing with such uncertain information.

  3. A Novel Hybrid Intelligent Indoor Location Method for Mobile Devices by Zones Using Wi-Fi Signals.

    Science.gov (United States)

    Castañón-Puga, Manuel; Salazar, Abby Stephanie; Aguilar, Leocundo; Gaxiola-Pacheco, Carelia; Licea, Guillermo

    2015-12-02

    The increasing use of mobile devices in indoor spaces brings challenges to location methods. This work presents a hybrid intelligent method based on data mining and Type-2 fuzzy logic to locate mobile devices in an indoor space by zones using Wi-Fi signals from selected access points (APs). This approach takes advantage of wireless local area networks (WLANs) over other types of architectures and implements the complete method in a mobile application using the developed tools. Besides, the proposed approach is validated by experimental data obtained from case studies and the cross-validation technique. For the purpose of generating the fuzzy rules that conform to the Takagi-Sugeno fuzzy system structure, a semi-supervised data mining technique called subtractive clustering is used. This algorithm finds centers of clusters from the radius map given by the collected signals from APs. Measurements of Wi-Fi signals can be noisy due to several factors mentioned in this work, so this method proposed the use of Type-2 fuzzy logic for modeling and dealing with such uncertain information.

  4. An Effective Hybrid Cuckoo Search Algorithm with Improved Shuffled Frog Leaping Algorithm for 0-1 Knapsack Problems

    OpenAIRE

    2014-01-01

    An effective hybrid cuckoo search algorithm (CS) with improved shuffled frog-leaping algorithm (ISFLA) is put forward for solving 0-1 knapsack problem. First of all, with the framework of SFLA, an improved frog-leap operator is designed with the effect of the global optimal information on the frog leaping and information exchange between frog individuals combined with genetic mutation with a small probability. Subsequently, in order to improve the ...

  5. Intelligent Energy Management Strategy for a Separated-Axle Parallel Hybrid Electric Vehicle

    Directory of Open Access Journals (Sweden)

    Naser Fallahi

    2014-03-01

    Full Text Available Hybrid electric vehicles (HEV in addition to provide the benefits of electric vehicles could satisfy consumers for some performances of conventional internal combustion engine (ICE vehicles such as acceleration and long range. On this way, suitable energy optimization strategies should be employed to get desired efficiency, less fuel consumption and pollution. One of the favorite and simple configurations of HEVs is parallel type. A student team at University of Kashan, IRAN have designed and manufactured Shaheb 2 hybrid electric vehicle. It is a separated-axle (or Through-to-Road (TTR parallel HEV type based on Pride platform. Employed energy management in Shaheb 2 is on/off strategy and three modes; motor, engine and hybrid have been implemented. This paper investigates the modeling of separated-axle (or TTR parallel type of HEV in ADVISOR software and then evaluates two control strategies for Shaheb 2; on/off strategy and an intelligent control based on fuzzy logic. On this way, maximizing the engine is considered as objective function. The simulation results indicate that the fuzzy strategy leads to less fuel consumption and lower pollution for given UDDS driving cycle rather than on/off strategy for Shaheb 2.

  6. Intelligent 3D packing using a grouping algorithm for automotive container engineering

    Directory of Open Access Journals (Sweden)

    Youn-Kyoung Joung

    2014-04-01

    Full Text Available Storing, and the loading and unloading of materials at production sites in the manufacturing sector for mass production is a critical problem that affects various aspects: the layout of the factory, line-side space, logistics, workers’ work paths and ease of work, automatic procurement of components, and transfer and supply. Traditionally, the nesting problem has been an issue to improve the efficiency of raw materials; further, research into mainly 2D optimization has progressed. Also, recently, research into the expanded usage of 3D models to implement packing optimization has been actively carried out. Nevertheless, packing algorithms using 3D models are not widely used in practice, due to the large decrease in efficiency, owing to the complexity and excessive computational time. In this paper, the problem of efficiently loading and unloading freeform 3D objects into a given container has been solved, by considering the 3D form, ease of loading and unloading, and packing density. For this reason, a Group Packing Approach for workers has been developed, by using analyzed truck packing work patterns and Group Technology, which is to enhance the efficiency of storage in the manufacturing sector. Also, an algorithm for 3D packing has been developed, and implemented in a commercial 3D CAD modeling system. The 3D packing method consists of a grouping algorithm, a sequencing algorithm, an orientating algorithm, and a loading algorithm. These algorithms concern the respective aspects: the packing order, orientation decisions of parts, collision checking among parts and processing, position decisions of parts, efficiency verification, and loading and unloading simulation. Storage optimization and examination of the ease of loading and unloading are possible, and various kinds of engineering analysis, such as work performance analysis, are facilitated through the intelligent 3D packing method developed in this paper, by using the results of the 3D

  7. Application of Hybrid Genetic Algorithm Routine in Optimizing Food and Bioengineering Processes.

    Science.gov (United States)

    Tumuluru, Jaya Shankar; McCulloch, Richard

    2016-11-09

    Optimization is a crucial step in the analysis of experimental results. Deterministic methods only converge on local optimums and require exponentially more time as dimensionality increases. Stochastic algorithms are capable of efficiently searching the domain space; however convergence is not guaranteed. This article demonstrates the novelty of the hybrid genetic algorithm (HGA), which combines both stochastic and deterministic routines for improved optimization results. The new hybrid genetic algorithm developed is applied to the Ackley benchmark function as well as case studies in food, biofuel, and biotechnology processes. For each case study, the hybrid genetic algorithm found a better optimum candidate than reported by the sources. In the case of food processing, the hybrid genetic algorithm improved the anthocyanin yield by 6.44%. Optimization of bio-oil production using HGA resulted in a 5.06% higher yield. In the enzyme production process, HGA predicted a 0.39% higher xylanase yield. Hybridization of the genetic algorithm with a deterministic algorithm resulted in an improved optimum compared to statistical methods.

  8. Research on integrated naval ship design model and its intelligent algorithm

    Institute of Scientific and Technical Information of China (English)

    HOU Yuan-hang; HUANG Sheng

    2016-01-01

    Pointing at naval ship projects creation and evaluation at stage of naval ship concept design,in the mechanism of integrated design based on naval ship synthesis model, ship projects creation and intelligent fuzzy evaluation method is researched, thus the applicability of each algorithm is obtained. Firstly,the naval ship synthesis model is introduced to design process, value and application status of synthesis model in integrated design is then exposed. Then the applicability of single target and multi targets SA algorithm is improved, and the quick generation of naval ship projects is done. After that, multiple projects evaluation method based on Vague fuzzy set is introduced to established the intelligent evaluation model, which can integrate effectively the quantitative and qualitative indexes. At last, the analysis of results comparison shows the advancement and rationality of each method. The example shows the integrated design process researched in this paper can be a great orientation of naval ship project design, and can also be used in other parts of naval ship development.

  9. 基于智能Agent系统的集成路由算法%Integrated Routing Algorithms Based on Intelligent Agent Systems

    Institute of Scientific and Technical Information of China (English)

    张艳华; 贺红; 马绍汉

    2003-01-01

    In order to ensure serve quality of Internet, and enhance Internet resource utilizing, we take advantage of NN-Algorithm and common algorithm, absorb NN-Algorithm's merit, such as fast and veracity, and overcome shortcoming high cost. We absorb common algorithm's lower cost and overcome it's shortcoming. We put forward integrated routing algorithms based on intelligent Agent systems. In different condition we trade off NN-Algorithm and common algorithm, so we can enhance serve quality of Internet. Compared with the common network model, this paper also comsiders the weight of network vertexes.So the intelligent routing algorithm is more practical.

  10. Optimization of Evolutionary Neural Networks Using Hybrid Learning Algorithms

    OpenAIRE

    Abraham, Ajith

    2004-01-01

    Evolutionary artificial neural networks (EANNs) refer to a special class of artificial neural networks (ANNs) in which evolution is another fundamental form of adaptation in addition to learning. Evolutionary algorithms are used to adapt the connection weights, network architecture and learning algorithms according to the problem environment. Even though evolutionary algorithms are well known as efficient global search algorithms, very often they miss the best local solutions in the complex s...

  11. Intelligence.

    Science.gov (United States)

    Sternberg, Robert J

    2012-03-01

    Intelligence is the ability to learn from experience and to adapt to, shape, and select environments. Intelligence as measured by (raw scores on) conventional standardized tests varies across the lifespan, and also across generations. Intelligence can be understood in part in terms of the biology of the brain-especially with regard to the functioning in the prefrontal cortex-and also correlates with brain size, at least within humans. Studies of the effects of genes and environment suggest that the heritability coefficient (ratio of genetic to phenotypic variation) is between .4 and .8, although heritability varies as a function of socioeconomic status and other factors. Racial differences in measured intelligence have been observed, but race is a socially constructed rather than biological variable, so such differences are difficult to interpret.

  12. Using Computational Intelligence Algorithms to Solve the Coalition Structure Generation Problem in Coalitional Skill Games

    Institute of Scientific and Technical Information of China (English)

    Yang Liu; Guo-Fu Zhang; Zhao-Pin Su; Feng Yue; Jian-Guo Jiang

    2016-01-01

    Coalitional skill games (CSGs) are a simple model of cooperation in an uncertain environment where each agent has a set of skills that are required to accomplish a variety of tasks and each task requires a set of skills to be completed, but each skill is very hard to be quantified and can only be qualitatively expressed. Thus far, many computational questions surrounding CSGs have been studied. However, to the best of our knowledge, the coalition structure generation problem (CSGP), as a central issue of CSGs, is extremely challenging and has not been well solved. To this end, two different computational intelligence algorithms are herein evaluated: binary particle swarm optimization (BPSO) and binary differential evolution (BDE). In particular, we develop the two stochastic search algorithms with two-dimensional binary encoding and corresponding heuristic for individual repairs. After that, we discuss some fundamental properties of the proposed heuristic. Finally, we compare the improved BPSO and BDE with the state-of-the-art algorithms for solving CSGP in CSGs. The experimental results show that our algorithms can find the same near optimal solutions with the existing approaches but take extremely short time, especially under the large problem size.

  13. Application of Memetic Algorithm in Generating Test Paper Intelligently%Computer and Modernization

    Institute of Scientific and Technical Information of China (English)

    易桂生; 黄文华

    2016-01-01

    Memetic algorithm is a metaheuristic search method. It is often used to solve NP problems. In this paper, through the improvement and optimization of the genetic Memetic algorithm, combined with the characteristics of the intelligent test paper gen-eration, a set of complete solution is put forward. The algorithm uses the Memetic algorithm framework;the global search strategy uses genetic algorithm of piecewise real number encoding; crossover and mutation operations are included in. The local search strategy algorithm using simulated annealing algorithm, solves the local optimization problem effectively. Through the comparison experiment of different algorithms, the experimental results show that the Memetic algorithm proposed in this paper can solve the problem of generating test paper quickly and efficiently, at the same time, the algorithm can improve the quality of test paper, and also can reduce the number of iterations and obtain the optimal solution more quickly.%Memetic算法是一种启发式搜索方法,常用于解决一些NP问题。本文通过对遗传Memetic算法的改进与优化,结合智能组卷问题的特点,提出一套完整的解决方案。算法使用Memetic算法框架,全局搜索策略采用分段实数编码的遗传算法,融合了算法的交叉变异操作,局部搜索策略采用模拟退火算法,有效解决陷入局部最优问题。通过不同算法的对比实验表明,本文提出的Memetic算法能够快速高效地解决智能组卷问题,大大提升试卷生成质量,减少迭代次数,可快速获得最优解。

  14. Hybridizing Differential Evolution with a Genetic Algorithm for Color Image Segmentation

    Directory of Open Access Journals (Sweden)

    R. V. V. Krishna

    2016-10-01

    Full Text Available This paper proposes a hybrid of differential evolution and genetic algorithms to solve the color image segmentation problem. Clustering based color image segmentation algorithms segment an image by clustering the features of color and texture, thereby obtaining accurate prototype cluster centers. In the proposed algorithm, the color features are obtained using the homogeneity model. A new texture feature named Power Law Descriptor (PLD which is a modification of Weber Local Descriptor (WLD is proposed and further used as a texture feature for clustering. Genetic algorithms are competent in handling binary variables, while differential evolution on the other hand is more efficient in handling real parameters. The obtained texture feature is binary in nature and the color feature is a real value, which suits very well the hybrid cluster center optimization problem in image segmentation. Thus in the proposed algorithm, the optimum texture feature centers are evolved using genetic algorithms, whereas the optimum color feature centers are evolved using differential evolution.

  15. Hybrid partheno-genetic algorithm and its application in flow-shop problem

    Institute of Scientific and Technical Information of China (English)

    李树刚; 吴智铭; 庞小红

    2004-01-01

    In order to solve the constraint satisfied problem in the genetic algorithm, the partheno-genetic algorithm is designed. And then the schema theorem of the partheno-genetic algorithm is proposed to show that the high rank schemas at the subsequent generation decrease exponentially even though its fitness is more optimal than the average one in the population and the low rank schemas at the subsequent generation increase exponentially when its fitness is more optimal than the average one in the population. In order to overcome the shortcoming that the optimal high rank schema can be deserted arbitrarily, the HGA (hybrid partheno-genetic algorithm) is proposed, that is, the hill-climbing algorithm is integrated to search for a better individual. Finally, the results of the simulation for facility layout problem and no-wait schedule problem are given. It is shown that the hybrid partheno- genetic algorithm is of high efficiency.

  16. Hybrid nested sampling algorithm for Bayesian model selection applied to inverse subsurface flow problems

    Energy Technology Data Exchange (ETDEWEB)

    Elsheikh, Ahmed H., E-mail: aelsheikh@ices.utexas.edu [Institute for Computational Engineering and Sciences (ICES), University of Texas at Austin, TX (United States); Institute of Petroleum Engineering, Heriot-Watt University, Edinburgh EH14 4AS (United Kingdom); Wheeler, Mary F. [Institute for Computational Engineering and Sciences (ICES), University of Texas at Austin, TX (United States); Hoteit, Ibrahim [Department of Earth Sciences and Engineering, King Abdullah University of Science and Technology (KAUST), Thuwal (Saudi Arabia)

    2014-02-01

    A Hybrid Nested Sampling (HNS) algorithm is proposed for efficient Bayesian model calibration and prior model selection. The proposed algorithm combines, Nested Sampling (NS) algorithm, Hybrid Monte Carlo (HMC) sampling and gradient estimation using Stochastic Ensemble Method (SEM). NS is an efficient sampling algorithm that can be used for Bayesian calibration and estimating the Bayesian evidence for prior model selection. Nested sampling has the advantage of computational feasibility. Within the nested sampling algorithm, a constrained sampling step is performed. For this step, we utilize HMC to reduce the correlation between successive sampled states. HMC relies on the gradient of the logarithm of the posterior distribution, which we estimate using a stochastic ensemble method based on an ensemble of directional derivatives. SEM only requires forward model runs and the simulator is then used as a black box and no adjoint code is needed. The developed HNS algorithm is successfully applied for Bayesian calibration and prior model selection of several nonlinear subsurface flow problems.

  17. Hybrid intelligent system for Sale Forecasting using Delphi and adaptive Fuzzy Back-Propagation Neural Networks

    Directory of Open Access Journals (Sweden)

    Attariuas Hicham

    2012-12-01

    Full Text Available ales forecasting is one of the most crucial issues addressed in business. Control and evaluation of future sales still seem concerned both researchers and policy makers and managers of companies. this research propose an intelligent hybrid sales forecasting system Delphi-FCBPN sales forecast based on Delphi Method, fuzzy clustering and Back-propagation (BP Neural Networks with adaptive learning rate. The proposed model is constructed to integrate expert judgments, using Delphi method, in enhancing the model of FCBPN. Winter’s Exponential Smoothing method will be utilized to take the trend effect into consideration. The data for this search come from an industrial company that manufactures packaging. Analyze of results show that the proposed model outperforms other three different forecasting models in MAPE and RMSE measures.

  18. A Hybrid Distributed Mutual Exclusion Algorithm for Cluster-Based Systems

    Directory of Open Access Journals (Sweden)

    Moharram Challenger

    2013-01-01

    Full Text Available Distributed mutual exclusion is a fundamental problem which arises in various systems such as grid computing, mobile ad hoc networks (MANETs, and distributed databases. Reducing key metrics like message count per any critical section (CS and delay between two CS entrances, which is known as synchronization delay, is a great challenge for this problem. Various algorithms use either permission-based or token-based protocols. Token-based algorithms offer better communication costs and synchronization delay. Raymond's and Suzuki-Kasami's algorithms are well-known token-based ones. Raymond's algorithm needs only O(log2(N messages per CS and Suzuki-Kasami's algorithm needs just one message delivery time between two CS entrances. Nevertheless, both algorithms are weak in the other metric, synchronization delay and message complexity correspondingly. In this work, a new hybrid algorithm is proposed which gains from powerful aspects of both algorithms. Raysuz's algorithm (the proposed algorithm uses a clustered graph and executes Suzuki-Kasami's algorithm intraclusters and Raymond's algorithm interclusters. This leads to have better message complexity than that of pure Suzuki-Kasami's algorithm and better synchronization delay than that of pure Raymond's algorithm, resulting in an overall efficient DMX algorithm pure algorithm.

  19. Series Hybrid Electric Vehicle Power System Optimization Based on Genetic Algorithm

    Science.gov (United States)

    Zhu, Tianjun; Li, Bin; Zong, Changfu; Wu, Yang

    2017-09-01

    Hybrid electric vehicles (HEV), compared with conventional vehicles, have complex structures and more component parameters. If variables optimization designs are carried on all these parameters, it will increase the difficulty and the convergence of algorithm program, so this paper chooses the parameters which has a major influence on the vehicle fuel consumption to make it all work at maximum efficiency. First, HEV powertrain components modelling are built. Second, taking a tandem hybrid structure as an example, genetic algorithm is used in this paper to optimize fuel consumption and emissions. Simulation results in ADVISOR verify the feasibility of the proposed genetic optimization algorithm.

  20. Hybrid discrete particle swarm optimization algorithm for capacitated vehicle routing problem

    Institute of Scientific and Technical Information of China (English)

    2006-01-01

    Capacitated vehicle routing problem (CVRP) is an NP-hard problem. For large-scale problems, it is quite difficult to achieve an optimal solution with traditional optimization methods due to the high computational complexity. A new hybrid approximation algorithm is developed in this work to solve the problem. In the hybrid algorithm, discrete particle swarm optimization (DPSO) combines global search and local search to search for the optimal results and simulated annealing (SA) uses certain probability to avoid being trapped in a local optimum. The computational study showed that the proposed algorithm is a feasible and effective approach for capacitated vehicle routing problem, especially for large scale problems.

  1. A Simple Sizing Algorithm for Stand-Alone PV/Wind/Battery Hybrid Microgrids

    Directory of Open Access Journals (Sweden)

    Jing Li

    2012-12-01

    Full Text Available In this paper, we develop a simple algorithm to determine the required number of generating units of wind-turbine generator and photovoltaic array, and the associated storage capacity for stand-alone hybrid microgrid. The algorithm is based on the observation that the state of charge of battery should be periodically invariant. The optimal sizing of hybrid microgrid is given in the sense that the life cycle cost of system is minimized while the given load power demand can be satisfied without load rejection. We also report a case study to show the efficacy of the developed algorithm.

  2. A hybrid quantum encoding algorithm of vector quantization for image compression

    Institute of Scientific and Technical Information of China (English)

    Pang Chao-Yang; Zhou Zheng-Wei; Guo Guang-Can

    2006-01-01

    Many classical encoding algorithms of vector quantization (VQ) of image compression that can obtain global optimal solution have computational complexity O(N). A pure quantum VQ encoding algorithm with probability of success near 100% has been proposed, that performs operations 45√N times approximately. In this paper, a hybrid quantum VQ encoding algorithm between the classical method and the quantum algorithm is presented. The number of its operations is less than √N for most images, and it is more efficient than the pure quantum algorithm.

  3. A hybrid genetic algorithm based on mutative scale chaos optimization strategy

    Institute of Scientific and Technical Information of China (English)

    2002-01-01

    In order to avoid such problems as low convergent speed and local optimal solution in simple genetic algorithms, a new hybrid genetic algorithm is proposed. In this algorithm, a mutative scale chaos optimization strategy is operated on the population after a genetic operation. And according to the searching process, the searching space of the optimal variables is gradually diminished and the regulating coefficient of the secondary searching process is gradually changed which will lead to the quick evolution of the population. The algorithm has such advantages as fast search, precise results and convenient using etc. The simulation results show that the performance of the method is better than that of simple genetic algorithms.

  4. Comparison Of Hybrid Sorting Algorithms Implemented On Different Parallel Hardware Platforms

    Directory of Open Access Journals (Sweden)

    Dominik Zurek

    2013-01-01

    Full Text Available Sorting is a common problem in computer science. There are lot of well-known sorting algorithms created for sequential execution on a single processor. Recently, hardware platforms enable to create wide parallel algorithms. We have standard processors consist of multiple cores and hardware accelerators like GPU. The graphic cards with their parallel architecture give new possibility to speed up many algorithms. In this paper we describe results of implementation of a few different sorting algorithms on GPU cards and multicore processors. Then hybrid algorithm will be presented which consists of parts executed on both platforms, standard CPU and GPU.

  5. Intelligent Sensor Positioning and Orientation Through Constructive Neural Network-Embedded INS/GPS Integration Algorithms

    Directory of Open Access Journals (Sweden)

    Kai-Wei Chiang

    2010-10-01

    Full Text Available Mobile mapping systems have been widely applied for acquiring spatial information in applications such as spatial information systems and 3D city models. Nowadays the most common technologies used for positioning and orientation of a mobile mapping system include a Global Positioning System (GPS as the major positioning sensor and an Inertial Navigation System (INS as the major orientation sensor. In the classical approach, the limitations of the Kalman Filter (KF method and the overall price of multi-sensor systems have limited the popularization of most land-based mobile mapping applications. Although intelligent sensor positioning and orientation schemes consisting of Multi-layer Feed-forward Neural Networks (MFNNs, one of the most famous Artificial Neural Networks (ANNs, and KF/smoothers, have been proposed in order to enhance the performance of low cost Micro Electro Mechanical System (MEMS INS/GPS integrated systems, the automation of the MFNN applied has not proven as easy as initially expected. Therefore, this study not only addresses the problems of insufficient automation in the conventional methodology that has been applied in MFNN-KF/smoother algorithms for INS/GPS integrated systems proposed in previous studies, but also exploits and analyzes the idea of developing alternative intelligent sensor positioning and orientation schemes that integrate various sensors in more automatic ways. The proposed schemes are implemented using one of the most famous constructive neural networks––the Cascade Correlation Neural Network (CCNNs––to overcome the limitations of conventional techniques based on KF/smoother algorithms as well as previously developed MFNN-smoother schemes. The CCNNs applied also have the advantage of a more flexible topology compared to MFNNs. Based on the experimental data utilized the preliminary results presented in this article illustrate the effectiveness of the proposed schemes compared to smoother algorithms

  6. An effective hybrid cuckoo search and genetic algorithm for constrained engineering design optimization

    Science.gov (United States)

    Kanagaraj, G.; Ponnambalam, S. G.; Jawahar, N.; Mukund Nilakantan, J.

    2014-10-01

    This article presents an effective hybrid cuckoo search and genetic algorithm (HCSGA) for solving engineering design optimization problems involving problem-specific constraints and mixed variables such as integer, discrete and continuous variables. The proposed algorithm, HCSGA, is first applied to 13 standard benchmark constrained optimization functions and subsequently used to solve three well-known design problems reported in the literature. The numerical results obtained by HCSGA show competitive performance with respect to recent algorithms for constrained design optimization problems.

  7. Modeling level change in Lake Urmia using hybrid artificial intelligence approaches

    Science.gov (United States)

    Esbati, M.; Ahmadieh Khanesar, M.; Shahzadi, Ali

    2017-06-01

    The investigation of water level fluctuations in lakes for protecting them regarding the importance of these water complexes in national and regional scales has found a special place among countries in recent years. The importance of the prediction of water level balance in Lake Urmia is necessary due to several-meter fluctuations in the last decade which help the prevention from possible future losses. For this purpose, in this paper, the performance of adaptive neuro-fuzzy inference system (ANFIS) for predicting the lake water level balance has been studied. In addition, for the training of the adaptive neuro-fuzzy inference system, particle swarm optimization (PSO) and hybrid backpropagation-recursive least square method algorithm have been used. Moreover, a hybrid method based on particle swarm optimization and recursive least square (PSO-RLS) training algorithm for the training of ANFIS structure is introduced. In order to have a more fare comparison, hybrid particle swarm optimization and gradient descent are also applied. The models have been trained, tested, and validated based on lake level data between 1991 and 2014. For performance evaluation, a comparison is made between these methods. Numerical results obtained show that the proposed methods with a reasonable error have a good performance in water level balance prediction. It is also clear that with continuing the current trend, Lake Urmia will experience more drop in the water level balance in the upcoming years.

  8. A Hybrid Artificial Neural Network-based Scheduling Knowledge Acquisition Algorithm

    Institute of Scientific and Technical Information of China (English)

    WANG Weida; WANG Wei; LIU Wenjian

    2006-01-01

    It is a key issue that constructing successful knowledge base to satisfy an efficient adaptive scheduling for the complex manufacturing system. Therefore, a hybrid artificial neural network (ANN)-based scheduling knowledge acquisition algorithm is presented in this paper. We combined genetic algorithm (GA) with simulated annealing (SA) to develop a hybrid optimization method, in which GA was introduced to present parallel search architecture and SA was introduced to increase escaping probability from local optima and ability to neighbor search. The hybrid method was utilized to resolve the optimal attributes subset of manufacturing system and determine the optimal topology and parameters of ANN under different scheduling objectives; ANN was used to evaluate the fitness of chromosome in the method and generate the scheduling knowledge after obtaining the optimal attributes subset, optimal ANN's topology and parameters. The experimental results demonstrate that the proposed algorithm produces significant performance improvements over other machine learning-based algorithms.

  9. Optimization of Electric Power Leveling Systems by a Novel Hybrid Algorithm with Simulated Evolution and Genetic Algorithms

    Science.gov (United States)

    Itoh, Jyunpei; Yamamoto, Masayoshi; Funabiki, Shigeyuki

    Electric power demand has an increasing tendency year by year. The fluctuation of the electric power causes further increase in the cost of the electric power facility and electricity charges. The development of the electric power-leveling systems (EPLS) using energy storage technology is desired to improve the electric power quality. The EPLS with a SMES is proposed as one of the countermeasures for the electric power quality improvement. However, the SMES is very expensive and it is difficult to decide the gains of the controller. It is essential in the practical use that the reduction of SMES capacity is realized. This paper proposes a new optimization method of the EPLS. The proposed algorithm is hybrid architecture with a combination of SimE (Simulated Evolution) and GA (Genetic Algorithms). The optimization of the EPLS can be achieved by the proposed hybrid algorithm compared to the SimE and the GA.

  10. Detection of Defective Sensors in Phased Array Using Compressed Sensing and Hybrid Genetic Algorithm

    Directory of Open Access Journals (Sweden)

    Shafqat Ullah Khan

    2016-01-01

    Full Text Available A compressed sensing based array diagnosis technique has been presented. This technique starts from collecting the measurements of the far-field pattern. The system linking the difference between the field measured using the healthy reference array and the field radiated by the array under test is solved using a genetic algorithm (GA, parallel coordinate descent (PCD algorithm, and then a hybridized GA with PCD algorithm. These algorithms are applied for fully and partially defective antenna arrays. The simulation results indicate that the proposed hybrid algorithm outperforms in terms of localization of element failure with a small number of measurements. In the proposed algorithm, the slow and early convergence of GA has been avoided by combining it with PCD algorithm. It has been shown that the hybrid GA-PCD algorithm provides an accurate diagnosis of fully and partially defective sensors as compared to GA or PCD alone. Different simulations have been provided to validate the performance of the designed algorithms in diversified scenarios.

  11. A Hybrid Routing Algorithm Based on Ant Colony and ZHLS Routing Protocol for MANET

    Science.gov (United States)

    Rafsanjani, Marjan Kuchaki; Asadinia, Sanaz; Pakzad, Farzaneh

    Mobile Ad hoc networks (MANETs) require dynamic routing schemes for adequate performance. This paper, presents a new routing algorithm for MANETs, which combines the idea of ant colony optimization with Zone-based Hierarchical Link State (ZHLS) protocol. Ant colony optimization (ACO) is a class of Swarm Intelligence (SI) algorithms. SI is the local interaction of many simple agents to achieve a global goal. SI is based on social insect for solving different types of problems. ACO algorithm uses mobile agents called ants to explore network. Ants help to find paths between two nodes in the network. Our algorithm is based on ants jump from one zone to the next zones which contains of the proactive routing within a zone and reactive routing between the zones. Our proposed algorithm improves the performance of the network such as delay, packet delivery ratio and overhead than traditional routing algorithms.

  12. Systematic Design of High-performance Hybrid Feedback Algorithms

    Science.gov (United States)

    2015-06-24

    C8. A. Subbaraman and A.R. Teel, “A Krasovskii- LaSalle function based recurrence principle for a class of stochastic hybrid systems”, Proceedings...variety of results on this topic. Our results on stochastic discrete-time (difference) inclusions include an invariance principle [J1], converse...public release. 12 and an ensuing invariance /recurrence principle [C10], [C8]. We considered hybrid systems with both stochastic flows and stochastic

  13. A hybrid ACO algorithm for the full truckload transportation problem

    OpenAIRE

    Doerner, Karl; Hartl, Richard F.; Reimann, Marc

    2001-01-01

    In this paper we propose a hybrid ACO approach to solve a full truckload transportation problem. Hybridization is achieved through the use of a problem specific heuristic. This heuristic is utilized both, to initialize the pheromone information and to construct solutions in the ACO pro-cedure. The main idea is to use information about the required fleetsize, by initializing the system with a number of vehicles rather than opening vehicles one at a time as needed. Our results show the advantag...

  14. Intelligent Soft Computing on Forex: Exchange Rates Forecasting with Hybrid Radial Basis Neural Network

    Directory of Open Access Journals (Sweden)

    Lukas Falat

    2016-01-01

    Full Text Available This paper deals with application of quantitative soft computing prediction models into financial area as reliable and accurate prediction models can be very helpful in management decision-making process. The authors suggest a new hybrid neural network which is a combination of the standard RBF neural network, a genetic algorithm, and a moving average. The moving average is supposed to enhance the outputs of the network using the error part of the original neural network. Authors test the suggested model on high-frequency time series data of USD/CAD and examine the ability to forecast exchange rate values for the horizon of one day. To determine the forecasting efficiency, they perform a comparative statistical out-of-sample analysis of the tested model with autoregressive models and the standard neural network. They also incorporate genetic algorithm as an optimizing technique for adapting parameters of ANN which is then compared with standard backpropagation and backpropagation combined with K-means clustering algorithm. Finally, the authors find out that their suggested hybrid neural network is able to produce more accurate forecasts than the standard models and can be helpful in eliminating the risk of making the bad decision in decision-making process.

  15. Intelligent Soft Computing on Forex: Exchange Rates Forecasting with Hybrid Radial Basis Neural Network.

    Science.gov (United States)

    Falat, Lukas; Marcek, Dusan; Durisova, Maria

    2016-01-01

    This paper deals with application of quantitative soft computing prediction models into financial area as reliable and accurate prediction models can be very helpful in management decision-making process. The authors suggest a new hybrid neural network which is a combination of the standard RBF neural network, a genetic algorithm, and a moving average. The moving average is supposed to enhance the outputs of the network using the error part of the original neural network. Authors test the suggested model on high-frequency time series data of USD/CAD and examine the ability to forecast exchange rate values for the horizon of one day. To determine the forecasting efficiency, they perform a comparative statistical out-of-sample analysis of the tested model with autoregressive models and the standard neural network. They also incorporate genetic algorithm as an optimizing technique for adapting parameters of ANN which is then compared with standard backpropagation and backpropagation combined with K-means clustering algorithm. Finally, the authors find out that their suggested hybrid neural network is able to produce more accurate forecasts than the standard models and can be helpful in eliminating the risk of making the bad decision in decision-making process.

  16. Optimal planning of electric vehicle charging station at the distribution system using hybrid optimization algorithm

    DEFF Research Database (Denmark)

    Awasthi, Abhishek; Venkitusamy, Karthikeyan; Padmanaban, Sanjeevikumar

    2017-01-01

    , a hybrid algorithm based on genetic algorithm and improved version of conventional particle swarm optimization is utilized for finding optimal placement of charging station in the Allahabad distribution system. The particle swarm optimization algorithm re-optimizes the received sub-optimal solution (site...... and the size of the station) which leads to an improvement in the algorithm functionality and enhances quality of solution. The genetic algorithm and improved version of conventional particle swarm optimization algorithm will also be compared with a conventional genetic algorithm and particle swarm...... optimization. Through simulation studies on a real time system of Allahabad city, the superior performance of the aforementioned technique with respect to genetic algorithm and particle swarm optimization in terms of improvement in voltage profile and quality....

  17. A New Hybrid Algorithm to Solve Winner Determination Problem in Multiunit Double Internet Auction

    Directory of Open Access Journals (Sweden)

    Mourad Ykhlef

    2015-01-01

    Full Text Available Solving winner determination problem in multiunit double auction has become an important E-business task. The main issue in double auction is to improve the reward in order to match the ideal prices and quantity and make the best profit for sellers and buyers according to their bids and predefined quantities. There are many algorithms introduced for solving winner in multiunit double auction. Conventional algorithms can find the optimal solution but they take a long time, particularly when they are applied to large dataset. Nowadays, some evolutionary algorithms, such as particle swarm optimization and genetic algorithm, were proposed and have been applied. In order to improve the speed of evolutionary algorithms convergence, we will propose a new kind of hybrid evolutionary algorithm that combines genetic algorithm (GA with particle swarm optimization (PSO to solve winner determination problem in multiunit double auction; we will refer to this algorithm as AUC-GAPSO.

  18. Design and economic investigation of shell and tube heat exchangers using Improved Intelligent Tuned Harmony Search algorithm

    Directory of Open Access Journals (Sweden)

    Oguz Emrah Turgut

    2014-12-01

    Full Text Available This study explores the thermal design of shell and tube heat exchangers by using Improved Intelligent Tuned Harmony Search (I-ITHS algorithm. Intelligent Tuned Harmony Search (ITHS is an upgraded version of harmony search algorithm which has an advantage of deciding intensification and diversification processes by applying proper pitch adjusting strategy. In this study, we aim to improve the search capacity of ITHS algorithm by utilizing chaotic sequences instead of uniformly distributed random numbers and applying alternative search strategies inspired by Artificial Bee Colony algorithm and Opposition Based Learning on promising areas (best solutions. Design variables including baffle spacing, shell diameter, tube outer diameter and number of tube passes are used to minimize total cost of heat exchanger that incorporates capital investment and the sum of discounted annual energy expenditures related to pumping and heat exchanger area. Results show that I-ITHS can be utilized in optimizing shell and tube heat exchangers.

  19. An Adaptive Hybrid Multi-level Intelligent Intrusion Detection System for Network Security

    Directory of Open Access Journals (Sweden)

    P. Ananthi

    2014-04-01

    Full Text Available Intrusion Detection System (IDS plays a vital factor in providing security to the networks through detecting malicious activities. Due to the extensive advancements in the computer networking, IDS has become an active area of research to determine various types of attacks in the networks. A large number of intrusion detection approaches are available in the literature using several traditional statistical and data mining approaches. Data mining techniques in IDS observed to provide significant results. Data mining approaches for misuse and anomaly-based intrusion detection generally include supervised, unsupervised and outlier approaches. It is important that the efficiency and potential of IDS be updated based on the criteria of new attacks. This study proposes a novel Adaptive Hybrid Multi-level Intelligent IDS (AHMIIDS system which is the combined version of anomaly and misuse detection techniques. The anomaly detection is based on Bayesian Networks and then the misuse detection is performed using Adaptive Neuro Fuzzy Inference System (ANFIS. The outputs of both anomaly detection and misuse detection modules are applied to Decision Table Majority (DTM to perform the final decision making. A rule-base approach is used in this system. It is observed from the results that the proposed AHMIIDS performs better than other conventional hybrid IDS.

  20. Game Algorithm for Resource Allocation Based on Intelligent Gradient in HetNet

    Directory of Open Access Journals (Sweden)

    Fang Ye

    2017-02-01

    Full Text Available In order to improve system performance such as throughput, heterogeneous network (HetNet has become an effective solution in Long Term Evolution-Advanced (LET-A. However, co-channel interference leads to degradation of the HetNet throughput, because femtocells are always arranged to share the spectrum with the macro base station. In this paper, in view of the serious cross-layer interference in double layer HetNet, the Stackelberg game model is adopted to analyze the resource allocation methods of the network. Unlike the traditional system models only focusing on macro base station performance improvement, we take into account the overall system performance and build a revenue function with convexity. System utility functions are defined as the average throughput, which does not adopt frequency spectrum trading method, so as to avoid excessive signaling overhead. Due to the value scope of continuous Nash equilibrium of the built game model, the gradient iterative algorithm is introduced to reduce the computational complexity. As for the solution of Nash equilibrium, one kind of gradient iterative algorithm is proposed, which is able to intelligently choose adjustment factors. The Nash equilibrium can be quickly solved; meanwhile, the step of presetting adjustment factors is avoided according to network parameters in traditional linear iterative model. Simulation results show that the proposed algorithm enhances the overall performance of the system.

  1. A BENCHMARK TO SELECT DATA MINING BASED CLASSIFICATION ALGORITHMS FOR BUSINESS INTELLIGENCE AND DECISION SUPPORT SYSTEMS

    Directory of Open Access Journals (Sweden)

    Pardeep Kumar

    2012-09-01

    Full Text Available In today’s business scenario, we percept major changes in how managers use computerized support inmaking decisions. As more number of decision-makers use computerized support in decision making,decision support systems (DSS is developing from its starting as a personal support tool and is becomingthe common resource in an organization. DSS serve the management, operations, and planning levels of anorganization and help to make decisions, which may be rapidly changing and not easily specified inadvance. Data mining has a vital role to extract important information to help in decision making of adecision support system. It has been the active field of research in the last two-three decades. Integration ofdata mining and decision support systems (DSS can lead to the improved performance and can enable thetackling of new types of problems. Artificial Intelligence methods are improving the quality of decisionsupport, and have become embedded in many applications ranges from ant locking automobile brakes tothese days interactive search engines. It provides various machine learning techniques to support datamining. The classification is one of the main and valuable tasks of data mining. Several types ofclassification algorithms have been suggested, tested and compared to determine the future trends based onunseen data. There has been no single algorithm found to be superior over all others for all data sets.Various issues such as predictive accuracy, training time to build the model, robustness and scalabilitymust be considered and can have tradeoffs, further complex the quest for an overall superior method. Theobjective of this paper is to compare various classification algorithms that have been frequently used indata mining for decision support systems. Three decision trees based algorithms, one artificial neuralnetwork, one statistical, one support vector machines with and without adaboost and one clusteringalgorithm are tested and compared on

  2. A hybrid algorithm for Caputo fractional differential equations

    Science.gov (United States)

    Salgado, G. H. O.; Aguirre, L. A.

    2016-04-01

    This paper is concerned with the numerical solution of fractional initial value problems (FIVP) in sense of Caputo's definition for dynamical systems. Unlike for integer-order derivatives that have a single definition, there is more than one definition of non integer-order derivatives and the solution of an FIVP is definition-dependent. In this paper, the chief differences of the main definitions of fractional derivatives are revisited and a numerical algorithm to solve an FIVP for Caputo derivative is proposed. The main advantages of the algorithm are twofold: it can be initialized with integer-order derivatives, and it is faster than the corresponding standard algorithm. The performance of the proposed algorithm is illustrated with examples which suggest that it requires about half the computation time to achieve the same accuracy than the standard algorithm.

  3. SAR Image Segmentation Based On Hybrid PSOGSA Optimization Algorithm

    Directory of Open Access Journals (Sweden)

    Amandeep Kaur

    2014-09-01

    Full Text Available Image segmentation is useful in many applications. It can identify the regions of interest in a scene or annotate the data. It categorizes the existing segmentation algorithm into region-based segmentation, data clustering, and edge-base segmentation. Region-based segmentation includes the seeded and unseeded region growing algorithms, the JSEG, and the fast scanning algorithm. Due to the presence of speckle noise, segmentation of Synthetic Aperture Radar (SAR images is still a challenging problem. We proposed a fast SAR image segmentation method based on Particle Swarm Optimization-Gravitational Search Algorithm (PSO-GSA. In this method, threshold estimation is regarded as a search procedure that examinations for an appropriate value in a continuous grayscale interval. Hence, PSO-GSA algorithm is familiarized to search for the optimal threshold. Experimental results indicate that our method is superior to GA based, AFS based and ABC based methods in terms of segmentation accuracy, segmentation time, and Thresholding.

  4. The Verification of Hybrid Image Deformation algorithm for PIV

    Directory of Open Access Journals (Sweden)

    Novotný Jan

    2016-06-01

    Full Text Available The aim of this paper was to test a newly designed algorithm for more accurate calculation of the image displacement of seeding particles when taking measurement using the Particle Image Velocimetry method. The proposed algorithm is based on modification of a classical iterative approach using a three-point subpixel interpolation and method using relative deformation of individual areas for accurate detection of signal peak position. The first part briefly describes the tested algorithm together with the results of the performed synthetic tests. The other part describes the measurement setup and the overall layout of the experiment. Subsequently, a comparison of results of the classical iterative scheme and our designed algorithm is carried out. The conclusion discusses the benefits of the tested algorithm, its advantages and disadvantages.

  5. A hybrid evolutionary algorithm for distribution feeder reconfiguration

    Institute of Scientific and Technical Information of China (English)

    Taher; NIKNAM; Ehsan; AZAD; FARSANI

    2010-01-01

    This paper presents a new method to reduce the distribution system loss by feeder reconfiguration.This new method combines self-adaptive particle swarm optimization(SAPSO) with shuffled frog-leaping algorithm(SFLA) in an attempt to find the global optimal solutions for the distribution feeder reconfiguration(DFR).In PSO algorithm,appropriate adjustment of the parameters is cumbersome and usually requires a lot of time and effort.Thus,a self-adaptive framework is proposed to improve the robustness of PSO.In SAPSO the learning factors of PSO coevolve with the particles.SFLA is combined with the SAPSO algorithm to improve its performance.The proposed algorithm is tested on two distribution test networks.The results of simulation show that the proposed algorithm is very powerful and guarantees to obtain the global optimization in minimum time.

  6. Intelligent Scheduling Controller Design for Networked Control Systems Based on Estimation of Distribution Algorithm

    Institute of Scientific and Technical Information of China (English)

    LI Hongbo; SUN Zengqi; CHEN Badong; LIU Huaping

    2008-01-01

    The use of communication networks in control loops has gained increasing attention in recent years due to its advantages and flexible applications. The network quality-of-service (QoS) in those so-called networked control systems always fluctuates due to changes of the traffic load and available network resources. This paper presents an intelligent scheduling controller design approach for a class of NCSs to handle network QoS variations. The sampling period and control parameters in the controller are simultane-ously scheduled to compensate for the network QoS variations. The estimation of distribution algorithm is used to optimize the sampling period and control parameters for better performance. Compared with exist-ing networked control methods, the controller has better ability to compensate for the network QoS varia-tions and to balance network loads. Simulation results show that the plant setting time with the intelligent scheduling controller is reduced by about 64.0% for the medium network load and 49.1% for high network load and demonstrate the effectiveness of the proposed approaches.

  7. Design of Passive Analog Electronic Circuits Using Hybrid Modified UMDA algorithm

    Directory of Open Access Journals (Sweden)

    J. Slezak

    2015-04-01

    Full Text Available Hybrid evolutionary passive analog circuits synthesis method based on modified Univariate Marginal Distribution Algorithm (UMDA and a local search algorithm is proposed in the paper. The modification of the UMDA algorithm which allows to specify the maximum number of the nodes and the maximum number of the components of the synthesized circuit is proposed. The proposed hybrid approach efficiently reduces the number of the objective function evaluations. The modified UMDA algorithm is used for synthesis of the topology and the local search algorithm is used for determination of the parameters of the components of the designed circuit. As an example the proposed method is applied to a problem of synthesis of the fractional capacitor circuit.

  8. Identification of vibration loads on hydro generator by using hybrid genetic algorithm

    Institute of Scientific and Technical Information of China (English)

    Shouju Li; Yingxi Liu

    2006-01-01

    Vibration dynamic characteristics have been a major issue in the modeling and mechanical analysis of large hydro generators.An algorithm is developed for identifying vibration dynamic characteristics by means of hybrid genetic algorithm.From the measured dynamic responses of a hydro generator,an appropriate estimation algorithm is needed to identify the loading parameters,including the main frequencies and amplitudes of vibrating forces.In order to identify parameters in an efficient and robust manner,an optimization method is proposed that combines genetic algorithm with simulated annealing and elitist strategy.The hybrid genetic algorithm is then used to tackle an ill-posed problem of parameter identification.In which the effectiveness of the proposed optimization method is confirmed by its comparison with actual observation data.

  9. A Fast Hybrid Algorithm of Global Optimization for Feedforward Neural Networks

    Institute of Scientific and Technical Information of China (English)

    JIANG Minghu; ZHANG Bo; ZHU Xiaoyan; JINAG Mingyan

    2001-01-01

    This paper presents the hybrid algorithm of global optimization of dynamic learning rate for multilayer feedforward neural networks (MLFNN).The effect of inexact line search on conjugacy was studied, based on which a generalized conjugate gradient method was proposed, showing global convergence for error backpagation of MLFNN. It overcomes the drawback of conventional BP and Polak-Ribieve conjugate gradient algorithms that maybe plunge into local minima. The hybrid algorithm's recognition rate is higher than that of Polak-Ribieve algorithm and convergence BP for test data, its training time is less than that of Fletcher-Reeves algorithm and far less than that of convergence BP, and it has a less complicated and stronger robustness to real speech data.

  10. Gravity Search Algorithm hybridized Recursive Least Square method for power system harmonic estimation

    Directory of Open Access Journals (Sweden)

    Santosh Kumar Singh

    2017-06-01

    Full Text Available This paper presents a new hybrid method based on Gravity Search Algorithm (GSA and Recursive Least Square (RLS, known as GSA-RLS, to solve the harmonic estimation problems in the case of time varying power signals in presence of different noises. GSA is based on the Newton’s law of gravity and mass interactions. In the proposed method, the searcher agents are a collection of masses that interact with each other using Newton’s laws of gravity and motion. The basic GSA algorithm strategy is combined with RLS algorithm sequentially in an adaptive way to update the unknown parameters (weights of the harmonic signal. Simulation and practical validation are made with the experimentation of the proposed algorithm with real time data obtained from a heavy paper industry. A comparative performance of the proposed algorithm is evaluated with other recently reported algorithms like, Differential Evolution (DE, Particle Swarm Optimization (PSO, Bacteria Foraging Optimization (BFO, Fuzzy-BFO (F-BFO hybridized with Least Square (LS and BFO hybridized with RLS algorithm, which reveals that the proposed GSA-RLS algorithm is the best in terms of accuracy, convergence and computational time.

  11. HYBRID CHRIPTOGRAPHY STREAM CIPHER AND RSA ALGORITHM WITH DIGITAL SIGNATURE AS A KEY

    Directory of Open Access Journals (Sweden)

    Grace Lamudur Arta Sihombing

    2017-03-01

    Full Text Available Confidentiality of data is very important in communication. Many cyber crimes that exploit security holes for entry and manipulation. To ensure the security and confidentiality of the data, required a certain technique to encrypt data or information called cryptography. It is one of the components that can not be ignored in building security. And this research aimed to analyze the hybrid cryptography with symmetric key by using a stream cipher algorithm and asymmetric key by using RSA (Rivest Shamir Adleman algorithm. The advantages of hybrid cryptography is the speed in processing data using a symmetric algorithm and easy transfer of key using asymmetric algorithm. This can increase the speed of transaction processing data. Stream Cipher Algorithm using the image digital signature as a keys, that will be secured by the RSA algorithm. So, the key for encryption and decryption are different. Blum Blum Shub methods used to generate keys for the value p, q on the RSA algorithm. It will be very difficult for a cryptanalyst to break the key. Analysis of hybrid cryptography stream cipher and RSA algorithms with digital signatures as a key, indicates that the size of the encrypted file is equal to the size of the plaintext, not to be larger or smaller so that the time required for encryption and decryption process is relatively fast.

  12. Assistance of Novel Artificial Intelligence in Optimization of Aluminum Matrix Nanocomposite by Genetic Algorithm

    Science.gov (United States)

    Mazahery, Ali; Shabani, Mohsen Ostad

    2012-12-01

    In this article, a genetic algorithm (GA) is used to predict the mechanical properties and to optimize the process conditions of Al nanocomposites. An artificial intelligence method is also implemented as an assisting tool for engineering tasks of GAs. The principle of the survival of the fittest is applied to produce successively superior approximations to a solution. A population of points at each iteration is generated. The population approaches an optimal solution. The next population by computations that involve random choices is selected. The optimal volume percentage of SiC, cooling rate, and temperature gradient are computed to be 2.84 pct, 283 K/s (10 °C/s), 1273 K/m (1000 °C/m), respectively.

  13. Intelligibility of time-compressed speech: the effect of uniform versus non-uniform time-compression algorithms.

    Science.gov (United States)

    Schlueter, Anne; Lemke, Ulrike; Kollmeier, Birger; Holube, Inga

    2014-03-01

    For assessing hearing aid algorithms, a method is sought to shift the threshold of a speech-in-noise test to (mostly positive) signal-to-noise ratios (SNRs) that allow discrimination across algorithmic settings and are most relevant for hearing-impaired listeners in daily life. Hence, time-compressed speech with higher speech rates was evaluated to parametrically increase the difficulty of the test while preserving most of the relevant acoustical speech cues. A uniform and a non-uniform algorithm were used to compress the sentences of the German Oldenburg Sentence Test at different speech rates. In comparison, the non-uniform algorithm exhibited greater deviations from the targeted time compression, as well as greater changes of the phoneme duration, spectra, and modulation spectra. Speech intelligibility for fast Oldenburg sentences in background noise at different SNRs was determined with 48 normal-hearing listeners. The results confirmed decreasing intelligibility with increasing speech rate. Speech had to be compressed to more than 30% of its original length to reach 50% intelligibility at positive SNRs. Characteristics influencing the discrimination ability of the test for assessing effective SNR changes were investigated. Subjective and objective measures indicated a clear advantage of the uniform algorithm in comparison to the non-uniform algorithm for the application in speech-in-noise tests.

  14. Fuzzy Logic, Neural Networks, Genetic Algorithms: Views of Three Artificial Intelligence Concepts Used in Modeling Scientific Systems

    Science.gov (United States)

    Sunal, Cynthia Szymanski; Karr, Charles L.; Sunal, Dennis W.

    2003-01-01

    Students' conceptions of three major artificial intelligence concepts used in the modeling of systems in science, fuzzy logic, neural networks, and genetic algorithms were investigated before and after a higher education science course. Students initially explored their prior ideas related to the three concepts through active tasks. Then,…

  15. A Location-Aware Vertical Handoff Algorithm for Hybrid Networks

    KAUST Repository

    Mehbodniya, Abolfazl

    2010-07-01

    One of the main objectives of wireless networking is to provide mobile users with a robust connection to different networks so that they can move freely between heterogeneous networks while running their computing applications with no interruption. Horizontal handoff, or generally speaking handoff, is a process which maintains a mobile user\\'s active connection as it moves within a wireless network, whereas vertical handoff (VHO) refers to handover between different types of networks or different network layers. Optimizing VHO process is an important issue, required to reduce network signalling and mobile device power consumption as well as to improve network quality of service (QoS) and grade of service (GoS). In this paper, a VHO algorithm in multitier (overlay) networks is proposed. This algorithm uses pattern recognition to estimate user\\'s position, and decides on the handoff based on this information. For the pattern recognition algorithm structure, the probabilistic neural network (PNN) which has considerable simplicity and efficiency over existing pattern classifiers is used. Further optimization is proposed to improve the performance of the PNN algorithm. Performance analysis and comparisons with the existing VHO algorithm are provided and demonstrate a significant improvement with the proposed algorithm. Furthermore, incorporating the proposed algorithm, a structure is proposed for VHO from the medium access control (MAC) layer point of view. © 2010 ACADEMY PUBLISHER.

  16. Novel hybrid genetic algorithm for progressive multiple sequence alignment.

    Science.gov (United States)

    Afridi, Muhammad Ishaq

    2013-01-01

    The family of evolutionary or genetic algorithms is used in various fields of bioinformatics. Genetic algorithms (GAs) can be used for simultaneous comparison of a large pool of DNA or protein sequences. This article explains how the GA is used in combination with other methods like the progressive multiple sequence alignment strategy to get an optimal multiple sequence alignment (MSA). Optimal MSA get much importance in the field of bioinformatics and some other related disciplines. Evolutionary algorithms evolve and improve their performance. In this optimisation, the initial pair-wise alignment is achieved through a progressive method and then a good objective function is used to select and align more alignments and profiles. Child and subpopulation initialisation is based upon changes in the probability of similarity or the distance matrix of the alignment population. In this genetic algorithm, optimisation of mutation, crossover and migration in the population of candidate solution reflect events of natural organic evolution.

  17. A hybrid Genetic and Simulated Annealing Algorithm for Chordal Ring implementation in large-scale networks

    DEFF Research Database (Denmark)

    Riaz, M. Tahir; Gutierrez Lopez, Jose Manuel; Pedersen, Jens Myrup

    2011-01-01

    The paper presents a hybrid Genetic and Simulated Annealing algorithm for implementing Chordal Ring structure in optical backbone network. In recent years, topologies based on regular graph structures gained a lot of interest due to their good communication properties for physical topology...... of the networks. There have been many use of evolutionary algorithms to solve the problems which are in combinatory complexity nature, and extremely hard to solve by exact approaches. Both Genetic and Simulated annealing algorithms are similar in using controlled stochastic method to search the solution....... The paper combines the algorithms in order to analyze the impact of implementation performance....

  18. Hybrid fuzzy charged system search algorithm based state estimation in distribution networks

    Directory of Open Access Journals (Sweden)

    Sachidananda Prasad

    2017-06-01

    Full Text Available This paper proposes a new hybrid charged system search (CSS algorithm based state estimation in radial distribution networks in fuzzy framework. The objective of the optimization problem is to minimize the weighted square of the difference between the measured and the estimated quantity. The proposed method of state estimation considers bus voltage magnitude and phase angle as state variable along with some equality and inequality constraints for state estimation in distribution networks. A rule based fuzzy inference system has been designed to control the parameters of the CSS algorithm to achieve better balance between the exploration and exploitation capability of the algorithm. The efficiency of the proposed fuzzy adaptive charged system search (FACSS algorithm has been tested on standard IEEE 33-bus system and Indian 85-bus practical radial distribution system. The obtained results have been compared with the conventional CSS algorithm, weighted least square (WLS algorithm and particle swarm optimization (PSO for feasibility of the algorithm.

  19. A Hybrid Continuous Max-Sum Algorithm for Decentralised Coordination

    OpenAIRE

    Voice, Thomas; Stranders, Ruben; Rogers, Alex; Jennings, Nick

    2010-01-01

    Recent advances in decentralised coordination of multiple agents have led to the proposal of the max-sum algorithm for solving distributed constraint optimisation problems (DCOPs). The max-sum algorithm is fully decentralised, converges to optimality for problems with acyclic constraint graphs and otherwise performs well in empirical studies. However, it requires agents to have discrete state spaces, which are of practical size to conduct repeated searches over. In contrast, there are decentr...

  20. A Hybrid Neural Network-Genetic Algorithm Technique for Aircraft Engine Performance Diagnostics

    Science.gov (United States)

    Kobayashi, Takahisa; Simon, Donald L.

    2001-01-01

    In this paper, a model-based diagnostic method, which utilizes Neural Networks and Genetic Algorithms, is investigated. Neural networks are applied to estimate the engine internal health, and Genetic Algorithms are applied for sensor bias detection and estimation. This hybrid approach takes advantage of the nonlinear estimation capability provided by neural networks while improving the robustness to measurement uncertainty through the application of Genetic Algorithms. The hybrid diagnostic technique also has the ability to rank multiple potential solutions for a given set of anomalous sensor measurements in order to reduce false alarms and missed detections. The performance of the hybrid diagnostic technique is evaluated through some case studies derived from a turbofan engine simulation. The results show this approach is promising for reliable diagnostics of aircraft engines.

  1. Constrained Optimization Based on Hybrid Evolutionary Algorithm and Adaptive Constraint-Handling Technique

    DEFF Research Database (Denmark)

    Wang, Yong; Cai, Zixing; Zhou, Yuren

    2009-01-01

    A novel approach to deal with numerical and engineering constrained optimization problems, which incorporates a hybrid evolutionary algorithm and an adaptive constraint-handling technique, is presented in this paper. The hybrid evolutionary algorithm simultaneously uses simplex crossover and two...... mutation operators to generate the offspring population. Additionally, the adaptive constraint-handling technique consists of three main situations. In detail, at each situation, one constraint-handling mechanism is designed based on current population state. Experiments on 13 benchmark test functions...... and four well-known constrained design problems verify the effectiveness and efficiency of the proposed method. The experimental results show that integrating the hybrid evolutionary algorithm with the adaptive constraint-handling technique is beneficial, and the proposed method achieves competitive...

  2. Hybrid and dependent task scheduling algorithm for on-board system software

    Institute of Scientific and Technical Information of China (English)

    魏振华; 洪炳熔; 乔永强; 蔡则苏; 彭俊杰

    2003-01-01

    In order to solve the hybrid and dependent task scheduling and critical source allocation problems, atask scheduling algorithm has been developed by first presenting the tasks, and then describing the hybrid anddependent scheduling algorithm and deriving the predictable schedulability condition. The performance of thisagorithm was evaluated through simulation, and it is concluded from the evaluation results that the hybrid taskscheduling subalgorithm based on the comparison factor can be used to solve the problem of aperiodic task beingblocked by periodic task in the traditional operating system for a very long time, which results in poor schedu-ling predictability; and the resource allocation subalgorithm based on schedulability analysis can be used tosolve the problems of critical section conflict, ceiling blocking and priority inversion; and the scheduling algo-rithm is nearest optimal when the abortable critical section is 0.6.

  3. DESIGN OF A NEW SECURITY PROTOCOL USING HYBRID CRYPTOGRAPHY ALGORITHMS

    Directory of Open Access Journals (Sweden)

    Dr.S.Subasree and Dr.N.K.Sakthivel

    2010-02-01

    Full Text Available A Computer Network is an interconnected group of autonomous computing nodes, which use a well defined, mutually agreed set of rules and conventions known as protocols, interact with one-another meaningfully and allow resource sharing preferably in a predictable and controllable manner. Communication has a major impact on today’s business. It is desired to communicate data with high security. Security Attacks compromises the security and hence various Symmetric and Asymmetric cryptographic algorithms have been proposed to achieve the security services such as Authentication, Confidentiality, Integrity, Non-Repudiation and Availability. At present, various types of cryptographic algorithms provide high security to information on controlled networks. These algorithms are required to provide data security and users authenticity. To improve the strength of these security algorithms, a new security protocol for on line transaction can be designed using combination of both symmetric and asymmetric cryptographic techniques. This protocol provides three cryptographic primitives such as integrity, confidentiality and authentication. These three primitives can be achieved with the help of Elliptic Curve Cryptography, Dual-RSA algorithm and Message Digest MD5. That is it uses Elliptic Curve Cryptography for encryption, Dual-RSA algorithm for authentication and MD-5 for integrity. This new security protocol has been designed for better security with integrity using a combination of both symmetric and asymmetric cryptographic techniques.

  4. BF-PSO-TS: Hybrid Heuristic Algorithms for Optimizing Task Schedulingon Cloud Computing Environment

    Directory of Open Access Journals (Sweden)

    Hussin M. Alkhashai

    2016-06-01

    Full Text Available Task Scheduling is a major problem in Cloud computing because the cloud provider has to serve many users. Also, a good scheduling algorithm helps in the proper and efficient utilization of the resources. So, task scheduling is considered as one of the major issues on the Cloud computing systems. The objective of this paper is to assign the tasks to multiple computing resources. Consequently, the total cost of execution is to be minimum and load to be shared between these computing resources. Therefore, two hybrid algorithms based on Particle Swarm Optimization (PSO have been introduced to schedule the tasks; Best-Fit-PSO (BFPSO and PSO-Tabu Search (PSOTS. According to BFPSO algorithm, Best-Fit (BF algorithm has been merged into the PSO algorithm to improve the performance. The main principle of the modified BFSOP algorithm is that BF algorithm is used to generate the initial population of the standard PSO algorithm instead of being initiated randomly. According to the proposed PSOTS algorithm, the Tabu-Search (TS has been used to improve the local research by avoiding the trap of the local optimality which could be occurred using the standard PSO algorithm. The two proposed algorithms (i.e., BFPSO and PSOTS have been implemented using Cloudsim and evaluated comparing to the standard PSO algorithm using five problems with different number of independent tasks and resources. The performance parameters have been considered are the execution time (Makspan, cost, and resources utilization. The implementation results prove that the proposed hybrid algorithms (i.e., BFPSO, PSOTS outperform the standard PSO algorithm.

  5. A Hybrid Model Based on Ensemble Empirical Mode Decomposition and Fruit Fly Optimization Algorithm for Wind Speed Forecasting

    Directory of Open Access Journals (Sweden)

    Zongxi Qu

    2016-01-01

    Full Text Available As a type of clean and renewable energy, the superiority of wind power has increasingly captured the world’s attention. Reliable and precise wind speed prediction is vital for wind power generation systems. Thus, a more effective and precise prediction model is essentially needed in the field of wind speed forecasting. Most previous forecasting models could adapt to various wind speed series data; however, these models ignored the importance of the data preprocessing and model parameter optimization. In view of its importance, a novel hybrid ensemble learning paradigm is proposed. In this model, the original wind speed data is firstly divided into a finite set of signal components by ensemble empirical mode decomposition, and then each signal is predicted by several artificial intelligence models with optimized parameters by using the fruit fly optimization algorithm and the final prediction values were obtained by reconstructing the refined series. To estimate the forecasting ability of the proposed model, 15 min wind speed data for wind farms in the coastal areas of China was performed to forecast as a case study. The empirical results show that the proposed hybrid model is superior to some existing traditional forecasting models regarding forecast performance.

  6. Wavelet neural networks initialization using hybridized clustering and harmony search algorithm: Application in epileptic seizure detection

    Science.gov (United States)

    Zainuddin, Zarita; Lai, Kee Huong; Ong, Pauline

    2013-04-01

    Artificial neural networks (ANNs) are powerful mathematical models that are used to solve complex real world problems. Wavelet neural networks (WNNs), which were developed based on the wavelet theory, are a variant of ANNs. During the training phase of WNNs, several parameters need to be initialized; including the type of wavelet activation functions, translation vectors, and dilation parameter. The conventional k-means and fuzzy c-means clustering algorithms have been used to select the translation vectors. However, the solution vectors might get trapped at local minima. In this regard, the evolutionary harmony search algorithm, which is capable of searching for near-optimum solution vectors, both locally and globally, is introduced to circumvent this problem. In this paper, the conventional k-means and fuzzy c-means clustering algorithms were hybridized with the metaheuristic harmony search algorithm. In addition to obtaining the estimation of the global minima accurately, these hybridized algorithms also offer more than one solution to a particular problem, since many possible solution vectors can be generated and stored in the harmony memory. To validate the robustness of the proposed WNNs, the real world problem of epileptic seizure detection was presented. The overall classification accuracy from the simulation showed that the hybridized metaheuristic algorithms outperformed the standard k-means and fuzzy c-means clustering algorithms.

  7. MIP models and hybrid algorithms for simultaneous job splitting and scheduling on unrelated parallel machines.

    Science.gov (United States)

    Eroglu, Duygu Yilmaz; Ozmutlu, H Cenk

    2014-01-01

    We developed mixed integer programming (MIP) models and hybrid genetic-local search algorithms for the scheduling problem of unrelated parallel machines with job sequence and machine-dependent setup times and with job splitting property. The first contribution of this paper is to introduce novel algorithms which make splitting and scheduling simultaneously with variable number of subjobs. We proposed simple chromosome structure which is constituted by random key numbers in hybrid genetic-local search algorithm (GAspLA). Random key numbers are used frequently in genetic algorithms, but it creates additional difficulty when hybrid factors in local search are implemented. We developed algorithms that satisfy the adaptation of results of local search into the genetic algorithms with minimum relocation operation of genes' random key numbers. This is the second contribution of the paper. The third contribution of this paper is three developed new MIP models which are making splitting and scheduling simultaneously. The fourth contribution of this paper is implementation of the GAspLAMIP. This implementation let us verify the optimality of GAspLA for the studied combinations. The proposed methods are tested on a set of problems taken from the literature and the results validate the effectiveness of the proposed algorithms.

  8. An immune-tabu hybrid algorithm for thermal unit commitment of electric power systems

    Institute of Scientific and Technical Information of China (English)

    Wei LI; Hao-yu PENG; Wei-hang ZHU; De-ren SHENG; Jian-hong CHEN

    2009-01-01

    This paper presents a new method based on an immune-tabu hybrid algorithm to solve the thermal unit commitment (TUC) problem in power plant optimization. The mathematical model of the TUC problem is established by analyzing the generating units in modern power plants. A novel immune-tabu hybrid algorithm is proposed to solve this complex problem. In the algorithm, the objective function of the TUC problem is considered as an antigen and the solutions are considered as antibodies,which are determined by the affinity computation. The code length of an antibody is shortened by encoding the continuous operating time, and the optimum searching speed is improved. Each feasible individual in the immune algorithm (IA) is used as the initial solution of the tabu search (TS) algorithm after certain generations of IA iteration. As examples, the proposed method has been applied to several thermal unit systems for a period of 24 h. The computation results demonstrate the good global optimum searching performance of the proposed immune-tabu hybrid algorithm. The presented algorithm can also be used to solve other optimization problems in fields such as the chemical industry and the power industry.

  9. International Conference on Computational Intelligence 2015

    CERN Document Server

    Saha, Sujan

    2017-01-01

    This volume comprises the proceedings of the International Conference on Computational Intelligence 2015 (ICCI15). This book aims to bring together work from leading academicians, scientists, researchers and research scholars from across the globe on all aspects of computational intelligence. The work is composed mainly of original and unpublished results of conceptual, constructive, empirical, experimental, or theoretical work in all areas of computational intelligence. Specifically, the major topics covered include classical computational intelligence models and artificial intelligence, neural networks and deep learning, evolutionary swarm and particle algorithms, hybrid systems optimization, constraint programming, human-machine interaction, computational intelligence for the web analytics, robotics, computational neurosciences, neurodynamics, bioinspired and biomorphic algorithms, cross disciplinary topics and applications. The contents of this volume will be of use to researchers and professionals alike....

  10. A Hybrid Constructive Algorithm for Single-Layer Feedforward Networks Learning.

    Science.gov (United States)

    Wu, Xing; Rózycki, Paweł; Wilamowski, Bogdan M

    2015-08-01

    Single-layer feedforward networks (SLFNs) have been proven to be a universal approximator when all the parameters are allowed to be adjustable. It is widely used in classification and regression problems. The SLFN learning involves two tasks: determining network size and training the parameters. Most current algorithms could not be satisfactory to both sides. Some algorithms focused on construction and only tuned part of the parameters, which may not be able to achieve a compact network. Other gradient-based optimization algorithms focused on parameters tuning while the network size has to be preset by the user. Therefore, trial-and-error approach has to be used to search the optimal network size. Because results of each trial cannot be reused in another trial, it costs much computation. In this paper, a hybrid constructive (HC)algorithm is proposed for SLFN learning, which can train all the parameters and determine the network size simultaneously. At first, by combining Levenberg-Marquardt algorithm and least-square method, a hybrid algorithm is presented for training SLFN with fixed network size. Then,with the hybrid algorithm, an incremental constructive scheme is proposed. A new randomly initialized neuron is added each time when the training entrapped into local minima. Because the training continued on previous results after adding new neurons, the proposed HC algorithm works efficiently. Several practical problems were given for comparison with other popular algorithms. The experimental results demonstrated that the HC algorithm worked more efficiently than those optimization methods with trial and error, and could achieve much more compact SLFN than those construction algorithms.

  11. A new hybrid genetic algorithm for optimizing the single and multivariate objective functions

    Energy Technology Data Exchange (ETDEWEB)

    Tumuluru, Jaya Shankar [Idaho National Laboratory; McCulloch, Richard Chet James [Idaho National Laboratory

    2015-07-01

    In this work a new hybrid genetic algorithm was developed which combines a rudimentary adaptive steepest ascent hill climbing algorithm with a sophisticated evolutionary algorithm in order to optimize complex multivariate design problems. By combining a highly stochastic algorithm (evolutionary) with a simple deterministic optimization algorithm (adaptive steepest ascent) computational resources are conserved and the solution converges rapidly when compared to either algorithm alone. In genetic algorithms natural selection is mimicked by random events such as breeding and mutation. In the adaptive steepest ascent algorithm each variable is perturbed by a small amount and the variable that caused the most improvement is incremented by a small step. If the direction of most benefit is exactly opposite of the previous direction with the most benefit then the step size is reduced by a factor of 2, thus the step size adapts to the terrain. A graphical user interface was created in MATLAB to provide an interface between the hybrid genetic algorithm and the user. Additional features such as bounding the solution space and weighting the objective functions individually are also built into the interface. The algorithm developed was tested to optimize the functions developed for a wood pelleting process. Using process variables (such as feedstock moisture content, die speed, and preheating temperature) pellet properties were appropriately optimized. Specifically, variables were found which maximized unit density, bulk density, tapped density, and durability while minimizing pellet moisture content and specific energy consumption. The time and computational resources required for the optimization were dramatically decreased using the hybrid genetic algorithm when compared to MATLAB's native evolutionary optimization tool.

  12. Strong Convergence of Hybrid Algorithm for Asymptotically Nonexpansive Mappings in Hilbert Spaces

    Directory of Open Access Journals (Sweden)

    Juguo Su

    2012-01-01

    Full Text Available The hybrid algorithms for constructing fixed points of nonlinear mappings have been studied extensively in recent years. The advantage of this methods is that one can prove strong convergence theorems while the traditional iteration methods just have weak convergence. In this paper, we propose two types of hybrid algorithm to find a common fixed point of a finite family of asymptotically nonexpansive mappings in Hilbert spaces. One is cyclic Mann's iteration scheme, and the other is cyclic Halpern's iteration scheme. We prove the strong convergence theorems for both iteration schemes.

  13. Cluster Based Hybrid Niche Mimetic and Genetic Algorithm for Text Document Categorization

    Directory of Open Access Journals (Sweden)

    A. K. Santra

    2011-09-01

    Full Text Available An efficient cluster based hybrid niche mimetic and genetic algorithm for text document categorization to improve the retrieval rate of relevant document fetching is addressed. The proposal minimizes the processing of structuring the document with better feature selection using hybrid algorithm. In addition restructuring of feature words to associated documents gets reduced, in turn increases document clustering rate. The performance of the proposed work is measured in terms of cluster objects accuracy, term weight, term frequency and inverse document frequency. Experimental results demonstrate that it achieves very good performance on both feature selection and text document categorization, compared to other classifier methods.

  14. A Swarm Intelligent Algorithm Based Route Maintaining Protocol for Mobile Sink Wireless Sensor Networks

    Directory of Open Access Journals (Sweden)

    Xiaoming Wu

    2015-01-01

    Full Text Available Recent studies have shown that mobile sink can be a solution to solve the problem that energy consumption of sensor nodes is not balanced in wireless sensor networks (WSNs. Caused by the sink mobility, the paths between the sensor nodes and the sink change frequently and have profound influence on the lifetime of WSN. It is necessary to design a protocol that can find efficient routings between the mobile sink and nodes but does not consume too many network resources. In this paper, we propose a swarm intelligent algorithm based route maintaining protocol to resolve this issue. The protocol utilizes the concentric ring mechanism to guide the route researching direction and adopts the optimal routing selection to maintain the data delivery route in mobile sink WSN. Using the immune based artificial bee colony (IABC algorithm to optimize the forwarding path, the routing maintaining protocol could find an alternative routing path quickly and efficiently when the coordinate of sink is changed in WSN. The results of our extensive experiments demonstrate that our proposed route maintaining protocol is able to balance the network traffic load and prolong the network lifetime.

  15. Study on Immune Relevant Vector Machine Based Intelligent Fault Detection and Diagnosis Algorithm

    Directory of Open Access Journals (Sweden)

    Zhong-hua Miao

    2013-01-01

    Full Text Available An immune relevant vector machine (IRVM based intelligent classification method is proposed by combining the random real-valued negative selection (RRNS algorithm and the relevant vector machine (RVM algorithm. The method proposed is aimed to handle the training problem of missing or incomplete fault sampling data and is inspired by the “self/nonself” recognition principle in the artificial immune systems. The detectors, generated by the RRNS, are treated as the “nonself” training samples and used to train the RVM model together with the “self” training samples. After the training succeeds, the “nonself” detection model, which requires only the “self” training samples, is obtained for the fault detection and diagnosis. It provides a general way solving the problems of this type and can be applied for both fault detection and fault diagnosis. The standard Fisher's Iris flower dataset is used to experimentally testify the proposed method, and the results are compared with those from the support vector data description (SVDD method. Experimental results have shown the validity and practicability of the proposed method.

  16. A new intelligent approach for air traffic control using gravitational search algorithm

    Indian Academy of Sciences (India)

    Kazem Dastgerdi; Nasser Mehrshad; Mohsen Farshad

    2016-02-01

    Aircraft landing planning (ALP) is one of the most important challenging problems in the domain of air traffic control (ATC). Solving this NP-hard problem is a valuable aid in organizing air traffic in terminal control area (TCA), which itself leads to a decrease in aircraft fuel consumption, costs of airlines, and workload undertaken by air traffic controllers. In the present paper, the ALP problem is dealt with by applying effective rich knowledge to the optimization process (to remove obvious non-optimal solutions), and the first use of Gravitational Search Algorithm (GSA) in resolving such a case. In this regard, while the specific regulations for safe separation have been observed, the optimal landing time, the optimal runway, and the order of consecutive landings have been determined so that the main goal (minimizing total flight delays) would be best met. Results of simulations show that this approach, compared to previous ones, which are based on Genetic and Bionomic algorithms, GLS, and Scatter search method, considerably decreases total flight delays. Attaining zero in the total flight delays in three scenarios with real data shows that the suggested intelligent approach is more decisive than others in finding an optimal solution.

  17. A hybrid cuckoo search algorithm with Nelder Mead method for solving global optimization problems.

    Science.gov (United States)

    Ali, Ahmed F; Tawhid, Mohamed A

    2016-01-01

    Cuckoo search algorithm is a promising metaheuristic population based method. It has been applied to solve many real life problems. In this paper, we propose a new cuckoo search algorithm by combining the cuckoo search algorithm with the Nelder-Mead method in order to solve the integer and minimax optimization problems. We call the proposed algorithm by hybrid cuckoo search and Nelder-Mead method (HCSNM). HCSNM starts the search by applying the standard cuckoo search for number of iterations then the best obtained solution is passing to the Nelder-Mead algorithm as an intensification process in order to accelerate the search and overcome the slow convergence of the standard cuckoo search algorithm. The proposed algorithm is balancing between the global exploration of the Cuckoo search algorithm and the deep exploitation of the Nelder-Mead method. We test HCSNM algorithm on seven integer programming problems and ten minimax problems and compare against eight algorithms for solving integer programming problems and seven algorithms for solving minimax problems. The experiments results show the efficiency of the proposed algorithm and its ability to solve integer and minimax optimization problems in reasonable time.

  18. A hybrid algorithm for the segmentation of books in libraries

    Science.gov (United States)

    Hu, Zilong; Tang, Jinshan; Lei, Liang

    2016-05-01

    This paper proposes an algorithm for book segmentation based on bookshelves images. The algorithm can be separated into three parts. The first part is pre-processing, aiming at eliminating or decreasing the effect of image noise and illumination conditions. The second part is near-horizontal line detection based on Canny edge detector, and separating a bookshelves image into multiple sub-images so that each sub-image contains an individual shelf. The last part is book segmentation. In each shelf image, near-vertical line is detected, and obtained lines are used for book segmentation. The proposed algorithm was tested with the bookshelf images taken from OPIE library in MTU, and the experimental results demonstrate good performance.

  19. A New Chaotic Genetic Hybrid Algorithm and Its Applications in Mechanical Optimization Design

    Institute of Scientific and Technical Information of China (English)

    WANG Zhong-min; DAI Yi

    2010-01-01

    A new chaotic genetic hybrid algorithm (CGHA) based on float point coding was put forward in this paper.Firstly, it used chaos optimization to search coarsely and produced a better initial population. Then, a power function carri-er was adopted to improve the ergodicity and the sufficiency of the chaos optimization. Secondly, the genetic algorithm (GA) was used to search finely and guaranteed the population's evolution. To avoid the search being trapped in local minimum, a chaos degenerate mutation operator was designed to make the search converge to a global optimum quickly. Finally, CGHA was used to solve a typical mechanical optimization problem of shear stress checking for a cylinder helix spring.Compared with traditional penalty function method, chaos-Powell hybrid algorithm and standard GA, CGHA shows better performance in solution precision and convergence speed than those of the algorithms. Therefore, CGHA is a new effective way to solve the problems in mechanical optimization design.

  20. A Hybrid Mutation Chemical Reaction Optimization Algorithm for Global Numerical Optimization

    Directory of Open Access Journals (Sweden)

    Ransikarn Ngambusabongsopa

    2015-01-01

    Full Text Available This paper proposes a hybrid metaheuristic approach that improves global numerical optimization by increasing optimal quality and accelerating convergence. This algorithm involves a recently developed process for chemical reaction optimization and two adjustment operators (turning and mutation operators. Three types of mutation operators (uniform, nonuniform, and polynomial were combined with chemical reaction optimization and turning operator to find the most appropriate framework. The best solution among these three options was selected to be a hybrid mutation chemical reaction optimization algorithm for global numerical optimization. The optimal quality, convergence speed, and statistical hypothesis testing of our algorithm are superior to those previous high performance algorithms such as RCCRO, HP-CRO2, and OCRO.

  1. Hybrid Genetic Algorithm with Multiparents Crossover for Job Shop Scheduling Problems

    Directory of Open Access Journals (Sweden)

    Noor Hasnah Moin

    2015-01-01

    Full Text Available The job shop scheduling problem (JSSP is one of the well-known hard combinatorial scheduling problems. This paper proposes a hybrid genetic algorithm with multiparents crossover for JSSP. The multiparents crossover operator known as extended precedence preservative crossover (EPPX is able to recombine more than two parents to generate a single new offspring distinguished from common crossover operators that recombine only two parents. This algorithm also embeds a schedule generation procedure to generate full-active schedule that satisfies precedence constraints in order to reduce the search space. Once a schedule is obtained, a neighborhood search is applied to exploit the search space for better solutions and to enhance the GA. This hybrid genetic algorithm is simulated on a set of benchmarks from the literatures and the results are compared with other approaches to ensure the sustainability of this algorithm in solving JSSP. The results suggest that the implementation of multiparents crossover produces competitive results.

  2. Time Series Analysis and Forecasting for Wind Speeds Using Support Vector Regression Coupled with Artificial Intelligent Algorithms

    OpenAIRE

    Ping Jiang; Shanshan Qin; Jie Wu; Beibei Sun

    2015-01-01

    Wind speed/power has received increasing attention around the earth due to its renewable nature as well as environmental friendliness. With the global installed wind power capacity rapidly increasing, wind industry is growing into a large-scale business. Reliable short-term wind speed forecasts play a practical and crucial role in wind energy conversion systems, such as the dynamic control of wind turbines and power system scheduling. In this paper, an intelligent hybrid model for short-term ...

  3. Robust Intelligence (RI) under uncertainty: Mathematical foundations of autonomous hybrid (human-machine-robot) teams, organizations and systems

    OpenAIRE

    Lawless, William F.

    2013-01-01

    To develop a theory of Robust Intelligence (RI), we continue to advance our theory of interdependence on the efficient and effective control of systems of autonomous hybrid teams composed of robots, machines and humans working interchangeably. As is the case with humans, we believe that RI is less likely to be achieved by individual computational agents; instead, we propose that a better path to RI is with interdependent agents. However, unlike conventional computational models where agents a...

  4. An efficient algorithm for the stochastic simulation of the hybridization of DNA to microarrays

    Directory of Open Access Journals (Sweden)

    Laurenzi Ian J

    2009-12-01

    Full Text Available Abstract Background Although oligonucleotide microarray technology is ubiquitous in genomic research, reproducibility and standardization of expression measurements still concern many researchers. Cross-hybridization between microarray probes and non-target ssDNA has been implicated as a primary factor in sensitivity and selectivity loss. Since hybridization is a chemical process, it may be modeled at a population-level using a combination of material balance equations and thermodynamics. However, the hybridization reaction network may be exceptionally large for commercial arrays, which often possess at least one reporter per transcript. Quantification of the kinetics and equilibrium of exceptionally large chemical systems of this type is numerically infeasible with customary approaches. Results In this paper, we present a robust and computationally efficient algorithm for the simulation of hybridization processes underlying microarray assays. Our method may be utilized to identify the extent to which nucleic acid targets (e.g. cDNA will cross-hybridize with probes, and by extension, characterize probe robustnessusing the information specified by MAGE-TAB. Using this algorithm, we characterize cross-hybridization in a modified commercial microarray assay. Conclusions By integrating stochastic simulation with thermodynamic prediction tools for DNA hybridization, one may robustly and rapidly characterize of the selectivity of a proposed microarray design at the probe and "system" levels. Our code is available at http://www.laurenzi.net.

  5. Optimization of Hybrid PV/Wind Energy System Using Genetic Algorithm (GA

    Directory of Open Access Journals (Sweden)

    Satish Kumar Ramoji

    2014-01-01

    Full Text Available In this paper, a new approach of optimum design for a Hybrid PV/Wind energy system is presented in order to assist the designers to take into consideration both the economic and ecological aspects. When the stand alone energy system having photovoltaic panels only or wind turbine only are compared with the hybrid PV/wind energy systems, the hybrid systems are more economical and reliable according to climate changes. This paper presents an optimization technique to design the hybrid PV/wind system. The hybrid system consists of photovoltaic panels, wind turbines and storage batteries. Genetic Algorithm (GA optimization technique is utilized to minimize the formulated objective function, i.e. total cost which includes initial costs, yearly replacement cost, yearly operating costs and maintenance costs and salvage value of the proposed hybrid system. A computer program is designed, using MATLAB code to formulate the optimization problem by computing the coefficients of the objective function. The method mentioned in this article is proved to be effective using an example of hybrid energy system. Finally, the optimal solution is achieved by Genetic Algorithm (GA optimization method.

  6. Fault Diagnosis of Nonlinear Systems Based on Hybrid PSOSA Optimization Algorithm

    Institute of Scientific and Technical Information of China (English)

    Ling-Lai Li; Dong-Hua Zhou; Ling Wang

    2007-01-01

    Fault diagnosis of nonlinear systems is of great importance in theory and practice, and the parameter estimation method is an effective strategy. Based on the framework of moving horizon estimation, fault parameters are identified by a proposed intelligent optimization algorithm called PSOSA, which could avoid premature convergence of standard particle swarm optimization (PSO) by introducing the probabilistic jumping property of simulated annealing (SA). Simulations on a three-tank system show the effectiveness of this optimization based fault diagnosis strategy.

  7. Optimization of concrete I-beams using a new hybrid glowworm swarm algorithm

    OpenAIRE

    García-Segura,Tatiana; Yepes, Víctor; Martí, José V.; Alcalá,Julián

    2014-01-01

    In this paper a new hybrid glowworm swarm algorithm (SAGSO) for solving structural optimization problems is presented. The structure proposed to be optimized here is a simply-supported concrete I-beam defined by 20 variables. Eight different concrete mixtures are studied, varying the compressive strength grade and compacting system. The solutions are evaluated following the Spanish Code for structural concrete. The algorithm is applied to two objective functions, namely the embedded CO2 emiss...

  8. A Hybrid Time Synchronization Algorithm Based on Broadcast Sequencing for Wireless Sensor Networks

    Science.gov (United States)

    2014-09-01

    sequence per the flow charts detailed in Figures 43–45 located in Appendix A. The input 1 in Figure 12 is a recursive step from some of the...SYNCHRONIZATION ALGORITHM BASED ON BROADCAST SEQUENCING FOR WIRELESS SENSOR NETWORKS by Sung C. Park September 2014 Thesis Co-Advisors...REPORT TYPE AND DATES COVERED Master’s Thesis 4. TITLE AND SUBTITLE A HYBRID TIME SYNCHRONIZATION ALGORITHM BASED ON BROADCAST SEQUENCING FOR

  9. A Hybrid Bacterial Foraging - PSO Algorithm Based Tuning of Optimal FOPI Speed Controller

    Directory of Open Access Journals (Sweden)

    Rajasekhar Anguluri

    2011-11-01

    Full Text Available Bacterial Foraging Optimization Algorithm (BFOA has recently emerged as a very powerful technique for real parameteroptimization. In order to overcome the delay in optimization and to further enhance the performance of BFO, this paper proposeda new hybrid algorithm combining the features of BFOA and Particle Swarm Optimization (PSO for tuning a Fractional orderspeed controller in a Permanent Magnet Synchronous Motor (PMSM Drive. Computer simulations illustrate the effectiveness of theproposed approach compared to that of basic versions of PSO and BFO.

  10. Hybrid model based on Genetic Algorithms and SVM applied to variable selection within fruit juice classification.

    Science.gov (United States)

    Fernandez-Lozano, C; Canto, C; Gestal, M; Andrade-Garda, J M; Rabuñal, J R; Dorado, J; Pazos, A

    2013-01-01

    Given the background of the use of Neural Networks in problems of apple juice classification, this paper aim at implementing a newly developed method in the field of machine learning: the Support Vector Machines (SVM). Therefore, a hybrid model that combines genetic algorithms and support vector machines is suggested in such a way that, when using SVM as a fitness function of the Genetic Algorithm (GA), the most representative variables for a specific classification problem can be selected.

  11. A New Hybrid Algorithm for Bankruptcy Prediction Using Switching Particle Swarm Optimization and Support Vector Machines

    OpenAIRE

    2015-01-01

    Bankruptcy prediction has been extensively investigated by data mining techniques since it is a critical issue in the accounting and finance field. In this paper, a new hybrid algorithm combining switching particle swarm optimization (SPSO) and support vector machine (SVM) is proposed to solve the bankruptcy prediction problem. In particular, a recently developed SPSO algorithm is exploited to search the optimal parameter values of radial basis function (RBF) kernel of the SVM. The new algori...

  12. Hybrid Optimization Algorithm of Particle Swarm Optimization and Cuckoo Search for Preventive Maintenance Period Optimization

    OpenAIRE

    Jianwen Guo; Zhenzhong Sun; Hong Tang; Xuejun Jia; Song Wang; Xiaohui Yan; Guoliang Ye; Guohong Wu

    2016-01-01

    All equipment must be maintained during its lifetime to ensure normal operation. Maintenance is one of the critical roles in the success of manufacturing enterprises. This paper proposed a preventive maintenance period optimization model (PMPOM) to find an optimal preventive maintenance period. By making use of the advantages of particle swarm optimization (PSO) and cuckoo search (CS) algorithm, a hybrid optimization algorithm of PSO and CS is proposed to solve the PMPOM problem. The test fun...

  13. AN HYBRID STOCHASTIC-DETERMINISTIC OPTIMIZATION ALGORITHM FOR STRUCTURAL DAMAGE IDENTIFICATION

    OpenAIRE

    Nhamage, Idilson António; Lopez, Rafael Holdorf; Miguel, Leandro Fleck Fadel; Miguel, Letícia Fleck Fadel; Torii, André Jacomel

    2017-01-01

    Abstract. This paper presents a hybrid stochastic/deterministic optimization algorithm to solve the target optimization problem of vibration-based damage detection. The use of a numerical solution of the representation formula to locate the region of the global solution, i.e., to provide a starting point for the local optimizer, which is chosen to be the Nelder-Mead algorithm (NMA), is proposed. A series of numerical examples with different damage scenarios and noise levels was performed unde...

  14. An improved hybrid intelligent extreme learning machine%一种新的混合智能极限学习机

    Institute of Scientific and Technical Information of China (English)

    林梅金; 罗飞; 苏彩红; 许玉格

    2015-01-01

    An improved hybrid intelligent algorithm based on differential evolution(DE) and particle swarm optimization (PSO) is proposed. The performance of DEPSO algorithm is verified by simulations on 10 benchmark functions. Then, an improved learning algorithm named DEPSO extreme learning machine(DEPSO-ELM) algorithm for single hidden layer feedforward networks(SLFNs) is proposed. In DEPSO-ELM, DEPSO is used to optimize the network hidden node parameters, and ELM is used to analytically determine the output weights. Simulation results of 6 real world datasets regression problems show that the DEPSO-ELM algorithm performs better than DE-ELM and SaE-ELM. Finally, the effectiveness of the DEPSO-ELM algorithm is verified in the prediction of NC machine tool thermal errors.%提出一种基于差分进化(DE)和粒子群优化(PSO)的混合智能方法—–DEPSO算法,并通过对10个典型函数进行测试,表明DEPSO算法具有良好的寻优性能。针对单隐层前向神经网络(SLFNs)提出一种改进的学习算法—–DEPSO-ELM算法,即应用DEPSO算法优化SLFNs的隐层节点参数,采用极限学习算法(ELM)求取SLFNs的输出权值。将DEPSO-ELM算法应用于6个典型真实数据集的回归计算,并与DE-ELM、SaE-ELM算法相比,获得了更精确的计算结果。最后,将DEPSO-ELM算法应用于数控机床热误差的建模预测,获得了良好的预测效果。

  15. Application of a single-objective, hybrid genetic algorithm approach to pharmacokinetic model building.

    Science.gov (United States)

    Sherer, Eric A; Sale, Mark E; Pollock, Bruce G; Belani, Chandra P; Egorin, Merrill J; Ivy, Percy S; Lieberman, Jeffrey A; Manuck, Stephen B; Marder, Stephen R; Muldoon, Matthew F; Scher, Howard I; Solit, David B; Bies, Robert R

    2012-08-01

    A limitation in traditional stepwise population pharmacokinetic model building is the difficulty in handling interactions between model components. To address this issue, a method was previously introduced which couples NONMEM parameter estimation and model fitness evaluation to a single-objective, hybrid genetic algorithm for global optimization of the model structure. In this study, the generalizability of this approach for pharmacokinetic model building is evaluated by comparing (1) correct and spurious covariate relationships in a simulated dataset resulting from automated stepwise covariate modeling, Lasso methods, and single-objective hybrid genetic algorithm approaches to covariate identification and (2) information criteria values, model structures, convergence, and model parameter values resulting from manual stepwise versus single-objective, hybrid genetic algorithm approaches to model building for seven compounds. Both manual stepwise and single-objective, hybrid genetic algorithm approaches to model building were applied, blinded to the results of the other approach, for selection of the compartment structure as well as inclusion and model form of inter-individual and inter-occasion variability, residual error, and covariates from a common set of model options. For the simulated dataset, stepwise covariate modeling identified three of four true covariates and two spurious covariates; Lasso identified two of four true and 0 spurious covariates; and the single-objective, hybrid genetic algorithm identified three of four true covariates and one spurious covariate. For the clinical datasets, the Akaike information criterion was a median of 22.3 points lower (range of 470.5 point decrease to 0.1 point decrease) for the best single-objective hybrid genetic-algorithm candidate model versus the final manual stepwise model: the Akaike information criterion was lower by greater than 10 points for four compounds and differed by less than 10 points for three

  16. Type-2 Fuzzy Logic in Intelligent Control Applications

    CERN Document Server

    Castillo, Oscar

    2012-01-01

    We describe in this book, hybrid intelligent systems based mainly on type-2 fuzzy logic for intelligent control. Hybrid intelligent systems combine several intelligent computing paradigms, including fuzzy logic, and bio-inspired optimization algorithms, which can be used to produce powerful automatic control systems. The book is organized in three main parts, which contain a group of chapters around a similar subject. The first part consists of chapters with the main theme of theory and design algorithms, which are basically chapters that propose new models and concepts, which can be the basis for achieving intelligent control with interval type-2 fuzzy logic. The second part of the book is comprised of chapters with the main theme of evolutionary optimization of type-2 fuzzy systems in intelligent control with the aim of designing optimal type-2 fuzzy controllers for complex control problems in diverse areas of application, including mobile robotics, aircraft dynamics systems and hardware implementations. Th...

  17. A hybrid ECT image reconstruction based on Tikhonov regularization theory and SIRT algorithm

    Science.gov (United States)

    Lei, Wang; Xiaotong, Du; Xiaoyin, Shao

    2007-07-01

    Electrical Capacitance Tomography (ECT) image reconstruction is a key problem that is not well solved due to the influence of soft-field in the ECT system. In this paper, a new hybrid ECT image reconstruction algorithm is proposed by combining Tikhonov regularization theory and Simultaneous Reconstruction Technique (SIRT) algorithm. Tikhonov regularization theory is used to solve ill-posed image reconstruction problem to obtain a stable original reconstructed image in the region of the optimized solution aggregate. Then, SIRT algorithm is used to improve the quality of the final reconstructed image. In order to satisfy the industrial requirement of real-time computation, the proposed algorithm is further been modified to improve the calculation speed. Test results show that the quality of reconstructed image is better than that of the well-known Filter Linear Back Projection (FLBP) algorithm and the time consumption of the new algorithm is less than 0.1 second that satisfies the online requirements.

  18. A hybrid ECT image reconstruction based on Tikhonov regularization theory and SIRT algorithm

    Energy Technology Data Exchange (ETDEWEB)

    Wang Lei [School of Control Science and Engineering, Shandong University, 250061, Jinan (China); Du Xiaotong [School of Control Science and Engineering, Shandong University, 250061, Jinan (China); Shao Xiaoyin [Department of Manufacture Engineering and Engineering Management, City University of Hong Kong (China)

    2007-07-15

    Electrical Capacitance Tomography (ECT) image reconstruction is a key problem that is not well solved due to the influence of soft-field in the ECT system. In this paper, a new hybrid ECT image reconstruction algorithm is proposed by combining Tikhonov regularization theory and Simultaneous Reconstruction Technique (SIRT) algorithm. Tikhonov regularization theory is used to solve ill-posed image reconstruction problem to obtain a stable original reconstructed image in the region of the optimized solution aggregate. Then, SIRT algorithm is used to improve the quality of the final reconstructed image. In order to satisfy the industrial requirement of real-time computation, the proposed algorithm is further been modified to improve the calculation speed. Test results show that the quality of reconstructed image is better than that of the well-known Filter Linear Back Projection (FLBP) algorithm and the time consumption of the new algorithm is less than 0.1 second that satisfies the online requirements.

  19. A Hybrid Adaptive Routing Algorithm for Event-Driven Wireless Sensor Networks

    Directory of Open Access Journals (Sweden)

    Antonio A. F. Loureiro

    2009-09-01

    Full Text Available Routing is a basic function in wireless sensor networks (WSNs. For these networks, routing algorithms depend on the characteristics of the applications and, consequently, there is no self-contained algorithm suitable for every case. In some scenarios, the network behavior (traffic load may vary a lot, such as an event-driven application, favoring different algorithms at different instants. This work presents a hybrid and adaptive algorithm for routing in WSNs, called Multi-MAF, that adapts its behavior autonomously in response to the variation of network conditions. In particular, the proposed algorithm applies both reactive and proactive strategies for routing infrastructure creation, and uses an event-detection estimation model to change between the strategies and save energy. To show the advantages of the proposed approach, it is evaluated through simulations. Comparisons with independent reactive and proactive algorithms show improvements on energy consumption.

  20. An efficient hybrid evolutionary optimization algorithm based on PSO and SA for clustering

    Institute of Scientific and Technical Information of China (English)

    Taher NIKNAM; Babak AMIRI; Javad OLAMAEI; Ali AREFI

    2009-01-01

    The K-means algorithm is one of the most popular techniques in clustering. Nevertheless, the performance of the Kmeans algorithm depends highly on initial cluster centers and converges to local minima. This paper proposes a hybrid evolutionary programming based clustering algorithm, called PSO-SA, by combining particle swarm optimization (PSO) and simulated annealing (SA). The basic idea is to search around the global solution by SA and to increase the information exchange among particles using a mutation operator to escape local optima. Three datasets, Iris, Wisconsin Breast Cancer, and Riplcy's Glass, have been considered to show the effectiveness of the proposed clustering algorithm in providing optimal clusters. The simulation results show that the PSO-SA clustering algorithm not only has a better response but also converges more quickly than the K-means, PSO, and SA algorithms.

  1. A hybrid adaptive routing algorithm for event-driven wireless sensor networks.

    Science.gov (United States)

    Figueiredo, Carlos M S; Nakamura, Eduardo F; Loureiro, Antonio A F

    2009-01-01

    Routing is a basic function in wireless sensor networks (WSNs). For these networks, routing algorithms depend on the characteristics of the applications and, consequently, there is no self-contained algorithm suitable for every case. In some scenarios, the network behavior (traffic load) may vary a lot, such as an event-driven application, favoring different algorithms at different instants. This work presents a hybrid and adaptive algorithm for routing in WSNs, called Multi-MAF, that adapts its behavior autonomously in response to the variation of network conditions. In particular, the proposed algorithm applies both reactive and proactive strategies for routing infrastructure creation, and uses an event-detection estimation model to change between the strategies and save energy. To show the advantages of the proposed approach, it is evaluated through simulations. Comparisons with independent reactive and proactive algorithms show improvements on energy consumption.

  2. CPU-GPU hybrid accelerating the Zuker algorithm for RNA secondary structure prediction applications.

    Science.gov (United States)

    Lei, Guoqing; Dou, Yong; Wan, Wen; Xia, Fei; Li, Rongchun; Ma, Meng; Zou, Dan

    2012-01-01

    Prediction of ribonucleic acid (RNA) secondary structure remains one of the most important research areas in bioinformatics. The Zuker algorithm is one of the most popular methods of free energy minimization for RNA secondary structure prediction. Thus far, few studies have been reported on the acceleration of the Zuker algorithm on general-purpose processors or on extra accelerators such as Field Programmable Gate-Array (FPGA) and Graphics Processing Units (GPU). To the best of our knowledge, no implementation combines both CPU and extra accelerators, such as GPUs, to accelerate the Zuker algorithm applications. In this paper, a CPU-GPU hybrid computing system that accelerates Zuker algorithm applications for RNA secondary structure prediction is proposed. The computing tasks are allocated between CPU and GPU for parallel cooperate execution. Performance differences between the CPU and the GPU in the task-allocation scheme are considered to obtain workload balance. To improve the hybrid system performance, the Zuker algorithm is optimally implemented with special methods for CPU and GPU architecture. Speedup of 15.93× over optimized multi-core SIMD CPU implementation and performance advantage of 16% over optimized GPU implementation are shown in the experimental results. More than 14% of the sequences are executed on CPU in the hybrid system. The system combining CPU and GPU to accelerate the Zuker algorithm is proven to be promising and can be applied to other bioinformatics applications.

  3. Comparison between hybridized algorithm of GA–SA and ABC, GA, DE and PSO for vertical-handover in heterogeneous wireless networks

    Indian Academy of Sciences (India)

    SHIDROKH GOUDARZI; WAN HASLINA HASSAN; MOHAMMAD HOSSEIN ANISI; SEYED AHMAD SOLEYMANI

    2016-07-01

    Genetic algorithms (GAs) and simulated annealing (SA) have emerged as leading methods for search and optimization problems in heterogeneous wireless networks. In this paradigm, various access technologies need to be interconnected; thus, vertical handovers are necessary for seamless mobility. In this paper, the hybrid algorithm for real-time vertical handover using different objective functions has been presented to find the optimal network to connect with a good quality of service in accordance with the user’s preferences. As it is, the characteristics of the current mobile devices recommend using fast andefficient algorithms to provide solutions near to real-time. These constraints have moved us to develop intelligent algorithms that avoid slow and massive computations. This was to, specifically, solve two major problems in GA optimization, i.e. premature convergence and slow convergence rate, and the facilitation of simulated annealing in the merging populations phase of the search. The hybrid algorithm was expected to improve on the pure GA in two ways, i.e., improved solutions for a given number of evaluations, and more stability over many runs. This paper compares the formulation and results of four recent optimization algorithms: artificial bee colony (ABC), genetic algorithm(GA), differential evolution (DE), and particle swarm optimization (PSO). Moreover, a cost function is used to sustain the desired QoS during the transition between networks, which is measured in terms of the bandwidth, BER, ABR, SNR, and monetary cost. Simulation results indicated that choosing the SA rules would minimize the cost function and the GA– SA algorithm could decrease the number of unnecessary handovers, and thereby prevent the ‘Ping-Pong’ effect.

  4. 并行遗传/模拟退火混合算法及其应用%Parallel Genetic Algorithm / Simulated Annealing Hybrid Algorithm and its Applications

    Institute of Scientific and Technical Information of China (English)

    温平川; 徐晓东; 何先刚

    2003-01-01

    This paper presents a highly hybrid Genetic Algorithm / Simulated Annealing algorithm. This algorithmhas been successfully implemented on Beowulf PCs Cluster and applied to a set of standard function optimization prob-lems. From experimental results, it is easily to see that this algorithm proposed by us is not only effective but also robust.

  5. Intelligence System for Diagnosis Level of Coronary Heart Disease with K-Star Algorithm

    Science.gov (United States)

    Kusnanto, Hari; Herianto, Herianto

    2016-01-01

    Objectives Coronary heart disease is the leading cause of death worldwide, and it is important to diagnose the level of the disease. Intelligence systems for diagnosis proved can be used to support diagnosis of the disease. Unfortunately, most of the data available between the level/type of coronary heart disease is unbalanced. As a result system performance is low. Methods This paper proposes an intelligence systems for the diagnosis of the level of coronary heart disease taking into account the problem of data imbalance. The first stage of this research was preprocessing, which included resampled non-stratified random sampling (R), the synthetic minority over-sampling technique (SMOTE), clean data out of range attribute (COR), and remove duplicate (RD). The second step was the sharing of data for training and testing using a k-fold cross-validation model and training multiclass classification by the K-star algorithm. The third step was performance evaluation. The proposed system was evaluated using the performance parameters of sensitivity, specificity, positive prediction value (PPV), negative prediction value (NPV), area under the curve (AUC) and F-measure. Results The results showed that the proposed system provides an average performance with sensitivity of 80.1%, specificity of 95%, PPV of 80.1%, NPV of 95%, AUC of 87.5%, and F-measure of 80.1%. Performance of the system without consideration of data imbalance provide showed sensitivity of 53.1%, specificity of 88,3%, PPV of 53.1%, NPV of 88.3%, AUC of 70.7%, and F-measure of 53.1%. Conclusions Based on these results it can be concluded that the proposed system is able to deliver good performance in the category of classification. PMID:26893948

  6. Optimizing Hybrid Wind/Diesel Generator System Using BAT Algorithm

    Directory of Open Access Journals (Sweden)

    Sudhir Sharma,

    2016-01-01

    Full Text Available Hybrid system comprising of Wind/Diesel generation system for a practical standalone application considers Wind turbine generators and diesel generator as primary power sources for generating electricity. Battery banks are considered as a backup power source. The total value of cost is reduced by meeting energy demand required by the customers. Bat optimization technique is implemented to optimize wind and battery modules. Wind and battery banks are considered as primary sources and diesel generator as a secondary power source for the system

  7. A New Hybrid Fuzzy Intelligent Filter for Medical Image Noise Reduction

    Directory of Open Access Journals (Sweden)

    Somaye Aliakbari Dehkordi

    2014-10-01

    Full Text Available Medical imaging comprises different imaging modalities and processes to image human body for diagnostic and treatment purposes and, therefore has an important role in the improvement of public health in all population groups. In this paper, we present an intelligent hybrid noise reduction filter which is based on Neuro-Fuzzy systems. It is especially beneficial in medical image noise reduction. First stage we feed the input image into four general noise reduction filters in parallel. These general filters are: mean filter, median filter, weighted median filter and the adaptive median filter. At the second stage we give the output of the above filters as input into a Neuro-Fuzzy system. As expected, the ability of Neuro-Fuzzy systems in encoding human knowledge and using non-deterministic knowledge, allow us to achieve much more noise reduction from the input images. We implement the proposed method and use it for reduction of noise from a set of medical images affected with high noise density. Experimental results show that the idea is considerably effective.

  8. Hybrid Intelligent System to Perform Fault Detection on BIS Sensor During Surgeries

    Science.gov (United States)

    Casteleiro-Roca, José-Luis; Calvo-Rolle, José Luis; Méndez Pérez, Juan Albino; Roqueñí Gutiérrez, Nieves; de Cos Juez, Francisco Javier

    2017-01-01

    This paper presents a new fault detection system in hypnotic sensors used for general anesthesia during surgery. Drug infusion during surgery is based on information received from patient monitoring devices; accordingly, faults in sensor devices can put patient safety at risk. Our research offers a solution to cope with these undesirable scenarios. We focus on the anesthesia process using intravenous propofol as the hypnotic drug and employing a Bispectral Index (BISTM) monitor to estimate the patient’s unconsciousness level. The method developed identifies BIS episodes affected by disturbances during surgery with null clinical value. Thus, the clinician—or the automatic controller—will not take those measures into account to calculate the drug dose. Our method compares the measured BIS signal with expected behavior predicted by the propofol dose provider and the electromyogram (EMG) signal. For the prediction of the BIS signal, a model based on a hybrid intelligent system architecture has been created. The model uses clustering combined with regression techniques. To validate its accuracy, a dataset taken during surgeries with general anesthesia was used. The proposed fault detection method for BIS sensor measures has also been verified using data from real cases. The obtained results prove the method’s effectiveness. PMID:28106793

  9. Hybrid neural intelligent system to predict business failure in small-to-medium-size enterprises.

    Science.gov (United States)

    Borrajo, M Lourdes; Baruque, Bruno; Corchado, Emilio; Bajo, Javier; Corchado, Juan M

    2011-08-01

    During the last years there has been a growing need of developing innovative tools that can help small to medium sized enterprises to predict business failure as well as financial crisis. In this study we present a novel hybrid intelligent system aimed at monitoring the modus operandi of the companies and predicting possible failures. This system is implemented by means of a neural-based multi-agent system that models the different actors of the companies as agents. The core of the multi-agent system is a type of agent that incorporates a case-based reasoning system and automates the business control process and failure prediction. The stages of the case-based reasoning system are implemented by means of web services: the retrieval stage uses an innovative weighted voting summarization of self-organizing maps ensembles-based method and the reuse stage is implemented by means of a radial basis function neural network. An initial prototype was developed and the results obtained related to small and medium enterprises in a real scenario are presented.

  10. FIVE PHASE PENTAGON HYBRID STEPPER MOTOR INTELLIGENT HALF/FULL DRIVER

    Directory of Open Access Journals (Sweden)

    Alexandru Morar

    2017-06-01

    Full Text Available Stepper motors are very well suited for positioning applications since they can achieve very good positional accuracy without complicated feedback loops associated with servo systems. In this paper, an intelligent five-phase stepper motor driver of business card size proposed. Constant current chopping technique was applied for the purposes of high torque, high velocity and high efficiency. The driver was designed to drive a middle-sized hybrid stepper motor with wire current rating from 0.4 to 1.5A. An up-to-dated translator of five-phase stepping motor was used to drive the gates of N- channel MOSFET array. The resolution in full/half mode is 0.72/0.36 degrees/step. Moreover, an automatic power down circuit was used to limit the power consuming as the motor stops. Additionally, a self-testing program embedded in a 80C31-CPU (PCL838 can self-test whether the driver is normal or not. This embedded program including linear acceleration and deceleration routines also can serve as a positioning controller. The dimension of this driver is approximate 70x65x35 millimeters, which is smaller than a business card. Experimental results demonstrate that the responses of the driver can reach 60 kilo pulses per second

  11. An intelligent hybrid scheme for optimizing parking space: A Tabu metaphor and rough set based approach

    Directory of Open Access Journals (Sweden)

    Soumya Banerjee

    2011-03-01

    Full Text Available Congested roads, high traffic, and parking problems are major concerns for any modern city planning. Congestion of on-street spaces in official neighborhoods may give rise to inappropriate parking areas in office and shopping mall complex during the peak time of official transactions. This paper proposes an intelligent and optimized scheme to solve parking space problem for a small city (e.g., Mauritius using a reactive search technique (named as Tabu Search assisted by rough set. Rough set is being used for the extraction of uncertain rules that exist in the databases of parking situations. The inclusion of rough set theory depicts the accuracy and roughness, which are used to characterize uncertainty of the parking lot. Approximation accuracy is employed to depict accuracy of a rough classification [1] according to different dynamic parking scenarios. And as such, the hybrid metaphor proposed comprising of Tabu Search and rough set could provide substantial research directions for other similar hard optimization problems.

  12. Towards Sustainable Smart Homes by a Hierarchical Hybrid Architecture of an Intelligent Agent

    Directory of Open Access Journals (Sweden)

    K. Yang

    2016-10-01

    Full Text Available A smart home can be realized by the provision of services, such as building control, automation and security implemented in accordance with a user’s request. One of the important issues is how to respond quickly and appropriately to a user’s request in a “dynamic environment”. An intelligent agent infers the user’s intention and provides the intact service. This paper proposes a smart home agent system based on a hierarchical hybrid architecture of a user intention model, which models the user intention as a hierarchical structure and implements it in a dynamic environment. The conventional rule-based approach needs to obtain all information before it is executed, which requires a large number of rules and is hardly scalable as the control objects are increasing. On the other hand, the proposed system consists of several modules that construct a hierarchical user intention model. The smart home system needs to take account of the information, such as time, state of device and state of the home, in addition to users’ intention. We evaluate the performance of the proposed system in a dynamic environment and conduct a blind test with seven subjects to measure the satisfaction of service, resulting in the average score of 81.46.

  13. A hybrid genetic algorithm-queuing multi-compartment model for optimizing inpatient bed occupancy and associated costs.

    Science.gov (United States)

    Belciug, Smaranda; Gorunescu, Florin

    2016-03-01

    Explore how efficient intelligent decision support systems, both easily understandable and straightforwardly implemented, can help modern hospital managers to optimize both bed occupancy and utilization costs. This paper proposes a hybrid genetic algorithm-queuing multi-compartment model for the patient flow in hospitals. A finite capacity queuing model with phase-type service distribution is combined with a compartmental model, and an associated cost model is set up. An evolutionary-based approach is used for enhancing the ability to optimize both bed management and associated costs. In addition, a "What-if analysis" shows how changing the model parameters could improve performance while controlling costs. The study uses bed-occupancy data collected at the Department of Geriatric Medicine - St. George's Hospital, London, period 1969-1984, and January 2000. The hybrid model revealed that a bed-occupancy exceeding 91%, implying a patient rejection rate around 1.1%, can be carried out with 159 beds plus 8 unstaffed beds. The same holding and penalty costs, but significantly different bed allocations (156 vs. 184 staffed beds, and 8 vs. 9 unstaffed beds, respectively) will result in significantly different costs (£755 vs. £1172). Moreover, once the arrival rate exceeds 7 patient/day, the costs associated to the finite capacity system become significantly smaller than those associated to an Erlang B queuing model (£134 vs. £947). Encoding the whole information provided by both the queuing system and the cost model through chromosomes, the genetic algorithm represents an efficient tool in optimizing the bed allocation and associated costs. The methodology can be extended to different medical departments with minor modifications in structure and parameterization. Copyright © 2016 Elsevier B.V. All rights reserved.

  14. Hybrid Artificial Bee Colony Algorithm and Particle Swarm Search for Global Optimization

    Directory of Open Access Journals (Sweden)

    Wang Chun-Feng

    2014-01-01

    Full Text Available Artificial bee colony (ABC algorithm is one of the most recent swarm intelligence based algorithms, which has been shown to be competitive to other population-based algorithms. However, there is still an insufficiency in ABC regarding its solution search equation, which is good at exploration but poor at exploitation. To overcome this problem, we propose a novel artificial bee colony algorithm based on particle swarm search mechanism. In this algorithm, for improving the convergence speed, the initial population is generated by using good point set theory rather than random selection firstly. Secondly, in order to enhance the exploitation ability, the employed bee, onlookers, and scouts utilize the mechanism of PSO to search new candidate solutions. Finally, for further improving the searching ability, the chaotic search operator is adopted in the best solution of the current iteration. Our algorithm is tested on some well-known benchmark functions and compared with other algorithms. Results show that our algorithm has good performance.

  15. Algorithm of constructing hybrid effective modules for elastic isotropic composites

    Science.gov (United States)

    Svetashkov, A. A.; Miciński, J.; Kupriyanov, N. A.; Barashkov, V. N.; Lushnikov, A. V.

    2017-02-01

    The algorithm of constructing of new effective elastic characteristics of two-component composites based on the superposition of the models of Reiss and Voigt, Hashin and Strikman, as well as models of the geometric average for effective modules. These effective characteristics are inside forks Voigt and Reiss. Additionally, the calculations of the stress-strain state of composite structures with new effective characteristics give more accurate prediction than classical models do.

  16. A hybrid genetic algorithm for multi-modal image registration

    Institute of Scientific and Technical Information of China (English)

    2006-01-01

    This paper describes a new method for three-dimensional medical image registration. In the interactive image-guided HIFU (High Intensity Focused Ultrasound) therapy system, a fast and precise localization of the tumor is very important. An automatic system is developed for registering pre-operative MR images with intra-operative ultrasound images based on the vessels visible in both of the modalities. When the MR and the ultrasound images are aligned, the centerline points of the vessels in the MR image will align with bright intensities in the ultrasound image. The method applies an optimization strategy combining the genetic algorithm with the conjugated gradients algorithm to minimize the objective function. It provides a feasible way of determining the global solution and makes the method robust to local maximum and insensitive to initial position. Two experiments were designed to evaluate the method, and the results show that our method has better registration accuracy and convergence rate than the other two classic algorithms.

  17. A Hybrid Genetic-Algorithm Space-Mapping Tool for the Optimization of Antennas

    DEFF Research Database (Denmark)

    Pantoja, Mario Fernández; Meincke, Peter; Bretones, Amelia Rubio

    2007-01-01

    A hybrid global-local optimization technique for the design of antennas is presented. It consists of the subsequent application of a genetic algorithm (GA) that employs coarse models in the simulations and a space mapping (SM) that refines the solution found in the previous stage. The technique...

  18. Hybrid Monte Carlo algorithm for lattice QCD with two flavors of dynamical Ginsparg-Wilson quarks

    CERN Document Server

    Liu Chua

    1999-01-01

    We study aspects concerning numerical simulations of lattice QCD with two flavors of dynamical Ginsparg-Wilson quarks with degenerate masses. A hybrid Monte Carlo algorithm is described and a formula for the fermionic force is derived for two specific implementations. The implementation with the optimal rational approximation method is favored in both CPU time and memory consumption.

  19. Hybrid Monte Carlo algorithm for lattice QCD with two flavors of dynamical Ginsparg-Wilson quarks

    OpenAIRE

    Liu, Chuan

    1998-01-01

    We study aspects concerning numerical simulations of Lattice QCD with two flavors of dynamical Ginsparg-Wilson quarks with degenerate masses. A Hybrid Monte Carlo algorithm is described and the formula for the fermionic force is derived for two specific implementations. The implementation with optimal rational approximation method is favored both in CPU time and memory consumption.

  20. Modified Hybrid Algorithm for a Family of Quasi- -Asymptotically Nonexpansive Mappings

    Directory of Open Access Journals (Sweden)

    Zhang Xin

    2010-01-01

    Full Text Available The purpose of this paper is to propose a modified hybrid projection algorithm and prove strong convergence theorems for a family of quasi- -asymptotically nonexpansive mappings. The method of the proof is different from the original one. Our results improve and extend the corresponding results announced by Zhou et al. (2010, Kimura and Takahashi (2009, and some others.

  1. Improved Fractal Space Filling Curves Hybrid Optimization Algorithm for Vehicle Routing Problem.

    Science.gov (United States)

    Yue, Yi-xiang; Zhang, Tong; Yue, Qun-xing

    2015-01-01

    Vehicle Routing Problem (VRP) is one of the key issues in optimization of modern logistics system. In this paper, a modified VRP model with hard time window is established and a Hybrid Optimization Algorithm (HOA) based on Fractal Space Filling Curves (SFC) method and Genetic Algorithm (GA) is introduced. By incorporating the proposed algorithm, SFC method can find an initial and feasible solution very fast; GA is used to improve the initial solution. Thereafter, experimental software was developed and a large number of experimental computations from Solomon's benchmark have been studied. The experimental results demonstrate the feasibility and effectiveness of the HOA.

  2. Choice of a PISA selector in a hybrid algorithmic structure for the FJSSP

    Directory of Open Access Journals (Sweden)

    Mariano Frutos

    2015-04-01

    Full Text Available This paper analyzes the choice of a PISA selector for a Hybrid Algorithm integrating it as a Multi-Objective Evolutionary Algorithm (MOEA with a path-dependent search algorithm. The interaction between these components provides an efficient procedure for solving Multi-Objective Problems (MOPs in operations scheduling. In order to choose the selector, we consider both NSGA and SPEA as well as their successors (NSGAII and SPEAII. NSGAII and SPEAII are shown to be the most efficient candidates. On the other hand, for the path-dependent search at the end of each evolutionary phase we use the multi-objective version of Simulated Annealing.

  3. Hybrid particle swarm cooperative optimization algorithm and its application to MBC in alumina production

    Institute of Scientific and Technical Information of China (English)

    Shengli Song; Li Kong; Yong Gan; Rijian Su

    2008-01-01

    An effective hybrid particle swarm cooperative optimization (HPSCO) algorithm combining simulated annealing method and simplex method is proposed. The main idea is to divide particle swarm into several sub-groups and achieve optimization through cooperativeness of different sub-groups among the groups. The proposed algorithm is tested by benchmark functions and applied to material balance computation (MBC) in alumina production. Results show that HPSCO, with both a better stability and a steady convergence, has faster convergence speed and higher global convergence ability than the single method and the improved particle swarm optimization method. Most importantly, results demonstrate that HPSCO is more feasible and efficient than other algorithms in MBC.

  4. Improved Fractal Space Filling Curves Hybrid Optimization Algorithm for Vehicle Routing Problem

    Directory of Open Access Journals (Sweden)

    Yi-xiang Yue

    2015-01-01

    Full Text Available Vehicle Routing Problem (VRP is one of the key issues in optimization of modern logistics system. In this paper, a modified VRP model with hard time window is established and a Hybrid Optimization Algorithm (HOA based on Fractal Space Filling Curves (SFC method and Genetic Algorithm (GA is introduced. By incorporating the proposed algorithm, SFC method can find an initial and feasible solution very fast; GA is used to improve the initial solution. Thereafter, experimental software was developed and a large number of experimental computations from Solomon’s benchmark have been studied. The experimental results demonstrate the feasibility and effectiveness of the HOA.

  5. Improved Fractal Space Filling Curves Hybrid Optimization Algorithm for Vehicle Routing Problem

    Science.gov (United States)

    Yue, Yi-xiang; Zhang, Tong; Yue, Qun-xing

    2015-01-01

    Vehicle Routing Problem (VRP) is one of the key issues in optimization of modern logistics system. In this paper, a modified VRP model with hard time window is established and a Hybrid Optimization Algorithm (HOA) based on Fractal Space Filling Curves (SFC) method and Genetic Algorithm (GA) is introduced. By incorporating the proposed algorithm, SFC method can find an initial and feasible solution very fast; GA is used to improve the initial solution. Thereafter, experimental software was developed and a large number of experimental computations from Solomon's benchmark have been studied. The experimental results demonstrate the feasibility and effectiveness of the HOA. PMID:26167171

  6. A hybrid multi-objective evolutionary algorithm for wind-turbine blade optimization

    Science.gov (United States)

    Sessarego, M.; Dixon, K. R.; Rival, D. E.; Wood, D. H.

    2015-08-01

    A concurrent-hybrid non-dominated sorting genetic algorithm (hybrid NSGA-II) has been developed and applied to the simultaneous optimization of the annual energy production, flapwise root-bending moment and mass of the NREL 5 MW wind-turbine blade. By hybridizing a multi-objective evolutionary algorithm (MOEA) with gradient-based local search, it is believed that the optimal set of blade designs could be achieved in lower computational cost than for a conventional MOEA. To measure the convergence between the hybrid and non-hybrid NSGA-II on a wind-turbine blade optimization problem, a computationally intensive case was performed using the non-hybrid NSGA-II. From this particular case, a three-dimensional surface representing the optimal trade-off between the annual energy production, flapwise root-bending moment and blade mass was achieved. The inclusion of local gradients in the blade optimization, however, shows no improvement in the convergence for this three-objective problem.

  7. On the Idea of a New Artificial Intelligence Based Optimization Algorithm Inspired From the Nature of Vortex

    Directory of Open Access Journals (Sweden)

    Utku Kose

    2015-07-01

    Full Text Available In this paper, the idea of a new artificial intelligence based optimization algorithm, which is inspired from the nature of vortex, has been provided briefly. As also a bio-inspired computation algorithm, the idea is generally focused on a typical vortex flow / behavior in nature and inspires from some dynamics that are occurred in the sense of vortex nature. Briefly, the algorithm is also a swarm-oriented evolutional problem solution approach; because it includes many methods related to elimination of weak swarm members and trying to improve the solution process by supporting the solution space via new swarm members. In order have better idea about success of the algorithm; it has been tested via some benchmark functions. At this point, the obtained results show that the algorithm can be an alternative to the literature in terms of single-objective optimizationsolution ways. Vortex Optimization Algorithm (VOA is the name suggestion by the authors; for this new idea of intelligent optimization approach.

  8. Dissolved oxygen content prediction in crab culture using a hybrid intelligent method

    Science.gov (United States)

    Yu, Huihui; Chen, Yingyi; Hassan, Shahbazgul; Li, Daoliang

    2016-06-01

    A precise predictive model is needed to obtain a clear understanding of the changing dissolved oxygen content in outdoor crab ponds, to assess how to reduce risk and to optimize water quality management. The uncertainties in the data from multiple sensors are a significant factor when building a dissolved oxygen content prediction model. To increase prediction accuracy, a new hybrid dissolved oxygen content forecasting model based on the radial basis function neural networks (RBFNN) data fusion method and a least squares support vector machine (LSSVM) with an optimal improved particle swarm optimization(IPSO) is developed. In the modelling process, the RBFNN data fusion method is used to improve information accuracy and provide more trustworthy training samples for the IPSO-LSSVM prediction model. The LSSVM is a powerful tool for achieving nonlinear dissolved oxygen content forecasting. In addition, an improved particle swarm optimization algorithm is developed to determine the optimal parameters for the LSSVM with high accuracy and generalizability. In this study, the comparison of the prediction results of different traditional models validates the effectiveness and accuracy of the proposed hybrid RBFNN-IPSO-LSSVM model for dissolved oxygen content prediction in outdoor crab ponds.

  9. Improved NSGA-Ⅱ Multi-objective Genetic Algorithm Based on Hybridization-encouraged Mechanism

    Institute of Scientific and Technical Information of China (English)

    Sun Yijie; Shen Gongzhang

    2008-01-01

    To improve performances of muhi-objective optimization algorithms, such as convergence and diversity, a hybridization-encour-aged mechanism is proposed and realized in elitist nondominated sorting genetic algorithm (NSGA-Ⅱ). This mechanism uses the nor-malized distance to evaluate the difference among genes in a population. Three possible modes of crossover operators--"Max Distance", "Min-Max Distance", and "Neighboring-Max"--are suggested and analyzed. The mode of "Neighboring-Max", which not only takes advantage of hybridization but also improves the distribution of the population near Pareto optimal front, is chosen and used in NSGA-Ⅱ on the basis of bybridization-encouraged mechanism (short for HEM-based NSGA-II). To prove the HEM-based algorithm, several problems are studied by using standard NSGA-Ⅱ and the presented method. Different evaluation criteria are also used to judge these algorithms in terms of distribution of solutions, convergence, diversity, and quality of solutions. The numerical results indicate that the application of hybridization-encouraged mechanism could effectively improve the performances of genetic algorithm. Finally, as an example in engineering practices, the presented method is used to design a longitudinal flight control system, which demonstrates the obtainability of a reasonable and correct Pareto front.

  10. Improvement of Transient Stability in a Hybrid Power Multi-System Using a Designed NIDC (Novel Intelligent Damping Controller

    Directory of Open Access Journals (Sweden)

    Ting-Chia Ou

    2017-04-01

    Full Text Available This paper endeavors to apply a novel intelligent damping controller (NIDC for the static synchronous compensator (STATCOM to reduce the power fluctuations, voltage support and damping in a hybrid power multi-system. In this paper, we discuss the integration of an offshore wind farm (OWF and a seashore wave power farm (SWPF via a high-voltage, alternating current (HVAC electric power transmission line that connects the STATCOM and the 12-bus hybrid power multi-system. The hybrid multi-system consists of a battery energy storage system (BESS and a micro-turbine generation (MTG. The proposed NIDC consists of a designed proportional–integral–derivative (PID linear controller, an adaptive critic network and a proposed functional link-based novel recurrent fuzzy neural network (FLNRFNN. Test results show that the proposed controller can achieve better damping characteristics and effectively stabilize the network under unstable conditions.

  11. Creativity and Autonomy in Swarm Intelligence Systems

    OpenAIRE

    al-Rifaie, Mohammad Majid; Bishop,Mark; Caines, Suzanne

    2012-01-01

    This work introduces two swarm intelligence algorithms -- one mimicking the behaviour of one species of ants (\\emph{Leptothorax acervorum}) foraging (a `Stochastic Diffusion Search', SDS) and the other algorithm mimicking the behaviour of birds flocking (a `Particle Swarm Optimiser', PSO) -- and outlines a novel integration strategy exploiting the local search properties of the PSO with global SDS behaviour. The resulting hybrid algorithm is used to sketch novel drawings of an input image, ex...

  12. Hybrid Extragradient Iterative Algorithms for Variational Inequalities, Variational Inclusions, and Fixed-Point Problems

    Directory of Open Access Journals (Sweden)

    Lu-Chuan Ceng

    2012-01-01

    Full Text Available We investigate the problem of finding a common solution of a general system of variational inequalities, a variational inclusion, and a fixed-point problem of a strictly pseudocontractive mapping in a real Hilbert space. Motivated by Nadezhkina and Takahashi's hybrid-extragradient method, we propose and analyze new hybrid-extragradient iterative algorithm for finding a common solution. It is proven that three sequences generated by this algorithm converge strongly to the same common solution under very mild conditions. Based on this result, we also construct an iterative algorithm for finding a common fixed point of three mappings, such that one of these mappings is nonexpansive, and the other two mappings are strictly pseudocontractive mappings.

  13. Optimization of Turning Operations by Using a Hybrid Genetic Algorithm with Sequential Quadratic Programming

    Directory of Open Access Journals (Sweden)

    A. Belloufi*

    2013-01-01

    Full Text Available The determination of optimal cutting parameters is one of the most important elements in any process planning ofmetal parts. In this paper, a new hybrid genetic algorithm by using sequential quadratic programming is used for theoptimization of cutting conditions. It is used for the resolution of a multipass turning optimization case by minimizingthe production cost under a set of machining constraints. The genetic algorithm (GA is the main optimizer of thisalgorithm whereas SQP Is used to fine tune the results obtained from the GA. Furthermore, the convergencecharacteristics and robustness of the proposed method have been explored through comparisons with resultsreported in literature. The obtained results indicate that the proposed hybrid genetic algorithm by using a sequentialquadratic programming is effective compared to other techniques carried out by different researchers.

  14. A novel image compression-encryption hybrid algorithm based on the analysis sparse representation

    Science.gov (United States)

    Zhang, Ye; Xu, Biao; Zhou, Nanrun

    2017-06-01

    Recent advances on the compressive sensing theory were invoked for image compression-encryption based on the synthesis sparse model. In this paper we concentrate on an alternative sparse representation model, i.e., the analysis sparse model, to propose a novel image compression-encryption hybrid algorithm. The analysis sparse representation of the original image is obtained with an overcomplete fixed dictionary that the order of the dictionary atoms is scrambled, and the sparse representation can be considered as an encrypted version of the image. Moreover, the sparse representation is compressed to reduce its dimension and re-encrypted by the compressive sensing simultaneously. To enhance the security of the algorithm, a pixel-scrambling method is employed to re-encrypt the measurements of the compressive sensing. Various simulation results verify that the proposed image compression-encryption hybrid algorithm could provide a considerable compression performance with a good security.

  15. Hybrid particle swarm optimization algorithm based on quantum genetic%基于量子遗传的混合粒子群优化算法

    Institute of Scientific and Technical Information of China (English)

    赵莉; 董玉民

    2014-01-01

    为提高智能优化算法的性能,将其更好地应用到各个领域,提出了一种两阶段优化算法。在改进的量子遗传算法的基础上,进一步结合粒子群优化算法,构造了量子遗传-粒子群混合算法。通过量子遗传算法对问题进行初步求解,将第一阶段的优化结果作为粒子群算法的初始值,进行第二阶段的问题求解过程,得到问题的最终优化解。通过实验将该算法与传统优化算法进行比较,实验结果表明,该算法在性能方面有一定程度的提高。%To improve the performance of the intelligent optimization algorithm,making the optimization algorithm better appli-cable to various fields,a kind of two phase optimization algorithm was put forward.On the basis of the improved quantum gene-tic algorithm and further combined with particle swarm optimization algorithm,the quantum genetic-mixed particle swarm algo-rithm was constructed.First the problem was solved by quantum genetic algorithm preliminarily,and then the first stage optimi-zation results were taken as initial values for the second stage of the problem solving process to get the final optimization problem solution.The new hybrid algorithm was compared with the traditional optimization algorithm,the experimental results showed that the performance of the new algorithm had certain degree of improvement.

  16. Multi-objective optimization design of bridge piers with hybrid heuristic algorithms

    Institute of Scientific and Technical Information of China (English)

    Francisco J. MARTINEZ-MARTIN; Femando GONZALEZ-VIDOSA; Antonio HOSPITALER; Victor YEPES

    2012-01-01

    This paper describes one approach to the design of reinforced concrete (RC) bridge piers,using a three-hybrid multiobjective simulated annealing (SA) algorithm with a neighborhood move based on the mutation operator from the genetic algorithms (GAs),namely MOSAMO1,MOSAMO2 and MOSAMO3.The procedure is applied to three objective functions:the economic cost,the reinforcing steel congestion and the embedded CO2 emissions.Additional results for a random walk and a descent local search multi-objective algorithm are presented.The evaluation of solutions follows the Spanish Code for structural concrete.The methodology was applied to a typical bridge pier of 23,97 m in height.This example involved 110 design variables.Results indicate that algorithm MOSAMO2 outperforms other algorithms regarding the definition of Pareto fronts.Further,the proposed procedure will help structural engineers to enhance their bridge pier designs.

  17. A hybrid differential evolution algorithm for meta-task scheduling in grids

    Institute of Scientific and Technical Information of China (English)

    Kang Qinma; Jiang Changjun; He Hong; Huang Qiangsheng

    2009-01-01

    Task scheduling is one of the core steps to effectively exploit the capabilities of heterogeneous resources in the grid. This paper presents a new hybrid differential evolution (HDE) algorithm for finding an optimal or near-optimal schedule within reasonable time. The encoding scheme and the adaptation of classical differential evolution algorithm for dealing with discrete variables are discussed. A simple but effective local search is incorporated into differential evolution to stress exploitation. The performance of the proposed HDE algorithm is showed by being compared with a genetic algorithm (GA) on a known static benchmark for the problem. Experimental results indicate that the proposed algorithm has better performance than GA in terms of both solution quality and computational time, and thus it can be used to design efficient dynamic schedulers in batch mode for real grid systems.

  18. An Improved Artificial Bee Colony Algorithm for Solving Hybrid Flexible Flowshop With Dynamic Operation Skipping.

    Science.gov (United States)

    Li, Jun-Qing; Pan, Quan-Ke; Duan, Pei-Yong

    2016-06-01

    In this paper, we propose an improved discrete artificial bee colony (DABC) algorithm to solve the hybrid flexible flowshop scheduling problem with dynamic operation skipping features in molten iron systems. First, each solution is represented by a two-vector-based solution representation, and a dynamic encoding mechanism is developed. Second, a flexible decoding strategy is designed. Next, a right-shift strategy considering the problem characteristics is developed, which can clearly improve the solution quality. In addition, several skipping and scheduling neighborhood structures are presented to balance the exploration and exploitation ability. Finally, an enhanced local search is embedded in the proposed algorithm to further improve the exploitation ability. The proposed algorithm is tested on sets of the instances that are generated based on the realistic production. Through comprehensive computational comparisons and statistical analysis, the highly effective performance of the proposed DABC algorithm is favorably compared against several presented algorithms, both in solution quality and efficiency.

  19. Hammerstein Model Based RLS Algorithm for Modeling the Intelligent Pneumatic Actuator (IPA System

    Directory of Open Access Journals (Sweden)

    Siti Fatimah Sulaiman

    2017-08-01

    Full Text Available An Intelligent Pneumatic Actuator (IPA system is considered highly nonlinear and subject to nonlinearities which make the precise position control of this actuator is difficult to achieve. Thus, it is appropriate to model the system using nonlinear approach because the linear model sometimes not sufficient enough to represent the nonlinearity of the system in the real process. This study presents a new modeling of an IPA system using Hammerstein model based Recursive Least Square (RLS algorithm. The Hammerstein model is one of the blocks structured nonlinear models often used to model a nonlinear system and it consists of a static nonlinear block followed by a linear block of dynamic element. In this study, the static nonlinear block was represented by a deadzone of the pneumatic valve, while the linear block was represented by a dynamic element of IPA system. A RLS has been employed as the main algorithm in order to estimate the parameters of the Hammerstein model. The validity of the proposed model has been verified by conducting a real-time experiment. All of the criteria as outlined in the system identification’s procedures were successfully complied by the proposed Hammerstein model as it managed to provide a stable system, higher best fit, lower loss function and lower final prediction error than a linear model developed before. The performance of the proposed Hammerstein model in controlling the IPA’s positioning system is also considered good. Thus, this new developed Hammerstein model is sufficient enough to represents the IPA system utilized in this study.

  20. Application of an Intelligent Fuzzy Regression Algorithm in Road Freight Transportation Modeling

    Directory of Open Access Journals (Sweden)

    Pooya Najaf

    2013-07-01

    Full Text Available Road freight transportation between provinces of a country has an important effect on the traffic flow of intercity transportation networks. Therefore, an accurate estimation of the road freight transportation for provinces of a country is so crucial to improve the rural traffic operation in a large scale management. Accordingly, the focused case study database in this research is the information related to Iran’s provinces in the year 2008. Correlation between road freight transportation with variables such as transport cost and distance, population, average household income and Gross Domestic Product (GDP of each province is calculated. Results clarify that the population is the most effective factor in the prediction of provinces’ transported freight. Linear Regression Model (LRM is calibrated based on the population variable, and afterwards Fuzzy Regression Algorithm (FRA is generated on the basis of the LRM. The proposed FRA is an intelligent modified algorithm with an accurate prediction and fitting ability. This methodology can be significantly useful in macro-level planning problems where decreasing prediction error values is one of the most important concerns for decision makers. In addition, Back-Propagation Neural Network (BPNN is developed to evaluate the prediction capability of the models and to be compared with FRA. According to the final results, the modified FRA estimates road freight transportation values more accurately than the BPNN and LRM. Finally, in order to predict the road freight transportation values, the reliability of the calibrated models is analyzed using the information of the year 2009. Results show higher reliability for the proposed modified FRA.