{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,21]],"date-time":"2026-04-21T14:35:36Z","timestamp":1776782136398,"version":"3.51.2"},"publisher-location":"Berlin, Heidelberg","reference-count":24,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783642023187","type":"print"},{"value":"9783642023194","type":"electronic"}],"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-02319-4_81","type":"book-chapter","created":{"date-parts":[[2009,6,20]],"date-time":"2009-06-20T02:34:09Z","timestamp":1245465249000},"page":"670-677","source":"Crossref","is-referenced-by-count":2,"title":["A New Approach to Improve the Ant Colony System Performance: Learning Levels"],"prefix":"10.1007","author":[{"given":"Laura Cruz","family":"R.","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Juan J.","family":"Gonzalez B.","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Jos\u00e9 F. Delgado","family":"Orta","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Barbara A.","family":"Arra\u00f1aga C.","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Hector J.","family":"Fraire H.","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"81_CR1","doi-asserted-by":"crossref","unstructured":"Toth, P., Vigo, D.: The Vehicle Routing Problem. In: Proc. SIAM Monographs on Discrete Mathematics and Applications (2002)","DOI":"10.1137\/1.9780898718515"},{"key":"81_CR2","unstructured":"Bent, R., Van Hentenryck, P.: A Two-Stage Hybrid Local Search for the Vehicle Routing Problem with Time Windows. Transportation Science (2001)"},{"key":"81_CR3","unstructured":"Br\u00e4ysy, O.: A Reactive Variable Neighborhood Search Algorithm for the Vehicle Routing Problem with Time Windows. Tech. report, SINTEF Applied Mathematics, Department of Optimization (2001)"},{"key":"81_CR4","unstructured":"Pisinger, D., Ropke, S.: A General Heuristic for Vehicle Routing Problems. Tech. report, Dept. of Computer Science, Univ. Copenhagen (2005)"},{"key":"81_CR5","unstructured":"Gambardella, L., Taillard, E., Agazzi, G.: MACS-VRPTW: A M\u00faltiple Ant Colony System for Vehicle Routing Problems with Time Windows. Tech. report IDSIA-06-99, IDSIA (1999)"},{"key":"81_CR6","first-page":"297","volume":"37","author":"J. Homberger","year":"1999","unstructured":"Homberger, J., Gehring, H.: Two Evolutionary Metaheuristics for the Vehicle Routing Problems with Time Windows. INFOR\u00a037, 297\u2013318 (1999)","journal-title":"INFOR"},{"key":"81_CR7","unstructured":"Berger, J., Barkaoui, M.: A Memetic Algorithm for the Vehicle Routing Problem with Time Windows. In: The 7th International Command and Control Research and Technology Symposium (2002)"},{"key":"81_CR8","doi-asserted-by":"publisher","first-page":"147","DOI":"10.1007\/BF02430370","volume":"1","author":"Y. Rochat","year":"1995","unstructured":"Rochat, Y., Taillard, E.: Probabilistic Diversification and Intensification in Local Search for Vehicle Routing. Journal of Heuristics\u00a01, 147\u2013167 (1995)","journal-title":"Journal of Heuristics"},{"key":"81_CR9","doi-asserted-by":"publisher","first-page":"170","DOI":"10.1287\/trsc.31.2.170","volume":"31","author":"E. Taillard","year":"1997","unstructured":"Taillard, E., et al.: A Tabu Search Heuristic for the Vehicle Routing Problem with Soft Time Windows. Transportation Science\u00a031, 170\u2013186 (1997)","journal-title":"Transportation Science"},{"key":"81_CR10","unstructured":"Cordeau, F., et al.: The VRP with time windows. Technical Report Cahiers du GERAD G-99-13, Ecole des Hautes \u00b4Etudes Commerciales de Montreal (1999)"},{"key":"81_CR11","doi-asserted-by":"publisher","first-page":"1433","DOI":"10.1057\/jors.1995.204","volume":"46","author":"J.Y. Potvin","year":"1995","unstructured":"Potvin, J.Y., Rousseau, J.M.: An Exchange Heuristic for Routeing Problems with Time Windows. Journal of the Operational Research Society\u00a046, 1433\u20131446 (1995)","journal-title":"Journal of the Operational Research Society"},{"key":"81_CR12","unstructured":"Dorigo, M., Gambardella, L.M.: Ant Colony System: A Cooperative Learning Approach to the Traveling Salesman Problem. Technical Report TR\/IRIDIA\/1996-5, IRIDIA, Universit\u00e9 Libre de Bruxelles (1996)"},{"issue":"1","key":"81_CR13","doi-asserted-by":"publisher","first-page":"80","DOI":"10.1287\/mnsc.6.1.80","volume":"6","author":"G.B. Dantzig","year":"1959","unstructured":"Dantzig, G.B., Ramser, J.H.: The Truck Dispatching Problem. Management Science\u00a06(1), 80\u201391 (1959)","journal-title":"Management Science"},{"key":"81_CR14","unstructured":"Jong, C., Kant, G., Vliet, A.V.: On Finding Minimal Route Duration in the Vehicle Routing Problem with Multiple Time Windows. Tech. report. Dept. of Computer Science, Utrecht Univ. (1996)"},{"key":"81_CR15","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"417","DOI":"10.1007\/3-540-49481-2_30","volume-title":"Principles and Practice of Constraint Programming - CP98","author":"P. Shaw","year":"1998","unstructured":"Shaw, P.: Using Constraint Programming and Local Search Methods to Solve Vehicle Routing Problems. In: Maher, M.J., Puget, J.-F. (eds.) CP 1998. LNCS, vol.\u00a01520, pp. 417\u2013431. Springer, Heidelberg (1998)"},{"key":"81_CR16","unstructured":"Dorronsoro, B.: The VRP Web (2006), \n                      \n                        http:\/\/neo.lcc.uma.es\/radi-aeb\/WebVRP\/"},{"key":"81_CR17","unstructured":"Dorigo, M.: Positive Feedback as a Search Strategy. Technical Report. No. 91-016. Politecnico Di Milano, Italy (1991)"},{"key":"81_CR18","first-page":"134","volume-title":"Proc. First European Conference on Artificial Life","author":"A. Colorni","year":"1992","unstructured":"Colorni, A., Dorigo, M., Matienzo, V.: Distributed Optimization by Ant Colonies. In: Varela, F.J., Bourgine, P. (eds.) Proc. First European Conference on Artificial Life, pp. 134\u2013142. MIT Press, Cambridge (1992)"},{"key":"81_CR19","first-page":"509","volume-title":"Proceedings of PPSN-II, Second International Conference on Parallel Problem Solving from Nature","author":"A. Colorni","year":"1992","unstructured":"Colorni, A., Dorigo, M., Maniezzo, V.: An Investigation of Some Properties of an Ant Algorithm. In: Manner, R., Manderick, B. (eds.) Proceedings of PPSN-II, Second International Conference on Parallel Problem Solving from Nature, pp. 509\u2013520. Elsevier, Amsterdam (1992)"},{"key":"81_CR20","first-page":"252","volume-title":"Proceedings of ML1995, Twelfth International Conference on Machine Learning","author":"L.M. Gambardella","year":"1995","unstructured":"Gambardella, L.M., Dorigo, M.: Ant-Q: A Reinforcement Learning Approach to the Traveling Salesman Problem. In: Prieditis, A., Russell, S. (eds.) Proceedings of ML1995, Twelfth International Conference on Machine Learning, Tahoe City, CA, pp. 252\u2013260. Morgan Kaufmann, San Francisco (1995)"},{"key":"81_CR21","unstructured":"Dorigo, M., Gambardella, L.M.: Ant Colony System: A Cooperative Learning Approach to the Traveling Salesman Problem. Technical Report TR\/IRIDIA\/1996-5, IRIDIA, Universit\u00e9 Libre de Bruxelles (1996)"},{"key":"81_CR22","unstructured":"St\u00fctzle, T., Hoos, H.H.: Improving the Ant System: A detailed report on the MAXMIN Ant System. Technical report AIDA-96-12, FG Intellektik, FB Informatik, TU Darmstadt (1996)"},{"key":"81_CR23","unstructured":"Bullnheimer, B., Hartl, R.F., Strauss, C.: A New Rank Based Version of the Ant System: A Computational Study, Technical report, Institute of Management Science, University of Vienna, Austria (1997)"},{"key":"81_CR24","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"324","DOI":"10.1007\/3-540-44795-4_28","volume-title":"Machine Learning: ECML 2001","author":"C. Mariano","year":"2001","unstructured":"Mariano, C., Morales, E.F.: DQL: A New Updating Strategy for Reinforcement Learning Based on Q-Learning. In: Flach, P.A., De Raedt, L. (eds.) ECML 2001. LNCS, vol.\u00a02167, pp. 324\u2013335. Springer, Heidelberg (2001)"}],"container-title":["Lecture Notes in Computer Science","Hybrid Artificial Intelligence Systems"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-02319-4_81","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,3,8]],"date-time":"2019-03-08T17:23:21Z","timestamp":1552065801000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-02319-4_81"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2009]]},"ISBN":["9783642023187","9783642023194"],"references-count":24,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-02319-4_81","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2009]]}}}