Offline approximate value iteration for dynamic solutions to the multivehicle routing problem with stochastic demand

The multivehicle routing problem with stochastic demand (MVRPSD) is an important issue both in theory and practice. However, solving the MVRPSD through traditional methods, such as a priori optimization or rollout-algorithm-based dynamic programming is generally limited by the issues of computation...

Celý popis

Podrobná bibliografie

Vydáno v:	Computers & operations research Ročník 146; s. 105884
Hlavní autoři:	Zhang, Xiaonan, Zhang, Jianxiong, Fan, Xiaoqing
Médium:	Journal Article
Jazyk:	angličtina
Vydáno:	Elsevier Ltd 01.10.2022
Témata:	Basis function Computational efficiency Markov decision process Multivehicle routing problem with stochastic demands Offline approximate value iteration Offline approximate value iteration Markov decision process Multivehicle routing problem with stochastic demands Basis function Computational efficiency
ISSN:	0305-0548, 1873-765X
On-line přístup:	Získat plný text
Tagy:	Přidat tag Žádné tagy, Buďte první, kdo vytvoří štítek k tomuto záznamu!