Search Results - (( solution construction phase algorithm ) OR ( program implementation using algorithm ))

Optimization of Digital Electronic Circuit Structure Design Using Genetic Algorithm by Chong, Kok Hen

“…GALI is programmed by the success chromosome bits obtained from the simulation phase. …”
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

Enhancing the Sorting Layers in the Initial Stage of High School Timetabling by Arbaoui, Billel, Wahid, Juliana, Abdul-Rahman, Syariza

“…Generally, NP-Complete problem was solved firstly by constructing the initial solution, in the construction phase. …”
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

“…Future work will use the best settings of heuristics to the improvement phase in population-based improvement algorithm.…”
Get full text
Get full text

Implementation of Autonomous Vehicle Navigation Algorithms Using Event-Driven Programming by Saman, Abu Bakar Sayuti, Sebastian , Patrick, Malek, Nadhira, Hasidin, Nurul Zahidah

“…The algorithm can be relatively easy translated to a suitable program with event-driven programming technique. …”
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

Implementation of autonomous vehicle navigation algorithms using event-driven programming by Saman, Abu Bakar Sayuti, Sebastian , Patrick, Malek, Nadhira, Hasidin, Nurul Zahidah

“…The algorithm can be relatively easy translated to a suitable program with event-driven programming technique. …”
Get full text
Get full text
Get full text

Evaluation of the effectiveness and efficiency of Wagner and Fischer algorithm in retrieving Hadith translated documents / Kamarul Arifin Muhamad by Muhamad, Kamarul Arifin

“…The method has been implemented as a C programming language. In this study, Wagner and Fischer algorithm, Hadith test collection that consists of Malay Hadith translation documents, query words and relevant judgements are used. …”
Get full text
Get full text

Enhanced cell-based algorithm with dynamic radius in solving capacitated multi-source weber problem by Nurhazwani, Ahmad Razak

“…The methodology consists of three phases. First, the profitable cells were constructed by applying ECBA. …”
Get full text
Get full text

Embedding Malaysian House Red Ant Behavior into an Ant Colony System by Ali Othman, Zulaiha, Md Rais, Helmi, Hamdan, Abdul Razak

“…The three level phases of pheromone updates are: local construction, local reinforcement and global reinforcement. …”
Get full text
Get full text

Simulation of shortest path using a-star algorithm / Nurul Hani Nortaja by Nurul Hani , Nortaja

“…The steps to calculate a shortest path using A • algorithm is shown by using appropriate examples and related figures. …”
Get full text
Get full text

Development of two matheuristics for production-inventory-distribution routing problem / Dicky Lim Teik Kyee by Dicky Lim , Teik Kyee

“…Phase 2 uses VNS and we utilize both phases in an interactive manner. …”
Get full text
Get full text
Get full text

Implementation of Color Filtering on FPGA by Mohd Shukor, Mohd Nasir, Lo, H. H., Sebastian, Patrick

“…Verilog HDL is chosen as the hardware programming language for this system and its compiled using Quartus II program. …”
Get full text
Get full text

A MODIFIED PARTICLE SWARM OPTIMIZATION ALGORITHM FOR WELLBORE TRAJECTORY DESIGN by BISWAS, KALLOL

“…The improvements of the original PSO algorithm are proposed by updating its exploitation phase by incorporating the GWO algorithm because of its strong exploitation capability and the exploration phase using a cellular automaton due to its ability to explore more area by constructing new neighbours. …”
Get full text
Get full text

A Tabu Search Approach with Embedded Nurse Preferences for Solving Nurse Rostering Problem by Ramli, Razamin, Ahmad, Siti Nurin Ima, Abdul-Rahman, Syariza, Wibowo, Antoni

“…The methodology consists of two phases: initialization and neighborhood. The semi-random initialization is employed for finding a good initial solution during the initialization phase which avoids the violation of hard constraints, while the neighborhood phase is established for further improving the solution quality with a special representation and innovative neighborhood generations within TS algorithm. …”
Get full text
Get full text
Get full text
Get full text

A tabu search approach with embedded nurse preferences for solving nurse rostering problem by Ramli, Razamin, Ahmad, Siti Nurin Ima, Abdul-Rahman, Syariza, Wibowo, Antoni

“…The methodology consists of two phases: initialization and neighborhood. The semi-random initialization is employed for finding a good initial solution during the initialization phase which avoids the violation of hard constraints, while the neighborhood phase is established for further improving the solution quality with a special representation and innovative neighborhood generations within TS algorithm. …”
Get full text
Get full text
Get full text
Get full text

Generic DNA encoding design scheme to solve combinatorial problems by Rofilde, Hasudungan

“…However, DNA computing can solve the problem in linear time since the parallel processing power of DNA computing is able to generate a solution in a single process. DNA encoding is the first important step in DNA computing phases. …”
Get full text
Get full text

CAR TRACTION CONTROL SYSTEM by MOHD ISMAIL, ADIBAH

“…VHDL is used in FPGA - based implementation. The methodology includes designing the fuzzy logic controller, development of the algorithm and codes programming. …”
Get full text
Get full text

Development of a Negotiation Support Model for Value Management in Construction by UTOMO, CHRISTIONO

“…In such situation where the designer, project manager, facility manager and others are involved in choosing a single alternative from a set of solutions, a negotiation support is required to evaluate and rank the solution before engaging into negotiation. …”
Get full text
Get full text

Implementation of repetitive control algorithm in reducing vibration using MATLAB/SIMULINK / Mohamad Zuhairy Mohamed by Mohamed, Mohamad Zuhairy

“…In this report, it analyzes an application of repetitive control algorithm that deal with periodic disturbance.. To investigates the possibility of using a truncated finite impulse response (FIR) model approximation to implement a well-known gradient type repetitive control algorithm. …”
Get full text
Get full text