Search Results - (( waste collection problems algorithm ) OR ( java simulation optimization algorithm ))
Search alternatives:
- collection problems »
- waste collection »
- java simulation »
-
1
Capacitated vehicle-routing problem model for scheduled solid waste collection and route optimization using PSO algorithm
Published 2023“…Costs; Efficiency; Routing algorithms; Scheduling; Solid wastes; Vehicle routing; Capacitated vehicle routing problem; Modified particle swarm optimization; Optimized models; Route optimization; Solid waste collection; Threshold waste level; Travel distance; Waste collection; Particle swarm optimization (PSO); fuel; algorithm; numerical model; optimization; routing; solid waste; transport vehicle; waste disposal; algorithm; Article; capacitated vehicle routing problem model; controlled study; cost; decision making; environmental impact; motor vehicle; nonbiological model; particle swarm optimization algorithm; priority journal; problem solving; process optimization; socioeconomics; solid waste management; travel; validation process; economics; solid waste; waste management; Algorithms; Costs and Cost Analysis; Solid Waste; Waste Management…”
Article -
2
Backtracking search algorithm in CVRP models for efficient solid waste collection and route optimization
Published 2023“…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…”
Article -
3
Enhanced Heuristic Algorithms with A Vehicle Travel Speed Model for Time-Dependent Vehicle Routing: A Waste Collection Problem
Published 2018“…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
Article -
4
Enhanced heuristic algorithms with a vehicle travel speed model for time-dependent vehcile routing: A waste collection problem
Published 2018“…This problem is referred to as Time-Dependent Vehicle Routing Problem (TD-VRP) in previous literature.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.However, in this paper the static speed that was considered in both algorithms were improved by introducing dynamic travel speeds to construct vehicle routes for the waste collection drivers. …”
Get full text
Get full text
Get full text
Article -
5
Dijkstra’s Algorithm for optimal recyclable waste collection system in Port Dickson / Nur Jazlina Mohd Iszairi, Aina Zulaika Md Ramli and Nursabrina Saifulbahri
Published 2023“…Moreover, waste collection and transportation problems are among the difficult operational problems. …”
Get full text
Get full text
Student Project -
6
Metaheuristics for the waste collection vehicle routing problem with time windows
Published 2010“…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
Conference or Workshop Item -
7
Ant Colony Optimization for Solving Solid Waste Collection Scheduling Problems
Published 2009“…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
Article -
8
Attribute reduction based scheduling algorithm with enhanced hybrid genetic algorithm and particle swarm optimization for optimal device selection
Published 2022“…The simulation is implemented with iFogSim and java programming language. …”
Get full text
Get full text
Article -
9
Ant colony optimization for solving solid waste collection scheduling problems
Published 2009“…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
Article -
10
Efficiency of heuristic algorithms in solving waste collection vehicle routing problem: a case study
Published 2018“…Hence, this paper looked into the efficiency of these heuristics by testing them on a real case study of waste collection problem in a district located at the north of Peninsular Malaysia. …”
Get full text
Get full text
Get full text
Article -
11
Efficiency of heuristic algorithms in solving waste collection vehicle routing problem: a case study
Published 2018“…Hence, this paper looked into the efficiency of these heuristics by testing them on a real case study of waste collection problem in a district located at the north of Peninsular Malaysia. …”
Get full text
Get full text
Get full text
Article -
12
Metaheuristics with disposal facility positioning for the waste collection VRP with time windows
Published 2013“…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
Article -
13
Enhancement of Ant Colony Optimization for Grid Job Scheduling and Load Balancing
Published 2011“…Global pheromone update is performed after the completion of processing the jobs in order to reduce the pheromone value of resources. A simulation environment was developed using Java programming to test the performance of the proposed EACO algorithm against existing grid resource management algorithms such as Antz algorithm, Particle Swarm Optimization algorithm, Space Shared algorithm and Time Shared algorithm, in terms of processing time and resource utilization. …”
Get full text
Get full text
Get full text
Thesis -
14
Ant colony optimization algorithm for load balancing in grid computing
Published 2012“…The proposed algorithm is known as the enhance ant colony optimization (EACO). …”
Get full text
Get full text
Get full text
Monograph -
15
A case study of minimising travel time for waste management problem with limited picking capacity in Taman Seremban 3 / Nur Yasmin Izzatul Zaid, Norezwannim Ibrahim and Nur Umairah...
Published 2024“…This study has two objectives that must be achieved. Using Dijkstra's algorithm, this project will create a travel network for garbage trucks to collect waste in Taman Seremban 3 and calculate the minimum travel time for the waste collection problem with limited picking capacity. …”
Get full text
Get full text
Student Project -
16
Metaheuristics for the waste collection vehicle routing problem with time windows, driver rest period and multiple disposal facilities
Published 2010“…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
Article -
17
Optimising a waste management system using the Artificial Bee Colony (ABC) algorithm
Published 2025“…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
Student Project -
18
OPTIMIZED MIN-MIN TASK SCHEDULING ALGORITHM FOR SCIENTIFIC WORKFLOWS IN A CLOUD ENVIRONMENT
Published 2023“…To achieve this, we propose a new noble mechanism called Optimized Min-Min (OMin-Min) algorithm, inspired by the Min-Min algorithm. …”
Review -
19
Smart Routing For Solid Waste Collection
Published 2023“…This project aims to design and develop a route optimization and decision support system for solid waste collection in Malaysia. The problem of waste management in Malaysia has become increasingly complex due to an increase in waste generation and insufficient technology, manpower, and facilities. …”
Get full text
Get full text
Get full text
Final Year Project Report / IMRAD -
20
A greedy heuristics multiple criteria model for solving multi-landfill site selection and plant propagation algorithm for improving waste collection vehicle routing solutions
Published 2023“…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
Thesis
