Search Results - (( java application reoptimize algorithm ) OR ( using case problems algorithm ))

An experimental study of neighbourhood based metaheuristic algorithms for test case generation satisfying the modified condition / decision coverage criterion by Haque, Ariful

“…The algorithms are used to generate test cases for nine different Boolean expressions of different size and complexities. …”
Get full text
Get full text

Simulated annealing algorithm for solving chambering student-case assignment problem by Ghazali, Saadiah, Abdul Rahman, Syariza

“…The challenge of solving the problem raise whenever the complexity related to preferences, the existence of real-world constraints and problem size increased.This study focuses on solving a chambering student-case assignment problem by using a simulated annealing algorithm where this problem is classified under project assignment problem.The project assignment problem is considered as hard combinatorial optimization problem and solving it using a metaheuristic approach is an advantage because it could return a good solution in a reasonable time. …”
Get full text
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

“…To show the methods applicability, this paper uses the proposed algorithm in three sustainable and resilient case studies. …”
Get full text
Get full text

A combinatorial optimization technique using genetic algorithm :a case study in machine layout problem by Lau, Yung Siew.

“…Genetic Algorithms (GAs) are a powerful stochastic search in solving optimization problems. …”
Get full text
Get full text
Get full text

Solving 0/1 Knapsack Problem Using Hybrid HS and Jaya Algorithms by Alomoush, Alaa A., Alsewari, Abdulrahman A., Alamri, Hammoudeh S., Kamal Z., Zamli

“…The new hybrid algorithm has been applied on different cases of Knapsack problem with different dimensions. 20 case studies have been evaluated by the new hybrid algorithm. …”
Get full text
Get full text
Get full text
Get full text

Optimisation of energy efficient Assembly Sequence Planning using Moth-Flame Optimisation alghorithm by Muhammad Arif, Abdullah

“…All of the results were then analysed by using the Analysis of Variance (ANOVA) method. The P-value was found to be lower than the significant level α (P ≤ 0.10) in all test and case study problems. …”
Get full text
Get full text

Maintaining diversity for genetic algorithm : a case of timetabling problem. by Md Sultan, Abu Bakar, Mahmod, Ramlan, Sulaiman, Md. Nasir, Abu Bakar, Mohd Rizam

Get full text
Get full text

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

“…Complexity reduction approach concept is used to develop these algorithms. This approach split the solution domain into 1 3 and 2 3 compartments in 1D case and 1 9 and 8 9 compartments in 2D cases. …”
Get full text
Get full text

A prototype for driving school instructor timetabling using case-based heuristics selection algorithm / CT Munnirah Niesha Mohd Shafee by Mohd Shafee, CT Munnirah Niesha

“…The specification with both hard constraints which must be satisfied and soft constraint which should satisfied. This problem can be solved using Case-Based Heuristics Selection approaches. …”
Get full text
Get full text

Hybrid Artificial Bees Colony Algorithms For Optimizing Carbon Nanotubes Characteristics by Mohammad Jarrah, Mu'ath Ibrahim

“…Optimization is a crucial process to select the best parameters in single and multi-objective problems for manufacturing process.However,it is difficult to find an optimization algorithm that obtain the global optimum for every optimization problem.Artificial Bees Colony (ABC) is a well-known swarm intelligence algorithm in solving optimization problems.It has noticeably shown better performance compared to the state-of-art algorithms.This study proposes a novel hybrid ABC algorithm with β-Hill Climbing (βHC) technique (ABC-βHC) in order to enhance the exploitation and exploration process of the ABC in optimizing carbon nanotubes (CNTs) characteristics.CNTs are widely used in electronic and mechanical products due to its fascinating material with extraordinary mechanical,thermal,physical and electrical properties. …”
Get full text
Get full text
Get full text
Get full text

Disparity between theory & practice beyond the worst-case competitive analysis by Iqbal, Javeria, Ahmad, Iftikhar, Shah, Asadullah

“…For instance, in case of forex, the online algorithm is presented daily exchange rates. …”
Get full text
Get full text
Get full text
Get full text
Get full text

Thalassaemia detection using CBR Algorithm via mobile device by Nur Faezah, Omar

“…CBR Algorithm is an algorithm that can solve a new problem by remembering a previous similar situation and by reusing information and knowledge of that situation in a new situation.CBR is suit for solving the problem in Thalassaemia cases.The model is designed and prototype is developed to test the diagnosis accuracy of the model.T his application is focus on Beta Thalassaemia and Haemoglobin E Trait only.For platform, this application will be using the mobile device such as PDA. …”
Get full text
Get full text

A trade-off criterion for bi-objective problem in solving hybrid flow shop scheduling with energy efficient (EE-HFS) using multi-objective dragonfly algorithm (MODA) by Muhammad Ammar, Nik Mu’tasim, Mohd Fadzil Faisae, Ab Rashid

“…The (EE-HFS) optimization has been carried out using the Multi-Objective Dragonfly Algorithm (MODA). …”
Get full text
Get full text
Get full text

Computer Lab Timetabling Using Genetic Algorithm Case Study - Unit ICT by Abdullah, Amran

Get full text
Get full text

Leader election algorithm in 2D torus networks with the presence of one link failure by Refai, M., Sharieh, A., Alshammari, F.

“…Leader election algorithms solve the instability problem in the network which is caused by leader failure. …”
Get full text

An Experiment of Ant Algorithms : Case Study of Kota Kinabalu Central Town by Nor Rafidah, Mohamad

Get full text
Get full text
Get full text

Development of committee machine models for multiple response optimization problems by Golestaneh, Seyed Jafar

“…Four methodologies are to make four different CM models to solve MRO problems. The fifth methodology proposes the final algorithm which uses four CM models together to solve MRO problems. …”
Get full text
Get full text

Solving transcendental equation using genetic algorithm / Masitah Hambari by Masitah , Hambari

“…Genetic algorithm (GA) has long been used for optimization problems that arise in a wide variety of complex systems. …”
Get full text
Get full text

Performances Of Metaheuristic Algorithms In Optimizing Tool Capacity Allocations by Goheannee

“…To achieve the best allocation, optimization methods, such as metaheuristic algorithms are commonly used. This research compares the performances of various metaheuristic algorithms to optimize tool capacity allocation in two case studies. …”
Get full text
Get full text

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

“…The algorithms are evaluated using 30 benchmark functions of the CEC2014 benchmark suite, and then applied to solve PCB drill path optimization case study. …”
Get full text
Get full text