Szczegóły publikacji

Opis bibliograficzny

Fleet optimization for a selective solid waste collection system / Katarzyna GDOWSKA, Roger KSIĄŻEK, Antoni KORCYL // W: Challenges and modern solution in transportation [Dokument elektroniczny] / eds. Maciej Stajniak, [et al.]. — Wersja do Windows. — Dane tekstowe. — Radom : Instytut Naukowo-Wydawniczy "Spatium", cop. 2019. — e-ISBN: 978-83-66017-85-6. — S. 121–134. — Wymagania systemowe: Adobe Reader. — Tryb dostępu: http://inw-spatium.pl/wp-content/uploads/2020/04/CHALLENGES-A... [2020-04-24]. — Bibliogr. s. 133–134, Abstr.

Autorzy (3)

Słowa kluczowe

MILPselective solid waste collection systemsolid waste managementrich VRP

Dane bibliometryczne

ID BaDAP128466
Data dodania do BaDAP2020-05-06
Rok publikacji2019
Typ publikacjifragment książki
Otwarty dostęptak
Creative Commons
WydawcaInstytut Naukowo-Wydawniczy Spatium

Abstract

Background: In the paper the vehicle routing problem (VRP) combined with fleet optimization for selected solid waste collection is presented. The fleet of garbage trucks consists of vehicles of various types which can differ one from another with capacity, size, and exclusive assignment to certain types of waste. Garbage trucks are used to collect segregated solid waste from pickup nodes and transport it to specialized sorting units. In real selective solid waste collection systems, an important issue is to route garbage truck subject to not only their size but also the time windows of pickup nodes. Some solid waste drop-off points are located in narrow streets and they can be served only by small-sized or medium-sized garbage trucks. Some pickup nodes can be served only within predefined time windows and visiting them should be scheduled carefully, so that they can be served in the preferred period and garbage trucks’ extra dwell time or extra kilometrage can be avoided. Methods: The Fleet Optimization Problem for Selective Solid Waste Collection (FOPSSWC) continues the approach adopted for the Selective Solid Waste Collection Routing Problem (SSWCRP). The SSWCRP solves the VRP for a predefined heterogeneous fleet of garbage trucks, includes time windows of pickup nodes, and recognizes segregated waste types to be served by dedicated garbage trucks. The FOPSSWC finds the minimum number of garbage trucks needed to perform selective waste collection service and not to violate any constraint. For the FOPSSWC a Mixed Integer Program was formulated and solved using Gurobi solver. Results: Gurobi solver was employed for solving small-sized and medium-sized instances. Results obtained for exact optimization of the Fleet Optimization Problem for Selective Solid Waste Collection (FOPSSWC) are illustrated with an examplary instance for which computational experiments are presented and obtained results are reported. Conclusions: The main contribution of the paper is a newly developed Mixed Integer Program combining fleet optimization with the VRP for the selective solid waste collection system. The FOPSSWC may be used by Solid Waste Management for scheduling selective solid waste collection. Obtained schedules may result in reducing the total operational costs of periodical selective solid waste collection.

Publikacje, które mogą Cię zainteresować

fragment książki
#125171Data dodania: 17.10.2019
A MILP model for the selective solid waste collection routing problem / Antoni KORCYL, Roger KSIĄŻEK, Katarzyna GDOWSKA // W: DMMS 2019 [Dokument elektroniczny] : Decision Making in Manufacturing and Services : 22nd international conference : September 26–29, 2019, Zakopane, Poland : book of abstracts / ed. Tadeusz Sawik. — Wersja do Windows. — Dane tekstowe. — Kraków : AGH University of Science and Technology, cop. 2019. — Dysk Flash. — S. 67. — Wymagania systemowe: Adobe Reader
artykuł
#128731Data dodania: 26.5.2020
A MILP model for the municipal solid waste selective collection routing problem / Antoni KORCYL, Roger KSIĄŻEK, Katarzyna GDOWSKA // Decision Making in Manufacturing and Services ; ISSN 1896-8325. — 2019 — vol. 13 no. 1–2, s. 17–35. — Bibliogr. s. 32–35, Abstr.