Reverse logistics of solid waste and recyclable materials in urban areas
The collection and transportation of waste from an urban area is a significant topic for any municipality worldwide. If this process works under an orderly and efficient way, it will have positive effects such as environmental protection, public hygiene, fuel savings for the fleet of collection truc...
Αποθηκεύτηκε σε:
| Κύριος συγγραφέας: | |
|---|---|
| Άλλοι συγγραφείς: | |
| Γλώσσα: | English |
| Δημοσίευση: |
2020
|
| Θέματα: | |
| Διαθέσιμο Online: | http://hdl.handle.net/11610/20008 |
| Ετικέτες: |
Προσθήκη ετικέτας
Δεν υπάρχουν, Καταχωρήστε ετικέτα πρώτοι!
|
| _version_ | 1828461231301722112 |
|---|---|
| author | Χατζηιωαννίδης, Δημήτριος |
| author2 | Μίνης, Ιωάννης |
| author_sort | Χατζηιωαννίδης, Δημήτριος |
| collection | DSpace |
| description | The collection and transportation of waste from an urban area is a significant topic for any municipality worldwide. If this process works under an orderly and efficient way, it will have positive effects such as environmental protection, public hygiene, fuel savings for the fleet of collection trucks and financial savings for the municipalities. This thesis presents and proposes methods for the collection and transportation of waste, which is a subprocess of Solid Waste Management (SWM). The approach followed in this thesis has been inspired by the Periodic Vehicle Routing Problem (PVRP). The objective is to develop an appropriate model for a fleet of vehicles, which empties the bins of an urban area as necessary during a whole period of m days, minimizing the distance cost. To solve the PVRP mathematical model, two heuristic approaches have been developed: Heuristic Algorithm 1 (HA1) and Heuristic Algorithm 2 (HA2). HA1 involves simultaneously deciding which customers (bins of waste in our problem) will be served (emptied) in each day of the week, which vehicle will be used, and in which sequence. HA1 is a variant of the savings algorithm Clarke & Wright adapted to the characteristics of the PVRP model. More specifically, heuristic HA1 executes the Clarke & Wright method as many times as needed throughout the period until the number of visits (frequency) in each node is met. The developed algorithms are initially shown in two small instances for a better understanding of the mathematical model. Eight applications with a range of 150 to 1400 nodes are then implemented 50 times each to compare both heuristics. In the last chapter, our PVRP inspired model is developed and solved for a practical case concerning the municipality of Chios. Finally, algorithms HA1 and HA2 are used in combination with the appropriate local search improvement heuristics for further reduction of the initial solution. |
| id | oai:hellanicus.lib.aegean.gr:11610-20008 |
| institution | Hellanicus |
| language | English |
| publishDate | 2020 |
| record_format | dspace |
| title | Reverse logistics of solid waste and recyclable materials in urban areas |
| topic | ευρετικοί αλγόριθμοι heuristic algorithms πρόβλημα δρομολόγησης εφοδιαστική αλυσίδα logistics routing problem supply chain Logistics Heuristic algorithms Business logistics |
| url | http://hdl.handle.net/11610/20008 |
| work_keys_str_mv | AT chatzēiōannidēsdēmētrios reverselogisticsofsolidwasteandrecyclablematerialsinurbanareas |