Optimization Approaches for Solving Chance Constrained Stochastic Orienteering Problems

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...

Full description

Saved in:
Bibliographic Details
Main Authors: VARAKANTHAM, Pradeep, KUMAR, Akshat
Format: text
Language:English
Published: Institutional Knowledge at Singapore Management University 2013
Subjects:
Travel Time
Local Search
Travel Salesman Problem
Constraint Violation
Chance Constraint
Artificial Intelligence and Robotics
Operations Research, Systems Engineering and Industrial Engineering
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

Internet

https://ink.library.smu.edu.sg/sis_research/1930
https://ink.library.smu.edu.sg/context/sis_research/article/2929/viewcontent/DSOPADT.pdf

Similar Items