{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,9]],"date-time":"2024-09-09T07:56:32Z","timestamp":1725868592168},"publisher-location":"Cham","reference-count":23,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319491080"},{"type":"electronic","value":"9783319491097"}],"license":[{"start":{"date-parts":[[2016,10,22]],"date-time":"2016-10-22T00:00:00Z","timestamp":1477094400000},"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":[[2017]]},"DOI":"10.1007\/978-3-319-49109-7_14","type":"book-chapter","created":{"date-parts":[[2016,10,21]],"date-time":"2016-10-21T09:03:15Z","timestamp":1477040595000},"page":"145-156","source":"Crossref","is-referenced-by-count":3,"title":["Temporally Adaptive Co-operation Schemes"],"prefix":"10.1007","author":[{"given":"Jakub","family":"Nalepa","sequence":"first","affiliation":[]},{"given":"Miroslaw","family":"Blocho","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2016,10,22]]},"reference":[{"key":"14_CR1","doi-asserted-by":"crossref","unstructured":"R. Baldacci, A. Mingozzi, and R. Roberti. New route relaxation and pricing strategies for the vehicle routing problem. Operations Research, 59(5):1269\u20131283, 2011","DOI":"10.1287\/opre.1110.0975"},{"key":"14_CR2","doi-asserted-by":"crossref","unstructured":"R. Baldacci, A. Mingozzi, and R. Roberti. Recent exact algorithms for solving the vehicle routing problem under capacity and time window constraints. European J. of Op. Research, 218(1):1 \u2013 6, 2012","DOI":"10.1016\/j.ejor.2011.07.037"},{"key":"14_CR3","doi-asserted-by":"crossref","unstructured":"R. Banos, J. Ortega, C. Gil, A. L. M\u00e1rquez, and F. de Toro. A hybrid meta-heuristic for multi-objective vehicle routing problems with time windows. Computers & Industrial Engineering, 65(2):286 \u2013 296, 2013","DOI":"10.1016\/j.cie.2013.01.007"},{"key":"14_CR4","doi-asserted-by":"crossref","unstructured":"M. Blocho and J. Nalepa. A parallel algorithm for minimizing the fleet size in the pickup and delivery problem with time windows. In Proc. EuroMPI, pages 15:1\u201315:2, New York, USA, 2015. ACM","DOI":"10.1145\/2802658.2802673"},{"key":"14_CR5","doi-asserted-by":"crossref","unstructured":"O. Br\u00e4ysy and M. Gendreau. Vehicle routing problem with time windows, part II: Metaheuristics. Transportation Science, 39(1):119\u2013139, 2005","DOI":"10.1287\/trsc.1030.0057"},{"key":"14_CR6","unstructured":"J. Caceres-Cruz, P. Arias, D. Guimarans, D. Riera, and A. A. Juan. Rich vehicle routing problem: Survey. ACM Computing Surveys, 47(2):32:1\u201332:28, 2014"},{"key":"14_CR7","doi-asserted-by":"crossref","unstructured":"D. Coltorti and A. E. Rizzoli. Ant colony optimization for real-world vehicle routing problems. SIGEVOlution, 2(2):2\u20139, 2007","DOI":"10.1145\/1329465.1329466"},{"key":"14_CR8","doi-asserted-by":"crossref","unstructured":"N. A. El-Sherbeny. Vehicle routing with time windows: An overview of exact, heuristic and metaheuristic methods. J. of King Saud University, 22(3):123 \u2013 131, 2010","DOI":"10.1016\/j.jksus.2010.03.002"},{"key":"14_CR9","doi-asserted-by":"crossref","unstructured":"W. Hu, H. Liang, C. Peng, B. Du, and Q. Hu. A hybrid chaos-particle swarm optimization algorithm for the vehicle routing problem with time window. Entropy, 15(4):1247\u20131270, 2013","DOI":"10.3390\/e15041247"},{"key":"14_CR10","doi-asserted-by":"crossref","unstructured":"B. Jarboui, A. Sifaleras, A. Rebai, M. Bruglieri, F. Pezzella, O. Pisacane, and S. Suraci. A variable neighborhood search branching for the electric vehicle routing problem with time windows. Electronic Notes in Discrete Mathematics, 47:221 \u2013 228, 2015","DOI":"10.1016\/j.endm.2014.11.029"},{"key":"14_CR11","doi-asserted-by":"crossref","unstructured":"Y. Nagata and O. Br\u00e4ysy. A powerful route minimization heuristic for the vehicle routing problem with time windows. Operations Res. Letters, 37(5):333 \u2013 338, 2009","DOI":"10.1016\/j.orl.2009.04.006"},{"key":"14_CR12","doi-asserted-by":"crossref","unstructured":"Y. Nagata, O. Br\u00e4ysy, and W. Dullaert. A penalty-based edge assembly memetic algorithm for the vehicle routing problem with time windows. Computers & Operations Research, 37(4):724 \u2013 737, 2010","DOI":"10.1016\/j.cor.2009.06.022"},{"key":"14_CR13","doi-asserted-by":"crossref","unstructured":"Y. Nagata and S. Kobayashi. A Memetic Algorithm for Pickup and Delivery with Time Windows Using Selective Exchange Crossover, pages 536\u2013545. Springer, 2010","DOI":"10.1007\/978-3-642-15844-5_54"},{"key":"14_CR14","doi-asserted-by":"crossref","unstructured":"J. Nalepa and M. Blocho. Co-operation in the parallel memetic algorithm. International Journal of Parallel Programming, 43(5):812\u2013839, 2015","DOI":"10.1007\/s10766-014-0343-4"},{"key":"14_CR15","doi-asserted-by":"crossref","unstructured":"J. Nalepa and M. Blocho. A parallel algorithm with the search space partition for the pickup and delivery with time windows. In Proc. 3PGCIC, pages 92\u201399, 2015","DOI":"10.1109\/3PGCIC.2015.12"},{"key":"14_CR16","doi-asserted-by":"crossref","unstructured":"J. Nalepa and M. Blocho. Adaptive memetic algorithm for minimizing distance in the vehicle routing problem with time windows. Soft Computing, 20(6):2309\u20132327, 2016","DOI":"10.1007\/s00500-015-1642-4"},{"key":"14_CR17","doi-asserted-by":"crossref","unstructured":"J. Nalepa and M. Kawulok. Adaptive memetic algorithm enhanced with data geometry analysis to select training data for SVMs. Neurocomputing, 185:113 \u2013 132, 2016","DOI":"10.1016\/j.neucom.2015.12.046"},{"key":"14_CR18","doi-asserted-by":"crossref","unstructured":"S. U. Ngueveu, C. Prins, and R. W. Calvo. An effective memetic algorithm for the cumulative capacitated vehicle routing problem. Computers & Operations Research, 37(11):1877 \u2013 1885, 2010. Metaheuristics for Logistics and Vehicle Routing","DOI":"10.1016\/j.cor.2009.06.014"},{"key":"14_CR19","doi-asserted-by":"crossref","unstructured":"E. Osaba, X.-S. Yang, F. Diaz, E. Onieva, A. D. Masegosa, and A. Perallos. A discrete firefly algorithm to solve a rich vehicle routing problem modelling a newspaper distribution system with recycling policy. Soft Computing, pages 1\u201314, 2016","DOI":"10.1007\/s00500-016-2114-1"},{"key":"14_CR20","doi-asserted-by":"crossref","unstructured":"K.-W. Pang. An adaptive parallel route construction heuristic for the vehicle routing problem with time windows. Exp. Sys. with App., 38(9):11939 \u2013 11946, 2011","DOI":"10.1016\/j.eswa.2011.03.088"},{"key":"14_CR21","doi-asserted-by":"crossref","unstructured":"P. Repoussis, C. Tarantilis, and G. Ioannou. Arc-guided evolutionary algorithm for vehicle routing problem with time windows. Evol. Comp., IEEE Trans. on, 13(3):624\u2013647, 2009","DOI":"10.1109\/TEVC.2008.2011740"},{"key":"14_CR22","doi-asserted-by":"crossref","unstructured":"T. Vidal, T. G. Crainic, M. Gendreau, and C. Prins. A hybrid genetic algorithm with adaptive diversity management for a large class of vehicle routing problems with time-windows. Computers & Operations Research, 40(1):475 \u2013 489, 2013","DOI":"10.1016\/j.cor.2012.07.018"},{"key":"14_CR23","doi-asserted-by":"crossref","unstructured":"S. Wrona and M. Pawelczyk. Controllability-oriented placement of actuators for active noise-vibration control of rectangular plates using a memetic algorithm. Archives of Acoustics, 38(4):529\u2013536, 2013","DOI":"10.2478\/aoa-2013-0062"}],"container-title":["Lecture Notes on Data Engineering and Communications Technologies","Advances on P2P, Parallel, Grid, Cloud and Internet Computing"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-49109-7_14","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,9,14]],"date-time":"2019-09-14T22:00:01Z","timestamp":1568498401000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-319-49109-7_14"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2016,10,22]]},"ISBN":["9783319491080","9783319491097"],"references-count":23,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-49109-7_14","relation":{},"ISSN":["2367-4512","2367-4520"],"issn-type":[{"type":"print","value":"2367-4512"},{"type":"electronic","value":"2367-4520"}],"subject":[],"published":{"date-parts":[[2016,10,22]]}}}