Optimization Approaches for Solving Chance Constrained Stochastic Orienteering Problems

• المؤلفون الرئيسيون: VARAKANTHAM, Pradeep, KUMAR, Akshat
• التنسيق: text
• اللغة: English
• منشور في: Institutional Knowledge at Singapore Management University 2013
• الموضوعات: Travel Time; Local Search; Travel Salesman Problem; Constraint Violation; Chance Constraint; Artificial Intelligence and Robotics; Operations Research, Systems Engineering and Industrial Engineering
• الوصول للمادة أونلاين: https://ink.library.smu.edu.sg/sis_research/1930; https://ink.library.smu.edu.sg/context/sis_research/article/2929/viewcontent/DSOPADT.pdf

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