Search Results - (( waste objective scheduling algorithm ) OR ( java implementation path algorithm ))

Heavy Transportation Shortest Route using Dijkstra’s algorithm (HETRO) / Nurul Aqilah Ahmad Nezer by Ahmad Nezer, Nurul Aqilah

“…The development tools used in developing this project is NetBeans by using Java for the implementation of the coding. The methodology that used for developing this system is the Dijkstra’s algorithm. …”
Get full text
Get full text

Embedded system for indoor guidance parking with Dijkstra’s algorithm and ant colony optimization by Mohammad Ata, Karimeh Ibrahim

“…BST inserts the nodes in the way that the Dijkstra’s can find the empty parking in fastest way. Dijkstra’s algorithm initials the paths to finding the shortest path while ACO optimizes the paths. …”
Get full text
Get full text

Path planning for unmanned aerial vehicle (UAV) using rotated accelerated method in static outdoor environment by Shaliza Hayati A. Wahab, Nordin Saad, Azali Saudi, Ali Chekima

“…In this study, a fast iterative method known as Rotated Successive Over-Relaxation (RSOR) is introduced. The algorithm is implemented in a self-developed 2D Java tool, UAV Planner. …”
Get full text
Get full text
Get full text
Get full text

Smart appointment organizer for mobile application / Mohd Syafiq Adam by Adam, Mohd Syafiq

“…The main component of this prototype is the use of Dijkstra algorithm to compute the shortest path from source of appointment to the 6 points of destinations within UiTM Shah Alam. …”
Get full text
Get full text

SG-PBFS : Shortest Gap-Priority Based Fair Scheduling technique for job scheduling in cloud environment by Murad, Saydul Akbar, Zafril Rizal, M. Azmi, Muzahid, Abu Jafar Md, Bhuiyan, Md Khairul Bashar, Saib, Md, Rahimi, Nick, Prottasha, Nusrat Jahan, Bairagi, Anupam Kumar

“…To address this issue, the main objective of this research is to improve the existing Priority Rules (PR) cloud schedulers by developing a new dynamic scheduling algorithm by manipulating the gaps in the cloud job schedule. …”
Get full text
Get full text
Get full text
Get full text

Backtracking search algorithm in CVRP models for efficient solid waste collection and route optimization by Akhtar M., Hannan M.A., Begum R.A., Basri H., Scavino E.

Faculty timetabling using genetic algorithm by Liong, Boon Yaun

“…Faculty Timetabling using Genetic Algorithm (FTGA) is an application that generate optimum timetable for faculty.The target user of this application is faculty staff who responsible in generate timetable.The problem statement of the project is many clashing exist in the timetable.Faculty staff needs to solve the clashing manually.This will waste time and it is a problem for staff to solve the clashing.By implement GA,clashing will be reduced.The objective of the project is to develop aprototype in scheduling application for generates an optimum timetable for a faculty.Genetic algorithm will be implemented.The scope of FTGA is Faculty of Computer Systems & Software Engineering (FCSSE).The methodology use in this project is prototype model.The testing result show 95 out of 100 test cases achieved the maximum fitness value which means there is no clashing in the timetable.The maximum generation is set to 15 generation.Population for each generation is 3 populations.Percentage of FTGA solve the problem is 95%.…”
Get full text
Get full text

Evolutionary cost-cognizant regression test case prioritization for object-oriented programs by Bello, AbdulKarim

“…Therefore, this study proposed a cost-cognizant TCP approach for object-oriented software that uses path-based integration testing to identify the possible execution path extracted from the Java System Dependence Graph (JSDG) model of the source code using forward slicing technique. …”
Get full text
Get full text