Vehicle routing problem model for disaster situation assistance in Murakami
View/Open
tfm-narcis-minguez.pdf (1,376Mb) (Restricted access)
Cita com:
hdl:2117/405599
CovenanteeNagaoka Gijutsu Kagaku Daigaku
Document typeMaster thesis
Date2024-03-07
Rights accessRestricted access - author's decision
(embargoed until 2025-02-21)
All rights reserved. This work is protected by the corresponding intellectual and industrial
property rights. Without prejudice to any existing legal exemptions, reproduction, distribution, public
communication or transformation of this work are prohibited without permission of the copyright holder
Abstract
The present document is a proposal to a different approach of solving Vehicle Routing Problems (VRP) divergent from the usually employed, focusing on the floods that occurred in Japan, specifically in Murakami city on 2022’s early August. Making use of Python programming and the available set of data, the suitability of the method will be tested. Research on the VRP topic has been performed in order to understand the basics of it; how they work, what are the objectives and possibilities and the different existing types of cases. After careful documentation, the most adequate variant for the situation is selected and used as the basis for the study. Different mathematical models are explored, each one having a different objective. All of them are tested using Python coding and the Gurobi package, commonly known as an optimizing software. Once all models are tested and the resulting information is obtained, an outcome comparison is performed with the incident’s data and with other sets to verify the viability and practicality of the developed idea against the standard method, focused on minimizing the time.
SubjectsNatural disasters--Japan, Transportation--Planning, Catàstrofes naturals--Japó, Transport--Planificació
DegreeMÀSTER UNIVERSITARI EN ENGINYERIA INDUSTRIAL (Pla 2014)
Collections
Files | Description | Size | Format | View |
---|---|---|---|---|
tfm-narcis-minguez.pdf | 1,376Mb | Restricted access |