scholarly journals Information Theoretic Objective Function for Genetic Software Clustering

Proceedings ◽  
2019 ◽  
Vol 46 (1) ◽  
pp. 18
Author(s):  
Habib Izadkhah ◽  
Mahjoubeh Tajgardan
Keyword(s):  
Genetic Algorithm ◽  
Genetic Algorithms ◽  
Objective Function ◽  
High Performance ◽  
Evolutionary Process ◽  
Program Comprehension ◽  
Software Systems ◽  
Objective Functions ◽  
Information Theoretic ◽  
Software Clustering

Software clustering is usually used for program comprehension. Since it is considered to be the most crucial NP-complete problem, several genetic algorithms have been proposed to solve this problem. In the literature, there exist some objective functions (i.e., fitness functions) which are used by genetic algorithms for clustering. These objective functions determine the quality of each clustering obtained in the evolutionary process of the genetic algorithm in terms of cohesion and coupling. The major drawbacks of these objective functions are the inability to (1) consider utility artifacts, and (2) to apply to another software graph such as artifact feature dependency graph. To overcome the existing objective functions’ limitations, this paper presents a new objective function. The new objective function is based on information theory, aiming to produce a clustering in which information loss is minimized. For applying the new proposed objective function, we have developed a genetic algorithm aiming to maximize the proposed objective function. The proposed genetic algorithm, named ILOF, has been compared to that of some other well-known genetic algorithms. The results obtained confirm the high performance of the proposed algorithm in solving nine software systems. The performance achieved is quite satisfactory and promising for the tested benchmarks.

Scalable Computing Architecture for Time-Dependent Transportation Optimization Problems Based on High-Performance Computing Techniques

2019 ◽  
Vol 2673 (4) ◽  
pp. 205-216 ◽  
Author(s):  
Pengfei (Taylor) Li ◽  
Peirong (Slade) Wang ◽  
Farzana Chowdhury ◽  
Li Zhang
Keyword(s):  
Objective Function ◽  
High Performance Computing ◽  
High Performance ◽  
Optimization Problems ◽  
Dynamic Network ◽  
Alternative Formulation ◽  
High Fidelity ◽  
Objective Functions ◽  
Performance Computing ◽  
Transportation Optimization

Traditional formulations for transportation optimization problems mostly build complicating attributes into constraints while keeping the succinctness of objective functions. A popular solution is the Lagrangian decomposition by relaxing complicating constraints and then solving iteratively. Although this approach is effective for many problems, it generates intractability in other problems. To address this issue, this paper presents an alternative formulation for transportation optimization problems in which the complicating attributes of target problems are partially or entirely built into the objective function instead of into the constraints. Many mathematical complicating constraints in transportation problems can be efficiently modeled in dynamic network loading (DNL) models based on the demand–supply equilibrium, such as the various road or vehicle capacity constraints or “IF–THEN” type constraints. After “pre-building” complicating constraints into the objective functions, the objective function can be approximated well with customized high-fidelity DNL models. Three types of computing benefits can be achieved in the alternative formulation: ( a) the original problem will be kept the same; ( b) computing complexity of the new formulation may be significantly reduced because of the disappearance of hard constraints; ( c) efficiency loss on the objective function side can be mitigated via multiple high-performance computing techniques. Under this new framework, high-fidelity and problem-specific DNL models will be critical to maintain the attributes of original problems. Therefore, the authors’ recent efforts in enhancing the DNL’s fidelity and computing efficiency are also described in the second part of this paper. Finally, a demonstration case study is conducted to validate the new approach.

scholarly journals Optimalisasi Penyelesaian Knapsack Problem Dengan Algoritma Genetika

2016 ◽  
pp. 182
Author(s):  
I Wayan Supriana
Keyword(s):  
Genetic Algorithm ◽  
Genetic Algorithms ◽  
Everyday Life ◽  
Knapsack Problem ◽  
Selection Process ◽  
Optimization Algorithms ◽  
Evolutionary Process ◽  
Knapsack Problems ◽  
Theory Of Evolution ◽  
Selection Of

Knapsack problems is a problem that often we encounter in everyday life. Knapsack problem itself is a problem where a person faced with the problems of optimization on the selection of objects that can be inserted into the container which has limited space or capacity. Problems knapsack problem can be solved by various optimization algorithms, one of which uses a genetic algorithm. Genetic algorithms in solving problems mimicking the theory of evolution of living creatures. The components of the genetic algorithm is composed of a population consisting of a collection of individuals who are candidates for the solution of problems knapsack. The process of evolution goes dimulasi of the selection process, crossovers and mutations in each individual in order to obtain a new population. The evolutionary process will be repeated until it meets the criteria o f an optimum of the resulting solution. The problems highlighted in this research is how to resolve the problem by applying a genetic algorithm knapsack. The results obtained by the testing of the system is built, that the knapsack problem can optimize the placement of goods in containers or capacity available. Optimizing the knapsack problem can be maximized with the appropriate input parameters.

