{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,26]],"date-time":"2025-03-26T01:42:46Z","timestamp":1742953366323,"version":"3.40.3"},"publisher-location":"Cham","reference-count":30,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783030227494"},{"type":"electronic","value":"9783030227500"}],"license":[{"start":{"date-parts":[[2019,1,1]],"date-time":"2019-01-01T00:00:00Z","timestamp":1546300800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2019,1,1]],"date-time":"2019-01-01T00:00:00Z","timestamp":1546300800000},"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":[[2019]]},"DOI":"10.1007\/978-3-030-22750-0_5","type":"book-chapter","created":{"date-parts":[[2019,6,7]],"date-time":"2019-06-07T18:11:13Z","timestamp":1559931073000},"page":"55-69","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":2,"title":["Applying NSGA-II to a Multiple Objective Dial a Ride Problem"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0000-0001-7272-2000","authenticated-orcid":false,"given":"Pedro M. M.","family":"Guerreiro","sequence":"first","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0003-4803-7964","authenticated-orcid":false,"given":"Pedro J. S.","family":"Cardoso","sequence":"additional","affiliation":[]},{"given":"Hort\u00eansio C. L.","family":"Fernandes","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2019,6,8]]},"reference":[{"issue":"3","key":"5_CR1","doi-asserted-by":"publisher","first-page":"377","DOI":"10.1016\/j.parco.2003.12.001","volume":"30","author":"A Attanasio","year":"2004","unstructured":"Attanasio, A., Cordeau, J.F., Ghiani, G., Laporte, G.: Parallel tabu search heuristics for the dynamic multi-vehicle dial-a-ride problem. Parallel Comput. 30(3), 377\u2013387 (2004)","journal-title":"Parallel Comput."},{"issue":"3","key":"5_CR2","doi-asserted-by":"publisher","first-page":"343","DOI":"10.1287\/ijoc.1110.0454","volume":"24","author":"G Berbeglia","year":"2012","unstructured":"Berbeglia, G., Cordeau, J.F., Laporte, G.: A hybrid tabu search and constraint programming algorithm for the dynamic dial-a-ride problem. INFORMS J. Comput. 24(3), 343\u2013355 (2012). https:\/\/doi.org\/10.1287\/ijoc.1110.0454","journal-title":"INFORMS J. Comput."},{"issue":"4","key":"5_CR3","doi-asserted-by":"publisher","first-page":"1247","DOI":"10.1016\/j.asoc.2011.12.014","volume":"12","author":"R Chevrier","year":"2012","unstructured":"Chevrier, R., Liefooghe, A., Jourdan, L., Dhaenens, C.: Solving a dial-a-ride problem with a hybrid evolutionary multi-objective approach: Application to demand responsive transport. Appl. Soft Comput. 12(4), 1247\u20131258 (2012). https:\/\/doi.org\/10.1016\/j.asoc.2011.12.014","journal-title":"Appl. Soft Comput."},{"issue":"3","key":"5_CR4","doi-asserted-by":"publisher","first-page":"573","DOI":"10.1287\/opre.1060.0283","volume":"54","author":"JF Cordeau","year":"2006","unstructured":"Cordeau, J.F.: A branch-and-cut algorithm for the dial-a-ride problem. Oper. Res. 54(3), 573\u2013586 (2006)","journal-title":"Oper. Res."},{"issue":"1","key":"5_CR5","doi-asserted-by":"publisher","first-page":"29","DOI":"10.1007\/s10479-007-0170-8","volume":"153","author":"JF Cordeau","year":"2007","unstructured":"Cordeau, J.F., Laporte, G.: The dial-a-ride problem: models and algorithms. Ann. Oper. Res. 153(1), 29\u201346 (2007)","journal-title":"Ann. Oper. Res."},{"key":"5_CR6","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"498","DOI":"10.1007\/978-3-540-73053-8_50","volume-title":"Bio-inspired Modeling of Cognitive Tasks","author":"C Cubillos","year":"2007","unstructured":"Cubillos, C., Rodriguez, N., Crawford, B.: A study on genetic algorithms for the DARP problem. In: Mira, J., \u00c1lvarez, J.R. (eds.) IWINAC 2007. LNCS, vol. 4527, pp. 498\u2013507. Springer, Heidelberg (2007). https:\/\/doi.org\/10.1007\/978-3-540-73053-8_50"},{"key":"5_CR7","volume-title":"Multi-objective Optimization Using Evolutionary Algorithms","author":"K Deb","year":"2001","unstructured":"Deb, K.: Multi-objective Optimization Using Evolutionary Algorithms. Wiley, Chichester (2001)"},{"issue":"2","key":"5_CR8","doi-asserted-by":"publisher","first-page":"182","DOI":"10.1109\/4235.996017","volume":"6","author":"K Deb","year":"2002","unstructured":"Deb, K., Pratap, A., Agarwal, S., Meyarivan, T.: A fast and elitist multiobjective genetic algorithm: NSGA-II. IEEE Trans. Evol. Comput. 6(2), 182\u2013197 (2002)","journal-title":"IEEE Trans. Evol. Comput."},{"key":"5_CR9","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-4419-1665-5","volume-title":"Handbook of Metaheuristics","author":"M Gendreau","year":"2010","unstructured":"Gendreau, M., Potvin, J.Y.: Handbook of Metaheuristics, vol. 2. Springer, Boston (2010). https:\/\/doi.org\/10.1007\/978-1-4419-1665-5"},{"issue":"12","key":"5_CR10","doi-asserted-by":"publisher","first-page":"1198","DOI":"10.1016\/j.ifacol.2016.07.671","volume":"49","author":"SA Haddadene","year":"2016","unstructured":"Haddadene, S.A., Labadie, N., Prodhon, C.: NSGA-II enhanced with a local search for the vehicle routing problem with time windows and synchronization constraints. IFAC-PapersOnLine 49(12), 1198\u20131203 (2016)","journal-title":"IFAC-PapersOnLine"},{"unstructured":"Hadka, D.: Platypus - Multiobjective Optimization in Python (2015). https:\/\/platypus.readthedocs.io. Accessed 08 Feb 2019","key":"5_CR11"},{"key":"5_CR12","doi-asserted-by":"publisher","first-page":"395","DOI":"10.1016\/j.trb.2018.02.001","volume":"111","author":"SC Ho","year":"2018","unstructured":"Ho, S.C., Szeto, W., Kuo, Y.H., Leung, J.M., Petering, M., Tou, T.W.: A survey of dial-a-ride problems: literature review and recent developments. Trans. Res. Part B Methodol. 111, 395\u2013421 (2018). https:\/\/doi.org\/10.1016\/j.trb.2018.02.001","journal-title":"Trans. Res. Part B Methodol."},{"key":"5_CR13","volume-title":"Adaptation in Natural and Artificial Systems","author":"J Holland","year":"1975","unstructured":"Holland, J.: Adaptation in Natural and Artificial Systems. University of Michigan Press, Ann Arbor (1975)"},{"doi-asserted-by":"crossref","unstructured":"Issaoui, B., Khelifi, L., Zidi, I., Zidi, K., Gh\u00e9dira, K.: A contribution to the resolution of stochastic dynamic dial a ride problem with NSGA-II. In: 13th International Conference on Hybrid Intelligent Systems (HIS 2013), pp. 54\u201359 (2013)","key":"5_CR14","DOI":"10.1109\/HIS.2013.6920454"},{"issue":"2","key":"5_CR15","doi-asserted-by":"publisher","first-page":"469","DOI":"10.3934\/jimo.2012.8.469","volume":"8","author":"M Lai","year":"2012","unstructured":"Lai, M., Tong, X.: A metaheuristic method for vehicle routing problem based on improved ant colony optimization and tabu search. J. Ind. Manage. Optim. 8(2), 469\u2013484 (2012). https:\/\/doi.org\/10.3934\/jimo.2012.8.469","journal-title":"J. Ind. Manage. Optim."},{"doi-asserted-by":"publisher","unstructured":"Luxen, D., Vetter, C.: Real-time routing with openstreetmap data. In: Proceedings of the 19th ACM SIGSPATIAL International Conference on Advances in Geographic Information Systems, GIS 2011, pp. 513\u2013516. ACM, New York (2011). https:\/\/doi.org\/10.1145\/2093973.2094062","key":"5_CR16","DOI":"10.1145\/2093973.2094062"},{"issue":"3","key":"5_CR17","doi-asserted-by":"publisher","first-page":"840","DOI":"10.1016\/j.ejor.2016.04.016","volume":"254","author":"D M\u00e4nnel","year":"2016","unstructured":"M\u00e4nnel, D., Bortfeldt, A.: A hybrid algorithm for the vehicle routing problem with pickup and delivery and three-dimensional loading constraints. Eur. J. Oper. Res. 254(3), 840\u2013858 (2016)","journal-title":"Eur. J. Oper. Res."},{"key":"5_CR18","volume-title":"Nonlinear Multiobjective Optimization","author":"K Miettinen","year":"1999","unstructured":"Miettinen, K.: Nonlinear Multiobjective Optimization. Kluwer Academic Publishers, Boston (1999)"},{"unstructured":"Morais, A.C., Torres, L., Dias, T.G., Cardoso, P.J.S., Fernandes, H.: A combined data mining and tabu search approach for single customer dial-a-ride problem. In: 7th International Conference on Metaheuristics and Nature Inspired Computing, Marrakech, Morocco, pp. 121\u2013123, October 2018","key":"5_CR19"},{"key":"5_CR20","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"885","DOI":"10.1007\/978-3-540-31880-4_61","volume-title":"Evolutionary Multi-Criterion Optimization","author":"T Murata","year":"2005","unstructured":"Murata, T., Itai, R.: Multi-objective vehicle routing problems using two-fold EMO algorithms to enhance solution similarity on non-dominated solutions. In: Coello Coello, C.A., Hern\u00e1ndez Aguirre, A., Zitzler, E. (eds.) EMO 2005. LNCS, vol. 3410, pp. 885\u2013896. Springer, Heidelberg (2005). https:\/\/doi.org\/10.1007\/978-3-540-31880-4_61"},{"unstructured":"OpenStreetMap contributors: Planet dump (2017). https:\/\/planet.osm.org. https:\/\/www.openstreetmap.org","key":"5_CR21"},{"issue":"1","key":"5_CR22","doi-asserted-by":"publisher","first-page":"21","DOI":"10.1007\/s11301-008-0033-7","volume":"58","author":"SN Parragh","year":"2008","unstructured":"Parragh, S.N., Doerner, K.F., Hartl, R.F.: A survey on pickup and delivery problems. Journal f\u00fcr Betriebswirtschaft 58(1), 21\u201351 (2008)","journal-title":"Journal f\u00fcr Betriebswirtschaft"},{"issue":"2","key":"5_CR23","doi-asserted-by":"publisher","first-page":"254","DOI":"10.1287\/trsc.2014.0524","volume":"49","author":"Y Qu","year":"2014","unstructured":"Qu, Y., Bard, J.F.: A branch-and-price-and-cut algorithm for heterogeneous pickup and delivery problems with configurable vehicle capacity. Transp. Sci. 49(2), 254\u2013270 (2014)","journal-title":"Transp. Sci."},{"doi-asserted-by":"publisher","unstructured":"Riquelme, N., L\u00fccken, C.V., Baran, B.: Performance metrics in multi-objective optimization. In: 2015 Latin American Computing Conference (CLEI), pp. 1\u201311, October 2015. https:\/\/doi.org\/10.1109\/CLEI.2015.7360024","key":"5_CR24","DOI":"10.1109\/CLEI.2015.7360024"},{"issue":"4","key":"5_CR25","first-page":"258","volume":"49","author":"S Ropke","year":"2007","unstructured":"Ropke, S., Cordeau, J.F., Laporte, G.: Models and branch-and-cut algorithms for pickup and delivery problems with time windows. Networks Int. J. 49(4), 258\u2013272 (2007)","journal-title":"Networks Int. J."},{"key":"5_CR26","doi-asserted-by":"publisher","first-page":"315","DOI":"10.1016\/j.cor.2013.05.011","volume":"52","author":"S Salhi","year":"2014","unstructured":"Salhi, S., Imran, A., Wassan, N.A.: The multi-depot vehicle routing problem with heterogeneous vehicle fleet: formulation and a variable neighborhood search implementation. Comput. Oper. Res. 52, 315\u2013325 (2014)","journal-title":"Comput. Oper. Res."},{"issue":"11","key":"5_CR27","doi-asserted-by":"publisher","first-page":"1899","DOI":"10.1016\/j.cor.2009.10.011","volume":"37","author":"A Subramanian","year":"2010","unstructured":"Subramanian, A., Drummond, L., Bentes, C., Ochi, L., Farias, R.: A parallel heuristic for the vehicle routing problem with simultaneous pickup and delivery. Comput. Oper. Res. 37(11), 1899\u20131911 (2010). https:\/\/doi.org\/10.1016\/j.cor.2009.10.011","journal-title":"Comput. Oper. Res."},{"doi-asserted-by":"crossref","unstructured":"Toth, P., Vigo, D.: Vehicle Routing: Problems, Methods, and Applications. SIAM (2014)","key":"5_CR28","DOI":"10.1137\/1.9781611973594"},{"key":"5_CR29","series-title":"Advances in Intelligent Systems and Computing","doi-asserted-by":"publisher","first-page":"325","DOI":"10.1007\/978-3-319-66939-7_28","volume-title":"Advances in Computational Intelligence Systems","author":"T Tripathy","year":"2018","unstructured":"Tripathy, T., Nagavarapu, S.C., Azizian, K., Ramasamy Pandi, R., Dauwels, J.: Solving dial-a-ride problems using multiple ant colony system with fleet size minimisation. In: Chao, F., Schockaert, S., Zhang, Q. (eds.) UKCI 2017. AISC, vol. 650, pp. 325\u2013336. Springer, Cham (2018). https:\/\/doi.org\/10.1007\/978-3-319-66939-7_28"},{"issue":"4","key":"5_CR30","doi-asserted-by":"publisher","first-page":"257","DOI":"10.1109\/4235.797969","volume":"3","author":"E Zitzler","year":"1999","unstructured":"Zitzler, E., Thiele, L.: Multiobjective evolutionary algorithms: a comparative case study and the strength Pareto approach. IEEE Trans. Evol. Comput. 3(4), 257\u2013271 (1999)","journal-title":"IEEE Trans. Evol. Comput."}],"container-title":["Lecture Notes in Computer Science","Computational Science \u2013 ICCS 2019"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-22750-0_5","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,6,7]],"date-time":"2023-06-07T03:38:09Z","timestamp":1686109089000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-030-22750-0_5"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019]]},"ISBN":["9783030227494","9783030227500"],"references-count":30,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-22750-0_5","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2019]]},"assertion":[{"value":"8 June 2019","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"ICCS","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Computational Science","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Faro","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Portugal","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2019","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"12 June 2019","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"14 June 2019","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"19","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"iccs-computsci2019","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/www.iccs-meeting.org\/iccs2019\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"This content has been made available to all.","name":"free","label":"Free to read"}]}}