Search Results - (( java implementation path algorithm ) OR ( using solving waste 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

Ant colony optimization for solving solid waste collection scheduling problems by Ismail, Zuhaimy, Loh, S. L.

“…Formulating this real life problem into vehicle routing problem with stochastic demand model and using some designed algorithms to minimize operation cost of solid waste management. …”
Get full text
Get full text
Get full text

Ant Colony Optimization for Solving Solid Waste Collection Scheduling Problems by Ismail, Zuhaimy, Loh, Ser Lee

“…Formulating this real life problem into vehicle routing problem with stochastic demand model and using some designed algorithms to minimize operation cost of solid waste management. …”
Get full text
Get full text
Get full text

A greedy heuristics multiple criteria model for solving multi-landfill site selection and plant propagation algorithm for improving waste collection vehicle routing solutions by Nur Azriati, Mat

“…First, previous models focused only on a single landfill site based on the highest score without considering the operational costs criterion in solving LSSP. Second, the Plant Propagation Algorithm (PPA) has never been considered to solve WCVRP. …”
Get full text
Get full text
Get full text

Enhanced Heuristic Algorithms with A Vehicle Travel Speed Model for Time-Dependent Vehicle Routing: A Waste Collection Problem by Mat, Nur Azriati, Benjamin, Aida Mauziah, Abdul-Rahman, Syariza

“…The benchmark problem consisted of ten sub problems, involving up to 2092 customers. Previous studies solved the benchmark problem using DIC and CIS algorithms with the assumption that the vehicles are travelling with a static speed when collecting the waste. …”
Get full text
Get full text

Enhanced heuristic algorithms with a vehicle travel speed model for time-dependent vehcile routing: A waste collection problem by Mat, Nur Azriati, Benjamin, Aida Mauziah, Abdul-Rahman, Syariza

“…This paper proposes a vehicle travel speed model to enhance two heuristic algoritihms from previous studies, namely current initial solution (CIS) and different initial customer (DIC).Both algorithms are used to solve a real-life waste collection vehicle routing benchmark problem with dynamic travel speeds. …”
Get full text
Get full text
Get full text

Using predictive analytics to solve a newsvendor problem / S. Sarifah Radiah Shariff and Hady Hud by Shariff, S. Sarifah Radiah, Hud, Hady

“…Secondly, in solving every Machine Learning problem, there is no one algorithm superior to other algorithms. …”
Get full text
Get full text

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

Capacitated vehicle-routing problem model for scheduled solid waste collection and route optimization using PSO algorithm by Hannan M.A., Akhtar M., Begum R.A., Basri H., Hussain A., Scavino E.

Metaheuristics for the waste collection vehicle routing problem with time windows by Benjamin, Aida Mauziah, Beasley, J. E.

“…In this problem there is a set of customers which waste is collected by vehicles.Vehicles can visit waste disposal facilities during their working day to empty collected waste and hence continue to collect from customers.The vehicles start and end their routes at a single depot empty.We take into consideration time windows associated with customers, disposal facilities and the depot.Here, we also have a driver rest period.The problem is solved using a number of metaheuristic algorithms namely tabu search (TS) and variable neighbourhood search (VNS).More over, we also present a combined metaheuristic algorithm based on variable neighbourhood tabu search (VNTS).Where the variable neighbourhood is searched via tabu search.Computational experiments on ten publicly available waste collection benchmark problems involving up to 2092 customers and 19 waste disposal facilities indicates that the proposed algorithms are able to find better quality solutions than previous work presented in literature within reasonable computation times.…”
Get full text
Get full text

Metaheuristics with disposal facility positioning for the waste collection VRP with time windows by Benjamin, Aida Mauziah, Beasley, J. E.

“…This paper improves heuristic algorithms presented in Benjamin and Beasley (Comput Oper Res 37(12):2270–2280, 2010) for solving the waste collection vehicle routing problem with time windows, particularly the real life waste collection benchmark problems from Kim et al.…”
Get full text
Get full text

Nearest greedy for solving the waste collection vehicle routing problem: A case study by Mat, Nur Azriati, Benjamin, Aida Mauziah, Abdul-Rahman, Syariza, Wibowo, Antoni

Get full text
Get full text

A matrix approach for minimum spanning tree in neutrosophic and application in medical waste management / Nur Haifa Ahmad Hayazim, Siti Nurain Zulkifli and Siti Nurhidayah Yaacob by Ahmad Hayazim, Nur Haifa, Zulkifli, Siti Nurain, Yaacob, Siti Nurhidayah

“…A numerical example related to finding the optimal route that can minimize the cost of solving the medical waste management is provided to show the effectiveness of the Prim's and Kruskal's algorithms with IVBN. …”
Get full text
Get full text

Development of heuristic methods based on genetic algorithm (GA) for solving vehicle routing problem by Ismail, Zuhaimy, Nurhadi, Irhamah, Zainuddin, Zaitul Marlizawati

“…This research proposes the enhanced metaheuristic algorithms that exploit the power of Tabu Search, Genetic Algorithm, and Simulated Annealing for solving VRPSD. …”
Get full text
Get full text

Metaheuristics for the waste collection vehicle routing problem with time windows, driver rest period and multiple disposal facilities by Benjamin, Aida Mauziah, Beasley, J. E.

“…A procedure that attempts to fully utilise a vehicle is used to obtain an initial solution, with this initial solution being improved using an interchange procedure.We present two metaheuristic algorithms using tabu search and variable neighbourhood search that are based around the neighbour sets.We also present a metaheuristic based on variable neighbourhood tabu search, where the variable neighbourhood is searched via tabu search.Computational results are presented for publicly available waste collection problems involving up to 2092 customers and 19 waste disposal facilities, which indicate that our algorithms produce better quality solutions than previous work presented in the literature.…”
Get full text
Get full text
Get full text

Development of a fuzzy multi-objective mathematical model for hazardous waste location-routing problem by Hassani, Omid Boyer

“…To solve the model a (fast elitist Non-Dominated Sorting Genetic Algorithm (NSGAII)) and also the (weighted sum method (WSM)) were used and their results were compared to each other. …”
Get full text
Get full text

Development of novel algorithm features in the modelling of cyclic processes by Choong, Thomas S.Y., Paterson, William R., Scott, David M.

“…In principle, the algorithm could be used for many cyclic process. Air separation using rapid pressure swing adsorption (RPSA) is used as an illustration. …”
Get full text
Get full text
Get full text