{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,31]],"date-time":"2025-10-31T07:14:38Z","timestamp":1761894878211},"publisher-location":"Berlin, Heidelberg","reference-count":13,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642010088"},{"type":"electronic","value":"9783642010095"}],"license":[{"start":{"date-parts":[[2009,1,1]],"date-time":"2009-01-01T00:00:00Z","timestamp":1230768000000},"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":[[2009]]},"DOI":"10.1007\/978-3-642-01009-5_9","type":"book-chapter","created":{"date-parts":[[2009,4,9]],"date-time":"2009-04-09T13:34:14Z","timestamp":1239284054000},"page":"97-108","source":"Crossref","is-referenced-by-count":11,"title":["Beam-ACO Based on Stochastic Sampling for Makespan Optimization Concerning the TSP with Time Windows"],"prefix":"10.1007","author":[{"given":"Manuel","family":"L\u00f3pez-Ib\u00e1\u00f1ez","sequence":"first","affiliation":[]},{"given":"Christian","family":"Blum","sequence":"additional","affiliation":[]},{"given":"Dhananjay","family":"Thiruvady","sequence":"additional","affiliation":[]},{"given":"Andreas T.","family":"Ernst","sequence":"additional","affiliation":[]},{"given":"Bernd","family":"Meyer","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"issue":"1","key":"9_CR1","doi-asserted-by":"publisher","first-page":"80","DOI":"10.1287\/ijoc.1050.0145","volume":"19","author":"J.W. Ohlmann","year":"2007","unstructured":"Ohlmann, J.W., Thomas, B.W.: A compressed-annealing heuristic for the traveling salesman problem with time windows. INFORMS J. Comput.\u00a019(1), 80\u201390 (2007)","journal-title":"INFORMS J. Comput."},{"issue":"1","key":"9_CR2","doi-asserted-by":"publisher","first-page":"285","DOI":"10.1007\/BF02022044","volume":"4","author":"M.W.P. Savelsbergh","year":"1985","unstructured":"Savelsbergh, M.W.P.: Local search in routing problems with time windows. Annals of Operations Research\u00a04(1), 285\u2013305 (1985)","journal-title":"Annals of Operations Research"},{"key":"9_CR3","doi-asserted-by":"publisher","first-page":"1225","DOI":"10.1016\/j.mcm.2006.11.035","volume":"46","author":"C.B. Cheng","year":"2007","unstructured":"Cheng, C.B., Mao, C.P.: A modified ant colony system for solving the travelling salesman problem with time windows. Mathematical and Computer Modelling\u00a046, 1225\u20131235 (2007)","journal-title":"Mathematical and Computer Modelling"},{"key":"9_CR4","first-page":"63","volume-title":"New Ideas in Optimization","author":"L. Gambardella","year":"1999","unstructured":"Gambardella, L., Taillard, E.D., Agazzi, G.: MACS-VRPTW: A multiple ant colony system for vehicle routing problems with time windows. In: Corne, D., Dorigo, M., Glover, F. (eds.) New Ideas in Optimization, pp. 63\u201376. McGraw Hill, London (1999)"},{"key":"9_CR5","doi-asserted-by":"crossref","DOI":"10.7551\/mitpress\/1290.001.0001","volume-title":"Ant Colony Optimization","author":"M. Dorigo","year":"2004","unstructured":"Dorigo, M., St\u00fctzle, T.: Ant Colony Optimization. MIT Press, Cambridge (2004)"},{"key":"9_CR6","doi-asserted-by":"publisher","first-page":"1565","DOI":"10.1016\/j.cor.2003.11.018","volume":"32","author":"C. Blum","year":"2005","unstructured":"Blum, C.: Beam-ACO\u2013hybridizing ant colony optimization with beam search: an application to open shop scheduling. Comp. & Op. Res.\u00a032, 1565\u20131591 (2005)","journal-title":"Comp. & Op. Res."},{"issue":"4","key":"9_CR7","doi-asserted-by":"publisher","first-page":"618","DOI":"10.1287\/ijoc.1080.0271","volume":"20","author":"C. Blum","year":"2008","unstructured":"Blum, C.: Beam-ACO for simple assembly line balancing. INFORMS J. Comput.\u00a020(4), 618\u2013627 (2008)","journal-title":"INFORMS J. Comput."},{"key":"9_CR8","doi-asserted-by":"publisher","first-page":"297","DOI":"10.1080\/00207548808947840","volume":"26","author":"P.S. Ow","year":"1988","unstructured":"Ow, P.S., Morton, T.E.: Filtered beam search in scheduling. Int. J. Prod. Res.\u00a026, 297\u2013307 (1988)","journal-title":"Int. J. Prod. Res."},{"key":"9_CR9","series-title":"Lecture Notes in Computer Science","volume-title":"Proceedings of LION3","author":"M. L\u00f3pez-Ib\u00e1\u00f1ez","year":"2009","unstructured":"L\u00f3pez-Ib\u00e1\u00f1ez, M., Blum, C.: Beam-ACO based on stochastic sampling: A case study on the TSP with time windows. In: Battiti, R., et al. (eds.) Proceedings of LION3. LNCS. Springer, Berlin (2009)"},{"key":"9_CR10","first-page":"776","volume-title":"Proceedings of AAAI 1998","author":"H. Juill\u00e9","year":"1998","unstructured":"Juill\u00e9, H., Pollack, J.B.: A sampling-based heuristic for tree search applied to grammar induction. In: Proceedings of AAAI 1998, pp. 776\u2013783. MIT press, Cambridge (1998)"},{"key":"9_CR11","first-page":"235","volume-title":"Proceedings of IJCAI 2001","author":"W. Ruml","year":"2001","unstructured":"Ruml, W.: Incomplete tree search using adaptive probing. In: Proceedings of IJCAI 2001, pp. 235\u2013241. IEEE press, Los Alamitos (2001)"},{"issue":"2","key":"9_CR12","doi-asserted-by":"publisher","first-page":"1161","DOI":"10.1109\/TSMCB.2003.821450","volume":"34","author":"C. Blum","year":"2004","unstructured":"Blum, C., Dorigo, M.: The hyper-cube framework for ant colony optimization. IEEE T. Syst. Man Cyb. \u2013 Part B\u00a034(2), 1161\u20131172 (2004)","journal-title":"IEEE T. Syst. Man Cyb. \u2013 Part B"},{"key":"9_CR13","doi-asserted-by":"publisher","first-page":"165","DOI":"10.1287\/ijoc.8.2.165","volume":"8","author":"J.Y. Potvin","year":"1996","unstructured":"Potvin, J.Y., Bengio, S.: The vehicle routing problem with time windows part II: Genetic search. INFORMS J. Comput.\u00a08, 165\u2013172 (1996)","journal-title":"INFORMS J. Comput."}],"container-title":["Lecture Notes in Computer Science","Evolutionary Computation in Combinatorial Optimization"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-01009-5_9","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,3,7]],"date-time":"2019-03-07T10:31:14Z","timestamp":1551954674000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-01009-5_9"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2009]]},"ISBN":["9783642010088","9783642010095"],"references-count":13,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-01009-5_9","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2009]]}}}