scholarly journals Genetic Algorithm with Elitist-Tournament for Clashes-Free Slots of Lecturer Timetabling Problem

2018 ◽  
Vol 12 (1) ◽  
pp. 303 ◽  
Author(s):  
Marina Yusoff ◽  
Anis Amalina Othman
Keyword(s):  
Genetic Algorithm ◽  
Optimization Technique ◽  
Specific Time ◽  
Selection Scheme ◽  
Timetabling Problem ◽  
Evolutionary Optimization Technique ◽  
Tournament Selection ◽  
Mathematical Sciences ◽  
Real World Problems

<span>Genetic algorithm (GA) approach is one of an evolutionary optimization technique relies on natural selection. The employment of GA still popular and it was applied to many real-world problems, especially in many combinatorial optimization solutions. Lecturer Timetabling Problem (LTP) has been researched for a few decades and produced good solutions. Although, some of LTP offers good results, the criteria and constraints of each LTP however are different from other universities. The LTP appears to be a tiresome job to the scheduler that involves scheduling of students, classes, lecturers and rooms at specific time-slots while satisfying all the necessary requirements to build a feasible timetable. This paper addresses the employment and evaluation of GA to overcome the biggest challenge in LTP to find clashes-free slots for lecturer based on a case study in the Faculty of Computer and Mathematical Sciences, University Technologi MARA, Malaysia. Hence, the performance of the GA is evaluated based on selection, mutation and crossover using different number of population size. A comparison of performance between simple GA with Tournament Selection scheme combined with Elitism (TE) and a GA with Tournament (T) selection scheme. The findings demonstrate that the embedded penalty measures and elitism composition provide good performance that satisfies all the constraints in producing timetables to lecturers. </span>

A GENETIC ALGORITHM FOR URBAN TRANSIT ROUTING PROBLEM

2012 ◽  
Vol 09 ◽  
pp. 411-421 ◽  
Author(s):  
JOANNE SUK CHUN CHEW ◽  
LAI SOON LEE
Keyword(s):  
Genetic Algorithm ◽  
Optimization Technique ◽  
Urban Transit ◽  
Routing Problem ◽  
Evolutionary Optimization Technique ◽  
Route Network ◽  
Constrained Problem ◽  
Transit Route ◽  
Better Than

The Urban Transit Routing Problem (UTRP) involves solving a set of transit route networks, which proved to be a highly complex multi-constrained problem. In this study, a bus route network to find an efficient network to meet customer demands given information on link travel times is considered. An evolutionary optimization technique, called Genetic Algorithm is proposed to solve the UTRP. The main objective is to minimize the passenger costs where the quality of the route sets is evaluated by a set of parameters. Initial computational experiments show that the proposed algorithm performs better than the benchmark results for Mandl's problems.

Outline Capture of Planar Objects by Detecting Corner Features

2014 ◽  
pp. 280-298
Author(s):  
Misbah Irshad ◽  
Muhammad Sarfraz ◽  
Malik Zawwar Hussain
Keyword(s):  
Genetic Algorithm ◽  
Curve Fitting ◽  
Optimization Technique ◽  
Cubic Spline ◽  
Evolutionary Optimization ◽  
Spline Functions ◽  
Shape Parameters ◽  
Evolutionary Optimization Technique ◽  
Corner Points ◽  
Optimal Values

This chapter proposes a scheme that helps digitizing hand printed and electronic planar objects or vectorizing the generic shapes. An evolutionary optimization technique, namely Genetic Algorithm (GA), is used to solve the problem of curve fitting with cubic and rational cubic spline functions. The underlying scheme is comprised of various phases including data of the image outlines, detection of corner points, using GA for optimal values of shape parameters in the description of spline functions, and fitting curve using spline functions to the detected corner points.

Multi-Objective Optimization Technique Applied to Preliminary Design of a Tanker

2008 ◽  
Author(s):  
Marcelo R. Martins ◽  
Diego F. S. Burgos
Keyword(s):  
Genetic Algorithm ◽  
Early Stage ◽  
Optimization Technique ◽  
Pareto Frontier ◽  
Design Parameters ◽  
Preliminary Design ◽  
Multi Objective Optimization ◽  
Total Cost ◽  
Rational Process

