{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,26]],"date-time":"2025-03-26T06:26:50Z","timestamp":1742970410245,"version":"3.40.3"},"publisher-location":"Berlin, Heidelberg","reference-count":26,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642538551"},{"type":"electronic","value":"9783642538568"}],"license":[{"start":{"date-parts":[[2013,1,1]],"date-time":"2013-01-01T00:00:00Z","timestamp":1356998400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2013,1,1]],"date-time":"2013-01-01T00:00:00Z","timestamp":1356998400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2013]]},"DOI":"10.1007\/978-3-642-53856-8_42","type":"book-chapter","created":{"date-parts":[[2013,12,10]],"date-time":"2013-12-10T13:26:45Z","timestamp":1386682005000},"page":"332-339","source":"Crossref","is-referenced-by-count":1,"title":["An Improved Heuristic for the Probabilistic Traveling Salesman Problem with Deadlines Based on GPGPU"],"prefix":"10.1007","author":[{"given":"Dennis","family":"Weyland","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Roberto","family":"Montemanni","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Luca Maria","family":"Gambardella","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"issue":"3","key":"42_CR1","doi-asserted-by":"publisher","first-page":"407","DOI":"10.1016\/0377-2217(92)90323-2","volume":"56","author":"C. Bastian","year":"1992","unstructured":"Bastian, C., Rinnooy Kan, A.H.G.: The stochastic vehicle routing problem revisited. European Journal of Operational Research\u00a056(3), 407\u2013412 (1992)","journal-title":"European Journal of Operational Research"},{"issue":"3","key":"42_CR2","doi-asserted-by":"publisher","first-page":"574","DOI":"10.1287\/opre.40.3.574","volume":"40","author":"D.J. Bertsimas","year":"1992","unstructured":"Bertsimas, D.J.: A vehicle routing problem with stochastic demand. Operations Research\u00a040(3), 574\u2013585 (1992)","journal-title":"Operations Research"},{"issue":"1","key":"42_CR3","doi-asserted-by":"publisher","first-page":"68","DOI":"10.1016\/0377-2217(93)90145-D","volume":"65","author":"D.J. Bertsimas","year":"1993","unstructured":"Bertsimas, D.J., Howell, L.H.: Further results on the probabilistic traveling salesman problem. European Journal of Operational Research\u00a065(1), 68\u201395 (1993)","journal-title":"European Journal of Operational Research"},{"issue":"6","key":"42_CR4","doi-asserted-by":"publisher","first-page":"1019","DOI":"10.1287\/opre.38.6.1019","volume":"38","author":"D.J. Bertsimas","year":"1990","unstructured":"Bertsimas, D.J., Jaillet, P., Odoni, A.R.: A priori optimization. Operations Research\u00a038(6), 1019\u20131033 (1990)","journal-title":"Operations Research"},{"issue":"2","key":"42_CR5","doi-asserted-by":"publisher","first-page":"239","DOI":"10.1007\/s11047-008-9098-4","volume":"8","author":"L. Bianchi","year":"2009","unstructured":"Bianchi, L., Dorigo, M., Gambardella, L.M., Gutjahr, W.J.: A survey on metaheuristics for stochastic combinatorial optimization. Natural Computing\u00a08(2), 239\u2013287 (2009)","journal-title":"Natural Computing"},{"issue":"9","key":"42_CR6","doi-asserted-by":"publisher","first-page":"2703","DOI":"10.1016\/j.cor.2005.02.024","volume":"33","author":"A.M. Campbell","year":"2006","unstructured":"Campbell, A.M.: Aggregation for the probabilistic traveling salesman problem. Computers and Operations Research\u00a033(9), 2703\u20132724 (2006)","journal-title":"Computers and Operations Research"},{"key":"42_CR7","doi-asserted-by":"crossref","unstructured":"Campbell, A.M., Thomas, B.W.: Challenges and advances in a priori routing. In: The Vehicle Routing Problem: Latest Advances and New Challenges, pp. 123\u2013142 (2008)","DOI":"10.1007\/978-0-387-77778-8_6"},{"issue":"1","key":"42_CR8","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1287\/trsc.1070.0203","volume":"42","author":"A.M. Campbell","year":"2008","unstructured":"Campbell, A.M., Thomas, B.W.: Probabilistic traveling salesman problem with deadlines. Transportation Science\u00a042(1), 1\u201321 (2008)","journal-title":"Transportation Science"},{"issue":"4","key":"42_CR9","doi-asserted-by":"publisher","first-page":"1231","DOI":"10.1016\/j.cor.2008.01.006","volume":"36","author":"A.M. Campbell","year":"2009","unstructured":"Campbell, A.M., Thomas, B.W.: Runtime reduction techniques for the probabilistic traveling salesman problem with deadlines. Computers and Operations Research\u00a036(4), 1231\u20131248 (2009)","journal-title":"Computers and Operations Research"},{"issue":"5","key":"42_CR10","doi-asserted-by":"publisher","first-page":"819","DOI":"10.1287\/opre.37.5.819","volume":"37","author":"R.L. Carraway","year":"1989","unstructured":"Carraway, R.L., Morin, T.L., Moskowitz, H.: Generalized dynamic programming for stochastic combinatorial optimization. Operations Research\u00a037(5), 819\u2013829 (1989)","journal-title":"Operations Research"},{"issue":"3","key":"42_CR11","doi-asserted-by":"publisher","first-page":"273","DOI":"10.1007\/BF01415995","volume":"37","author":"M. Dror","year":"1993","unstructured":"Dror, M., Laporte, G., Louveaux, F.V.: Vehicle routing with stochastic demands and restricted failures. Mathematical Methods of Operations Research\u00a037(3), 273\u2013283 (1993)","journal-title":"Mathematical Methods of Operations Research"},{"issue":"2","key":"42_CR12","doi-asserted-by":"publisher","first-page":"143","DOI":"10.1287\/trsc.29.2.143","volume":"29","author":"M. Gendreau","year":"1995","unstructured":"Gendreau, M., Laporte, G., S\u00e9guin, R.: An exact algorithm for the vehicle routing problem with stochastic demands and customers. Transportation Science\u00a029(2), 143\u2013155 (1995)","journal-title":"Transportation Science"},{"issue":"3","key":"42_CR13","doi-asserted-by":"publisher","first-page":"469","DOI":"10.1287\/opre.44.3.469","volume":"44","author":"M. Gendreau","year":"1996","unstructured":"Gendreau, M., Laporte, G., S\u00e9guin, R.: A tabu search heuristic for the vehicle routing problem with stochastic demands and customers. Operations Research\u00a044(3), 469\u2013477 (1996)","journal-title":"Operations Research"},{"key":"42_CR14","unstructured":"Immorlica, N., Karger, D., Minkoff, M., Mirrokni, V.S.: On the costs and benefits of procrastination: Approximation algorithms for stochastic combinatorial optimization problems. In: Proceedings of the Fifteenth Annual ACM-SIAM Symposium on Discrete Algorithms, pp. 691\u2013700. Society for Industrial and Applied Mathematics (2004)"},{"key":"42_CR15","unstructured":"Jaillet, P.: Probabilistic traveling salesman problems. PhD thesis, M. I. T., Dept. of Civil Engineering (1985)"},{"key":"42_CR16","doi-asserted-by":"publisher","first-page":"39","DOI":"10.1023\/A:1018930113099","volume":"85","author":"W.K. Klein Haneveld","year":"1999","unstructured":"Klein Haneveld, W.K., van der Vlerk, M.H.: Stochastic integer programming: General models and algorithms. Annals of Operations Research\u00a085, 39\u201357 (1999)","journal-title":"Annals of Operations Research"},{"issue":"3","key":"42_CR17","doi-asserted-by":"publisher","first-page":"543","DOI":"10.1287\/opre.42.3.543","volume":"42","author":"G. Laporte","year":"1994","unstructured":"Laporte, G., Louveaux, F.V., Mercure, H.: A priori optimization of the probabilistic traveling salesman problem. Operations Research\u00a042(3), 543\u2013549 (1994)","journal-title":"Operations Research"},{"issue":"1","key":"42_CR18","doi-asserted-by":"publisher","first-page":"561","DOI":"10.1016\/S0304-3975(01)00005-6","volume":"270","author":"C. Murat","year":"2002","unstructured":"Murat, C., Paschos, V.T.: A priori optimization for the probabilistic maximum independent set problem. Theoretical Computer Science\u00a0270(1), 561\u2013590 (2002)","journal-title":"Theoretical Computer Science"},{"issue":"3","key":"42_CR19","doi-asserted-by":"publisher","first-page":"404","DOI":"10.1111\/j.1467-9574.1996.tb01506.x","volume":"50","author":"R. Schultz","year":"2008","unstructured":"Schultz, R., Stougie, L., Vlerk, M.H.: Two-stage stochastic integer programming: A survey. Statistica Neerlandica\u00a050(3), 404\u2013416 (2008)","journal-title":"Statistica Neerlandica"},{"key":"42_CR20","doi-asserted-by":"crossref","unstructured":"Uryasev, S., Pardalos, P.M.: Stochastic optimization: Algorithms and applications. Springer (2001)","DOI":"10.1007\/978-1-4757-6594-6"},{"key":"42_CR21","unstructured":"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)"},{"key":"42_CR22","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"448","DOI":"10.1007\/978-3-642-27549-4_57","volume-title":"Computer Aided Systems Theory \u2013 EUROCAST 2011","author":"D. Weyland","year":"2012","unstructured":"Weyland, D., Montemanni, R., Gambardella, L.M.: Using statistical tests for improving state-of-the-art heuristics for the probabilistic traveling salesman problem with deadlines. In: Moreno-D\u00edaz, R., Pichler, F., Quesada-Arencibia, A. (eds.) EUROCAST 2011, Part I. LNCS, vol.\u00a06927, pp. 448\u2013455. Springer, Heidelberg (2012)"},{"key":"42_CR23","doi-asserted-by":"crossref","unstructured":"Weyland, D., Montemanni, R., Gambardella, L.M.: A metaheuristic framework for stochastic combinatorial optimization problems based on GPGPU with a case study on the probabilistic traveling salesman problem with deadlines. Journal of Parallel and Distributed Computing (2012)","DOI":"10.1016\/j.jpdc.2012.05.004"},{"key":"42_CR24","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.\u00a07422, pp. 392\u2013403. Springer, Heidelberg (2012)"},{"key":"42_CR25","doi-asserted-by":"crossref","unstructured":"Weyland, D., Montemanni, R., Gambardella, L.M.: Heuristics for the probabilistic traveling salesman problem with deadlines based on quasi-parallel Monte Carlo sampling. Computers and Operations Research (2012) (to appear)","DOI":"10.1016\/j.cor.2012.12.015"},{"key":"42_CR26","doi-asserted-by":"crossref","unstructured":"Weyland, D., Montemanni, R., Gambardella, L.M.: On the computational complexity of the probabilistic traveling salesman problem with deadlines (2012) (submitted)","DOI":"10.1007\/978-3-642-32147-4_35"}],"container-title":["Lecture Notes in Computer Science","Computer Aided Systems Theory - EUROCAST 2013"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-53856-8_42","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,2,9]],"date-time":"2023-02-09T21:05:53Z","timestamp":1675976753000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-642-53856-8_42"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2013]]},"ISBN":["9783642538551","9783642538568"],"references-count":26,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-53856-8_42","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2013]]}}}