List of Articles Genetic algorithm

• Open Access Article
  • Abstract Page
  • Full-Text
  
  1 - Applying genetic algorithm for automatic service identification based on quality metrics
  Jan Mohammad Rajabi saeed parsa masoud bagheri ali akbar
  Service-oriented architecture improves the stability and operational capability of software systems for passive defense measures. Automatic identification of services using quality of service measures ensures the successful deployment of service-oriented architecture an More

  Service-oriented architecture improves the stability and operational capability of software systems for passive defense measures. Automatic identification of services using quality of service measures ensures the successful deployment of service-oriented architecture and is great importance to speed up software development life cycle. Little attention to non-functional requirements, no considerations for concurrent effects of business activities and entities and non-automated ranking of candidate services are the major issues with current approaches. The approach proposed in this paper considers both the business processes and entities, simultaneously to detect services. Applying a genetic algorithm, candidate services are identified based on quality metrics i.e. granularity, coupling, cohesion and convergence. These metrics are obtained from breaking goals to requirements of level. The TOPSIS method is applied to rank the candidate services. The illustrated case study is shown that high quality services can be identified automatically with minimal software developer’s interventions. Manuscript profile
• Open Access Article
  • Abstract Page
  • Full-Text
  
  2 - Determination of Optimum SVMs Based on Genetic Algorithm in Classification of Hyper spectral Imagery
  farhad samadzadegan hadise hassani
  Hyper spectral remote sensing imagery, due to its rich source of spectral information provides an efficient tool for ground classifications in complex geographical areas with similar classes. Referring to robustness of Support Vector Machines (SVMs) in high dimensional More

  Hyper spectral remote sensing imagery, due to its rich source of spectral information provides an efficient tool for ground classifications in complex geographical areas with similar classes. Referring to robustness of Support Vector Machines (SVMs) in high dimensional space, they are efficient tool for classification of hyper spectral imagery. However, there are two optimization issues which strongly effect on the SVMs performance: Optimum SVMs parameters determination and optimum feature subset selection. Traditional optimization algorithms are appropriate in limited search space but they usually trap in local optimum in high dimensional space, therefore it is inevitable to apply meta-heuristic optimization algorithms such as Genetic Algorithm to obtain global optimum solution. This paper evaluates the potential of different proposed optimization scenarios in determining of SVMs parameters and feature subset selection based on Genetic Algorithm (GA). Obtained results on AVIRIS Hyper spectral imagery demonstrate superior performance of SVMs achieved by simultaneously optimization of SVMs parameters and input feature subset. In Gaussian and Polynomial kernels, the classification accuracy improves by about 5% and15% respectively and more than 90 redundant bands are eliminated. For comparison, the evaluation is also performed by applying it to Simulated Annealing (SA) that shows a better performance of Genetic Algorithm especially in complex search space where parameter determination and feature selection are solve simultaneously. Manuscript profile
• Open Access Article
  • Abstract Page
  • Full-Text
  
  3 - Using a Hybrid PSO-GA Method for Capacitor Placement in Distribution Systems
  mohammadmahdi Varahram amir mohammadi
  In this paper, we have proposed a new algorithm which combines PSO and GA in such a way that the new algorithm is more effective and efficient.The particle swarm optimization (PSO) algorithm has shown rapid convergence during the initial stages of a global search but ar More

  In this paper, we have proposed a new algorithm which combines PSO and GA in such a way that the new algorithm is more effective and efficient.The particle swarm optimization (PSO) algorithm has shown rapid convergence during the initial stages of a global search but around global optimum, the search process will become very slow. On the other hand, genetic algorithm is very sensitive to the initial population. In fact, the random nature of the GA operators makes the algorithm sensitive to the initial population. This dependence to the initial population is in such a manner that the algorithm may not converge if the initial population is not well selected. This new algorithm can perform faster and does not depend on initial population and can find optimal solutions with acceptable accuracy. Optimal capacitor placement and sizing have been found using this hybrid PSO-GA algorithm. We have also found the optimal place and size of capacitors using GA and PSO separately and compared the results. Manuscript profile
