Georgia Institute of Technology
Planning the Operations of Parcel Express Shipment Service
Abstract
dc:description.abstractPackage delivery represents a significant part of the transportation industry. A critical aspect of package delivery is timely service, which is driven, in part, by the growth of e-commerce, which relies heavily on fast delivery. To provide an economically viable delivery service, express service providers need to carefully allocate and utilize their resources during operations. The primary challenge is to identify and exploit consolidation opportunities (so as to keep the costs down) while satisfying the service guarantees offered to customers (so as to maintain or increase market share). The size of real-world instances and complicating restrictions faced by express service providers in practice often impose challenges to problem tractability and difficulties in directly applying standard optimization algorithms. Therefore, computationally efficient heuristics that can produce high quality solutions within a reasonably short period of time are often pursued. This dissertation aims to develop heuristic algorithms that can provide effective decision support for planning the operations of parcel express shipment service in practice. Background information and challenges in planning the operations of a parcel express shipment service are provided and discussed in chapter 1. In chapter 2, we study a novel service network design problem encountered in a real-world urban same-day delivery system, in which the number of vehicles that can simultaneously load or unload at a hub is limited. The problem is modeled on a time-expanded network and formulated as an integer program. To produce high-quality solutions in a reasonable amount of time, we propose an integer programming based heuristic as well as a hybrid matheuristic that takes advantage of the strengths of the proposed integer programming based heuristic and of a local search based metaheuristic. The efficacy of the heuristics is demonstrated on a number of real-world instances. In chapter 3, we introduce a challenging routing and scheduling problem arising in the city operations of a large package express carrier. Vehicles perform multiple trips during a planning horizon spanning multiple driver shifts, where a trip can involve deliveries only, pickups only, or deliveries followed by pickups. Complicating factors include split deliveries and pickups, cross-trip consistency requirements, and limited unloading capacity at the main hubs. We develop an optimization-based multi-phase heuristic solution approach seeking to minimize the number of vehicles used. An extensive computational study is conducted to provide insight into current operations, its bottlenecks, and potential adjustments to improve efficiency. In chapter 4, we address an operational planning problem for an express shipment service network in which flight schedules are given, and container crossdocking decisions have to be made before freight flow demand information is revealed. A two-stage stochastic programming model is formulated in which crossdocking container movements are decided in the first-stage and package flows are determined in the second stage after demand becomes known. The proposed problem takes too long to solve with existing methods, and we address the computational challenges by proposing a two-phase branch-and-Benders-cut approach as well as additional cuts that use characteristics of solutions found so far to improve the progress of the algorithm. We present results from a computational study using real-world data that demonstrates the effectiveness of the proposed approach.
Degree
thesis:*- Level thesis:degree_level
- Doctoral
- Department dc:contributor.department
- Industrial and Systems Engineering
- Grantor dc:publisher
- Georgia Institute of Technology
- Year dc:date.issued
- 2022
Author and committee
dc:creator, dc:contributor.*- Author dc:creator
-
- Wu, Haotian
- Advisors dc:contributor.advisor
-
- Savelsbergh, Martin W. P.
- Kleywegt, Anton J.
- Committee members dc:contributor.committeemember
-
- Toriello, Alejandro
- Wang, He
Subjects
dc:subject × 15- Service network design
- Hub capacity constraints
- Same-day delivery
- Heuristics
- City operations
- Package express carrier
- Multi-trip routes
- Backhauls
- Cross-trip consistency
- Unloading capacity
- Container crossdocking planning
- Express shipment service
- Two-stage stochastic programming
- Benders decomposition
- Level bundle method
Rights
- Language dc:language.iso
- en_US
Identifiers
dc:identifier.*- Handle dc:identifier.uri
- http://hdl.handle.net/1853/67226