Search Results - (( program solving ((method algorithm) OR (path algorithm)) ) OR ( java application _ algorithm ))

Path planning algorithm for a car like robot based on MILP method by Mohd Sadri, Mohd Pawzi

“…This project is presents an algorithm for path planning optimal routes mobile robot “like a car” to a target in unknown environment. …”
Get full text
Get full text
Get full text
Get full text

Development of Hybrid Algorithm for Integrated Aircraft Routing Problem and Crew Pairing Problem by NurulFarihan Mohamed, ZaitulMarlizawati Zainuddin, Said Salhi, Nurul Huda Mohamed, NurulAkmal Mohamed

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

“…Due to the increasing of complexity in software projects, group work is becoming more important in order to ensure quality software products can be delivered on time.Thus, in universities, group work is seen as a good preparation for students to industry because by working in group, it can reduce the individual workload,improve the ability to manage a project and enhance the problem solving skills. 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

A method for group formation using genetic algorithm by Che Ani, Zhamri, Yasin, Azman, Husin, Mohd Zabidin, Abdul Hamid, Zauridah

“…Due to the increasing of complexity in software projects, group work is becoming more important in order to ensure quality software products can be delivered on time.Thus, in universities, group work is seen as a good preparation for students to enter industry because by working in group, it can reduce the individual workload, improve the ability to manage a project and enhance the problem solving skills. However, due to lack of programming skills especially in Java programming language, 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 programming.This paper presents a method for group formation using genetic algorithm, where the members for each group will be generated based on the students’ programming skill.…”
Get full text
Get full text
Get full text

Recent research in cooperative path planning algorithms for multi-agent using mixed- integer linear programming by Che Ku, Nor Azie Hailma, Omar, Rosli, Sabudin Elia Nadira, Sabudin Elia Nadira

“…This paper will review and compare the performances of those existing methods that can find solution without graph search algorithm such as Mixed-Integer Linear Programming (MILP) techniques which exactly solves the problem and then propose four alternative MILP formulations which are computationally less intensive and suited for real-time purposes, but yield a theoretically guaranteed suboptimal solution.…”
Get full text
Get full text

Solving vehicle routing problem by using improved K-nearest neighbor algorithm for best solution by Mohammed, Mazin Abed, Abd Ghani, Mohd Khanapi, Hamed, Raed Ibraheem, A. Mostafa, Salama, Ahmed Ibrahim, Dheyaa, Jameel, Humam Khaled, Alallah, Ahmed Hamed

“…The structure of the algorithm is designed so that the program does not require a large database to store the population, which speeds up the implementation of the program execution to obtain the solution; secondly, the algorithm has proven its success in solving the problem and finds a shortest route. …”
Get full text
Get full text
Get full text

An Enhanced Simulated Annealing Routing Algorithm for Semi-Diagonal Torus Network by Noraziah, Adzhar, Shaharuddin, Salleh

“…In order to achieve this objective, each node must be connected in its shortest way as possible. We start our algorithm by designing shortest path algorithm based on Dijkstra's method. …”
Get full text
Get full text
Get full text

Scheduling of batch process plant / Abdul Aziz Abu Bakar by Abu Bakar, Abdul Aziz

“…This research work is devoted to software development of scheduling and control algorithm of batch process plant using shortest path method developed by Dijkstra and K* shortest path method developed by Jin Y. …”
Get full text
Get full text

The solution of 2048 puzzle game using A* algorithm / Zafhira Ismail by Ismail, Zafhira

“…Experiment result proves high accuracy and efficiency from the proposed algorithm. For future work, besides the program providing the shortest path to minimize the possible movement to achieve game’s goal, the game could have a hint button attached to help the player.…”
Get full text
Get full text

Optimum Time-Cost Trade-Off Strategies on Critical Path Method for Project Management by Khalaf, Wakas S.

“…Approach of Crashing Critical Activities (CCA) was originally developed along with the Critical Path Method (CPM) for planning and controlling large scale projects in the late 50s. …”
Get full text
Get full text

Automated time series forecasting by Ismail, Suzilah, Zakaria, Rohaiza, Tuan Muda, Tuan Zalizam

“…While quantitative technique is based on statistical concepts and requires large amount of data in order to formulate the mathematical models.This technique can be classified into projective and causal technique.The projective technique (or univariate modelling) just involve one variable while the causal technique (or econometric modelling) suitable for multi-variables.Since forecasting involves uncertainty, several methods need to be executed on one set of time series data in order to produce accurate forecast.Hence, usually in practice forecaster need to use several softwares to obtain the forecast values.If this practice can be transformed into algorithm (well-defined rules for solving a problem) and then the algorithm can be transformed into a computer program, less time will be needed to compute the forecast values where in business world time is money.In this study, we focused on algorithm development for univariate forecasting techniques only and will expand towards econometric modelling in the future.Two set of simulated data (yearly and non-yearly) and several univariate forecasting techniques (i.e. …”
Get full text
Get full text
Get full text

The shortest route of the potential companies for internship using Dijkstra’s Algorithm / Mohamad Khairul Ikhwan Mohd Radzi by Mohd Radzi, Mohamad Khairul Ikhwan

Get full text
Get full text

Soft computing approach for solving elevator scheduling problem by Norzatul Hajar, Abd Majid

“…It is formulated as an integer programming problem. In order to solve the scheduling problem on elevator, a genetic algorithm as part of soft computing is used in a real time system. …”
Get full text
Get full text
Get full text

Motor Speed Controlled Using Voice Recognition by Wan Muhd Albazli bin Wan Harujan

Text messaging encryption system by Sundara Morthty, Nirmala Devi

“…The only way to read the information is to know the method on how message is being masked,in this case knowing the algorithm used to encrypt the message. …”
Get full text
Get full text

Restaurant locator using Djikstra Algorithm / Mohamad Aliff Hakimi Lukman Hakim by Lukman Hakim, Mohamad Aliff Hakimi

Get full text
Get full text

Integration of program evaluation and review technique (PERT), gantt chart and genetic algorithm in project management scheduling by Ahmad, Siti Hasziani

“…In this thesis, the discussion on the integration approach, which combines Program Evaluation and Review Technique (PERT), Gantt Chart (GC) and Genetic Algorithm (GA), is carried out. …”
Get full text
Get full text
Get full text

Finding multi-constrained path using genetic algorithm by Yussof S., See O.H.

Development of a Mobile Robot Local Navigation System Based on Fuzzy-Logic Control and Actual Virtual Target Switching by Esmaeili Motlagh, Omid Reza

“…From TRAINER Software and Colbert Program which were used in the simulation work, the system managed to solve all the problems in sample environments and the results were compared with results from other related methods to show the effectiveness and robustness of the proposed approach.…”
Get full text
Get full text

Solving a Reconfigurable Maze using Hybrid Wall Follower Algorithm by Saman, Abu Bakar Sayuti, Abdramane, Issa

“…It is found that the hybrid algorithm has improved the maze solving capabilities of the maze robot significantly…”
Get full text
Get full text