Optimization Approaches for Solving Chance Constrained Stochastic Orienteering Problems
Orienteering problems (OPs) are typically used to model routing and trip planning problems. OP is a variant of the well known traveling salesman problem where the goal is to compute the highest reward path that includes a subset of nodes and has an overall travel time less than the specified deadlin...
Saved in:
Main Authors: | VARAKANTHAM, Pradeep, KUMAR, Akshat |
---|---|
Format: | text |
Language: | English |
Published: |
Institutional Knowledge at Singapore Management University
2013
|
Subjects: | |
Online Access: | https://ink.library.smu.edu.sg/sis_research/1930 https://ink.library.smu.edu.sg/context/sis_research/article/2929/viewcontent/DSOPADT.pdf |
Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
Institution: | Singapore Management University |
Language: | English |
Similar Items
-
Multi-objective chance-constrained optimal day-ahead scheduling considering BESS degradation
by: Xu, Yan, et al.
Published: (2019) -
A stochastic dynamic traveling salesman problem with hard time windows
by: Chang, T.-S., et al.
Published: (2013) -
Risk management in liner ship fleet deployment: A joint chance constrained programming model
by: Wang, T., et al.
Published: (2014) -
Particle swarm optimization-based algorithms for TSP and generalized TSP
by: Shi, X.H., et al.
Published: (2014) -
Learning to solve multiple-TSP with time window and rejections via deep reinforcement learning
by: ZHANG, Rongkai, et al.
Published: (2022)