Search Results - (( developing new (problems OR problem) algorithm ) OR ( java implication based algorithm ))

Development of optimization Alghorithm for uncertain non-linear dynamical system by Abdul Aziz, Mohd. Ismail, Yaacob, Nazeeruddin, Mohd. Said, Norfarizan, Hamzah, Nor Hazadura

Get full text
Get full text

New random approaches of modified adaptive bats sonar algorithm for reservoir operation optimization problems by Nor Shuhada, Ibrahim

“…Generally, the average results indicates that the newly developed algorithm retrieved better than original MABSA in finding a minimum point which increment 5.833% better than original MABSA, and new algorithm retrieved 5.204% more better than global optimum value. …”
Get full text
Get full text

Enhancement of Ant System Algorithm for Course Timetabling Problem by Djamarus, Djasli

“…In order to develop a new algorithm for the course scheduling problem, this research follows the experimental research methodology that consist of problem analysis, designing algorithm, implementing algorithm as a computer program in order to examine the results, analyzing the results, and if necessary improving the algorithm by doing all those activities over and over again. …”
Get full text
Get full text
Get full text

Application of Krylov Subspace methods for solving Continuous Power Flow problem in voltage stability analysis of power system by Jasni, Jasronita

“…Furthermore, the real data with 293 buses and 595 lines is used as a practical system for verification of the new algorithms The results show that these new algorithms are able to eliminate the convergence problem faced by the existing CPF algorithm. …”
Get full text
Get full text

Augmentation of basic-line-search and quick-simplex-method algorithms to enhance linear programming computational performance by Nor Azlan, Nor Asmaa Alyaa

“…Each dataset is set to 10 different problems and the result of the iteration number was as follows: first datasets; new augmentation algorithm = 2, QSM = 4, BLSA = 7, and Simplex = 13 and second datasets; new augmentation algorithm = 1, QSM = 3, BLSA = 4, and Simplex = 8.…”
Get full text
Get full text
Get full text

Development of Simulated Annealing Based Scheduling Algorithm for Two Machines Flow Shop Problem by M., Muziana, Kamal Z., Zamli

“…Viewing as optimization problem and focusing on two machines, this research aims to develop a new Simulated Annealing based scheduling algorithm, called SA2M, for flow shop problem. …”
Get full text
Get full text
Get full text

An Efficient Genetic Algorithm for Large Scale Vehicle Routing Problem Subject to Precedence Constraints by Noraini, Mohd Razali

“…In order to obtain feasible solution which does not violate precedence constraints, a route repair based topological sort technique is used and integrated in the genetic algorithm procedure. In this paper, a new algorithm is developed and the performances as well as the quality of the solution were evaluated against large scale test problems. …”
Get full text
Get full text
Get full text

Fast Finite Difference Time Domain Algorithms for Solving Antenna Application Problem by Hasan, Mohammad Khatim

“…Existing method, known as FDTD needs a very long processing time to solve this problem. The objective of the thesis is to develop new sequential and parallel algorithms that are faster than the standard Finite Difference Time Domain method. …”
Get full text
Get full text

An interactive analytics approach for sustainable and resilient case studies: a machine learning perspective by Mousavi, Seyed Mohsen, Sadeghi R., Kiarash, Lee, Lai Soon

“…However, there needs to be more research examining the role of interactive methods in multiobjective optimisation problems. To integrate machine learning and human interactions, this paper develops a new three-stage interactive algorithm in business analytics, called the interactive Nautilus-based algorithm, to address complex problems. …”
Get full text
Get full text

A machine learning approach to tourism recommendations system by Chia, An

“…Cold start problem occurs when there is insufficient data about new users, new items or both. …”
Get full text
Get full text

A discrete simulated kalman filter optimizer for combinatorial optimization problems by Suhazri Amrin, Rahmad

“…In the last few decades, significant research effort has been spent on the development of numerical algorithms, particularly for solving combinatorial problems. …”
Get full text
Get full text

Seed disperser ant algorithm for optimization / Chang Wen Liang by Chang , Wen Liang

“…The Seed Disperser Ant Algorithm (SDAA) is developed based on the evolution or expansion process of Seed Disperser Ant (Aphaenogaster senilis) colony. …”
Get full text
Get full text
Get full text

Cuckoo Search Approach for Cutting Stock Problem by Shair, Ezreen Farina, Khor, Shen Young, Abdullah, Abdul Rahim, Jaafar, Hazriq Izzuan, Saharuddin, Nur Zawani, Zainal Abidin, Amar Faiz

“…The purpose of this paper is to develop a new approach which is Cuckoo Search Algorithm in Cutting Stock Problem. …”
Get full text
Get full text
Get full text

Optimised Crossover Genetic Algorithms for Combinatorial Optimisation Problems by Nazif, Habibeh

“…This thesis focuses on the development of a new stream of crossover within genetic algorithms, called Optimised Crossover Genetic Algorithm (OCGA) for solving combinatorial optimisation problems, which takes into account the objective function in finding the best ofspring solution among an exponentially large number of potential ofspring. …”
Get full text
Get full text

Dynamic social behavior algorithm for real-parameter optimization problems and optimization of hyper beamforming of linear antenna arrays by Prajindra�Sankar K., Kiong T.S., Siaw�Paw J.K.

A New Optimization Algorithm based on Copulation Behavior of Simine Jackals by Alemu Lemma, Tamiru, Mohd Hashim, Fakhruldin

Get full text

Ant colony optimization algorithm for dynamic scheduling of jobs in computational grid by Ku-Mahamud, Ku Ruhana, Ramli, Razamin, Yusof, Yuhanis, Mohamed Din, Aniza, Mahmuddin, Massudi

“…In computational grid, job scheduling is one of the main factors affecting grid computing performance. Job scheduling problem is classified as an NP-hard problem.Such a problem can be solved only by using approximate algorithms such as heuristic and meta-heuristic algorithms.Among different optimization algorithms for job scheduling, ant colony system algorithm is a popular meta-heuristic algorithm which has the ability to solve different types of NP-hard problems.However, ant colony system algorithm has a deficiency in its heuristic function which affects the algorithm behavior in terms of finding the shortest connection between edges.This research focuses on a new heuristic function where information about recent ants’ discoveries has been considered.The new heuristic function has been integrated into the classical ant colony system algorithm.Furthermore, the enhanced algorithm has been implemented to solve the travelling salesman problem as well as in scheduling of jobs in computational grid.A simulator with dynamic environment feature to mimic real life application has been development to validate the proposed enhanced ant colony system algorithm. …”
Get full text
Get full text

New Quasi-Newton Equation And Method Via Higher Order Tensor Models by Gholilou, Fahimeh Biglari

“…The implementation of the new proposed method on a set of test problems highlights that the derivation of this new method is more efficient in performing the standard algorithm.…”
Get full text
Get full text

Developing an intelligent system to acquire meeting knowledge in problem-based learning environments by Chiang, A., Baba, M.S.

Get full text
Get full text
Get full text

AUTOMATIC ROUTE FINDER FOR NEW VISITORS by ADNAN, MOHD SHIHAM

“…This project proposes a new visitor route model that is based on shortest path algorithms for road networks. …”
Get full text
Get full text