Seminar: Hanzhang QinExport this event to calendar

Wednesday, January 19, 2022 — 11:00 AM EST

A New Approach for Vehicle Routing with Stochastic Demand: Combining Route Assignment with Process Flexibility

Hanzhang Qin

Laboratory for Information and Decision Systems
MIT

Via ZOOM


Abstract

We propose a new approach for the vehicle routing problem with stochastic customer demands revealed before vehicles are dispatched. We combine ideas from vehicle routing and manufacturing process flexibility to propose overlapped routing strategies with customer sharing. We characterize the asymptotic performance of the overlapped routing strategies under probabilistic analysis while also providing an upper-bound on the asymptotic performance that depends only on the mean and standard deviation of the customer demand distribution. Moreover, we show the optimality gap of our approach decays exponentially as the size of overlapped routes increases. We demonstrate that our overlapped routing strategies perform close to the theoretical lower-bound derived from the reoptimization strategy, and significantly outperform the routing strategy without overlapped routes. The effectiveness of the proposed overlapped routing strategies in non-asymptotic regimes is further verified through numerical analysis.

Biographical Sketch

Hanzhang Qin is a Ph.D. candidate in Computational Science and Engineering under supervision of Professor David Simchi-Levi. Affiliated with Laboratory for Information & Decision Systems and Center for Computational Science & Engineering at MIT, Hanzhang has research interests that span stochastic control, applied probability and statistical learning, with applications in supply chain analytics and transportation systems. He holds two master's, one in EECS and one in Transportation both from MIT. Prior to attending MIT, Hanzhang received two bachelor degrees in Industrial Engineering and Mathematics from Tsinghua University, where he was advised by Professor Hai Jiang and Professor Liping Zhang for his undergraduate theses.

S M T W T F S
29
30
31
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
1
2
3
4
  1. 2023 (1)
    1. January (1)
  2. 2022 (29)
    1. November (2)
    2. October (4)
    3. June (1)
    4. April (4)
    5. March (5)
    6. February (7)
    7. January (6)
  3. 2021 (43)
  4. 2020 (81)
  5. 2019 (72)
  6. 2018 (43)
  7. 2017 (35)
  8. 2016 (11)
  9. 2015 (10)
  10. 2014 (8)
  11. 2013 (8)
  12. 2012 (3)