Search Results - (( initial solution study algorithm ) OR ( java location based algorithm ))

Development of mobile location based notification for crime cases tracking as an alternative alert for public safety / Noraini Ismail by Ismail, Noraini

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

Group formation using genetic algorithm by Che Ani, Zhamri, Husin, Mohd Zabidin, Yasin, Azman

“…However, due to lack of programming skills especially in Java programming language and the inability to have meetings frequently among the group members,most of the students’ software project cannot be delivered successfully.To solve this problem, systematic group formation is one of the initial factors that should be considered to ensure that every group consists of quality individuals who are good in Java programming and also to ensure that every group member in a group are staying closer to each other.In this research, we propose a method for group formation using Genetic Algorithms, where the members for each group will be generated based on the students’ programming skill and location of residential colleges.…”
Get full text
Get full text
Get full text
Get full text

Multi-floor indoor location estimation system based on wireless local area network by Chua, Tien Han

“…The most probable match is selected and returned as estimated location based on Bayesian filtering algorithm. Estimated location is reported as physical location and symbolic location. …”
Get full text
Get full text

Traveler’s recommendation mobile based system around Terengganu / Muhammad Aiman Syakir Shamsudin by Shamsudin, Muhammad Aiman Syakir

Get full text
Get full text

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

“…The findings revealed that on average the hybrid TS-SBA was able to increase 1.97% profit of the initial solution. However, the best-known solution from past studies seemed to outperform the hybrid TS-SBA with an average difference of 3.69%. …”
Get full text
Get full text
Get full text

Multistage optimal homotopy asymptotic method for solving initial-value problems by Anakira, N. R., Alomari, A. K., Jameela, Ali, Hashim, Ishak

“…In this paper, a new approximate analytical algorithm namely multistage optimal homotopy asymptotic method (MOHAM) is presented for the first time to obtain approximate analytical solutions for linear, nonlinear and system of initial value problems (IVPs).This algorithm depends on the standard optimal homotopy asymptotic method (OHAM), in which it is treated as an algorithm in a sequence of subinterval. …”
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

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

“…Firstly, an architecture for the clustering ensemble based on incremental genetic-based algorithms is proposed consisting of two phases: (i) to produce cluster partitions as initial populations, (ii) to combine cluster partitions and to generate final clustering solution by incremental genetic based clustering ensemble learning algorithm. …”
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

Efficiency of heuristic algorithms in solving waste collection vehicle routing problem: a case study by Mat, Nur Azriati, Benjamin, Aida Mauziah, Abdul-Rahman, Syariza

“…This paper investigated the efficiency of six heuristic algorithms from prior studies in the attempt to solve issues related to waste collection, namely: (i) Nearest Greedy (NG), (ii) Further from Depot (FFD), (iii) Different Initial Customer (DIC), (iv) Savings Approach, (v) Sweep Algorithm, and (vi) Different Initial Customer based on Sweep Algorithm. …”
Get full text
Get full text
Get full text

Efficiency of heuristic algorithms in solving waste collection vehicle routing problem: a case study by Mat, Nur Azriati, Benjamin, Aida Mauziah, Abdul-Rahman, Syariza

“…This paper investigated the efficiency of six heuristic algorithms from prior studies in the attempt to solve issues related to waste collection, namely: (i) Nearest Greedy (NG), (ii) Further from Depot (FFD), (iii) Different Initial Customer (DIC), (iv) Savings Approach, (v) Sweep Algorithm, and (vi) Different Initial Customer based on Sweep Algorithm. …”
Get full text
Get full text
Get full text

Study on numerical solution of a variable order fractional differential equation based on symmetric algorithm by Liu, Jingrui, Pan, Dongyang

“…As the class of fractional differential equations with changing order has attracted more attention and attention in the fields of research and engineering, it is important to study its numerical solutions. Numerical solution algorithm for a class of fractional differential equations with transformed arrays based on the proposed symmetry algorithm. …”
Get full text
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

“…In this HPSO algorithm, totally seven particles positions are initialized. …”
Get full text
Get full text

Studying the Impact of Initialization for Population-Based Algorithms with Low-Discrepancy Sequences by Adnan Ashraf, Sobia Pervaiz, Waqas Haider Bangyal, Kashif Nisar, Ag. Asri Ag. Ibrahim, Joel J. P. C. Rodrigues, Danda B. Rawat

Get full text
Get full text
Get full text
Get full text
Get full text

Shooting method with root finding to solve boundary value problems / Aryani Rima Matakim by Matakim, Aryani Rima

“…The aim of the study is to analyze the effectiveness of these algorithms regarding their convergence rate, accuracy, and robustness. …”
Get full text
Get full text

A Hybrid ant colony optimization algorithm for solving a highly constrained nurse rostering problem by Ramli, Razamin, Abd Rahman, Rosshairy, Rohim, Nurdalila

“…The hybridization with the hill climbing is aiming at fine-tuning the initial solution or roster generated by the ACO algorithm to achieve better rosters. …”
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

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

Mathematical simulation for 3-dimensional temperature visualization on open source-based grid computing platform by Alias, Norma, Satam, Noriza, Abd. Ghaffar, Zarith Safiza, Darwis, Roziha, Hamzah, Norhafiza, Islam, Md. Rajibul

“…The development of this architecture is based on several programming language as it involves algorithm implementation on C, parallelization using Parallel Virtual Machine (PVM) and Java for web services development. …”
Get full text
Get full text
Get full text