• Open Access Article
  • Abstract Page
  • Full-Text
  
  4 - Scheduling tasks in cloud environments using mapping framework - reduction and genetic algorithm
  nima khezr nima jafari novimipour
  Task scheduling is a vital component of any distributed system such as grids, clouds, and peer-to-peer networks that refer tasks to appropriate resources for execution. Common scheduling methods have disadvantages such as high time complexity, inconsistent execution of More

  Task scheduling is a vital component of any distributed system such as grids, clouds, and peer-to-peer networks that refer tasks to appropriate resources for execution. Common scheduling methods have disadvantages such as high time complexity, inconsistent execution of input tasks, and increased program execution time. Exploration-based scheduling algorithms to prioritize tasks from Manuscript profile
• Open Access Article
  • Abstract Page
  • Full-Text
  
  5 - Multimodal Biometric Recognition Using Particle Swarm Optimization-Based Selected Features
  Sara Motamed Ali Broumandnia Azam sadat  Nourbakhsh
  10.7508/jist.2013.02.002
  Feature selection is one of the best optimization problems in human recognition, which reduces the number of features, removes noise and redundant data in images, and results in high rate of recognition. This step affects on the performance of a human recognition system More

  Feature selection is one of the best optimization problems in human recognition, which reduces the number of features, removes noise and redundant data in images, and results in high rate of recognition. This step affects on the performance of a human recognition system. This paper presents a multimodal biometric verification system based on two features of palm and ear which has emerged as one of the most extensively studied research topics that spans multiple disciplines such as pattern recognition, signal processing and computer vision. Also, we present a novel Feature selection algorithm based on Particle Swarm Optimization (PSO). PSO is a computational paradigm based on the idea of collaborative behavior inspired by the social behavior of bird flocking or fish schooling. In this method, we used from two Feature selection techniques: the Discrete Cosine Transforms (DCT) and the Discrete Wavelet Transform (DWT). The identification process can be divided into the following phases: capturing the image; pre-processing; extracting and normalizing the palm and ear images; feature extraction; matching and fusion; and finally, a decision based on PSO and GA classifiers. The system was tested on a database of 60 people (240 palm and 180 ear images). Experimental results show that the PSO-based feature selection algorithm was found to generate excellent recognition results with the minimal set of selected features. Manuscript profile
• Open Access Article
  • Abstract Page
  • Full-Text
  
  6 - Handwritten Digits Recognition Using an Ensemble Technique Based on the Firefly Algorithm
  Azar Mahmoodzadeh Hamed Agahi Marzieh  Salehi
  10.7508/jist.2018.03.003
  This paper develops a multi-step procedure for classifying Farsi handwritten digits using a combination of classifiers. Generally, the technique relies on extracting a set of characteristics from handwritten samples, training multiple classifiers to learn to discriminat More

  This paper develops a multi-step procedure for classifying Farsi handwritten digits using a combination of classifiers. Generally, the technique relies on extracting a set of characteristics from handwritten samples, training multiple classifiers to learn to discriminate between digits, and finally combining the classifiers to enhance the overall system performance. First, a pre-processing course is performed to prepare the images for the main steps. Then three structural and statistical characteristics are extracted which include several features, among which a multi-objective genetic algorithm selects those more effective ones in order to reduce the computational complexity of the classification step. For the base classification, a decision tree (DT), an artificial neural networks (ANN) and a k-nearest neighbor (KNN) models are employed. Finally, the outcomes of the classifiers are fed into a classifier ensemble system to make the final decision. This hybrid system assigns different weights for each class selected by each classifier. These voting weights are adjusted by a metaheuristic firefly algorithm which optimizes the accuracy of the overall system. The performance of the implemented approach on the standard HODA dataset is compared with the base classifiers and some state-of-the-art methods. Evaluation of the proposed technique demonstrates that the proposed hybrid system attains high performance indices including accuracy of 98.88% with only eleven features. Manuscript profile
