Search Results - (( solution construction waste algorithm ) OR ( parallel visualization mining algorithm ))
Search alternatives:
- solution construction »
- visualization mining »
- construction waste »
- mining algorithm »
- waste algorithm »
-
1
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“…Then, a multiple criteria greedy heuristic model was proposed to construct WCVRP solutions and to find a new landfill site(s) with the minimum total operational costs. …”
Get full text
Get full text
Get full text
Thesis -
2
Enhanced Heuristic Algorithms with A Vehicle Travel Speed Model for Time-Dependent Vehicle Routing: A Waste Collection Problem
Published 2018“…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
Article -
3
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 -
4
Nearest greedy for solving the waste collection vehicle routing problem: A case study
Published 2017“…This paper presents a real case study pertaining to an issue related to waste collection in the northern part of Malaysia by using a constructive heuristic algorithm known as the Nearest Greedy (NG) technique. …”
Get full text
Get full text
Article -
5
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 -
6