{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,31]],"date-time":"2025-10-31T08:00:00Z","timestamp":1761897600158,"version":"build-2065373602"},"publisher-location":"Cham","reference-count":17,"publisher":"Springer Nature Switzerland","isbn-type":[{"value":"9783032024350","type":"print"},{"value":"9783032024367","type":"electronic"}],"license":[{"start":{"date-parts":[[2025,11,1]],"date-time":"2025-11-01T00:00:00Z","timestamp":1761955200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2025,11,1]],"date-time":"2025-11-01T00:00:00Z","timestamp":1761955200000},"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":[[2026]]},"DOI":"10.1007\/978-3-032-02436-7_8","type":"book-chapter","created":{"date-parts":[[2025,10,31]],"date-time":"2025-10-31T06:50:02Z","timestamp":1761893402000},"page":"111-125","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["A Parallel Hybrid Genetic Search for\u00a0the\u00a0Capacitated VRP with\u00a0Pickup and\u00a0Delivery"],"prefix":"10.1007","author":[{"given":"Timo","family":"Stadler","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Spyro","family":"Nita","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Jan","family":"D\u00fcnnweber","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2025,11,1]]},"reference":[{"key":"8_CR1","doi-asserted-by":"crossref","unstructured":"Stadler, T., Hofmeister, S., D\u00fcnnweber, J.: A method for the optimized placement of bus stops based on Voronoi diagrams. In: Proceedings of the Annual Hawaii International Conference on System Sciences. Hawaii International Conference on System Sciences (2022)","DOI":"10.24251\/HICSS.2022.694"},{"key":"8_CR2","doi-asserted-by":"crossref","unstructured":"Lana, I., Ser, J.D., Velez, M., Vlahogianni, E.I.: Road traffic forecasting: Recent advances and new challenges, vol.\u00a010, no.\u00a02, pp.\u00a093\u2013109 (2018)","DOI":"10.1109\/MITS.2018.2806634"},{"key":"8_CR3","unstructured":"Turner, A.: Cirrus user guide. https:\/\/cirrus.readthedocs.io\/en\/main\/user-guide\/introduction.html. Accessed 01 Sept 2023"},{"key":"8_CR4","doi-asserted-by":"crossref","unstructured":"Pichpibul, T., Kawtummachai, R.: A heuristic approach based on Clarke-wright algorithm for open vehicle routing problem, vol.\u00a02013, pp.\u00a01\u201311 (2013)","DOI":"10.1155\/2013\/874349"},{"key":"8_CR5","doi-asserted-by":"crossref","unstructured":"Backer, B.D., Furnon, V., Shaw, P., Kilby, P., Prosser, P.: Solving vehicle routing problems using constraint programming and metaheuristics, vol.\u00a06, no.\u00a04, pp.\u00a0501\u2013523 (2000)","DOI":"10.1023\/A:1009621410177"},{"key":"8_CR6","doi-asserted-by":"crossref","unstructured":"Hoffmann, S., Lienhart, R.: OpenMP: Eine Einf\u00fchrung in die parallele Programmierung mit C\/C++. Springer (2008)","DOI":"10.1007\/978-3-540-73123-8_1"},{"key":"8_CR7","doi-asserted-by":"crossref","unstructured":"Kirk, D., et al.: NVIDIA CUDA software and GPU parallel computing architecture. In: ISMM, vol. 7, pp. 103\u2013104 (2007)","DOI":"10.1145\/1296907.1296909"},{"key":"8_CR8","doi-asserted-by":"crossref","unstructured":"Yelmewad, P., Talawar, B.: Parallel version of local search heuristic algorithm to solve capacitated vehicle routing problem, vol.\u00a024, no.\u00a04, pp.\u00a03671\u20133692 (2021)","DOI":"10.1007\/s10586-021-03354-9"},{"key":"8_CR9","doi-asserted-by":"crossref","unstructured":"Vidal, T.: Hybrid genetic search for the CVRP: open-source implementation and swap* neighborhood, vol.\u00a0140, p.\u00a0105643 (2020)","DOI":"10.1016\/j.cor.2021.105643"},{"key":"8_CR10","doi-asserted-by":"crossref","unstructured":"Abdelatti, M., Sodhi, M., Sendag, R.: A multi-GPU parallel genetic algorithm for large-scale vehicle routing problems. In: 2022 IEEE High Performance Extreme Computing Conference (HPEC), pp.\u00a01\u20138, IEEE (2022)","DOI":"10.1109\/HPEC55821.2022.9926363"},{"key":"8_CR11","unstructured":"Santana, I., Lodi, A., Vidal, T.: Neural networks for local search and crossover in vehicle routing: a possible overkill? (2022). https:\/\/arxiv.org\/abs\/2210.12075"},{"key":"8_CR12","doi-asserted-by":"crossref","unstructured":"Homsi, G., Martinelli, R., Vidal, T., Fagerholt, K.: Industrial and tramp ship routing problems: closing the gap for real-scale instances, vol.\u00a0283, pp.\u00a0972\u2013990 (2018)","DOI":"10.1016\/j.ejor.2019.11.068"},{"key":"8_CR13","doi-asserted-by":"crossref","unstructured":"Prins, C.: A simple and effective evolutionary algorithm for the vehicle routing problem, vol.\u00a031, no.\u00a012, pp.\u00a01985\u20132002 (2004)","DOI":"10.1016\/S0305-0548(03)00158-8"},{"key":"8_CR14","unstructured":"Cormen, T.H., Leiserson, C.E., Rivest, R.L., Stein, C.: Introduction to Algorithms. The MIT Press (2022)"},{"key":"8_CR15","doi-asserted-by":"crossref","unstructured":"Saxena, R., Jain, M., Bhadri, S., S.: Parallelizing GA based heuristic approach for TSP over CUDA and OPENMP. In: 2017 International Conference on Advances in Computing, Communications and Informatics (ICACCI). IEEE (2017)","DOI":"10.1109\/ICACCI.2017.8126128"},{"key":"8_CR16","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"44","DOI":"10.1007\/10968987_3","volume-title":"Job Scheduling Strategies for Parallel Processing","author":"AB Yoo","year":"2003","unstructured":"Yoo, A.B., Jette, M.A., Grondona, M.: SLURM: simple Linux utility for resource management. In: Feitelson, D., Rudolph, L., Schwiegelshohn, U. (eds.) JSSPP 2003. LNCS, vol. 2862, pp. 44\u201360. Springer, Heidelberg (2003). https:\/\/doi.org\/10.1007\/10968987_3"},{"key":"8_CR17","unstructured":"Coupey, J.: New features for our route optimization API. https:\/\/blog.verso-optim.com\/2022\/05\/31\/solving-problems-better-and-faster\/. Accessed 01 Sept 2023"}],"container-title":["Lecture Notes in Computer Science","Languages and Compilers for Parallel Computing"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-032-02436-7_8","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,10,31]],"date-time":"2025-10-31T06:50:08Z","timestamp":1761893408000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-032-02436-7_8"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025,11,1]]},"ISBN":["9783032024350","9783032024367"],"references-count":17,"URL":"https:\/\/doi.org\/10.1007\/978-3-032-02436-7_8","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2025,11,1]]},"assertion":[{"value":"1 November 2025","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"LCPC","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Workshop on Languages and Compilers for Parallel Computing","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Lexington, KY","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"USA","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2023","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"11 October 2023","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"13 October 2023","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"36","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"lcpc2023","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"http:\/\/www.lcpcworkshop.org\/LCPC23\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}