This paper shows one rational process of selecting the optimal dimensions and coefficients of form of tankers using the technique of genetic algorithm in the early stage of design. Two objective attributes are used to evaluate each design: Total Cost and Mean Oil Outflow. It is proposed a procedure to balance the designs in weight and useful space and assesses their feasibility. A genetic algorithm is implemented to search optimal design parameters and identify the non-dominated Pareto frontier. A real Suezmax vessel is used as case study.

scholarly journals Hybrid Seven-bar Press Mechanism

2018 ◽  
Vol 12 (3) ◽  
pp. 181-187
Author(s):  
M. Erkan Kütük ◽  
L. Canan Dülger
Keyword(s):  
Genetic Algorithm ◽  
Objective Function ◽  
Design Optimization ◽  
Hybrid System ◽  
Degrees Of Freedom ◽  
Dimensional Synthesis ◽  
Design Variables ◽  
Optimization Study ◽  
Metal Stamping

An optimization study with kinetostatic analysis is performed on hybrid seven-bar press mechanism. This study is based on previous studies performed on planar hybrid seven-bar linkage. Dimensional synthesis is performed, and optimum link lengths for the mechanism are found. Optimization study is performed by using genetic algorithm (GA). Genetic Algorithm Toolbox is used with Optimization Toolbox in MATLAB®. The design variables and the constraints are used during design optimization. The objective function is determined and eight precision points are used. A seven-bar linkage system with two degrees of freedom is chosen as an example. Metal stamping operation with a dwell is taken as the case study. Having completed optimization, the kinetostatic analysis is performed. All forces on the links and the crank torques are calculated on the hybrid system with the optimized link lengths

scholarly journals Optimized Strategic Planning of Future Norwegian Low-Voltage Networks with a Genetic Algorithm Applying Empirical Electric Vehicle Charging Data

Electricity ◽  
2021 ◽  
Vol 2 (1) ◽  
pp. 91-109
Author(s):  
Julian Wruk ◽  
Kevin Cibis ◽  
Matthias Resch ◽  
Hanne Sæle ◽  
Markus Zdrallek
Keyword(s):  
Genetic Algorithm ◽  
Electric Vehicle ◽  
Electric Vehicles ◽  
Low Voltage ◽  
Network Planning ◽  
Voltage Regulation ◽  
Electric Vehicle Charging ◽  
Vehicle Charging ◽  
The Impact

This article outlines methods to facilitate the assessment of the impact of electric vehicle charging on distribution networks at planning stage and applies them to a case study. As network planning is becoming a more complex task, an approach to automated network planning that yields the optimal reinforcement strategy is outlined. Different reinforcement measures are weighted against each other in terms of technical feasibility and costs by applying a genetic algorithm. Traditional reinforcements as well as novel solutions including voltage regulation are considered. To account for electric vehicle charging, a method to determine the uptake in equivalent load is presented. For this, measured data of households and statistical data of electric vehicles are combined in a stochastic analysis to determine the simultaneity factors of household load including electric vehicle charging. The developed methods are applied to an exemplary case study with Norwegian low-voltage networks. Different penetration rates of electric vehicles on a development path until 2040 are considered.

scholarly journals Load Frequency Control Using Hybrid Intelligent Optimization Technique for Multi-Source Power Systems

Energies ◽  
2021 ◽  
Vol 14 (6) ◽  
pp. 1581
Author(s):  
Deepak Kumar Gupta ◽  
Amitkumar V. Jha ◽  
Bhargav Appasani ◽  
Avireni Srinivasulu ◽  
Nicu Bizon ◽  
...  
Keyword(s):  
Power Plant ◽  
Power System ◽  
Frequency Control ◽  
Optimization Technique ◽  
Load Frequency Control ◽  
Frequency Deviation ◽  
Source Power ◽  
Load Frequency ◽  
Tie Line

