Search Results - (( parallel optimization path algorithm ) OR ( initial solution using algorithm ))

Restoration planning strategy of transmission system based on optimal energizing time of sectionalizing islands / Dian Najihah Abu Talib by Dian Najihah , Abu Talib

“…The initial solution is important to guide the optimization methods in finding the optimal solution. …”
Get full text
Get full text
Get full text

Tool path generation of contour parallel based on ant colony optimisation by Abdullah, Haslina, Ramli, Rizauddin, Abd Wahab, Dzuraidah, Abu Qudeiri, Jaber

“…An Ant Colony Optimisation (ACO) method is used to optimize the tool path length because of its capability to find the shortest tool path length. …”
Get full text
Get full text

Minimizing machining airtime motion with an ant colony algorithm by Abdullah, Haslina, Ramli, Rizauddin, Abd Wahab, Dzuraidah, Abu Qudeiri, Jaber

Get full text
Get full text

OPTIMAL DATAPATH DESIGN FOR A CRYPTOGRAPHIC PROCESSOR: THE BLOWFISH ALGORITHM by Zain Ali, Noohul Basheer, Noras, James

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

A novel large-bit-size architecture and microarchitecture for the implementation of Superscalar Pipeline VLIW microprocessors by Lee, Weng Fook

“…Different adder architectures are investigated for suitability on synthesis implementation of large data bus size adder for efficient usage within the ALU. An adder algorithm using repetitive constructs in a parallel algorithm that allows for efficient and optimal synthesis for large data bus size is proposed as a suitable implementation for the adder within the ALU. …”
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

Hybrid tabu search – strawberry algorithm for multidimensional knapsack problem by Wong, Jerng Foong

“…The Greedy heuristics by ratio was employed to construct an initial solution. Next, the solution was enhanced by using the hybrid TS-SBA. …”
Get full text
Get full text
Get full text

Enhancing the RC4 algorithm by eliminating the Initiative Vector (IV) transmission by Waleed Abdelrahman Yousif Mohammed, Salmah Fattah, Khalid Mohammed Osman Saeed, Ashraf Osman Ibrahim Elsayed, Safaa Eltahier

“…This paper introduces an innovative approach to address the vulnerabilities of the RC4 encryption algorithm by employing an Initiative Vector (IV). The proposed method incorporates a lengthy random text without transmitting an initialization vector. …”
Get full text
Get full text
Get full text

Clustering ensemble learning method based on incremental genetic algorithms by Ghaemi, Reza

“…Moreover, experiments demonstrate that final clustering solution generated by the proposed incremental genetic-based clustering ensemble algorithm using the pattern ensemble learning method possess comparative or better clustering accuracy than clustering solutions generated by the incremental genetic-based clustering ensemble algorithms using other recombination operators. …”
Get full text
Get full text

Hybrid of firefly algorithm and pattern search for solving optimization problems by Wahid, Fazli, Ghazali, Rozaida

“…In the first stage, the parameters of standard FA are initialized. In the firefly changing position stage, the randomization factor is used to update the solution in each iteration of operational stages. …”
Get full text
Get full text

Initialization Methods For Conventional Fuzzy C-Means And Its Application Towards Colour Image Segmentation by Tan , Khang Siang

“…Due to its capability in providing a particularly promising solution to clustering problems, the conventional Fuzzy C-Mean (FCM) algorithm is widely used as a segmentation method. …”
Get full text
Get full text

Vehicle Routing Problem with Simultaneous Pickup and Delivery by Sze, San Nah, Sek, Siaw Ying Doreen, Sze, Jeeu Fong, Cheah, Wai Shiang, Chiew, Kang Leng

“…A simple heuristic is used to generate the initial solution in the first phase. …”
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

“…Conclusion/Recommendations: The results obtained from intelligence based genetic algorithm were used as an initial point for fine-tuning by simulated annealing to increase the quality of solution. …”
Get full text
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

“…KHE is an algorithm that generates initial solution of HSTP. …”
Get full text
Get full text
Get full text

Comparison between Newton’s Method and a new Scaling Newton Method / Ramizah Baharuddin by Baharuddin, Ramizah

“…The second estimate is obtained by using the tangent line of f (x) at the initial value. …”
Get full text
Get full text

Solving Assembly Line Balancing Problem Using Genetic Algorithm With Heuristics-Treated Initial Population by Chong, Kuan Eng, Omar, Mohamed K, Abu Bakar, Nooh

“…Although genetic algorithm (GA) has been widely used to address assembly line balancing problems (ALBP), not much attention has been given to the population initialization procedure. …”
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

Flexible job shop scheduling using priority heuristics and genetic algorithm by Farashahi, Hamid Ghaani

“…In the next method, a genetic algorithm has been developed. It has been shown that proposed genetic algorithm with a reinforced initial population (GA2) has better efficiency compared to a proposed genetic algorithm with fully random initial population (GA0). …”
Get full text
Get full text

Hexagon pattern particle swarm optimization based block matching algorithm for motion estimation / Siti Eshah Che Osman by Che Osman, Siti Eshah

“…Due to the center biased nature of the videos, the HPSO algorithm uses an initial pattern (hexagon-shaped) to speed up the convergence of the algorithm. …”
Get full text
Get full text