• Open Access Article
  • Abstract Page
  • Full-Text
  
  7 - Reducing Energy Consumption in Sensor-Based Internet of Things Networks Based on Multi-Objective Optimization Algorithms
  Mohammad sedighimanesh Hessam  Zandhessami Mahmood  Alborzi Mohammadsadegh  Khayyatian
  10.52547/jist.15639.10.39.180
  Energy is an important parameter in establishing various communications types in the sensor-based IoT. Sensors usually possess low-energy and non-rechargeable batteries since these sensors are often applied in places and applications that cannot be recharged. The mos More

  Energy is an important parameter in establishing various communications types in the sensor-based IoT. Sensors usually possess low-energy and non-rechargeable batteries since these sensors are often applied in places and applications that cannot be recharged. The most important objective of the present study is to minimize the energy consumption of sensors and increase the IoT network's lifetime by applying multi-objective optimization algorithms when selecting cluster heads and routing between cluster heads for transferring data to the base station. In the present article, after distributing the sensor nodes in the network, the type-2 fuzzy algorithm has been employed to select the cluster heads and also the genetic algorithm has been used to create a tree between the cluster heads and base station. After selecting the cluster heads, the normal nodes become cluster members and send their data to the cluster head. After collecting and aggregating the data by the cluster heads, the data is transferred to the base station from the path specified by the genetic algorithm. The proposed algorithm was implemented with MATLAB simulator and compared with LEACH, MB-CBCCP, and DCABGA protocols, the simulation results indicate the better performance of the proposed algorithm in different environments compared to the mentioned protocols. Due to the limited energy in the sensor-based IoT and the fact that they cannot be recharged in most applications, the use of multi-objective optimization algorithms in the design and implementation of routing and clustering algorithms has a significant impact on the increase in the lifetime of these networks. Manuscript profile
• Open Access Article
  • Abstract Page
  • Full-Text
  
  8 - A Task Mapping and Scheduling Algorithm based on Genetic Algorithm for Embedded System Design
  mohadese nikseresht Mohsen Raji
  Embedded system designers face numerous design requirements and objectives (such as runtime, power consumption and reliability). Since meeting one of these requirements mostly contradicts other design requirements, it seem to be inevitable to apply multi-objective appr More

  Embedded system designers face numerous design requirements and objectives (such as runtime, power consumption and reliability). Since meeting one of these requirements mostly contradicts other design requirements, it seem to be inevitable to apply multi-objective approaches in various stages of designing embedded systems, including task scheduling step. In this paper, a multi-objective task mapping and scheduling in the design stage of the embedded system is presented. In this method, tasks are represented by task graphs assuming that the hardware architecture platform is given and determined. In order to manage the dependencies between tasks in the task graph, a segmentation method is used, in which the tasks that can be executed simultaneously are specified in a segment and is considered in the scheduling process. In the proposed method, the task mapping and scheduling problem is modeled as a genetic algorithm-based multi-objective optimization problem considering execution time, energy consumption, and reliability. In comparison to similar previous works, the proposed scheduling method respectively provides 21.4%, 19.2%, and 20% improvement in execution time, energy consumption, and reliability. Applying a multi-objective helps the designer to pick out the best outcome according to different considerations. Manuscript profile
• Open Access Article
  • Abstract Page
  • Full-Text
  
  9 - Presenting the model for opinion mining at the document feature level for hotel users' reviews
  ELHAM KHALAJJ shahriyar mohammadi
  Nowadays, online review of user’s sentiments and opinions on the Internet is an important part of the process of people deciding whether to choose a product or use the services provided. Despite the Internet platform and easy access to blogs related to opinions in the More

  Nowadays, online review of user’s sentiments and opinions on the Internet is an important part of the process of people deciding whether to choose a product or use the services provided. Despite the Internet platform and easy access to blogs related to opinions in the field of tourism and hotel industry, there are huge and rich sources of ideas in the form of text that people can use text mining methods to discover the opinions of. Due to the importance of user's sentiments and opinions in the industry, especially in the tourism and hotel industry, the topics of opinion research and analysis of emotions and exploration of texts written by users have been considered by those in charge. In this research, a new and combined method based on a common approach in sentiment analysis, the use of words to produce characteristics for classifying reviews is presented. Thus, the development of two methods of vocabulary construction, one using statistical methods and the other using genetic algorithm is presented. The above words are combined with the Vocabulary of public feeling and standard Liu Bing classification of prominent words to increase the accuracy of classification Manuscript profile
