Search Results - (( initial solving waste algorithm ) OR ( using codification based algorithm ))
Search alternatives:
- using codification »
- codification based »
- initial solving »
- waste algorithm »
- 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
Enhanced Heuristic Algorithms with A Vehicle Travel Speed Model for Time-Dependent Vehicle Routing: A Waste Collection Problem
Published 2018“…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
Article -
4
Enhanced heuristic algorithms with a vehicle travel speed model for time-dependent vehcile routing: A waste collection problem
Published 2018“…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
Article -
5
-
6
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 -
7
Metaheuristics for the waste collection vehicle routing problem with time windows, driver rest period and multiple disposal facilities
Published 2010“…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
Article -
8
An improved partial comparison optimization for utilizing landfill facilities in a waste collection vehicle routing problem
Published 2025“…The improved PCO incorporates a Nearest Greedy (NG) algorithm for initial solution construction, dynamic parameter adjustment, and two additional neighborhood operators. …”
Get full text
Get full text
Get full text
Get full text
Thesis -
9
Development of a fuzzy multi-objective mathematical model for hazardous waste location-routing problem
Published 2014“…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
Thesis -
10
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 -
11
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 -
12
Discriminative feature representation for Malay children’s speech recognition / Seyedmostafa Mirhassani
Published 2015“…Three speech databases were used for the experiments including prolonged Malay vowels and Malay continuous speech database based on children’s speech and TIMIT database based on adult speeches. …”
Get full text
Get full text
Thesis -
13
Optimization of Microbial Electrolysis Cell for Sago Mill Wastewater Derived Biohydrogen via Modeling and Artificial Neural Network
Published 2023“…Model validity describes the first sub-objective, which is to solve the complexity of the nonlinear interaction of multiple MEC input variables related to the hydrogen production rate response using artificial neural networks (ANN) before validating the mathematical modeling results by comparing experimental data with the predicted substrate concentration profile and hydrogen production rate profile based on the re-estimated input values of the model parameters using single-objective optimization based on the nonlinear convex method using gradient descent algorithm. …”
Get full text
Get full text
Get full text
Thesis