Maximizing the probability of arriving on time : a stochastic shortest path problem
Traffic and transportation are crucial to the sustainable development of most metropolitan cities, where the stochastic shortest path (SSP) problem for vehicle routing is a challenging topic. For this problem, optimization-based methods and multiagent-based methods are usually adopted to compute the...
محفوظ في:
المؤلف الرئيسي: | Cao, Zhiguang |
---|---|
مؤلفون آخرون: | Zhang Jie |
التنسيق: | Theses and Dissertations |
اللغة: | English |
منشور في: |
2017
|
الموضوعات: | |
الوصول للمادة أونلاين: | http://hdl.handle.net/10356/69617 |
الوسوم: |
إضافة وسم
لا توجد وسوم, كن أول من يضع وسما على هذه التسجيلة!
|
مواد مشابهة
-
Maximizing the probability of arriving on time: A practical q-learning method
بواسطة: CAO, Zhiguang, وآخرون
منشور في: (2017) -
SEGAC: Sample Efficient Generalized Actor Critic for the Stochastic On-Time Arrival Problem
بواسطة: GUO, Honglian, وآخرون
منشور في: (2024) -
Finding the shortest path in stochastic vehicle routing: A cardinality minimization approach
بواسطة: CAO, Zhiguang, وآخرون
منشور في: (2016) -
Novel approach to solving stochastic constrained shortest path problem with quantum computing
بواسطة: Yang, Richard Chen Xiao
منشور في: (2023) -
THE SHORTEST PATH PROBLEM SOLVING WITH TIME WINDOW FOR PERISHABLE PRODUCTS
بواسطة: KARTIKA (NIM: 23410038); Pembimbing : Suprayogi, Ph.D, WINANDA