Abstract
Stochastic Combinatorial Optimization Problems are of great interest because they can model some quantities more accurately than their deterministic counterparts. However, the element of stochasticity introduces intricacies that make the objective function either difficult to evaluate or very time-consuming. In this paper, we propose and compare different sampling-based techniques for approximating the objective function for the Orienteering Problem with Stochastic Travel and Service Times.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
References
Weyland, D., Bianchi, L., Gambardella, L.M.: New heuristics for the probabilistic traveling salesman problem. In: Proceedings of the VIII Metaheuristic International Conference (MIC 2009) (2009)
Brucker, P., Drexl, A., Möhring, R., Neumann, K., Pesch, E.: Resource-constrained project scheduling: notation, classification, models, and methods, Eur. J. Oper. Res. 112(1), 3–41, (1999). http://www.sciencedirect.com/science/article/pii/S0377221798002045
Weyland, D., Montemanni, R., Gambardella, L.M.: Hardness results for the probabilistic traveling salesman problem with deadlines. Combinatorial Optimization. Lecture Notes in Computer Science, vol. 7422, pp. 392–403. Springer, Berlin (2012)
Papapanagiotou, V., Weyland, D., Montemanni, R., Gambardella, L.M.: A sampling-based approximation of the objective function of the orienteering problem with stochastic travel and service times. In: 5th International Conference on Applied Operational Research, Proceedings, Lecture Notes in Management Science, pp. 143–152 (2013)
Papapanagiotou, V., Montemanni, R., Gambardella, L.M.: Objective function evaluation methods for the orienteering problem with stochastic travel and service times. J. Appl. Oper. Res. 6(1), 16–29 (2014)
Campbell, A.M., Gendreau, M., Thomas, B.W.: The orienteering problem with stochastic travel and service times. Ann. Oper. Res. 186, 61–81 (2011)
Sevkli, Z., Sevilgen, F.E.: Variable neighborhood search for the orienteering problem. Computer and Information Sciences-ISCIS 2006, pp. 134–143. Springer, Berlin (2006)
Birattari, M., Balaprakash, P., Stützle, T., Dorigo, M.: Estimation-based local search for stochastic combinatorial optimization. In: IRIDIA, Université Libre de Bruxelles (2007)
http://www.idsia.ch/papapanagio/. Accessed 9-Jul-2014
Acknowledgments
Vassilis Papapanagiotou was supported by the Swiss National Science Foundation through project 200020-134675/1: “New sampling-based metaheuristics for Stochastic Vehicle Routing Problems II”.
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2016 Springer International Publishing Switzerland
About this paper
Cite this paper
Papapanagiotou, V., Montemanni, R., Gambardella, L.M. (2016). Sampling-Based Objective Function Evaluation Techniques for the Orienteering Problem with Stochastic Travel and Service Times. In: Lübbecke, M., Koster, A., Letmathe, P., Madlener, R., Peis, B., Walther, G. (eds) Operations Research Proceedings 2014. Operations Research Proceedings. Springer, Cham. https://doi.org/10.1007/978-3-319-28697-6_62
Download citation
DOI: https://doi.org/10.1007/978-3-319-28697-6_62
Published:
Publisher Name: Springer, Cham
Print ISBN: 978-3-319-28695-2
Online ISBN: 978-3-319-28697-6
eBook Packages: Business and ManagementBusiness and Management (R0)