Search Results - (( waste collection search algorithm ) OR ( java implication based algorithm ))

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.

“…Bins; Budget control; Carbon dioxide; Cost reduction; Costs; Crashworthiness; Efficiency; Environmental impact; Fuels; Learning algorithms; Optimization; Solid wastes; Vehicle routing; Backtracking search algorithms; Capacitated vehicle routing problem; Environmental emissions; Optimization modeling; Route optimization; Solid waste collection; Threshold waste level; Waste collection; Waste management; fuel; carbon dioxide; solid waste; algorithm; fuel consumption; modeling; optimization; solid waste; threshold; waste management; algorithm; Article; backtracking search algorithm; capacitated vehicle routing problem model; carbon footprint; controlled study; environmental impact assessment; feasibility study; limit of quantitation; measurement precision; process model; process optimization; solid waste collection; solid waste management; motor vehicle; procedures; solid waste; theoretical model; waste disposal; Algorithms; Carbon Dioxide; Models, Theoretical; Motor Vehicles; Refuse Disposal; Solid Waste…”

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

Optimising a waste management system using the Artificial Bee Colony (ABC) algorithm by Mohamad Fadzil, Nur Hamisha Helanie

“…This study proposed the application of the Artificial Bee Colony (ABC) algorithm to address the Capacitated Vehicle Routing Problem (CVRP) in a real-world waste collection scenario. …”
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

Mathematical formulation of tabu search in combinatorial optimization by Ismail, Zuhaimy

“…One such problem is in the designing a tour for waste collection vehicle where each vehicle is limited in its capacity. …”
Get full text
Get full text

Solving the vehicle routing problem with stochastic demands via hybrid genetic algorithm-tabu search by Ismail, Zuhaimy, Irhamah, Irhamah

“…The problem data are inspired by real case of VRPSD in waste collection. Results from the experiment show the advantages of the proposed algorithm that are its robustness and better solution qualities resulted…”
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

A breeder genetic algorithm for vehicle routing problem with stochastic demands by Irhamah, Irhamah, Ismail, Zuhaimy

“…The Breeder Genetic Algorithm is proposed to solve this problem. BGA is a kind of GAs, which is especially powerful and reliable in global searching. …”
Get full text
Get full text
Get full text

The implications for ahybrid detection technique against malicious sqlattacks on web applications by Bahjat Arif, Sarajaldeen Akram, Wani, Sharyar

Get full text
Get full text
Get full text

Digital Quran With Storage Optimization Through Duplication Handling And Compressed Sparse Matrix Method by Ashraf Saleh Mohammad Alomoush

An Implementation Framework Overview of Non-Intrusive Load Monitoring by Omar Al-Khadher, Azharudin Mukhtaruddin, Fakroul Ridzuan Hashim, Hussin Mamat, Muhammad Mokhzaini Azizan