Optimal Design of 6-UPU Parallel Mechanism

2011 ◽  
Vol 480-481 ◽  
pp. 1055-1060
Author(s):  
Guang Hua Wu ◽  
Lie Hang Gong ◽  
Xin Wei Ji ◽  
Zhong Jun Wu ◽  
Yong Jun Gai
Keyword(s):  
Genetic Algorithm ◽  
Genetic Algorithms ◽  
Optimal Design ◽  
Objective Function ◽  
Parallel Mechanism ◽  
Design Space ◽  
Jacobian Matrix ◽  
Optimal Model ◽  
The Real ◽  
Universal Joints

The methodology of the optimal design for the 6-UPU parallel mechanism (PM) is presented based on genetic algorithms. The optimal index which expressed by Jacobian matrix of the PM is first deduced. An optimal model is established, in which the kinematic dexterity of a parallel mechanism is considered as the objective function. The design space, the limiting length of the electric actuators and the limit angles of universal joints are taken as constraints. The real-encoding genetic algorithm is applied to the optimal design of a parallel mechanism, which is proved the validity and advantage for the optimal design of a similar mechanism.

A Genetic Engineering Approach to Genetic Algorithms

2001 ◽  
Vol 9 (1) ◽  
pp. 71-92 ◽  
Author(s):  
John S. Gero ◽  
Vladimir Kazakov
Keyword(s):  
Genetic Algorithm ◽  
Genetic Algorithms ◽  
Genetic Engineering ◽  
Genetic Material ◽  
Evolutionary Process ◽  
Automatic Generation ◽  
Engineering Approach ◽  
Standard Genetic Algorithm

We present an extension to the standard genetic algorithm (GA), which is based on concepts of genetic engineering. The motivation is to discover useful and harmful genetic materials and then execute an evolutionary process in such a way that the population becomes increasingly composed of useful genetic material and increasingly free of the harmful genetic material. Compared to the standard GA, it provides some computational advantages as well as a tool for automatic generation of hierarchical genetic representations specifically tailored to suit certain classes of problems.

scholarly journals Mixed genetic algorithm for optimization of trusses

2008 ◽  
Vol 48 ◽  
Author(s):  
Dmitrij Šešok
Keyword(s):  
Genetic Algorithm ◽  
Genetic Algorithms ◽  
Finite Elements ◽  
Shape Optimization ◽  
Objective Function ◽  
Objective Function Value ◽  
Finite Elements Method ◽  
Topology And Shape Optimization ◽  
Mixed Genetic Algorithm

In this paper two strategies of optimization are compared: sequential and synchronous topology and shape optimization of trusses. Genetic algorithms are used for optimization. A task of optimization of truss withtwelve possible nodes is solved. Finite elements method is used to calculate an objective function value. Software used in calculations was created by the author.

Application of Genetic Algorithm for the Support Location Optimization of Beams

1994 ◽  
Author(s):  
Bo Ping Wang ◽  
Jahau Lewis Chen
Keyword(s):  
Genetic Algorithm ◽  
Genetic Algorithms ◽  
Natural Selection ◽  
Optimal Design ◽  
Design Process ◽  
Evolutionary Process ◽  
Location Optimization ◽  
Adaptive Procedures ◽  
Rigid Supports ◽  
Selection Of

Abstract Genetic algorithms are adaptive procedures that find solutions to problems by an evolutionary process that mimics natural selection. In this paper, the use of genetic algorithms for the selection of optimal support locations of beams is presented. Both elastic and rigid supports are considered. The approach of adapting the genetic algorithms into the optimal design process is described This approach is used to optimize locations of three supports for beam with three types of boundary conditions.

Application of Genetic Algorithms to the Synthesis of Riser Configurations

2003 ◽  
Author(s):  
Luciano T. Vieira ◽  
Beatriz de S. L. P. de Lima ◽  
Alexandre G. Evsukoff ◽  
Breno P. Jacob
Keyword(s):  
Genetic Algorithm ◽  
Genetic Algorithms ◽  
Search Space ◽  
Optimization Techniques ◽  
Objective Functions ◽  
Random Choice ◽  
Large Space ◽  
Steel Catenary Riser ◽  
Deep Waters ◽  
Optimization Methodology

The purpose of this work is to describe the application of Genetic Algorithms in the search of the best configuration of catenary riser systems in deep waters. Particularly, an optimization methodology based on genetic algorithms is implemented on a computer program, in order to seek an optimum geometric configuration for a steel catenary riser in a lazy-wave configuration. This problem is characterized by a very large space of possible solutions; the use of traditional methods is an exhaustive work, since there is a large number of variables and parameters that define this type of system. Genetic algorithms are more robust than the more commonly used optimization techniques. They use random choice as a tool to guide a search toward regions of the search space with likely improvements. Some differences such as the coding of the parameter set, the search from a population of points, the use of objective functions and randomized operators are factors that contribute to the robustness of a genetic algorithm and result in advantages over traditional techniques. The implemented methodology has as baseline one or more criteria established by the experience of the offshore engineer. The implementation of an intelligent methodology oriented specifically to the optimization and synthesis of riser configurations will not only facilitate the work of manipulating a huge mass of data, but also assure the best alternative between all the possible ones, searching in a much larger space of possible solutions than classical methods.

