New Optimization Models and Algorithms for Logistics and Delivery Problems
2021-01
Loading...
View/Download File
Persistent link to this item
Statistics
View StatisticsJournal Title
Journal ISSN
Volume Title
Title
New Optimization Models and Algorithms for Logistics and Delivery Problems
Authors
Published Date
2021-01
Publisher
Type
Thesis or Dissertation
Abstract
Optimization is essential to logistics and delivery problems. It has been widely used to solve classical transportation problems. However, as technology improves and the demand increases, we face an increasing number of challenging and complex problems. In this dissertation, we propose new models and develop new efficient algorithms for emerging delivery problems. The first problem we study is the speed optimization problem, where a sequence of nodes is visited in order within prescribed time windows. It is a fundamental operational problem initially studied for tramp speed decisions. In this thesis, we study this problem regarding vessel and vehicle speed decisions. Given a sequence of nodes over a path, we aim to solve for the optimal speed between each pair of consecutive nodes to minimize total cost while respecting the time-window constraint at each node and speed limits over each arc. We develop an efficient and exact algorithm that is able to solve instances of 1000 nodes in less than a second. The algorithm is 20 to 100 times faster than a general convex optimization solver on test instances and requires much less memory. The solutions found at intermediate steps of our algorithm also provide some insights to ship planners on how to balance the operating cost and service quality. The second problem is the on-demand delivery problem with customer choice. Nowadays, an increasing number of delivery firms and retailers provide same-day delivery service in large metropolitan areas. In general, delivery firms offer some available delivery time windows and corresponding delivery fees to customers. In the meantime, a fleet of vehicles is dispatched to make delivery. We develop a policy based on value function approximation (VFA) to determine delivery fees and provide feasible vehicle routes jointly in real-time. After that, we show how VFA-based future anticipation improves the total profit and increases the number of served customers.
Description
University of Minnesota Ph.D. dissertation. 2021. Major: Industrial and Systems Engineering. Advisor: William Cooper. 1 computer file (PDF); 108 pages.
Related to
Replaces
License
Collections
Series/Report Number
Funding information
Isbn identifier
Doi identifier
Previously Published Citation
Suggested citation
Zhang, Xiaochen. (2021). New Optimization Models and Algorithms for Logistics and Delivery Problems. Retrieved from the University Digital Conservancy, https://hdl.handle.net/11299/219292.
Content distributed via the University Digital Conservancy may be subject to additional license and use restrictions applied by the depositor. By using these files, users agree to the Terms of Use. Materials in the UDC may contain content that is disturbing and/or harmful. For more information, please see our statement on harmful content in digital repositories.