{"id":{"repo_id":"usf","oai_identifier":"oai:digitalcommons.usf.edu:etd-12312"},"canonical_url":"https://search.ndltd.org/etd/usf/oai:digitalcommons.usf.edu:etd-12312","repository":{"repo_id":"usf","name":"University of South Florida","base_url":"https://digitalcommons.usf.edu/do/oai/"},"display":{"title":"Pathways to Efficient and Equitable Solutions for Large-Scale Routing Problems","abstract":"This dissertation addresses large-scale optimization problems in transportation emerging from hierarchical decision-making, equitable workload allocation, and innovative routing logistics. It presents three sets of contributions, each detailed in a separate chapter, and offers computational tools and insights to advance both the theory and practice of transportation systems. The first work introduces a deep learning-enhanced genetic algorithm framework for solving the Hierarchical Vehicle Routing Problems (HVRPs). Traditional optimization approaches to such problems require extensive evaluation of multiple lower-level routing solutions and are computationally intensive. Our innovative method integrates a genetic algorithm with a pretrained graph neural network, which is trained on solutions from the HGS CVRP solver, to effectively predict vehicle routing costs resulting from upper level decisions without explicitly solving each scenario. Extensive computational experiments validate the effectiveness of this approach, demonstrating significant computational savings while maintaining high-quality solutions across various datasets. The second work proposes a practical equity-oriented optimization framework tailored specifically for crowdshipping platforms within the last-mile delivery systems. Recognizing that equitable workload distribution and fair compensation are crucial for maintaining a sustainable pool of crowdworkers, our framework utilizes bi-objective optimization to balance equity against operational costs. To effectively solve this problem, we propose Hybrid NSGA-II. Numerous experiments are conducted to quantify the trade-offs between cost and equity, revealing that modest sacrifices in efficiency can lead to substantial equity improvements. Our findings provide actionable insights for gig-economy platforms, highlighting optimal strategies to maximize fairness with minimal cost increases, and guiding workforce management by analyzing the effects of varying crowdshipper pool sizes. The third problem extends the classical Rural Postman Problem (RPP) to a mixed-fleet scenario involving multiple trucks and drones, with the objective of minimizing makespan. Trucks act as mobile depots, deploying drones to service required arcs while also serving the arcs they visit themselves. To navigate the complexity inherent in this problem, we introduce a Hybrid Genetic Algorithm with a chromosome structure that encodes required arc sequences and vehicle assignments, accompanied by multiple dedicated local searches. Comprehensive evaluations on large-scale instances demonstrate the scalability, effectiveness, and real-time applicability of our method, underscoring significant improvements achievable through truck-drone integration in arc-routing logistics.","abstract_html":"This dissertation addresses large-scale optimization problems in transportation emerging from hierarchical decision-making, equitable workload allocation, and innovative routing logistics. It presents three sets of contributions, each detailed in a separate chapter, and offers computational tools and insights to advance both the theory and practice of transportation systems. The first work introduces a deep learning-enhanced genetic algorithm framework for solving the Hierarchical Vehicle Routing Problems (HVRPs). Traditional optimization approaches to such problems require extensive evaluation of multiple lower-level routing solutions and are computationally intensive. Our innovative method integrates a genetic algorithm with a pretrained graph neural network, which is trained on solutions from the HGS CVRP solver, to effectively predict vehicle routing costs resulting from upper level decisions without explicitly solving each scenario. Extensive computational experiments validate the effectiveness of this approach, demonstrating significant computational savings while maintaining high-quality solutions across various datasets. The second work proposes a practical equity-oriented optimization framework tailored specifically for crowdshipping platforms within the last-mile delivery systems. Recognizing that equitable workload distribution and fair compensation are crucial for maintaining a sustainable pool of crowdworkers, our framework utilizes bi-objective optimization to balance equity against operational costs. To effectively solve this problem, we propose Hybrid NSGA-II. Numerous experiments are conducted to quantify the trade-offs between cost and equity, revealing that modest sacrifices in efficiency can lead to substantial equity improvements. Our findings provide actionable insights for gig-economy platforms, highlighting optimal strategies to maximize fairness with minimal cost increases, and guiding workforce management by analyzing the effects of varying crowdshipper pool sizes. The third problem extends the classical Rural Postman Problem (RPP) to a mixed-fleet scenario involving multiple trucks and drones, with the objective of minimizing makespan. Trucks act as mobile depots, deploying drones to service required arcs while also serving the arcs they visit themselves. To navigate the complexity inherent in this problem, we introduce a Hybrid Genetic Algorithm with a chromosome structure that encodes required arc sequences and vehicle assignments, accompanied by multiple dedicated local searches. Comprehensive evaluations on large-scale instances demonstrate the scalability, effectiveness, and real-time applicability of our method, underscoring significant improvements achievable through truck-drone integration in arc-routing logistics.","abstract_has_math":false,"creators":["Sobhanan, Abhay"],"institution":"University of South Florida","degree_name":"Doctor of Philosophy (Ph.D.)","degree_level":"Dissertation","degree_discipline":"Industrial and Management Systems Engineering","degree_department":null,"school":null,"contributors":["Hadi Gard, Ph.D.","Changhyun Kwon, Ph.D.","Ankit Shah, Ph.D.","Yu Zhang, Ph.D.","Reza Ebrahimi, Ph.D."],"advisors":[],"committee_chairs":[],"committee_members":[],"year":2025,"date_issued":"2025-06-11T07:00:00Z","date_published":"2025-06-11T07:00:00Z","updated_at":"2026-11-19T08:49:40Z","subjects":["Deep Learning","Equitable Workload Allocation","Genetic Algorithm","Truck-Drone Routing","Vehicle Routing Problem","Operational Research","Urban Studies and Planning"],"languages":[],"rights":[],"rights_urls":[],"identifier_entries":[],"person_identifier_entries":[]},"links":{"outbound_url":"https://digitalcommons.usf.edu/etd/11009","outbound_label":"Repository record","outbound_source":"dc:identifier","record_url":"https://digitalcommons.usf.edu/etd/11009","record_label":"Repository record","record_kind":"record","record_source":"dc:identifier","download_url":null,"download_label":null,"download_source":null,"access_status":null,"embargo_until":null,"access_note":null},"source_record":{"url":"https://digitalcommons.usf.edu/do/oai/?verb=GetRecord&metadataPrefix=oai_etdms&identifier=oai%3Adigitalcommons.usf.edu%3Aetd-12312","prefix":"oai_etdms"},"metadata_groups":[{"id":"people","label":"People","entries":[{"key":"dc:contributor","label":"Contributor","values":["Hadi Gard, Ph.D.","Changhyun Kwon, Ph.D.","Ankit Shah, Ph.D.","Yu Zhang, Ph.D.","Reza Ebrahimi, Ph.D."]},{"key":"dc:creator","label":"Author","values":["Sobhanan, Abhay"]}]},{"id":"academic_context","label":"Academic Context","entries":[{"key":"dc:date","label":"Dc Date","values":["2025-06-11T07:00:00Z"]},{"key":"thesis:degree_discipline","label":"Discipline","values":["Industrial and Management Systems Engineering"]},{"key":"thesis:degree_level","label":"Degree Level","values":["Dissertation","Ph.D."]},{"key":"thesis:degree_name","label":"Degree Name","values":["Doctor of Philosophy (Ph.D.)"]},{"key":"thesis:institution_name","label":"Thesis Institution Name","values":["University of South Florida"]}]},{"id":"subjects_keywords","label":"Subjects and Keywords","entries":[{"key":"dc:subject","label":"Dc Subject","values":["Deep Learning","Equitable Workload Allocation","Genetic Algorithm","Truck-Drone Routing","Vehicle Routing Problem","Operational Research","Urban Studies and Planning"]}]},{"id":"identifiers","label":"Identifiers","entries":[{"key":"dc:identifier","label":"Identifier","values":["https://digitalcommons.usf.edu/etd/11009"]}]},{"id":"additional","label":"Additional Metadata","entries":[{"key":"dc:description","label":"Description","values":["This dissertation addresses large-scale optimization problems in transportation emerging from hierarchical decision-making, equitable workload allocation, and innovative routing logistics. It presents three sets of contributions, each detailed in a separate chapter, and offers computational tools and insights to advance both the theory and practice of transportation systems. The first work introduces a deep learning-enhanced genetic algorithm framework for solving the Hierarchical Vehicle Routing Problems (HVRPs). Traditional optimization approaches to such problems require extensive evaluation of multiple lower-level routing solutions and are computationally intensive. Our innovative method integrates a genetic algorithm with a pretrained graph neural network, which is trained on solutions from the HGS CVRP solver, to effectively predict vehicle routing costs resulting from upper level decisions without explicitly solving each scenario. Extensive computational experiments validate the effectiveness of this approach, demonstrating significant computational savings while maintaining high-quality solutions across various datasets. The second work proposes a practical equity-oriented optimization framework tailored specifically for crowdshipping platforms within the last-mile delivery systems. Recognizing that equitable workload distribution and fair compensation are crucial for maintaining a sustainable pool of crowdworkers, our framework utilizes bi-objective optimization to balance equity against operational costs. To effectively solve this problem, we propose Hybrid NSGA-II. Numerous experiments are conducted to quantify the trade-offs between cost and equity, revealing that modest sacrifices in efficiency can lead to substantial equity improvements. Our findings provide actionable insights for gig-economy platforms, highlighting optimal strategies to maximize fairness with minimal cost increases, and guiding workforce management by analyzing the effects of varying crowdshipper pool sizes. The third problem extends the classical Rural Postman Problem (RPP) to a mixed-fleet scenario involving multiple trucks and drones, with the objective of minimizing makespan. Trucks act as mobile depots, deploying drones to service required arcs while also serving the arcs they visit themselves. To navigate the complexity inherent in this problem, we introduce a Hybrid Genetic Algorithm with a chromosome structure that encodes required arc sequences and vehicle assignments, accompanied by multiple dedicated local searches. Comprehensive evaluations on large-scale instances demonstrate the scalability, effectiveness, and real-time applicability of our method, underscoring significant improvements achievable through truck-drone integration in arc-routing logistics."]},{"key":"dc:title","label":"Title","values":["Pathways to Efficient and Equitable Solutions for Large-Scale Routing Problems"]}]}],"canonical_facts":{"dc:contributor":["Hadi Gard, Ph.D.","Changhyun Kwon, Ph.D.","Ankit Shah, Ph.D.","Yu Zhang, Ph.D.","Reza Ebrahimi, Ph.D."],"dc:creator":["Sobhanan, Abhay"],"dc:date":["2025-06-11T07:00:00Z"],"dc:description":["This dissertation addresses large-scale optimization problems in transportation emerging from hierarchical decision-making, equitable workload allocation, and innovative routing logistics. It presents three sets of contributions, each detailed in a separate chapter, and offers computational tools and insights to advance both the theory and practice of transportation systems. The first work introduces a deep learning-enhanced genetic algorithm framework for solving the Hierarchical Vehicle Routing Problems (HVRPs). Traditional optimization approaches to such problems require extensive evaluation of multiple lower-level routing solutions and are computationally intensive. Our innovative method integrates a genetic algorithm with a pretrained graph neural network, which is trained on solutions from the HGS CVRP solver, to effectively predict vehicle routing costs resulting from upper level decisions without explicitly solving each scenario. Extensive computational experiments validate the effectiveness of this approach, demonstrating significant computational savings while maintaining high-quality solutions across various datasets. The second work proposes a practical equity-oriented optimization framework tailored specifically for crowdshipping platforms within the last-mile delivery systems. Recognizing that equitable workload distribution and fair compensation are crucial for maintaining a sustainable pool of crowdworkers, our framework utilizes bi-objective optimization to balance equity against operational costs. To effectively solve this problem, we propose Hybrid NSGA-II. Numerous experiments are conducted to quantify the trade-offs between cost and equity, revealing that modest sacrifices in efficiency can lead to substantial equity improvements. Our findings provide actionable insights for gig-economy platforms, highlighting optimal strategies to maximize fairness with minimal cost increases, and guiding workforce management by analyzing the effects of varying crowdshipper pool sizes. The third problem extends the classical Rural Postman Problem (RPP) to a mixed-fleet scenario involving multiple trucks and drones, with the objective of minimizing makespan. Trucks act as mobile depots, deploying drones to service required arcs while also serving the arcs they visit themselves. To navigate the complexity inherent in this problem, we introduce a Hybrid Genetic Algorithm with a chromosome structure that encodes required arc sequences and vehicle assignments, accompanied by multiple dedicated local searches. Comprehensive evaluations on large-scale instances demonstrate the scalability, effectiveness, and real-time applicability of our method, underscoring significant improvements achievable through truck-drone integration in arc-routing logistics."],"dc:identifier":["https://digitalcommons.usf.edu/etd/11009"],"dc:subject":["Deep Learning","Equitable Workload Allocation","Genetic Algorithm","Truck-Drone Routing","Vehicle Routing Problem","Operational Research","Urban Studies and Planning"],"dc:title":["Pathways to Efficient and Equitable Solutions for Large-Scale Routing Problems"],"thesis:degree_discipline":["Industrial and Management Systems Engineering"],"thesis:degree_level":["Dissertation","Ph.D."],"thesis:degree_name":["Doctor of Philosophy (Ph.D.)"],"thesis:institution_name":["University of South Florida"]},"updated_at":"2026-11-19T08:49:40Z"}