scholarly journals An Effective Chromosome Representation on Proportional Tuition Fees Assessment Using NSGA-II

2019 ◽  
Vol 4 (3) ◽  
pp. 291
Author(s):  
Farid Jauhari ◽  
Wayan Firdaus Mahmudy ◽  
Achmad Basuki

Proportional tuition fees assessment is an optimization process to find a compromise point between student willingness to pay and institution income. Using a genetic algorithm to find optimal solutions requires effective chromosome representations, parameters, and operator genetic to obtain efficient search. This paper proposes a new chromosome representation and also finding efficient genetic parameters to solve the proportional tuition fees assessment problem. The results of applying the new chromosome representation are compared with another chromosome representation in the previous study. The evaluations show that the proposed chromosome representation obtains better results than the other in both execution time required and the quality of the solutions.

2020 ◽  
Vol 20 (3) ◽  
pp. 45-63
Author(s):  
Andranik S. Akopov ◽  
Levon A. Beklaryan ◽  
Armen L. Beklaryan

AbstractThis work presents a novel approach to the design of a decision-making system for the cluster-based optimization of an evacuation process using a Parallel bi-objective Real-Coded Genetic Algorithm (P-RCGA). The algorithm is based on the dynamic interaction of distributed processes with individual characteristics that exchange the best potential decisions among themselves through a global population. Such an approach allows the HyperVolume performance metric (HV metric) as reflected in the quality of the subset of the Pareto optimal solutions to be improved. The results of P-RCGA were compared with other well-known multi-objective genetic algorithms (e.g., -MOEA, NSGA-II, SPEA2). Moreover, P-RCGA was aggregated with the developed simulation of the behavior of human agent-rescuers in emergency through the objective functions to optimize the main parameters of the evacuation process.


2021 ◽  
Vol 12 (1) ◽  
pp. 111-130
Author(s):  
Ankita Bansal ◽  
Abha Jain ◽  
Abhijeet Anand ◽  
Swatantra Annk

Huge and reputed software industries are expected to deliver quality products. However, industry suffers from a loss of approximately $500 billion due to shoddy software quality. The quality of the product in terms of its accuracy, efficiency, and reliability can be revamped through testing by focusing attention on testing the product through effective test case generation and prioritization. The authors have proposed a test-case generation technique based on iterative listener genetic algorithm that generates test cases automatically. The proposed technique uses its adaptive nature and solves the issues like redundant test cases, inefficient test coverage percentage, high execution time, and increased computation complexity by maintaining the diversity of the population which will decrease the redundancy in test cases. The performance of the technique is compared with four existing test-case generation algorithms in terms of computational complexity, execution time, coverage, and it is observed that the proposed technique outperformed.


Author(s):  
Hicham El Hassani ◽  
Said Benkachcha ◽  
Jamal Benhra

Inspired by nature, genetic algorithms (GA) are among the greatest meta-heuristics optimization methods that have proved their effectiveness to conventional NP-hard problems, especially the traveling salesman problem (TSP) which is one of the most studied Supply chain management problems. This paper proposes a new crossover operator called Jump Crossover (JMPX) for solving the travelling salesmen problem using a genetic algorithm (GA) for near-optimal solutions, to conclude on its efficiency compared to solutions quality given by other conventional operators to the same problem, namely, Partially matched crossover (PMX), Edge recombination Crossover (ERX) and r-opt heuristic with consideration of computational overload. We adopt the path representation technique for our chromosome which is the most direct representation and a low mutation rate to isolate the search space exploration ability of each crossover. The experimental results show that in most cases JMPX can remarkably improve the solution quality of the GA compared to the two existing classic crossover approaches and the r-opt heuristic.


2021 ◽  
Vol 24 (68) ◽  
pp. 123-137
Author(s):  
Sami Nasser Lauar ◽  
Mario Mestria