Workshop Layout Optimization Based on Genetic Algorithm

2012 ◽  
Vol 591-593 ◽  
pp. 169-173 ◽  
Author(s):  
Long Qiao ◽  
Hong Bin Yu ◽  
Jian Jun Sun
Keyword(s):  
Genetic Algorithm ◽  
Genetic Algorithms ◽  
Objective Function ◽  
Material Handling ◽  
Job Shop ◽  
Job Shops ◽  
Transfer Time ◽  
Set Up ◽  
Material Handling Costs ◽  
First Time

To shorten the transfer time of workpiece in job shop, it is necessary to optimize the equipment arrangement of job shops based on the technological process of workpiece. The objective function only considers the material handling costs, but it ignores the geometry of the workshop area utilization and so on factors. We propose and take an objective function that considers material handling costs and utilization proposed at the same time. And we set up an optimization model of facility layout is proposed and genetic algorithms is used to solve this mode1. The author brings forward the concept of carry quadrature for the first time. It is good to use this concept for the workshop in which many kinds of workpiece are produced. The result of optimal design is consonant with the desire of actual manufacture.

scholarly journals Software Systems Clustering Using Estimation of Distribution Approach

2016 ◽  
Vol 8 (2) ◽  
pp. 99-113 ◽  
Author(s):  
Mahjoubeh Tajgardan ◽  
Habib Izadkhah ◽  
Shahriar Lotfi
Keyword(s):  
Genetic Algorithms ◽  
Probabilistic Models ◽  
Evolutionary Process ◽  
Solution Space ◽  
Building Blocks ◽  
Genetic Operators ◽  
Software Clustering ◽  
Mutation Operators ◽  
Estimation Of Distribution ◽  
Crossover And Mutation

AbstractSoftware clustering is usually used for program understanding. Since the software clustering is a NP-complete problem, a number of Genetic Algorithms (GAs) are proposed for solving this problem. In literature, there are two wellknown GAs for software clustering, namely, Bunch and DAGC, that use the genetic operators such as crossover and mutation to better search the solution space and generating better solutions during genetic algorithm evolutionary process. The major drawbacks of these operators are (1) the difficulty of defining operators, (2) the difficulty of determining the probability rate of these operators, and (3) do not guarantee to maintain building blocks. Estimation of Distribution (EDA) based approaches, by removing crossover and mutation operators and maintaining building blocks, can be used to solve the problems of genetic algorithms. This approach creates the probabilistic models from individuals to generate new population during evolutionary process, aiming to achieve more success in solving the problems. The aim of this paper is to recast EDA for software clustering problems, which can overcome the existing genetic operators’ limitations. For achieving this aim, we propose a new distribution probability function and a new EDA based algorithm for software clustering. To the best knowledge of the authors, EDA has not been investigated to solve the software clustering problem. The proposed EDA has been compared with two well-known genetic algorithms on twelve benchmarks. Experimental results show that the proposed approach provides more accurate results, improves the speed of convergence and provides better stability when compared against existing genetic algorithms such as Bunch and DAGC.

scholarly journals Development and validation of constraints handling in a Differential Evolution optimizer

2020 ◽  
Vol 12 (1) ◽  
pp. 59-66
Author(s):  
Mihai-Vladut HOTHAZIE ◽  
Georgiana ICHIM ◽  
Mihai-Victor PRICOP
Keyword(s):  
Genetic Algorithm ◽  
Genetic Algorithms ◽  
Differential Evolution ◽  
Research Work ◽  
Scaling Factor ◽  
Test Problems ◽  
Objective Functions ◽  
Constraints Handling ◽  
Two Parameters ◽  
Development And Validation

Research work requires independent, portable optimization tools for many applications, most often for problems where derivability of objective functions is not satisfied. Differential evolution optimization represents an alternative to the more complex, encryption based genetic algorithms. Various packages are available as freeware, but they lack constraints handling, while constrained optimizations packages are commercially available. However, the literature devoted to constraints treatment is significant and the current work is devoted to the implementation of such an optimizer, to be applied in low-fidelity optimization processes. The parameter free penalty scheme is adopted for implementation, and the code is validated against the CEC2006 benchmark test problems and compared with the genetic algorithm in MATLAB. Our paper underlines the implementation of constrained differential evolution by varying two parameters, a predefined parameter for feasibility and the scaling factor, to ensure the convergence of the solution.

Sign in / Sign up

Export Citation Format

Share Document