Route optimization for maintaining road quality

Bachelor Thesis (2023)
Author(s)

F.B.J. Hemler (TU Delft - Electrical Engineering, Mathematics and Computer Science)

Contributor(s)

J. T. van Essen – Mentor (TU Delft - Discrete Mathematics and Optimization)

Faculty
Electrical Engineering, Mathematics and Computer Science
Copyright
© 2023 Frederique Hemler
More Info
expand_more
Publication Year
2023
Language
English
Copyright
© 2023 Frederique Hemler
Graduation Date
29-08-2023
Awarding Institution
Delft University of Technology
Programme
['Applied Mathematics']
Faculty
Electrical Engineering, Mathematics and Computer Science
Reuse Rights

Other than for strictly personal use, it is not permitted to download, forward or distribute the text or part of it, without the consent of the author(s) and/or copyright holder(s), unless the work is under an open content license such as Creative Commons.

Abstract

Velotech Solutions (VTS) is a company specialised in detecting damages in public spaces, such as road damages, non-working light posts or crooked traffic signs. This detection happens by bike or by car, and covers every street in the city or neighbourhood. The routes for navigation are currently created by hand. In this thesis, a proposal is given for the first step of automating this process meeting the requests of Velotech Solutions. A mathematical model is formulated for creating the routes. Firstly, the basic model is formulated to minimize the total distance of all routes that are created. Secondly, minimization of self crossings in every route is added. This is the main request, to prevent routes from becoming too complicated for the navigation devices and cyclists. Thirdly, two solution methods are presented. In the first one, all routes are created at once. In the second one, routes are created one-by-one. The methods are applied to the neighbourhoods Parkwijk and Boeier. From the results, the conclusion is drawn that the first solution method gives the most logical routes. However, the second method, is able to handle larger sets of data, since the solution space is smaller when creating only one route at the time. Lastly, recommendations for further research are given. These include research on the input parameters, the behaviour of the second method on larger datasets and using heurisitcs to solve this problem instead of exact solution methods.

Files

BEP_12_merged.pdf
(pdf | 1.55 Mb)
License info not available