scholarly journals Solving Timetable Problem by Genetic Algorithm and Heuristic Search Case Study: Universitas Pelita Harapan Timetable

10.5772/36626 ◽  
2012 ◽  
Author(s):  
Samuel Lukas ◽  
Arnold Aribowo ◽  
Milyandreana Muchri
Keyword(s):  
Genetic Algorithm ◽  
Heuristic Search ◽  
Timetable Problem

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 Multi-user Remote Lab: Timetable Scheduling Using Simplex Nondominated Sorting Genetic Algorithm

2021 ◽  
Vol 2 (2) ◽  
pp. 1-13
Author(s):  
Seid Miad Zandavi ◽  
Vera Chung ◽  
Ali Anaissi
Keyword(s):  
Genetic Algorithm ◽  
Optimization Algorithm ◽  
Heuristic Algorithms ◽  
Simplex Algorithm ◽  
Local Optimum ◽  
Hybrid Optimization Algorithm ◽  
Multimodal Function ◽  
Remote Laboratories ◽  
Remote Lab ◽  
Timetable Problem

The scheduling of multi-user remote laboratories is modeled as a multimodal function for the proposed optimization algorithm. The hybrid optimization algorithm, hybridization of the Nelder-Mead Simplex algorithm, and Non-dominated Sorting Genetic Algorithm (NSGA), named Simplex Non-dominated Sorting Genetic Algorithm (SNSGA), is proposed to optimize the timetable problem for the remote laboratories to coordinate shared access. The proposed algorithm utilizes the Simplex algorithm in terms of exploration and NSGA for sorting local optimum points with consideration of potential areas. SNSGA is applied to difficult nonlinear continuous multimodal functions, and its performance is compared with hybrid Simplex Particle Swarm Optimization, Simplex Genetic Algorithm, and other heuristic algorithms. The results show that SNSGA has a competitive performance to address timetable problems.

Design and Evaluation of Usable Systems

2002 ◽  
Vol 46 (3) ◽  
pp. 367-371
Author(s):  
John F. McGrew
Keyword(s):  
Genetic Algorithm ◽  
Change Management ◽  
Management System ◽  
Design Method ◽  
The Other ◽  
Design Team ◽  
Style Analysis ◽  
Decision Style ◽  
Parallel Design

This paper discusses a case study of a design and evaluation of a change management system at a large Telecommunications Corporation. The design and evaluation were done using the facilitated genetic algorithm (a parallel design method) and user decision style analysis. During the facilitated genetic algorithm the design team followed the procedure of the genetic algorithm. Usability was evaluated by applying user decision style analysis to the designed system. The design is compared with an existing system and with one designed by an analyst. The change management system designed by the facilitated genetic algorithm took less time to design and decision style analysis indicated it would be easier to use than the other two systems.

An Improved Ant Colony Optimization Algorithm for Solving the TSP Problem

2010 ◽  
Vol 26-28 ◽  
pp. 620-624 ◽  
Author(s):  
Zhan Wei Du ◽  
Yong Jian Yang ◽  
Yong Xiong Sun ◽  
Chi Jun Zhang ◽  
Tuan Liang Li
Keyword(s):  
Genetic Algorithm ◽  
Ant Colony Algorithm ◽  
Ant Colony ◽  
Convergence Time ◽  
Ant Colony Optimization Algorithm ◽  
Data Set ◽  
Research Attention ◽  
Simply Supported ◽  
Source Data

This paper presents a modified Ant Colony Algorithm(ACA) called route-update ant colony algorithm(RUACA). The research attention is focused on improving the computational efficiency in the TSP problem. A new impact factor is introduced and proved to be effective for reducing the convergence time in the RUACA performance. In order to assess the RUACA performance, a simply supported data set of cities, which was taken as the source data in previous research using traditional ACA and genetic algorithm(GA), is chosen as a benchmark case study. Comparing with the ACA and GA results, it is shown that the presented RUACA has successfully solved the TSP problem. The results of the proposed algorithm are found to be satisfactory.

Sign in / Sign up

Export Citation Format

Share Document