{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,28]],"date-time":"2025-03-28T05:35:05Z","timestamp":1743140105781,"version":"3.40.3"},"publisher-location":"Berlin, Heidelberg","reference-count":10,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642551949"},{"type":"electronic","value":"9783642551956"}],"license":[{"start":{"date-parts":[[2014,1,1]],"date-time":"2014-01-01T00:00:00Z","timestamp":1388534400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2014,1,1]],"date-time":"2014-01-01T00:00:00Z","timestamp":1388534400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2014]]},"DOI":"10.1007\/978-3-642-55195-6_19","type":"book-chapter","created":{"date-parts":[[2014,5,7]],"date-time":"2014-05-07T14:55:32Z","timestamp":1399474532000},"page":"207-214","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":3,"title":["Multi-GPU Parallel Memetic Algorithm for Capacitated Vehicle Routing Problem"],"prefix":"10.1007","author":[{"given":"Mieczys\u0142aw","family":"Wodecki","sequence":"first","affiliation":[]},{"given":"Wojciech","family":"Bo\u017cejko","sequence":"additional","affiliation":[]},{"given":"Micha\u0142","family":"Karpi\u0144ski","sequence":"additional","affiliation":[]},{"given":"Maciej","family":"Pacut","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2014,5,8]]},"reference":[{"key":"19_CR1","doi-asserted-by":"publisher","first-page":"25","DOI":"10.1016\/0166-218X(94)90199-6","volume":"49","author":"H Bandelt","year":"1994","unstructured":"Bandelt, H., Crama, Y., Spieksma, F.: Approximation algorithms for multi-dimensional assignment problems with decomposable costs. Discrete Appl. Math. 49, 25\u201340 (1994)","journal-title":"Discrete Appl. Math."},{"key":"19_CR2","doi-asserted-by":"publisher","first-page":"289","DOI":"10.1016\/j.procs.2010.04.032","volume":"1","author":"W Bo\u017cejko","year":"2010","unstructured":"Bo\u017cejko, W., Uchro\u0144ski, M., Wodecki, M.: The new golf neighborhood for the flexible job shop problem, Proceedings of the ICCS 2010. Procedia Computer Science 1, 289\u2013296 (2010)","journal-title":"Procedia Computer Science"},{"issue":"2","key":"19_CR3","doi-asserted-by":"publisher","first-page":"227","DOI":"10.1016\/j.orl.2006.03.002","volume":"35","author":"W Bo\u017cejko","year":"2007","unstructured":"Bo\u017cejko, W., Wodecki, M.: On the theoretical properties of swap multimoves. Oper. Res. Lett. 35(2), 227\u2013231 (2007). (Elsevier Science Ltd.)","journal-title":"Oper. Res. Lett."},{"key":"19_CR4","series-title":"LNCS (LNAI)","first-page":"400","volume-title":"ICAISC 2004","author":"W Bo\u017cejko","year":"2004","unstructured":"Bo\u017cejko, W., Wodecki, M.: Parallel genetic algorithm for minimizing total weighted completion time. In: Rutkowski, L., Siekmann, J., Tadeusiewicz, R., Zadeh, L.A. (eds.) ICAISC 2004. LNCS (LNAI), vol. 3070, pp. 400\u2013405. Springer, Heidelberg (2004)"},{"key":"19_CR5","volume-title":"Introduction to Genetic Algorithms","author":"SN Deepa","year":"2008","unstructured":"Deepa, S.N., Sivanandam, S.N.: Introduction to Genetic Algorithms. Springer, Heidelberg (2008)"},{"issue":"4598","key":"19_CR6","first-page":"671","volume":"220","author":"CD Gelatt","year":"1983","unstructured":"Gelatt, C.D., Kirkpatrick, S., Vecchi, M.P.: Optimization by simulated annealing. Sci. New Ser. 220(4598), 671\u2013680 (1983)","journal-title":"Sci. New Ser."},{"key":"19_CR7","volume-title":"The Vehicle Routing Problem","author":"P Toth","year":"2001","unstructured":"Toth, P., Vigo, D.: The Vehicle Routing Problem. Society for Industrial and Applied Mathematics, Philadelphia (2001)"},{"key":"19_CR8","unstructured":"TSPLIB data sets. http:\/\/comopt.ifi.uni-heidelberg.de\/software\/TSPLIB95\/"},{"key":"19_CR9","doi-asserted-by":"crossref","DOI":"10.7551\/mitpress\/6229.001.0001","volume-title":"The Simple Genetic Algorithm: Foundations and Theory","author":"MD Vose","year":"1999","unstructured":"Vose, M.D.: The Simple Genetic Algorithm: Foundations and Theory. Massachusetts Institute of Technology, Cambridge (1999)"},{"issue":"2","key":"19_CR10","doi-asserted-by":"publisher","first-page":"65","DOI":"10.1007\/BF00175354","volume":"4","author":"D Whitley","year":"1994","unstructured":"Whitley, D.: A genetic algorithm tutorial. Stat. Comput. 4(2), 65\u201385 (1994)","journal-title":"Stat. Comput."}],"container-title":["Lecture Notes in Computer Science","Parallel Processing and Applied Mathematics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-55195-6_19","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,2,7]],"date-time":"2023-02-07T23:03:13Z","timestamp":1675810993000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-642-55195-6_19"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2014]]},"ISBN":["9783642551949","9783642551956"],"references-count":10,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-55195-6_19","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2014]]},"assertion":[{"value":"8 May 2014","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}}]}}