In this work, we present a metaheuristic based on the genetic and greedy algorithms to solve an application of the set covering problem (SCP), the data aggregator positioning in smart grids. The GGH (Greedy Genetic Hybrid) is structured as a genetic algorithm, but it has many modifications compared to the classic version. At the mutation step, only columns included in the solution can suffer mutation and be removed. At the recombination step, only columns from the parent’s solutions are available to generate the offspring. Moreover, the greedy algorithm generates the initial population, reconstructs solutions after mutation, and generates new solutions from the recombination step. Computational results using OR-Library problems showed that the GGH reached optimal solutions for 40 instances in a total of 75 and, in the other instances, obtained good and promising values, presenting a medium gap of 1,761%.


Author(s):  
Ashraf Osman Ibrahim ◽  
Siti Mariyam Shamsuddin ◽  
Sultan Noman Qasem

Recently, hybrid algorithms have received considerable attention from a number of researchers. This paper presents a hybrid of the multiobjective evolutionary algorithm to gain a better accuracy of the fi nal solutions. The aim of using the hybrid algorithm is to improve the multiobjective evolutionary algorithm performance in terms of the enhancement of all the individuals in the population and increase the quality of the Pareto optimal solutions. The multiobjective evolutionary algorithm used in this study is a nondominated sorting genetic algorithm-II (NSGA-II) together with its hybrid, the backpropagation algorithm (BP), which is used as a local search algorithm to optimize the accuracy and complexity of the three-term backpropagation (TBP) network. The outcome positively demonstrates that the hybrid algorithm is able to improve the classification performance with a smaller number of hidden nodes and is effective in multiclass classifi cation problems. Furthermore, the results indicate that the proposed hybrid method is a potentially useful classifi er for enhancing the classification process ability when compared with the multiobjective genetic algorithm based on the TBP network (MOGATBP) and certain other methods found in the literature.  


2020 ◽  
Vol 164 ◽  
pp. 10045
Author(s):  
Svetlana Sviridova ◽  
Elena Shkarupeta ◽  
Olga Dorokhova

The purpose of this paper is to develop methodological tools for building the innovative environment of enterprises using the genetic algorithm and neural networks. The paper analyzes and highlights the advantages of genetic algorithms in the search for optimal solutions compared to classical methods. The scheme of construction of each step of the genetic algorithm is described in detail; the scheme of the presentation of artificial neural network data in key factors of innovative development of enterprises is given. The aspects of using neural networks of attractors and a genetic algorithm for modeling the processes of the innovative environment of enterprises are considered. The key problem of introducing effective industrial innovations is the lack of a favorable climatic environment that stimulates the creation of innovations that ensure the growth of global competitiveness, labor productivity and the quality of life of the population. The result of the study is the formation of a model of the innovative environment of enterprises based on the use of neural networks and a genetic algorithm.


2019 ◽  
Vol 14 (2) ◽  
pp. 521-558 ◽  
Author(s):  
Amir Hossein Hosseinian ◽  
Vahid Baradaran ◽  
Mahdi Bashiri

Purpose The purpose of this paper is to propose a new mixed-integer formulation for the time-dependent multi-skilled resource-constrained project scheduling problem (MSRCPSP/t) considering learning effect. The proposed model extends the basic form of the MSRCPSP by three concepts: workforces have different efficiencies, it is possible for workforces to improve their efficiencies by learning from more efficient workers and the availability of workforces and resource requests of activities are time-dependent. To spread dexterity from more efficient workforces to others, this study has integrated the concept of diffusion maximization in social networks into the proposed model. In this respect, the diffusion of dexterity is formulated based on the linear threshold model for a network of workforces who share common skills. The proposed model is bi-objective, aiming to minimize make-span and total costs of project, simultaneously. Design/methodology/approach The MSRCPSP is an non-deterministic polynomial-time hard (NP-hard) problem in the strong sense. Therefore, an improved version of the non-dominated sorting genetic algorithm II (IM-NSGA-II) is developed to optimize the make-span and total costs of project, concurrently. For the proposed algorithm, this paper has designed new genetic operators that help to spread dexterity among workforces. To validate the solutions obtained by the IM-NSGA-II, four other evolutionary algorithms – the classical NSGA-II, non-dominated ranked genetic algorithm, Pareto envelope-based selection algorithm II and strength Pareto evolutionary algorithm II – are used. All algorithms are calibrated via the Taguchi method. Findings Comprehensive numerical tests are conducted to evaluate the performance of the IM-NSGA-II in comparison with the other four methods in terms of convergence, diversity and computational time. The computational results reveal that the IM-NSGA-II outperforms the other methods in terms of most of the metrics. Besides, a sensitivity analysis is implemented to investigate the impact of learning on objective function values. The outputs show the significant impact of learning on objective function values. Practical implications The proposed model and algorithm can be used for scheduling activities of small- and large-size real-world projects. Originality/value Based on the previous studies reviewed in this paper, one of the research gaps is the MSRCPSP with time-dependent resource capacities and requests. Therefore, this paper proposes a multi-objective model for the MSRCPSP with time-dependent resource profiles. Besides, the evaluation of learning effect on efficiency of workforces has not been studied sufficiently in the literature. In this study, the effect of learning on efficiency of workforces has been considered. In the scarce number of proposed models with learning effect, the researchers have assumed that the efficiency of workforces increases as they spend more time on performing a skill. To the best of the authors’ knowledge, the effect of learning from more efficient co-workers has not been studied in the literature of the RCPSP. Therefore, in this research, the effect of learning from more efficient co-workers has been investigated. In addition, a modified version of the NSGA-II algorithm is developed to solve the model.