• Open Access Article
  • Abstract Page
  • Full-Text
  
  10 - Solve the issue of project scheduling in a steady state with resource constraints and timing of delivery intervals
  Meysam Jafari Eskandari rozbeh azizmohammadi
  Due to considering the real conditions of project and solving manager’s problems, the primary methods development of scheduling for projects has recently drawn researcher’s attentions so that these methods are looking for finding optimal sequence to realize project goal More

  Due to considering the real conditions of project and solving manager’s problems, the primary methods development of scheduling for projects has recently drawn researcher’s attentions so that these methods are looking for finding optimal sequence to realize project goals and to provide its constraints such as dependence, resource constraint (renewable and non-renewable). The importance of these issues has practically and theoretically led researchers to do much efforts on different conditions of issues for project schedule, various methods to solve and or to develop each of them. In this research based on selection of some executive methods for any activity with renewable and non-renewable resource and considering prerequisite relation from kind of start to end and having delivery time for any activity in two time periods that has been provided with regard to delivery time of penalty cost with delay or without delay. The presented model has been solved in small scale by gams software and in small, medium and large scale using meta-heuristic Methods of NSGA ll and cuckoo after coding in software of matlab 2013. The comparison of the answer obtained from the above algorithm indicates the better performance of genetic algorithm in most indexes and cuckoo algorithm has superiority on time index of problem solving. Manuscript profile
• Open Access Article
  • Abstract Page
  • Full-Text
  
  11 - A New Evolutionary Estimation of Distribution Algorithm Based on Learning Automata
  M. R. Meybodi
  In order to overcome the poor behaviors of genetic algorithms in some problems other classes of evolutionary algorithms have been recently developed by researchers. Although these algorithms do not have the simplicity of classic genetic algorithms but they are superior More

  In order to overcome the poor behaviors of genetic algorithms in some problems other classes of evolutionary algorithms have been recently developed by researchers. Although these algorithms do not have the simplicity of classic genetic algorithms but they are superior to genetic algorithms. The Probabilistic Model Building Genetic Algorithms or Estimation of Distribution Algorithms (EDAs) is one of these classes which is recently developed. In this paper we introduce a new estimation of distribution algorithm based on Learning Automata. The proposed algorithm is a model based search optimization method that uses a set of learning automata as a probabilistic model of the population of solutions in the search space. The proposed algorithm is a simple algorithm which has produced good results for the optimization problems considered in this problem. Manuscript profile
• Open Access Article
  • Abstract Page
  • Full-Text
  
  12 - Combined Subtransmission Substation and Network Expansion Planning Using Genetic Algorithm, Ant Colony algorithm, and hybrid Ant Colony and Genetic Algorithm
  V. Amir H. Seifi S. M. Sepasian g. r. yousefi
  This research presents new algorithms for subtransmission simultaneous substation and network expansion planning. Given an existing system model, the projected load growth in a target year and various system expansion options, the algorithms find the optimal mix of sys More

  This research presents new algorithms for subtransmission simultaneous substation and network expansion planning. Given an existing system model, the projected load growth in a target year and various system expansion options, the algorithms find the optimal mix of system expansion options to minimize the cost function subject to various system constraints and single contingencies on lines and transformers. The system expansion options considered include building new subtransmission lines/substations, the capacity to be upgraded and the service area of HV/MV substations. In this research, Genetic Algorithm (GA) with new coding, Ant Colony algorithm (AC) and hybrid Ant Colony and Genetic Algorithm (AC&GA) methods are employed. The optimization results are compared with successive elimination method to demonstrate the performance improvement. Manuscript profile
