Search Results - (( program solving ((method algorithm) OR (path algorithm)) ) OR ( java location based algorithm ))
Search alternatives:
- method algorithm »
- program solving »
- path algorithm »
- java »
-
1
Group formation using genetic algorithm
Published 2009“…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
Monograph -
2
Path planning algorithm for a car like robot based on MILP method
Published 2013“…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
Thesis -
3
-
4
Recent research in cooperative path planning algorithms for multi-agent using mixed- integer linear programming
Published 2016“…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
Article -
5
Solving vehicle routing problem by using improved K-nearest neighbor algorithm for best solution
Published 2017“…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
Article -
6
An Enhanced Simulated Annealing Routing Algorithm for Semi-Diagonal Torus Network
Published 2017“…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
Article -
7
Scheduling of batch process plant / Abdul Aziz Abu Bakar
Published 1995“…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
Student Project -
8
The solution of 2048 puzzle game using A* algorithm / Zafhira Ismail
Published 2017“…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
Thesis -
9
Optimum Time-Cost Trade-Off Strategies on Critical Path Method for Project Management
Published 2010“…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
Thesis -
10
-
11
Soft computing approach for solving elevator scheduling problem
Published 2010“…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
Final Year Project Report / IMRAD -
12
-
13
-
14
Integration of program evaluation and review technique (PERT), gantt chart and genetic algorithm in project management scheduling
Published 2014“…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
Thesis -
15
-
16
Development of a Mobile Robot Local Navigation System Based on Fuzzy-Logic Control and Actual Virtual Target Switching
Published 2006“…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
Thesis -
17
Solving a Reconfigurable Maze using Hybrid Wall Follower Algorithm
Published 2013“…It is found that the hybrid algorithm has improved the maze solving capabilities of the maze robot significantly…”
Get full text
Get full text
Citation Index Journal -
18
A Compromise Programming to Task Assignment Problem in Software Development Project
Published 2021“…We designed a genetic algorithm scheme to solve the transformed problem. …”
Get full text
Get full text
Article -
19
Cyclic Path Planning Of Hyper-Redundant Manipulator Using Whale Optimization Algorithm
Published 2023Article -
20