2020 ◽  
Vol 10 (20) ◽  
pp. 7264
Author(s):  
Wanida Khamprapai ◽  
Cheng-Fa Tsai ◽  
Paohsi Wang

Software testing using traditional genetic algorithms (GAs) minimizes the required number of test cases and reduces the execution time. Currently, GAs are adapted to enhance performance when finding optimal solutions. The multiple-searching genetic algorithm (MSGA) has improved upon current GAs and is used to find the optimal multicast routing in network systems. This paper presents an analysis of the optimization of test case generations using the MSGA by defining suitable values of MSGA parameters, including population size, crossover operator, and mutation operator. Moreover, in this study, we compare the performance of the MSGA with a traditional GA and hybrid GA (HGA). The experimental results demonstrate that MSGA reaches the maximum executed branch statements in the lowest execution time and the smallest number of test cases compared to the GA and HGA.


2011 ◽  
Vol 403-408 ◽  
pp. 1622-1625
Author(s):  
Xiao Wei Guan ◽  
Xia Zhu

As one of the difficulties and hot of computer vision and image processing, Image segmentation is highly valued by the research workers. Yet there is no image segmentation algorithm which is generic, and it is difficult to obtain an optimal feature representation method. In this paper, genetic algorithm (GA) has proposed to segment the image. GA algorithm can improve the efficiency and quality of the picture some extent through the experimental results. The algorithm has some versatility, as long as the corresponding parameters are adjusted, it can also handle the other images. The results show that GA algorithm is very stable, and the fusion result is more satisfactory. Thus, GA can be applied in image segmentation and this algorithm will have good prospects in image processing.


2021 ◽  
Vol 2021 ◽  
pp. 1-10
Author(s):  
Xiaoqian Zhang

University education is a hot topic of research in this era of outcome-based education in a learning-centric atmosphere, as people struggle for a higher quality of life and technological advancements. The key problems remain in structuring the teaching staff to achieve optimal information transmission and quality. Existing research aims to improve the quality of teaching of the staff, but majority of them fail to achieve their objectives. Multiobjective (MO) optimization has attracted researchers’ interest, particularly, in the context of performance monitoring and improving teaching quality. The goal of this research is to look into techniques for improving academic accomplishment through the planning structure of university teaching staff. I have adopted the Jaynes maximum entropy principle and fuzzy entropy concept to solve the structural optimization problem in the development of teaching staff in colleges and universities. The objective function and constraints in multiobjective optimization are determined, and the multiobjective optimization issue in the development of teaching staff structure is solved using the nondominated sorting genetic algorithm (NSGA-II) multiobjective genetic algorithm. The results show that the optimized structure of the teaching staff can reflect the goal of the construction of the teaching staff in colleges and universities and provide a scientific basis for the construction and planning of the teaching staff.


Sign in / Sign up

Export Citation Format

Share Document