Sirvi Autor "Nsiah, Obed Kobina" järgi
Nüüd näidatakse 1 - 1 1
- Tulemused lehekülje kohta
- Sorteerimisvalikud
listelement.badge.dso-type Kirje , Optimized Snowplow Routing on Estonian Roads: Machine Learning Approaches(Tartu Ülikool, 2025) Nsiah, Obed Kobina; Roy, Kallol, juhendaja; Übi, Jaan, juhendaja; Tartu Ülikool. Loodus- ja täppisteaduste valdkond; Tartu Ülikool. Arvutiteaduse instituutEfficient management of snowplowing operations on roads is a critical infrastructure challenge in regions with harsh winter conditions, such as Estonia. This thesis addresses the Snowplow Arc Routing Problem (SARP), with the intention of optimizing snowplow routes to minimize deadheading, ensure complete task coverage, and balance workloads between multiple vehicles. The study investigates four primary aspects: (1) the effectiveness of Mixed Integer Linear Programming (MILP) in optimally solving SARP instances; (2) the capability of supervised machine learning approaches to approximate MILP solutions while maintaining connectivity and complete coverage; (3) the potential of reinforcement learning (RL) techniques to improve routing performance and quality within machine learning frameworks; and (4) the comparative advantages and limitations of classical MILP, supervised ML, RL, and hybrid ML-RL models for such tasks. An MILP model implemented with Gurobi provides optimal benchmarks for subsequent learning-based approaches. Although the MILP achieves an optimal deadhead ratio of 0.002, it demonstrates significant computational scalability constraints. A supervised learning model utilizing graph neural networks (GNN) and Transformer-based pointer networks is developed, achieving an average deadhead ratio of 1.47 with initial coverage feasibility of 65.6% before heuristic post-processing. To address supervised learning limitations, an actor-critic RL model is implemented, which shows an improved deadhead ratio of 1.42. A proposed two-stage hybrid ML-RL architecture that combines supervised edge-to-truck assignments with RL-driven routing achieves a better workload balance coefficient of variation of 0.843 compared to 0.903 for supervised and 0.945 for RL, and a better initial coverage feasibility of 70.3%, but a slightly higher deadhead ratio of 1.53 highlighting trade-offs between operational efficiency and workload distribution. These approaches are validated through experiments conducted on real-world road networks in Tartu, Estonia. The results indicate that pure RL provides the most efficient solutions regarding route length and deadheading, while the hybrid ML-RL model demonstrated strengths in workload equity and coverage feasibility.