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...
محفوظ في:
المؤلفون الرئيسيون: | 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 |
الوسوم: |
إضافة وسم
لا توجد وسوم, كن أول من يضع وسما على هذه التسجيلة!
|
المؤسسة: | Singapore Management University |
اللغة: | English |
مواد مشابهة
-
Multi-objective chance-constrained optimal day-ahead scheduling considering BESS degradation
بواسطة: Xu, Yan, وآخرون
منشور في: (2019) -
A stochastic dynamic traveling salesman problem with hard time windows
بواسطة: Chang, T.-S., وآخرون
منشور في: (2013) -
Risk management in liner ship fleet deployment: A joint chance constrained programming model
بواسطة: Wang, T., وآخرون
منشور في: (2014) -
Particle swarm optimization-based algorithms for TSP and generalized TSP
بواسطة: Shi, X.H., وآخرون
منشور في: (2014) -
An integer L-shaped algorithm for time-constrained traveling salesman problem with stochastic travel and service times
بواسطة: Teng, S.Y., وآخرون
منشور في: (2014)