{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,2,21]],"date-time":"2025-02-21T00:25:11Z","timestamp":1740097511172,"version":"3.37.3"},"publisher-location":"Cham","reference-count":22,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319490007"},{"type":"electronic","value":"9783319490014"}],"license":[{"start":{"date-parts":[[2016,1,1]],"date-time":"2016-01-01T00:00:00Z","timestamp":1451606400000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2016]]},"DOI":"10.1007\/978-3-319-49001-4_8","type":"book-chapter","created":{"date-parts":[[2016,10,30]],"date-time":"2016-10-30T21:20:07Z","timestamp":1477862407000},"page":"97-109","source":"Crossref","is-referenced-by-count":1,"title":["A Sampling-Based Metaheuristic for\u00a0the\u00a0Orienteering Problem with Stochastic Travel Times"],"prefix":"10.1007","author":[{"given":"Vassilis","family":"Papapanagiotou","sequence":"first","affiliation":[]},{"given":"Roberto","family":"Montemanni","sequence":"additional","affiliation":[]},{"given":"Luca Maria","family":"Gambardella","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2016,11,1]]},"reference":[{"issue":"4","key":"8_CR1","doi-asserted-by":"crossref","first-page":"199","DOI":"10.1002\/net.3230250406","volume":"25","author":"E Balas","year":"1995","unstructured":"Balas, E.: The prize collecting traveling salesman problem: Ii. polyhedral results. Networks 25(4), 199\u2013216 (1995). http:\/\/dx.doi.org\/10.1002\/net.3230250406","journal-title":"Networks"},{"key":"8_CR2","series-title":"Operations Research\/Computer Science Interfaces Series","doi-asserted-by":"crossref","first-page":"189","DOI":"10.1007\/978-0-387-71921-4_10","volume-title":"Metaheuristics","author":"M Birattari","year":"2007","unstructured":"Birattari, M., Balaprakash, P., Dorigo, M.: The ACO\/F-race algorithm for combinatorial optimization under uncertainty. In: Doerner, K.F., Gendreau, M., Greistorfer, P., Gutjahr, W., Hartl, R.F., Reimann, M. (eds.) Metaheuristics. Operations Research\/Computer Science Interfaces Series, vol. 39, pp. 189\u2013203. Springer, Heidelberg (2007)"},{"key":"8_CR3","doi-asserted-by":"crossref","first-page":"61","DOI":"10.1007\/s10479-011-0895-2","volume":"186","author":"A Campbell","year":"2011","unstructured":"Campbell, A., Gendreau, M., Thomas, B.: The orienteering problem with stochastic travel and service times. Ann. Oper. Res. 186, 61\u201381 (2011)","journal-title":"Ann. Oper. Res."},{"issue":"2","key":"8_CR4","doi-asserted-by":"crossref","first-page":"188","DOI":"10.1287\/trsc.1030.0079","volume":"39","author":"D Feillet","year":"2005","unstructured":"Feillet, D., Dejax, P., Gendreau, M.: Traveling salesman problems with profits. Transp. Sci. 39(2), 188\u2013205 (2005)","journal-title":"Transp. Sci."},{"key":"8_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"238","DOI":"10.1007\/978-3-540-28646-2_21","volume-title":"Ant Colony Optimization and Swarm Intelligence","author":"WJ Gutjahr","year":"2004","unstructured":"Gutjahr, W.J.: S-ACO: an ant-based approach to combinatorial optimization under uncertainty. In: Dorigo, M., Birattari, M., Blum, C., Gambardella, L.M., Mondada, F., St\u00fctzle, T. (eds.) ANTS 2004. LNCS, vol. 3172, pp. 238\u2013249. Springer, Heidelberg (2004). doi: 10.1007\/978-3-540-28646-2_21"},{"key":"8_CR6","unstructured":"Johnson, N.L., Kotz, S., Balakrishnan, N.: Continuous Multivariate Distributions, vol. 1, Models and Applications, vol. 59. New York: John Wiley & Sons (2002)"},{"issue":"3","key":"8_CR7","doi-asserted-by":"crossref","first-page":"699","DOI":"10.1016\/j.ejor.2014.04.024","volume":"238","author":"C Lei","year":"2014","unstructured":"Lei, C., Lin, W., Miao, L.: A multicut l-shaped based algorithm to solve a stochastic programming model for the mobile facility routing and scheduling problem. Eur. J. Oper. Res. 238(3), 699\u2013710 (2014)","journal-title":"Eur. J. Oper. Res."},{"issue":"11","key":"8_CR8","doi-asserted-by":"crossref","first-page":"1097","DOI":"10.1016\/S0305-0548(97)00031-2","volume":"24","author":"N Mladenovi\u0107","year":"1997","unstructured":"Mladenovi\u0107, N., Hansen, P.: Variable neighborhood search. Comput. Oper. Res. 24(11), 1097\u20131100 (1997)","journal-title":"Comput. Oper. Res."},{"issue":"1","key":"8_CR9","first-page":"16","volume":"6","author":"V Papapanagiotou","year":"2014","unstructured":"Papapanagiotou, V., Montemanni, R., Gambardella, L.: Objective function evaluation methods for the orienteering problem with stochastic travel and service times. J. Appl. Oper. Res. 6(1), 16\u201329 (2014)","journal-title":"J. Appl. Oper. Res."},{"key":"8_CR10","unstructured":"Papapanagiotou, V., Montemanni, R., Gambardella, L.: Further results for opsts, caor (2015). http:\/\/people.idsia.ch\/~papapanagio\/"},{"issue":"2","key":"8_CR11","doi-asserted-by":"crossref","first-page":"1","DOI":"10.12720\/jtle.3.2.108-114","volume":"3","author":"V Papapanagiotou","year":"2015","unstructured":"Papapanagiotou, V., Montemanni, R., Gambardella, L.: Hybrid sampling-based evaluators for the orienteering problem with stochastic travel and service times. J. Traffic Logistics Eng. 3(2), 1\u201325 (2015)","journal-title":"J. Traffic Logistics Eng."},{"key":"8_CR12","doi-asserted-by":"crossref","unstructured":"Papapanagiotou, V., Montemanni, R., Gambardella, L.: Sampling-based objective function evaluation techniques for the orienteering problem with stochastic travel and service times. German Oper. Res. Soc. (GOR) (to appear)","DOI":"10.1007\/978-3-319-28697-6_62"},{"key":"8_CR13","unstructured":"Papapanagiotou, V., Weyland, D., Montemanni, R., Gambardella, L.: 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\u2013152 (2013)"},{"issue":"1","key":"8_CR14","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1016\/j.ejor.2010.03.045","volume":"209","author":"P Vansteenwegen","year":"2011","unstructured":"Vansteenwegen, P., Souffriau, W., Oudheusden, D.: The orienteering problem: A survey. Eur. J. Oper. Res. 209(1), 1\u201310 (2011). http:\/\/www.sciencedirect.com\/science\/article\/pii\/S0377221710002973","journal-title":"Eur. J. Oper. Res."},{"key":"8_CR15","unstructured":"Rauner, M., Gutjahr, W., Brailsford, S., Zeppelzauer, W.: Optimal screening policies for diabetic retinopathy using a combined discrete-event simulation and ant colony optimization approach (2005)"},{"issue":"2","key":"8_CR16","doi-asserted-by":"crossref","first-page":"139","DOI":"10.1006\/jcph.1999.6413","volume":"159","author":"G Schrimpf","year":"2000","unstructured":"Schrimpf, G., Schneider, J., Stamm-Wilbrandt, H., Dueck, G.: Record breaking optimization results using the ruin and recreate principle. J. Comput. Phys. 159(2), 139\u2013171 (2000)","journal-title":"J. Comput. Phys."},{"key":"8_CR17","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"134","DOI":"10.1007\/11902140_16","volume-title":"Computer and Information Sciences \u2013 ISCIS 2006","author":"Z Sevkli","year":"2006","unstructured":"Sevkli, Z., Sevilgen, F.E.: Variable neighborhood search for the orienteering problem. In: Levi, A., Sava\u015f, E., Yenig\u00fcn, H., Balc\u0131soy, S., Sayg\u0131n, Y. (eds.) ISCIS 2006. LNCS, vol. 4263, pp. 134\u2013143. Springer, Heidelberg (2006). doi: 10.1007\/11902140_16"},{"key":"8_CR18","unstructured":"Spall, J.: Introduction to stochastic search and optimization: estimation, simulation, and control, vol. 65. John Wiley & Sons (2005)"},{"key":"8_CR19","unstructured":"Weyland, D., Bianchi, L., Gambardella, L.: New heuristics for the probabilistic traveling salesman problem. In: Proceedings of the VIII Metaheuristic International Conference (MIC 2009) (2009)"},{"key":"8_CR20","unstructured":"Weyland, D., Montemanni, R., Gambardella, L.: Heuristics for the probabilistic traveling salesman problem with deadlines based on quasi-parallel monte carlo sampling, submitted for publication (2011)"},{"key":"8_CR21","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"392","DOI":"10.1007\/978-3-642-32147-4_35","volume-title":"Combinatorial Optimization","author":"D Weyland","year":"2012","unstructured":"Weyland, D., Montemanni, R., Gambardella, L.M.: Hardness results for the probabilistic traveling salesman problem with deadlines. In: Mahjoub, A.R., Markakis, V., Milis, I., Paschos, V.T. (eds.) ISCO 2012. LNCS, vol. 7422, pp. 392\u2013403. Springer, Heidelberg (2012). doi: 10.1007\/978-3-642-32147-4_35"},{"issue":"6","key":"8_CR22","doi-asserted-by":"crossref","first-page":"577","DOI":"10.1111\/1475-3995.00429","volume":"10","author":"Y Yoshitomi","year":"2003","unstructured":"Yoshitomi, Y., Yamaguchi, R.: A genetic algorithm and the monte carlo method for stochastic job-shop scheduling. Int. Trans. Oper. Res. 10(6), 577\u2013596 (2003)","journal-title":"Int. Trans. Oper. Res."}],"container-title":["Lecture Notes in Computer Science","Theory and Practice of Natural Computing"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-49001-4_8","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2017,6,24]],"date-time":"2017-06-24T22:25:01Z","timestamp":1498343101000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-319-49001-4_8"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2016]]},"ISBN":["9783319490007","9783319490014"],"references-count":22,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-49001-4_8","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2016]]}}}