Search Results - (( based solving waste algorithm ) OR ( java application stemming algorithm ))
Search alternatives:
- application stemming »
- stemming algorithm »
- java application »
- waste algorithm »
- based solving »
- solving waste »
-
1
Efficiency of heuristic algorithms in solving waste collection vehicle routing problem: a case study
Published 2018“…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
Article -
2
Efficiency of heuristic algorithms in solving waste collection vehicle routing problem: a case study
Published 2018“…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
Article -
3
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“…Second, the Plant Propagation Algorithm (PPA) has never been considered to solve WCVRP. …”
Get full text
Get full text
Get full text
Thesis -
4
Using predictive analytics to solve a newsvendor problem / S. Sarifah Radiah Shariff and Hady Hud
Published 2023“…Secondly, in solving every Machine Learning problem, there is no one algorithm superior to other algorithms. …”
Get full text
Get full text
Book Section -
5
-
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
Development of heuristic methods based on genetic algorithm (GA) for solving vehicle routing problem
Published 2008“…This research explored and developed new heuristics based on GA for solving VRPSD. New algorithms, journal papers and computerized system were also developed. …”
Get full text
Get full text
Monograph -
8
-
9
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 -
10
Mathematical formulation of tabu search in combinatorial optimization
Published 2008“…Tabu Search (TS) is a heuristic method based on the use of prohibition-based techniques and basic heuristics algorithms like local search. …”
Get full text
Get full text
Monograph -
11
An improved partial comparison optimization for utilizing landfill facilities in a waste collection vehicle routing problem
Published 2025“…To integrate this constraint, an enhanced Partial Comparison Optimization (PCO) algorithm is proposed. PCO is a single-solution-based metaheuristic previously shown to be effective in solving Vehicle Routing Problems (VRP). …”
Get full text
Get full text
Get full text
Get full text
Thesis -
12
Integrated immune-commensal-evolutionary programming for economic dispatch and distributed generation installation / Mohd Helmi Mansor
Published 2020“…Consequently, the performance of the proposed MOICEP algorithm is outstanding when compared with MOEP and MOAIS in solving the integrated ED-DG problems under several scenarios. …”
Get full text
Get full text
Thesis -
13
Classification model for water quality using machine learning techniques
Published 2015“…This article proposes a suitable classification model for classifying water quality based on the machine learning algorithms. The paper analyzed and compared performance of various classification models and algorithms in order to identify the significant features that contributed in classifying water quality of Kinta River, Perak Malaysia. …”
Get full text
Get full text
Article -
14
Design high frequency surgical robot controller: design FPGA-based controller for surgical robot manipulator simscape modeling
Published 2016“…To design PID type FPGA-based controller two types algorithm are needed: derivative algorithm and integral algorithm. …”
Get full text
Get full text
Get full text
Article -
15
Combustion modelling of an industrial municipal waste combustor in Malaysia
Published 2006“…The differential equations were discretized by the Finite Volume Method and were solved by the SIMPLE algorithm. The k-ε turbulence model was employed. …”
Get full text
Get full text
Get full text
Article -
16
Truck queuing analysis at landfill sites in a waste collection vehicle routing problem
Published 2017“…This paper presents an analysis of a truck queuing problem at landfill sites due to a static rest time of truck drivers in a waste collection vehicle routing problem. The analysis is based on a solution of two datasets from a benchmark waste collection problem using the nearest greedy heuristic algorithm.In this problem, all drivers need to have a one-hour rest break during their collection.The rest break can start from 11.00 a.m. to 12.00 p.m. …”
Get full text
Get full text
Get full text
Conference or Workshop Item -
17
Web-Based Route Optimization System For Logistic Using Agglomerative Clustering And Genetic Algorithm
Published 2020“…This system will first cluster those addresses based on the number of trucks involved and then perform the route optimization algorithm to suggest the shortest route to the user. …”
Get full text
Get full text
Final Year Project / Dissertation / Thesis -
18
Combustion modeling of municipal waste combustor
Published 2005“…The differential equations were discretized by the Finite Volume Method and were solved by the SIMPLE algorithm. The k-ε turbulence model was employed. …”
Get full text
Get full text
Conference or Workshop Item -
19
-
20
Mixed convection boundary layer flow embedded in porous medium with nanofluids
Published 2013“…Shooting method from MAPLE is used to solve the problem. This well-known technique is an iterative algorithm which attempts to identify appropriate initial conditions for a related initial value problem (IVP) that provides the solution to the original boundary value problem (BVP). …”
Get full text
Get full text
Thesis
