Measuring Backtracking on Delivery Routes through Community Detection
Name
Noszek_jnoszek_MST_CEE_2022.pdf
Description
Thesis PDF
Size
1.4 MB
Format
Adobe PDF
Checksum (MD5)
e7a7f3e9e30f3594e35e0c3689ba55b1
Author(s)
Noszek, Joseph Robert
Advisor(s)
Winkenbach, Matthias
Sheffi, Yossi
Date Issued
May 2022
Publisher
Massachusetts Institute of Technology
Abstract
In logistics, backtracking is the act of a route returning to an area that it has already visited. Despite backtracking’s clear potential to be a source of inefficiency and driver frustration, there is little existing research on backtracking in transportation. We set out to devise a method to measure backtracking that is consistently scalable and transferable to different route settings. Our measurement method utilizes community detection, a group of machine learning algorithms for clustering nodes within graphs, based on edge structure and weight. We then investigate the ability of backtracking, as measured by our community detection-based method, to predict suboptimality of Asymmetric Traveling Salesman Problem (ATSP) solutions. We find that backtracking does demonstrate viability as a predictor of suboptimality, particularly when it utilizes the Louvain algorithm or the Leiden algorithm for community detection. We also investigate the relationship between backtracking and suboptimality when adjusting our measurement process and when considering the additional variables of the number of customers and the number of backtracking instances. After these adjustments, we observe continued and increased viability as a predictor of suboptimality.
MIT Department
Massachusetts Institute of Technology. Department of Civil and Environmental Engineering
Terms of Use
In Copyright - Educational Use Permitted
Copyright MIT
Persistent DSpace Link