The automatic load frequency control for multi-area power systems has been a challenging task for power system engineers. The complexity of this task further increases with the incorporation of multiple sources of power generation. For multi-source power system, this paper presents a new heuristic-based hybrid optimization technique to achieve the objective of automatic load frequency control. In particular, the proposed optimization technique regulates the frequency deviation and the tie-line power in multi-source power system. The proposed optimization technique uses the main features of three different optimization techniques, namely, the Firefly Algorithm (FA), the Particle Swarm Optimization (PSO), and the Gravitational Search Algorithm (GSA). The proposed algorithm was used to tune the parameters of a Proportional Integral Derivative (PID) controller to achieve the automatic load frequency control of the multi-source power system. The integral time absolute error was used as the objective function. Moreover, the controller was also tuned to ensure that the tie-line power and the frequency of the multi-source power system were within the acceptable limits. A two-area power system was designed using MATLAB-Simulink tool, consisting of three types of power sources, viz., thermal power plant, hydro power plant, and gas-turbine power plant. The overall efficacy of the proposed algorithm was tested for two different case studies. In the first case study, both the areas were subjected to a load increment of 0.01 p.u. In the second case, the two areas were subjected to different load increments of 0.03 p.u and 0.02 p.u, respectively. Furthermore, the settling time and the peak overshoot were considered to measure the effect on the frequency deviation and on the tie-line response. For the first case study, the settling times for the frequency deviation in area-1, the frequency deviation in area-2, and the tie-line power flow were 8.5 s, 5.5 s, and 3.0 s, respectively. In comparison, these values were 8.7 s, 6.1 s, and 5.5 s, using PSO; 8.7 s, 7.2 s, and 6.5 s, using FA; and 9.0 s, 8.0 s, and 11.0 s using GSA. Similarly, for case study II, these values were: 5.5 s, 5.6 s, and 5.1 s, using the proposed algorithm; 6.2 s, 6.3 s, and 5.3 s, using PSO; 7.0 s, 6.5 s, and 10.0 s, using FA; and 8.5 s, 7.5 s, and 12.0 s, using GSA. Thus, the proposed algorithm performed better than the other techniques.

scholarly journals A Method for Integration of Preferences to a Multi-Objective Evolutionary Algorithm Using Ordinal Multi-Criteria Classification

2021 ◽  
Vol 26 (2) ◽  
pp. 27
Author(s):  
Alejandro Castellanos-Alvarez ◽  
Laura Cruz-Reyes ◽  
Eduardo Fernandez ◽  
Nelson Rangel-Valdez ◽  
Claudia Gómez-Santillán ◽  
...  
Keyword(s):  
Genetic Algorithm ◽  
Selective Pressure ◽  
Optimization Problems ◽  
Region Of Interest ◽  
Decision Makers ◽  
Multiple Objective ◽  
Objective Functions ◽  
Multi Objective ◽  
Imperfect Knowledge ◽  
Real World Problems

Most real-world problems require the optimization of multiple objective functions simultaneously, which can conflict with each other. The environment of these problems usually involves imprecise information derived from inaccurate measurements or the variability in decision-makers’ (DMs’) judgments and beliefs, which can lead to unsatisfactory solutions. The imperfect knowledge can be present either in objective functions, restrictions, or decision-maker’s preferences. These optimization problems have been solved using various techniques such as multi-objective evolutionary algorithms (MOEAs). This paper proposes a new MOEA called NSGA-III-P (non-nominated sorting genetic algorithm III with preferences). The main characteristic of NSGA-III-P is an ordinal multi-criteria classification method for preference integration to guide the algorithm to the region of interest given by the decision-maker’s preferences. Besides, the use of interval analysis allows the expression of preferences with imprecision. The experiments contrasted several versions of the proposed method with the original NSGA-III to analyze different selective pressure induced by the DM’s preferences. In these experiments, the algorithms solved three-objectives instances of the DTLZ problem. The obtained results showed a better approximation to the region of interest for a DM when its preferences are considered.

Sign in / Sign up

Export Citation Format

Share Document