• Open Access Article
  • Abstract Page
  • Full-Text
  
  13 - An Intelligent BGSA Based Method for Feature Selection in a Persian Handwritten Digits Recognition System
  N. Ghanbari S. M. Razavi S. H. Nabavi Karizi
  In this paper, an intelligent feature selection method for recognition of Persian handwritten digits is presented. The fitness function associated with the error in the Persian handwritten digits recognition system is minimized, by selecting the appropriate features, us More

  In this paper, an intelligent feature selection method for recognition of Persian handwritten digits is presented. The fitness function associated with the error in the Persian handwritten digits recognition system is minimized, by selecting the appropriate features, using binary gravitational search algorithm. Implementation results show that the use of intelligent methods is well able to choose the most effective features for this recognition system. The results of the proposed method in comparison with other similar methods based on genetic algorithm and binary particle method of optimizing indicates the effective performance of the proposed method. Manuscript profile
• Open Access Article
  • Abstract Page
  • Full-Text
  
  14 - A New Formulation for the Probabilistic Congestion Management Using Chance Constrained Programming
  M. Hojjat M. H. Javidi
  In this paper, a new method for probabilistic congestion management considering power system uncertainties is proposed. Chance constrained programming (CCP) is used to formulate the probabilistic congestion management as an efficient approach for stochastic optimization More

  In this paper, a new method for probabilistic congestion management considering power system uncertainties is proposed. Chance constrained programming (CCP) is used to formulate the probabilistic congestion management as an efficient approach for stochastic optimization problems. The CCP based probabilistic congestion management is solved utilizing a numerical approach by applying the Monte-Carlo technique into the real-coded genetic algorithm. The effectiveness of the proposed method is evaluated applying the method to the modified IEEE 9-bus test system. The results of the proposed approach are compared with those of the expected method to have a comprehensive study. The simulation results reflect the flexibility of the proposed approach in transmission congestion management. Manuscript profile
• Open Access Article
  • Abstract Page
  • Full-Text
  
  15 - Application of Epsilon Variable-Multi Objective Genetic Algorithm for Multi-Objective Optimal Power Flow with TCSC
  E. Afzalan M. Joorabian
  This paper ε-multi objective genetic algorithm variable (εV-MOGA) to optimize cost of generation, emission and active power transmission loss of flexible ac transmission systems (FACTS) device-equipped power systems. In the proposed approach, optimal power flow problem More

  This paper ε-multi objective genetic algorithm variable (εV-MOGA) to optimize cost of generation, emission and active power transmission loss of flexible ac transmission systems (FACTS) device-equipped power systems. In the proposed approach, optimal power flow problem is formulated as a multi-objective optimization problem. FACTS devices considered include thyristor controlled series capacitor (TCSC). The proposed approach has been examined and tested on the modified IEEE 57-bus test system. The results obtained from the proposed approach have been compared with those obtained from nondominated sorting genetic algorithm-II, multi-objective differential evolution. Manuscript profile
