Waste collection routing problem: A mini-review of recent heuristic approaches and applications

YC Liang, V Minanda… - Waste Management & …, 2022 - journals.sagepub.com
The waste collection routing problem (WCRP) can be defined as a problem of designing a
route to serve all of the customers (represented as nodes) with the least total traveling time …

Optimising the safety of road transport workers on IBS building construction projects: a review

ZA Ismail - Social Responsibility Journal, 2019 - emerald.com
Purpose The purpose of this study is to develop a new information and communication
technology (ICT)-based approach for optimising safety transportation according to the needs …

Energy-Efficient Dynamic Vehicle Routing for Waste Collection by Q-Learning-Based Hyperheuristic Particle Swarm Optimization

Y Zhao, X Shen, W Chen, H Pan - IEEE Access, 2024 - ieeexplore.ieee.org
During the process of waste collection, various unpredicted disturbances might occur.
Meanwhile, vehicle transport is an important source of carbon emissions. In this study, an …

Dynamic vehicle routing for battery swapping in an electric bike-sharing system

Y Yang, Y Zhou, T Kundu, S Xu - 2021 IEEE International …, 2021 - ieeexplore.ieee.org
In the daily operation of the emerging electric bike-sharing system, timely and efficient
battery swapping is essential as there are no charging facilities at e-bike stations. This paper …

A multiperiod household waste collection system for a set of rural islands with dynamic transfer port selection

M Zambra-Rivera, PA Miranda-González… - Optimization and …, 2023 - Springer
The design of a household waste collection system must integrate decisions related to
planning and control of all related operations, which may generate significant economic …

[PDF][PDF] Efficiency of heuristic algorithms in solving waste collection vehicle routing problem: a case study

NA Mat, AM Benjamin… - The Journal of Social …, 2018 - repo.uum.edu.my
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) …

A comparative study utilizing hybridized ant colony optimization algorithms for solving dynamic capacity of vehicle routing problems in waste collection system

TM Sahib, R Mohd-Mokhtar… - …, 2024 - teknomekanik.ppj.unp.ac.id
The waste collection stage generated 70% of the cost of the total Municipal Solid Waste
(MSW) management system. Therefore, choosing the most affordable waste collection …

Enfoque de sostenibilidad en el diseño de rutas tiempo-dependientes para el transporte escolar urbano desde el cargue mixto

JP Orejuela Cabrera - repositorio.unal.edu.co
La población mundial al 2018 fue alrededor de 7500 millones de habitantes (Central
Intelligence Agency, 2018), de los cuales se estima que el 20% son población en edad …

[PDF][PDF] Constructive Heuristics for Commercial Waste Collection with Time-Dependent Travel

R Hamm, A Kheiri, T Pigden - ahmedkheiri.github.io
Commercial waste collection can be modelled as a vehicle routing problem with a high
number of stops per route, corresponding to bins from individual customers. Retail …

Nearest greedy algorithm for solving a single landfill site selection with resource requirements

NA Mat, AM Benjamin… - Journal of Sustainability …, 2020 - dsgate.uum.edu.my
Landfill site selection has appeared to be an important waste management issue for future
landfill planning. The selection of suitable landfill sites involves several alternative sites …