Dynamic Stochastic Orienteering Problems for Risk-Aware Applications
Orienteering problems (OPs) are a variant of the well-known prize-collecting traveling salesman problem, where the salesman needs to choose a subset of cities to visit within a given deadline. OPs and their extensions with stochastic travel times (SOPs) have been used to model vehicle routing proble...
Saved in:
Main Authors: | LAU, Hoong Chuin, YEOH, William, VARAKANTHAM, Pradeep, NGUYEN, Duc Thien |
---|---|
Format: | text |
Language: | English |
Published: |
Institutional Knowledge at Singapore Management University
2012
|
Subjects: | |
Online Access: | https://ink.library.smu.edu.sg/sis_research/1610 https://ink.library.smu.edu.sg/context/sis_research/article/2609/viewcontent/DSOP_UAI.pdf |
Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
Institution: | Singapore Management University |
Language: | English |
Similar Items
-
Risk-sensitive stochastic orienteering problems for trip optimization in urban environments
by: VARAKANTHAM, Pradeep, et al.
Published: (2018) -
Decentralized multi-agent reinforcement learning in average-reward dynamic DCOPs
by: NGUYEN, Duc Thien, et al.
Published: (2014) -
Stochastic dominance in stochastic DCOPs for risk-sensitive applications
by: NGUYEN DUC THIEN,, et al.
Published: (2012) -
Incremental DCOP Search Algorithms for Solving Dynamic DCOP Problems
by: YEOH, William, et al.
Published: (2011) -
Decentralized multi-agent reinforcement learning in average-reward dynamic DCOPs
by: Nguyen, Duc Thien, et al.
Published: (2014)