Search Results - (( basic computing based algorithm ) OR ( solution population approach algorithm ))

Hybrid-discrete multi-objective particle swarm optimization for multi-objective job-shop scheduling by Anuar, Nurul Izah

“…This research first proposes an improved continuous MOPSO to address the rapid clustering problem that exists in the basic PSO algorithm using three improvement strategies: re-initialization of particles, systematic switch of best solutions and mutation on global best selection. …”
Get full text
Get full text
Get full text

Unit commitment in power system using multi-agent evolutionary programming incorporating priority listing optimisation technique / Muhammad Nazree Che Othman by Che Othman, Muhammad Nazree

“…In the proposed technique, deterministic PL technique was first applied to produce a population of initial solutions. The search process then being refined using heuristic EP-based algorithm with multi-agent approach to produce the final solution. …”
Get full text
Get full text

Design and statistical analysis of initial solution construction approach in curriculum based course timetabling problem by Wahid, Juliana, Mohd Hussin, Naimah

“…To produce a population of initial solution require algorithm that can produce multiple feasible solutions and these solutions must be diverse. …”
Get full text
Get full text

NSGA-III algorithm for optimizing robot collaborative task allocation in the internet of things environment by Shen, jiazheng, Tang, Sai Hong, Mohd Ariffin, Mohd Khairol Anuar, As’arry, Azizan, Wang, Xinming

“…The experiment verified that this strategy can approach the optimal solution more closely during the population convergence process, and compared it with traditional Multi TSP algorithms and single function multi-objective Multi TSP algorithms. …”
Get full text
Get full text
Get full text

Combining approximation algorithm with genetic algorithm at the initial population for NP-complete problem by Razip, H., Zakaria, M.N.

“…In Genetic Algorithm (GA), the prevalent approach to population initialization are heuristics and randomization. …”
Get full text
Get full text

Hybridizing harmony search with local search based metaheuristic for solving curriculum based university course timetabling / Juliana Wahid by Wahid, Juliana

“…The approach produced solutions that are at par quality with the previous published results. …”
Get full text
Get full text

Enhanced Harris's Hawk algorithm for continuous multi-objective optimization problems by Yasear, Shaymah Akram

“…Harris’s hawk multi-objective optimizer (HHMO) algorithm is a MOSIbased algorithm that was developed based on the reference point approach. …”
Get full text
Get full text
Get full text
Get full text

Single Fitness Function to Optimize Energy using Genetic Algorithms for Wireless Sensor Network by Ismail Abdullah, Kalid Abdlkader Marsal

Mobile First-Person Shooter (FPS) Game Using Basic Theta* Algorithm / Muhammad Syurahbil Abd Rohaman by Abd Rohaman, Muhammad Syurahbil

“…Basic Theta* is implemented in the game using grid-based map representation. …”
Get full text
Get full text

A novel clustering based genetic algorithm for route optimization by Aibinu, Abiodun Musa, Salau, Habeeb Bello, Najeeb, Athaur Rahman, Nwohu, Mark Ndubuka, Akachukwu, Chichebe

“…In addition, the introduction of dynamic population control with polygamy selection processes enabled fast convergence to optimal solution and diversity in the population respectively.…”
Get full text
Get full text
Get full text
Get full text
Get full text

Construction of initial solution population for curriculum-based course timetabling using combination of graph heuristics by Wahid, Juliana, Mohd Hussin, Naimah

“…The construction of population of initial solution is a crucial task in population-based metaheuristic approach for solving curriculum-based university course timetabling problem because it can affect the convergence speed and also the quality of the final solution.This paper presents an exploration on combination of graph heuristics in construction approach in curriculum based course timetabling problem to produce a population of initial solutions.The graph heuristics were set as single and combination of two heuristics.In addition, several ways of assigning courses into room and timeslot are implemented.All settings of heuristics are then tested on the same curriculum based course timetabling problem instances and are compared with each other in terms of number of population produced.The result shows that combination of largest degree followed by saturation degree heuristic produce the highest number of population of initial solutions.The results from this study can be used in the improvement phase of algorithm that uses population of initial solutions…”
Get full text
Get full text
Get full text

Application of intelligence based genetic algorithm for job sequencing problem on parallel mixed-model assembly line by Noroziroshan, Alireza, Mohd Ariffin, Mohd Khairol Anuar, Ismail, Napsiah

“…A heuristic algorithm was introduced to generate the initial population for intelligence based genetic algorithm. …”
Get full text
Get full text
Get full text

Constructing population of initial solutions for curriculum – based course timetabling problem by Wahid, Juliana, Mohd Hussin, Naimah

“…This paper presents an investigation of a combination of graph coloring heuristics in construction approach in University course timetabling problem (UCTP) to produce a population of initial solutions. …”
Get full text
Get full text

A Kalman Filter Approach for Solving Unimodal Optimization Problems by Zuwairie, Ibrahim, Nor Hidayati, Abdul Aziz, Nor Azlina, Ab. Aziz, Saifudin, Razali, Mohd Ibrahim, Shapiai, Sophan Wahyudi, Nawawi, Mohd Saberi, Mohamad

“…In this paper, a new population-based metaheuristic optimization algorithm, named Simulated Kalman Filter (SKF) is introduced. …”
Get full text
Get full text
Get full text

Hybrid bat algorithm for minimum dominating set problem by Abed, S.A., Rais, H.M.

“…However, population-based algorithms are not good in exploiting the search space in comparison to single-solution based methods, therefore we included simulated annealing (SA) algorithm to balance between exploitation and exploration in order to reach a best possible solution. …”
Get full text
Get full text

Comparative Analysis of Low Discrepancy Sequence-Based Initialization Approaches Using Population-Based Algorithms for Solving the Global Optimization Problems by Waqas Haider Bangyal, Kashif Nisar, Ag. Asri Bin Ag. Ibrahim, Muhammad Reazul Haque, Joel J. P. C. Rodrigues, Danda B. Rawat

“…These algorithms can influence the convergence to find an efficient optimal solution. …”
Get full text
Get full text
Get full text
Get full text
Get full text

Simulated Kalman Filter algorithms for solving optimization problems by Nor Hidayati, Abdul Aziz

“…However, the HKA algorithm has its own flaws. Although it was introduced as a population-based stochastic optimization algorithm, HKA is not exactly a population-based algorithm because it initializes and updates only a single solution. …”
Get full text
Get full text

Non-dominated sorting Harris’s hawk multi-objective optimizer based on reference point approach by Yasear, Shaymah Akram, Ku-Mahamud, Ku Ruhana

Get full text
Get full text
Get full text

Design Of Robot Motion Planning Algorithm For Wall Following Robot by Ali Hassan, Muhamad Khairul

“…Computer B will send the data to the BASIC Stamp and the BASIC Stamp will check their program. …”
Get full text
Get full text

Fine-tuning approach in metaheuristic algorithm to prolong wireless sensor networks nodes lifetime by Rahiman, Amir Rizaan, Williams, Temitope Betty, Zakaria, Muhammad D.

Get full text
Get full text