서브메뉴
검색
Periodic Vehicle Routing Problems: Optimization Approaches and Implications for Last-Mile Delivery- [electronic resource]
Periodic Vehicle Routing Problems: Optimization Approaches and Implications for Last-Mile Delivery- [electronic resource]
상세정보
- 자료유형
- 학위논문파일 국외
- 최종처리일시
- 20240214101915
- ISBN
- 9798380394680
- DDC
- 660
- 서명/저자
- Periodic Vehicle Routing Problems: Optimization Approaches and Implications for Last-Mile Delivery - [electronic resource]
- 발행사항
- [S.l.]: : Carnegie Mellon University., 2023
- 발행사항
- Ann Arbor : : ProQuest Dissertations & Theses,, 2023
- 형태사항
- 1 online resource(145 p.)
- 주기사항
- Source: Dissertations Abstracts International, Volume: 85-03, Section: B.
- 주기사항
- Advisor: Gounaris, Chrysanthos E.
- 학위논문주기
- Thesis (Ph.D.)--Carnegie Mellon University, 2023.
- 사용제한주기
- This item must not be sold to any third party vendors.
- 초록/해제
- 요약Last-mile delivery stands as a vital cog in supply chain operations, tasked with efficiently transporting goods from distribution hubs to their final destinations. In many scenarios, optimizing last-mile delivery requires intricate multi-period planning. Customers often present diverse visiting schedule options, compelling distributors to design both optimal visiting schedules and cost-effective daily routes for their transportation fleets. Within this complex landscape, the vehicle routing problem (VRP), particularly its periodic vehicle routing subclass, serves as a potent tool for conducting distribution optimization. Despite extensive research efforts and the emergence of various modeling and solution techniques in the literature for this combinatorial problem, disparities between theoretical works and real-world applications persist.This thesis is dedicated to bridging the gap between practical challenges encountered in last-mile delivery and the existing methodologies within the PVRP domain. To this end, two central challenges are addressed: incorporating operational constraints and transitioning to multi-period operation. The first challenge involves accommodating operational constraints that affect last-mile delivery efficiency. We start by constructing a versatile branch-price-and-cut framework capable of tackling PVRPs and their classic variants. Subsequently, we delve into specific practical considerations within last-mile delivery, such as work duration regulations leading to long-haul trips and workload equity. Leveraging our solution framework, we extend the existing state-of-the-art branch-price-and-cut approach proposed in the literature to adeptly handle problems featuring these characteristics.The second challenge revolves around transitioning from single-period to multi-period last-mile delivery operations. To address this, we introduce a comprehensive decision support framework armed with a rolling horizon simulation engine. This engine harnesses historical data to rigorously quantify cost savings associated with the transition, providing valuable insights for decision-makers.
- 일반주제명
- Chemical engineering.
- 기타저자
- Carnegie Mellon University Chemical Engineering
- 기본자료저록
- Dissertations Abstracts International. 85-03B.
- 기본자료저록
- Dissertation Abstract International
- 전자적 위치 및 접속
- 로그인 후 원문을 볼 수 있습니다.
MARC
008240612s2023 us |||||||||||||||c||eng d■001000016935299
■00520240214101915
■006m o d
■007cr#unu||||||||
■020 ▼a9798380394680
■035 ▼a(MiAaPQ)AAI30688140
■040 ▼aMiAaPQ▼cMiAaPQ
■0820 ▼a660
■1001 ▼aIzadkhah, Aliakbar.▼0(orcid)0000-0002-3547-0139
■24510▼aPeriodic Vehicle Routing Problems: Optimization Approaches and Implications for Last-Mile Delivery▼h[electronic resource]
■260 ▼a[S.l.]:▼bCarnegie Mellon University. ▼c2023
■260 1▼aAnn Arbor :▼bProQuest Dissertations & Theses, ▼c2023
■300 ▼a1 online resource(145 p.)
■500 ▼aSource: Dissertations Abstracts International, Volume: 85-03, Section: B.
■500 ▼aAdvisor: Gounaris, Chrysanthos E.
■5021 ▼aThesis (Ph.D.)--Carnegie Mellon University, 2023.
■506 ▼aThis item must not be sold to any third party vendors.
■520 ▼aLast-mile delivery stands as a vital cog in supply chain operations, tasked with efficiently transporting goods from distribution hubs to their final destinations. In many scenarios, optimizing last-mile delivery requires intricate multi-period planning. Customers often present diverse visiting schedule options, compelling distributors to design both optimal visiting schedules and cost-effective daily routes for their transportation fleets. Within this complex landscape, the vehicle routing problem (VRP), particularly its periodic vehicle routing subclass, serves as a potent tool for conducting distribution optimization. Despite extensive research efforts and the emergence of various modeling and solution techniques in the literature for this combinatorial problem, disparities between theoretical works and real-world applications persist.This thesis is dedicated to bridging the gap between practical challenges encountered in last-mile delivery and the existing methodologies within the PVRP domain. To this end, two central challenges are addressed: incorporating operational constraints and transitioning to multi-period operation. The first challenge involves accommodating operational constraints that affect last-mile delivery efficiency. We start by constructing a versatile branch-price-and-cut framework capable of tackling PVRPs and their classic variants. Subsequently, we delve into specific practical considerations within last-mile delivery, such as work duration regulations leading to long-haul trips and workload equity. Leveraging our solution framework, we extend the existing state-of-the-art branch-price-and-cut approach proposed in the literature to adeptly handle problems featuring these characteristics.The second challenge revolves around transitioning from single-period to multi-period last-mile delivery operations. To address this, we introduce a comprehensive decision support framework armed with a rolling horizon simulation engine. This engine harnesses historical data to rigorously quantify cost savings associated with the transition, providing valuable insights for decision-makers.
■590 ▼aSchool code: 0041.
■650 4▼aChemical engineering.
■653 ▼aVehicle routing problem
■653 ▼aDelivery efficiency
■653 ▼aSupply chain operations
■690 ▼a0542
■690 ▼a0796
■71020▼aCarnegie Mellon University▼bChemical Engineering.
■7730 ▼tDissertations Abstracts International▼g85-03B.
■773 ▼tDissertation Abstract International
■790 ▼a0041
■791 ▼aPh.D.
■792 ▼a2023
■793 ▼aEnglish
■85640▼uhttp://www.riss.kr/pdu/ddodLink.do?id=T16935299▼nKERIS▼z이 자료의 원문은 한국교육학술정보원에서 제공합니다.
■980 ▼a202402▼f2024
