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 |
---|---|
格式: | text |
語言: | English |
出版: |
Institutional Knowledge at Singapore Management University
2013
|
主題: | |
在線閱讀: | https://ink.library.smu.edu.sg/sis_research/1930 https://ink.library.smu.edu.sg/context/sis_research/article/2929/viewcontent/DSOPADT.pdf |
標簽: |
添加標簽
沒有標簽, 成為第一個標記此記錄!
|
相似書籍
-
Multi-objective chance-constrained optimal day-ahead scheduling considering BESS degradation
由: Xu, Yan, et al.
出版: (2019) -
A stochastic dynamic traveling salesman problem with hard time windows
由: Chang, T.-S., et al.
出版: (2013) -
Risk management in liner ship fleet deployment: A joint chance constrained programming model
由: Wang, T., et al.
出版: (2014) -
Particle swarm optimization-based algorithms for TSP and generalized TSP
由: Shi, X.H., et al.
出版: (2014) -
An integer L-shaped algorithm for time-constrained traveling salesman problem with stochastic travel and service times
由: Teng, S.Y., et al.
出版: (2014)