Risk-sensitive stochastic orienteering problems for trip optimization in urban environments
Orienteering Problems (OPs) are used to model many routing and trip planning problems. OPs are a variantof the well-known traveling salesman problem where the goal is to compute the highest reward path thatincludes a subset of vertices and has an overall travel time less than a specified deadline. H...
Saved in:
Main Authors: | VARAKANTHAM, Pradeep, KUMAR, Akshat, LAU, Hoong Chuin, YEOH, William |
---|---|
Format: | text |
Language: | English |
Published: |
Institutional Knowledge at Singapore Management University
2018
|
Subjects: | |
Online Access: | https://ink.library.smu.edu.sg/sis_research/3990 https://ink.library.smu.edu.sg/context/sis_research/article/4992/viewcontent/Risk_SensitiveStochasticOrienteeringProblems_2018_afv.pdf |
Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
Institution: | Singapore Management University |
Language: | English |
Similar Items
-
The stochastic root-finding problem: Overview, solutions, and open questions
by: Pasupathy, R., et al.
Published: (2014) -
The stochastic root-finding problem: Overview, solutions, and open questions
by: Pasupathy, R., et al.
Published: (2014) -
Stochastic Optimization Problems with CVaR Risk Measure and Their Sample Average Approximation
by: Meng, F.W., et al.
Published: (2013) -
A smoothing sample average approximation method for stochastic optimization problems with CVaR risk measure
by: Meng, F., et al.
Published: (2014) -
A trust-region algorithm for bi-objective stochastic optimization
by: Kim, S., et al.
Published: (2014)