Solving the Facility Location Problem using Graph Theory and Shortest Path Algorithms

This thesis in systems engineering and optimization theory aims to solve a facility location problem within the context of a confined space with path and proximity constraints. The thesis was commissioned by LKAB Kiruna, to help in their decision of where to construct a new facility on their industr...

Full description

Bibliographic Details
Main Authors: Zarabi, Patrick, Denes, August
Format: Bachelor Thesis
Language:English
Published: KTH, Optimeringslära och systemteori 2018
Subjects:
Online Access:http://urn.kb.se/resolve?urn=urn:nbn:se:kth:diva-229979
id ftkthstockholm:oai:DiVA.org:kth-229979
record_format openpolar
spelling ftkthstockholm:oai:DiVA.org:kth-229979 2023-05-15T17:04:19+02:00 Solving the Facility Location Problem using Graph Theory and Shortest Path Algorithms Optimal lagerplacering med hjälp av grafteori och kortaste vägen algoritmer Zarabi, Patrick Denes, August 2018 application/pdf http://urn.kb.se/resolve?urn=urn:nbn:se:kth:diva-229979 eng eng KTH, Optimeringslära och systemteori TRITA-SCI-GRU 2018:265 http://urn.kb.se/resolve?urn=urn:nbn:se:kth:diva-229979 info:eu-repo/semantics/openAccess Computational Mathematics Beräkningsmatematik Student thesis info:eu-repo/semantics/bachelorThesis text 2018 ftkthstockholm 2022-08-11T12:38:36Z This thesis in systems engineering and optimization theory aims to solve a facility location problem within the context of a confined space with path and proximity constraints. The thesis was commissioned by LKAB Kiruna, to help in their decision of where to construct a new facility on their industrial premises. The facility location problem was divided into a main problem of finding the best position of the facility, and a sub-problem of how to model distances and feasible areas within this particular context. The distance and feasibility modeling was solved by utilizing graph theory to construct a graph representation of a geographic area and then obtain the necessary distances using Dijkstra’s shortest path algorithm. The main problem was then solved using a mixed integer linear programming formulation which utilizes the distances obtained through the Dijkstra algorithm. The model is also extended to not only decide the placement of one facility but to accommodate the placement of two facilities. The extended model was solved in three ways, a heuristic algorithm, a mixed integer non linear formulation and a mixed integer linear formulation. The results concluded that the implementation of the single facility model was able to obtain optimal solutions consistently. Regarding the extension, the mixed integer linear formulation was deemed to be the best model as it was computationally fast and consistently produced optimal solutions. Finally, several model improvements are identified to increase the applicability to different cases. These improvements could also allow the model to provide more strategical and managerial insights to the facility location decision process. Some future research into metaheuristics and machine learning are also suggested to further improve the usability of the models. Detta examensarbete inom systemteknik och optimeringslära syftar till att lösa ett lagerplaceringsproblem. Lagret ska ställas inom en liten yta med hänsyn till ruttbegränsningar och närhet till andra byggnader. Denna ... Bachelor Thesis Kiruna Royal Institute of Technology, Stockholm: KTHs Publication Database DiVA Kiruna
institution Open Polar
collection Royal Institute of Technology, Stockholm: KTHs Publication Database DiVA
op_collection_id ftkthstockholm
language English
topic Computational Mathematics
Beräkningsmatematik
spellingShingle Computational Mathematics
Beräkningsmatematik
Zarabi, Patrick
Denes, August
Solving the Facility Location Problem using Graph Theory and Shortest Path Algorithms
topic_facet Computational Mathematics
Beräkningsmatematik
description This thesis in systems engineering and optimization theory aims to solve a facility location problem within the context of a confined space with path and proximity constraints. The thesis was commissioned by LKAB Kiruna, to help in their decision of where to construct a new facility on their industrial premises. The facility location problem was divided into a main problem of finding the best position of the facility, and a sub-problem of how to model distances and feasible areas within this particular context. The distance and feasibility modeling was solved by utilizing graph theory to construct a graph representation of a geographic area and then obtain the necessary distances using Dijkstra’s shortest path algorithm. The main problem was then solved using a mixed integer linear programming formulation which utilizes the distances obtained through the Dijkstra algorithm. The model is also extended to not only decide the placement of one facility but to accommodate the placement of two facilities. The extended model was solved in three ways, a heuristic algorithm, a mixed integer non linear formulation and a mixed integer linear formulation. The results concluded that the implementation of the single facility model was able to obtain optimal solutions consistently. Regarding the extension, the mixed integer linear formulation was deemed to be the best model as it was computationally fast and consistently produced optimal solutions. Finally, several model improvements are identified to increase the applicability to different cases. These improvements could also allow the model to provide more strategical and managerial insights to the facility location decision process. Some future research into metaheuristics and machine learning are also suggested to further improve the usability of the models. Detta examensarbete inom systemteknik och optimeringslära syftar till att lösa ett lagerplaceringsproblem. Lagret ska ställas inom en liten yta med hänsyn till ruttbegränsningar och närhet till andra byggnader. Denna ...
format Bachelor Thesis
author Zarabi, Patrick
Denes, August
author_facet Zarabi, Patrick
Denes, August
author_sort Zarabi, Patrick
title Solving the Facility Location Problem using Graph Theory and Shortest Path Algorithms
title_short Solving the Facility Location Problem using Graph Theory and Shortest Path Algorithms
title_full Solving the Facility Location Problem using Graph Theory and Shortest Path Algorithms
title_fullStr Solving the Facility Location Problem using Graph Theory and Shortest Path Algorithms
title_full_unstemmed Solving the Facility Location Problem using Graph Theory and Shortest Path Algorithms
title_sort solving the facility location problem using graph theory and shortest path algorithms
publisher KTH, Optimeringslära och systemteori
publishDate 2018
url http://urn.kb.se/resolve?urn=urn:nbn:se:kth:diva-229979
geographic Kiruna
geographic_facet Kiruna
genre Kiruna
genre_facet Kiruna
op_relation TRITA-SCI-GRU
2018:265
http://urn.kb.se/resolve?urn=urn:nbn:se:kth:diva-229979
op_rights info:eu-repo/semantics/openAccess
_version_ 1766058380628066304