An operative solution of the Vehicle Routing Problem in the framework of the municipal solid waste drop-off collection is exposed below. Two different approaches to the Problem have been presented, the Nearest Neighbor Algorithm and an algorithm based on Genetic Algorithm that has been developed in this work. This algorithm called Three-phase Algorithm, has been compared with the results of the NNA and simulated on the drop-offwaste collection system in the city of Padova

Vehicle Routing Problem solved through Genetic Algorithms in the framework of the municipal solid waste collection and transport. Il Vehicle Routing Problem risolto mediante Algoritmi genetici nella raccolta e trasporto dei rifiuti solidi urbani

Titti, Giacomo
2016/2017

Abstract

An operative solution of the Vehicle Routing Problem in the framework of the municipal solid waste drop-off collection is exposed below. Two different approaches to the Problem have been presented, the Nearest Neighbor Algorithm and an algorithm based on Genetic Algorithm that has been developed in this work. This algorithm called Three-phase Algorithm, has been compared with the results of the NNA and simulated on the drop-offwaste collection system in the city of Padova
2016-05-05
vehicle, routing
File in questo prodotto:
File Dimensione Formato  
titti_giacomo_tesi.pdf

accesso aperto

Dimensione 7.3 MB
Formato Adobe PDF
7.3 MB Adobe PDF Visualizza/Apri

The text of this website © Università degli studi di Padova. Full Text are published under a non-exclusive license. Metadata are under a CC0 License

Utilizza questo identificativo per citare o creare un link a questo documento: https://hdl.handle.net/20.500.12608/25601