CORE
🇺🇦
make metadata, not war
Services
Services overview
Explore all CORE services
Access to raw data
API
Dataset
FastSync
Content discovery
Recommender
Discovery
OAI identifiers
OAI Resolver
Managing content
Dashboard
Bespoke contracts
Consultancy services
Support us
Support us
Membership
Sponsorship
Community governance
Advisory Board
Board of supporters
Research network
About
About us
Our mission
Team
Blog
FAQs
Contact us
Quantity-predictive vehicle routing problem for smart waste collection
Authors
Arild Hoff
Dušan Hrabec
+5 more
Vlastimír Nevrlý
Martin Pavlas
Pavel Popela
Preben Senland
Radovan Šomplák
Publication date
1 January 2019
Publisher
Italian Association of Chemical Engineering - AIDIC
Doi
Cite
Abstract
The current trends in the field of waste management involves the use of modern technologies such as wireless sensors. The smart waste management with Sensor Technology involves an integration of the so-called smart trash bins and containers into existing network by using sensors that fill level of the bins and containers. Apart from the technological aspects of the problem, this arrangement points to the need of development of new decision-making tools that allow collectors to make fast and smart operative decisions on the waste collection. The sensors from the waste containers read the current fill-height once a day and send the information to the central database. The central decision-maker appraises the data and makes the waste collection plan for an entire (e.g., one week) collection period; note that this improves existing models on the data available and used. The aim of this paper is to present complex modelling ideas, develop a simple mathematical model, discuss its complexity and propose/discuss a computational approach in order to solve the collection problem. The objective is to optimize the dynamic planning on daily garbage-truck schedules with respect to minimization of transportation costs that also reflects a positive environmental impact presented by savings in transportation/routing distance. The secondary objective is to optimally decide on early collection of partly-filled containers, especially those directly on or close to the optimum route linking the full ones considering waste production rates in the next days. The paper outlines some directions for further research such as the need of modifying the old-existing models into a form utilizing the newly available data. This leads to specific vehicle routing problems that request appropriate computational time requirements and the need of suitable heuristic methods development. Copyright © 2019, AIDIC Servizi S.r.l
Similar works
Full text
Open in the Core reader
Download PDF
Available Versions
Brage HiM
See this paper in CORE
Go to the repository landing page
Download from data provider
oai:himolde.brage.unit.no:1125...
Last time updated on 21/10/2023
Institutional repository of Tomas Bata University Library
See this paper in CORE
Go to the repository landing page
Download from data provider
oai:publikace.k.utb.cz:10563/1...
Last time updated on 24/01/2020