Search Results - (( evolution optimization path algorithm ) OR ( waste collection based algorithm ))

The Development Of A Robust Algorithm For Uav Path Planning In 3d Environment by Kok, Kai Yit

“…Significant research has been conducted on Unmanned Aerial Vehicle (UAV) path planning using evolutionary algorithms, such as Particle Swarm Optimization (PSO), Genetic Algorithm (GA), Differential Evolution (DE), and Biogeographic-Based Optimization (BBO). …”
Get full text
Get full text

Development of an improved GWO algorithm for solving optimal paths in complex vertical farms with multi-robot multi-tasking by Shen, Jiazheng, Hong, Tang Sai, Fan, Luxin, Zhao, Ruixin, Mohd Ariffin, Mohd Khairol Anuar, As’arry, Azizan

“…The EPDE-GWO algorithm is compared with Genetic Algorithm (GA), Simulated Annealing (SA), Dung Beetle Optimizer (DBO), and Particle Swarm Optimization (PSO). …”
Get full text
Get full text
Get full text

Path optimization using genetic algorithm evolution by Low C.Y., Chong K.H., Salleh K., Johnny K.S.P.

Finding minimum path by using Genetic Algorithm (GA)/ Siti Zuraifah Hashim by Hashim, Siti Zuraifah

“…Roadways and telephone systems are the examples of them. Genetic Algorithms (GA), pioneered by John Holland, applies the principle of evolution found in nature to the problem of finding an optimal solution. …”
Get full text
Get full text

Differential evolution optimization for constrained routing in Wireless Mesh Networks by Sanni, Mistura Laide, Hassan Abdalla Hashim, Aisha, Hassan, Wan Haslina, Ahmed, Gharib Subhi Mahmoud, Anwar, Farhat, Zakaria, Omar

“…This solution addresses efficient and optimal routing path construction for cost and quality metrics of the application. …”
Get full text
Get full text
Get full text

Literature Review of Optimization Techniques for Chatter Suppression In Machining by A. R., Yusoff, Mohamed Reza Zalani, Mohamed Suffian, Mohd Yusof, Taib

“…Various algorithms can be applied in the optimization of machining problems; however, Differential Evolution is the most appropriate for use in chatter suppression, being less time consuming, locally optimal, and more robust than both Genetic Algorithms, despite their wide applications, and Sequential Quadratic Programming, which is a famous conventional algorithm.…”
Get full text
Get full text
Get full text

Comparative analysis of spiral dynamic algorithm and artificial bee colony optimization for position control of flexible link manipulators by Nor Maniha, Abdul Ghani, Nizaruddin, M. Nasir, Azrul Azim, Abdullah Hashim

“…By integrating the ABC algorithm into the manipulator's control system, the goal is to enhance its ability to plan paths and optimize trajectories. …”
Get full text
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.

Smart Routing For Solid Waste Collection by Ngiam, John Tze

“…The results of the evaluation will be used to design and develop a web-based application for route management, which will be made available to waste collection companies and garbage truck drivers. …”
Get full text
Get full text
Get full text

Dijkstra’s Algorithm for optimal recyclable waste collection system in Port Dickson / Nur Jazlina Mohd Iszairi, Aina Zulaika Md Ramli and Nursabrina Saifulbahri by Mohd Iszairi, Nur Jazlina, Md Ramli, Aina Zulaika, Saifulbahri, Nursabrina

“…Irregular waste collection services are among key challenges for establishing waste recycling. …”
Get full text
Get full text

Hybrid genetic algorithm with multi-parents recombination for job shop scheduling problems / Ong Chung Sin by Ong, Chung Sin

“…This mechanism is restricted to search the possible solutions in a critical path. Modification on the path by using neighborhood search significantly reduces the total length of the makespan. …”
Get full text
Get full text
Get full text

Modeling and multi-objective optimal sizing of standalone photovoltaic system based on evolutionary algorithms by Ridha, Hussein Mohammed

“…The IEM algorithm uses the attraction-repulsion mechanism to change the positions of solutions towards the optimality. …”
Get full text
Get full text

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

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

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.

“…In this problem there is a set of waste disposal facilities, a set of customers at which waste is collected and an unlimited number of homogeneous vehicles based at a single depot.Empty vehicles leave the depot and collect waste from customers, emptying themselves at the waste disposal facilities as and when necessary.Vehicles return to the depot empty.We take into consideration time windows associated with customers, disposal facilities and the depot. …”
Get full text
Get full text
Get full text

ESS-IoT: The Smart Waste Management System for General Household by Wong S.Y., Han H., Cheng K.M., Koo A.C., Yussof S.

“…The critical issue for better waste management is waste collection and sorting. …”

A secure trust aware ACO-Based WSN routing protocol for IoT by Sharmin, Afsah, Anwar, Farhat, Motakabber, S. M. A., Hassan Abdalla Hashim, Aisha

“…The performance of the proposed routing algorithm is demonstrated through MATLAB. Based on the proposed system, to find the secure and optimal path while aiming at providing trust in IoT environment, the average energy consumption is minimized by nearly 50% even as the number of nodes has increased, as compared with the conventional ACO algorithm, a current ant-based routing algorithm for IoT-communication, and a present routing protocol RPL for IoT.…”
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

“…This research focuses on two solid waste management (SWM) problems, particularly the landfill site selection problem (LSSP) and the waste collection vehicle routing problem (WCVRP). …”
Get full text
Get full text
Get full text

Dealing with Routing Hole Problem in Multi-hop Hierarchical Routing Protocol in Wireless Sensor Network by Sama, Najm Us

“…The challenging issue of routing protocols is to reduce the communication overhead for data transmission by determining an optimal path. The hierarchical routing technique is one of the energy efficient routing protocols in WSN. …”
Get full text
Get full text