{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T23:53:05Z","timestamp":1725580385833},"publisher-location":"Berlin, Heidelberg","reference-count":17,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642202810"},{"type":"electronic","value":"9783642202827"}],"license":[{"start":{"date-parts":[[2011,1,1]],"date-time":"2011-01-01T00:00:00Z","timestamp":1293840000000},"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":[[2011]]},"DOI":"10.1007\/978-3-642-20282-7_42","type":"book-chapter","created":{"date-parts":[[2011,4,8]],"date-time":"2011-04-08T19:24:27Z","timestamp":1302290667000},"page":"410-419","source":"Crossref","is-referenced-by-count":2,"title":["Taxi Pick-Ups Route Optimization Using Genetic Algorithms"],"prefix":"10.1007","author":[{"given":"Jorge","family":"Nunes","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Lu\u00eds","family":"Matos","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Ant\u00f3nio","family":"Trigo","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"42_CR1","volume-title":"The Traveling Salesman Problem: A Guided Tour of Combinatorial Optimization","author":"E.L. Lawler","year":"1985","unstructured":"Lawler, E.L., Lenstra, J.K., Rinnooy Khan, A.H.G., Shmoys, D.B.: The Traveling Salesman Problem: A Guided Tour of Combinatorial Optimization. John Wiley & Sons, Chichester (1985) ISBN 0-471-90413-9"},{"key":"42_CR2","volume-title":"The Traveling Salesman Problem and Its Variations","author":"G. Gutin","year":"2006","unstructured":"Gutin, G., Punnen, A.P.: The Traveling Salesman Problem and Its Variations. Springer, Heidelberg (2006) ISBN 0-387-44459-9"},{"key":"42_CR3","unstructured":"Bing Maps Winforms User Control, \n                    \n                      https:\/\/vearthcontrol.svn.codeplex.com\/svn\/"},{"key":"42_CR4","unstructured":"Applegate, D.L., Bixby, R.E., Chvatal, V., Cook, W.J.: The Traveling Salesman Problem A Computational Study"},{"key":"42_CR5","doi-asserted-by":"publisher","first-page":"209","DOI":"10.1016\/j.omega.2004.10.004","volume":"34","author":"T. Bektas","year":"2006","unstructured":"Bektas, T.: The multiple traveling salesman problem: an overview of formulations and solution procedures. Omega\u00a034, 209\u2013219 (2006)","journal-title":"Omega"},{"key":"42_CR6","doi-asserted-by":"crossref","unstructured":"\u00dc\u00e7oluk, G.: Genetic Algorithm Solution of the TSP Avoiding Special Crossover and Mutation. Intelligent Automation and Soft Computing\u00a03(8) (2002)","DOI":"10.1080\/10798587.2000.10642829"},{"key":"42_CR7","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"201","DOI":"10.1007\/3-540-48224-5_17","volume-title":"Automata, Languages and Programming","author":"L. Engebretsen","year":"2001","unstructured":"Engebretsen, L., Karpinski, M.: Approximation hardness of TSP with bounded metrics. In: Yu, Y., Spirakis, P.G., van Leeuwen, J. (eds.) ICALP 2001. LNCS, vol.\u00a02076, pp. 201\u2013212. Springer, Heidelberg (2001)"},{"key":"42_CR8","unstructured":"Al-Dulaimi, B.F., Ali, H.A.: Enhanced Traveling Salesman Problem Solving by Genetic Algorithm Technique (TSPGA). In: Proceeding of the World Academy of Science, Engineering and Technology, pp. 296\u2013302, Rome 25th -27th (2008)"},{"key":"42_CR9","unstructured":"Zhang, L., Yao, M., Zheng, N.: Optimization and Improvement of Genetic Algorithms Solving Traveling Salesman Problem. In: International Conference on Image Analysis and Signal Processing (2009)"},{"issue":"2","key":"42_CR10","first-page":"119","volume":"3","author":"B. Kaur","year":"2010","unstructured":"Kaur, B., Mittal, U.: Optimization of TSP using Genetic Algorithm. Advances in Computational Sciences and Technology\u00a03(2), 119\u2013125 (2010) ISSN 0973-6107","journal-title":"Advances in Computational Sciences and Technology"},{"key":"42_CR11","first-page":"471","volume":"52","author":"O.M. Sallabi","year":"2009","unstructured":"Sallabi, O.M., El-Haddad, Y.: An Improved Genetic Algorithm to Solve the Traveling Salesman Problem. World Academy Of Science, Engineering And Technology\u00a052, 471\u2013474 (2009) ISSN: 1307-6892","journal-title":"World Academy Of Science, Engineering And Technology"},{"key":"42_CR12","volume-title":"Adaptation in Natural and Artificial Systems: An Introductory Analysis with Applications to Biology, Control, and Artificial Intelligence","author":"J. Holland","year":"1975","unstructured":"Holland, J.: Adaptation in Natural and Artificial Systems: An Introductory Analysis with Applications to Biology, Control, and Artificial Intelligence. The University of Michigan Press, Ann Arbor (1975)"},{"key":"42_CR13","doi-asserted-by":"crossref","unstructured":"Berman, P., Karpinski, M.: 8\/7-Approximation Algorithm for (1,2)-TSP. In: Proc. 17th ACM-SIAM SODA, pp. 641\u2013648 (2006)","DOI":"10.1145\/1109557.1109627"},{"key":"42_CR14","first-page":"59","volume-title":"Genetic algorithms and engineering design","author":"M. Gen","year":"1997","unstructured":"Gen, M., Cheng, R.: Genetic algorithms and engineering design, pp. 59\u201364. Wiley-Interscience, Hoboken (1997)"},{"key":"42_CR15","doi-asserted-by":"publisher","first-page":"191","DOI":"10.1016\/S0925-5273(03)00184-1","volume":"88","author":"A.C. Nearchou","year":"2004","unstructured":"Nearchou, A.C.: The effect of various operators on the genetic search for large scheduling problems. Elsevier-Internation Journal of Production Economics\u00a088, 191\u2013203 (2004)","journal-title":"Elsevier-Internation Journal of Production Economics"},{"key":"42_CR16","first-page":"393","volume":"2","author":"G.B. Dantzig","year":"1954","unstructured":"Dantzig, G.B., Fulkerson, R., Johnson, S.M.: Solution of a large-scale traveling salesman problem. Operations Research\u00a02, 393\u2013410 (1954)","journal-title":"Operations Research"},{"key":"42_CR17","unstructured":"Cormen, T.H., Leiserson, C.E., Rivest, R.L., Stein, C.: Introduction to Algorithms, 2nd edn., pp. 1027\u20131033 (Section 35.2: The traveling-salesman problem). MIT Press and McGraw-Hill (2001), ISBN 0-262-03293-7"}],"container-title":["Lecture Notes in Computer Science","Adaptive and Natural Computing Algorithms"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-20282-7_42","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,22]],"date-time":"2019-05-22T21:00:16Z","timestamp":1558558816000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-20282-7_42"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2011]]},"ISBN":["9783642202810","9783642202827"],"references-count":17,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-20282-7_42","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2011]]}}}