• Open Access Article
  • Abstract Page
  • Full-Text
  
  16 - A Semi-Central Method to Improve Energy Saving in Real Wireless Sensor Networks Using Clustering and Mobile Sinks
  Fatemeh Sadeghi Sepideh Adabi Sahar Adabi
  Applying a hierarchical routing approach based on clustering technique and mobile sink has a great impact on reducing energy consumption in WSN. Two important issues in designing such an approach are cluster head selection and optimal allocation of mobile sinks to criti More

  Applying a hierarchical routing approach based on clustering technique and mobile sink has a great impact on reducing energy consumption in WSN. Two important issues in designing such an approach are cluster head selection and optimal allocation of mobile sinks to critical regions (i.e., regions those have low remaining energy and thus, high risk of energy hole problem). The limited number of mobile sinks should be utilized due to a high cost. Therefore, allocating the limited number of mobile sinks to the high amount of requests received from the critical regions is categorized as a NP-hard problem. Most of the previous studies address this problem by using heuristic methods which are carried out by sensor nodes. However, this type of solutions cannot be implemented in real WSN due to the sensors’ current technology and their limited processing capability. In other words, these are just theoretical solutions. Consequently, a semi-central genetic algorithm based method using mobile sink and clustering technique is proposed in order to find a trade-off between reduction of computation load on the sensors and increasing accuracy. In our method, lightweight computations are separated from heavyweight computations. While, the former computations are carried out by sensors, the latter are carried out by base station. Following activities are done by the authors: 1) cluster head selection by using effective environmental parameters and defining cost function of cluster membership, 2) mathematical modeling of a region’s chance to achieve mobile sink, and 3) designing a fitness function to evaluate the fitness of each allocation of mobile sinks to the critical regions in genetic algorithm. Furthermore, in our activities minimizing the number and length of messages are focused. In summary, the main distinguishing feature of the proposed method is that it can be implemented in real WSN (due to separation of lightweight computations from heavyweight computations) with respect to early mentioned objectives. The simulation results show the better performance of the proposed method compared to comparison bases. Manuscript profile
• Open Access Article
  • Abstract Page
  • Full-Text
  
  17 - Increasing Image Quality in Image Steganography Using Genetic Algorithm and Reversible Mapping
  Saeed TorabiTorbati مرتضی خادمی عباس ابراهیمی مقدم
  One of the evaluation methods for image steganography is preserving cover image quality and algorithm imperceptibility. Placing hidden information should be done in such a way that there is minimal change in quality between the cover image and the coded image (stego ima More

  One of the evaluation methods for image steganography is preserving cover image quality and algorithm imperceptibility. Placing hidden information should be done in such a way that there is minimal change in quality between the cover image and the coded image (stego image). The quality of the stego image is mainly influenced by the replacement method and the amount of hidden information or the replacement capacity. This can be treated as an optimization problem and a quality function can be considered for optimization. The variables of this function are the mappings applied to the cover image and the hidden information and location of the information. In the proposed method, by genetic algorithm and using the two concepts of targeted search and aimless search, the appropriate location and state for placement in the least significant bits of the cover image are identified. In this method, hidden information can be extracted completely and without error. This feature is important for management systems and cloud networks that use steganography to store information. Finally, the proposed method is tested and the results are compared with other methods in this field. The proposed method, in addition to maintaining the stego image quality, which is optimized based on PSNR, has also shown good performance in examining histogram and NIQE statistical criteria. Manuscript profile
• Open Access Article
  • Abstract Page
  • Full-Text
  
  18 - Optimum orientation of the building with the aim of optimal shading and reducing energy consumption (Case Study: Tehran Music Hall)
  Tiam Aram Javad Eiraji
  The increasing trend of population growth, the energy crisis, and the depletion of energy resources on the planet are all warnings for all sciences and in all fields and professions in order to help sustain the existing situation. Since a large amount of energy consumpt More

  The increasing trend of population growth, the energy crisis, and the depletion of energy resources on the planet are all warnings for all sciences and in all fields and professions in order to help sustain the existing situation. Since a large amount of energy consumption in the world is spent on construction purposes, specifically on cooling and heating loads and creating thermal comfort in the building, a study in this field is significantly important. In this research, by choosing a building as a case study, the amount of sunlight received by vertical surfaces has been investigated. Then, using the simulation method and related software, different angles between zero and 180 degrees of rotation are considered for the building to optimize the orientation angle of the building. The optimal angle means that the minimum amount of solar energy is received on vertical surfaces and the maximum amount of shading. Numerous research has been conducted in the past years about the amount of sunlight received in the building and the optimal angle. However, the used software and the measurement on vertical surfaces in Tehran in this research are considered research innovations. The optimal angle results from building energy analysis charts are displayed in this research. Manuscript profile