{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,7]],"date-time":"2025-10-07T14:41:07Z","timestamp":1759848067749,"version":"3.40.3"},"publisher-location":"Cham","reference-count":35,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783030504359"},{"type":"electronic","value":"9783030504366"}],"license":[{"start":{"date-parts":[[2020,1,1]],"date-time":"2020-01-01T00:00:00Z","timestamp":1577836800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2020,1,1]],"date-time":"2020-01-01T00:00:00Z","timestamp":1577836800000},"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":[[2020]]},"DOI":"10.1007\/978-3-030-50436-6_28","type":"book-chapter","created":{"date-parts":[[2020,6,19]],"date-time":"2020-06-19T19:03:44Z","timestamp":1592593424000},"page":"382-396","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":3,"title":["A Comparison of Multiple Objective Algorithms in the Context of a 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":[[2020,6,15]]},"reference":[{"issue":"3","key":"28_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). https:\/\/doi.org\/10.1016\/j.parco.2003.12.001","journal-title":"Parallel Comput."},{"issue":"3","key":"28_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."},{"key":"28_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"31","DOI":"10.1007\/978-3-319-54157-0_3","volume-title":"Evolutionary Multi-Criterion Optimization","author":"LCT Bezerra","year":"2017","unstructured":"Bezerra, L.C.T., L\u00f3pez-Ib\u00e1\u00f1ez, M., St\u00fctzle, T.: An empirical assessment of the properties of inverted generational distance on multi- and many-objective optimization. In: Trautmann, H., et al. (eds.) EMO 2017. LNCS, vol. 10173, pp. 31\u201345. Springer, Cham (2017). https:\/\/doi.org\/10.1007\/978-3-319-54157-0_3"},{"issue":"4","key":"28_CR4","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":"28_CR5","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). https:\/\/doi.org\/10.1287\/opre.1060.0283","journal-title":"Oper. Res."},{"issue":"1","key":"28_CR6","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). https:\/\/doi.org\/10.1007\/s10479-007-0170-8","journal-title":"Ann. Oper. Res."},{"issue":"2","key":"28_CR7","doi-asserted-by":"publisher","first-page":"89","DOI":"10.1007\/s10288-002-0009-8","volume":"1","author":"JF Cordeau","year":"2003","unstructured":"Cordeau, J.F., Laporte, G.: The dial-a-ride problem (DARP): variants, modeling issues and algorithms. Q. J. Belg. Fr. Ital. Oper. Res. Soc. 1(2), 89\u2013101 (2003). https:\/\/doi.org\/10.1007\/s10288-002-0009-8","journal-title":"Q. J. Belg. Fr. Ital. Oper. Res. Soc."},{"key":"28_CR8","unstructured":"Corne, D.W., Jerram, N.R., Knowles, J.D., Oates, M.J.: PESA-II: Region-based selection in evolutionary multiobjective optimization. In: Proceedings of the Genetic and Evolutionary Computation Conference GECCO 2001, pp. 283\u2013290. Morgan Kaufmann Publishers (2001)"},{"key":"28_CR9","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"},{"issue":"4","key":"28_CR10","doi-asserted-by":"publisher","first-page":"577","DOI":"10.1109\/TEVC.2013.2281535","volume":"18","author":"K Deb","year":"2014","unstructured":"Deb, K., Jain, H.: An evolutionary many-objective optimization algorithm using reference-point-based nondominated sorting approach, part I: solving problems with box constraints. IEEE Trans. Evol. Comput. 18(4), 577\u2013601 (2014). https:\/\/doi.org\/10.1109\/TEVC.2013.2281535","journal-title":"IEEE Trans. Evol. Comput."},{"issue":"2","key":"28_CR11","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). https:\/\/doi.org\/10.1109\/4235.996017","journal-title":"IEEE Trans. Evol. Comput."},{"key":"28_CR12","volume-title":"Multi-objective Optimization Using Evolutionary Algorithms","author":"K Deb","year":"2001","unstructured":"Deb, K.: Multi-objective Optimization Using Evolutionary Algorithms. Wiley, Hoboken (2001)"},{"key":"28_CR13","doi-asserted-by":"crossref","unstructured":"Deb, K., Mohan, M., Mishra, S.: A fast multi-objective evolutionary algorithm for finding well-spread pareto-optimal solutions. Technical report (2003). http:\/\/www.iitk.ac.in\/kangal\/papers\/k2003003.pdf","DOI":"10.1007\/3-540-36970-8_16"},{"key":"28_CR14","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, New York (2010). https:\/\/doi.org\/10.1007\/978-1-4419-1665-5"},{"key":"28_CR15","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"55","DOI":"10.1007\/978-3-030-22750-0_5","volume-title":"Computational Science \u2013 ICCS 2019","author":"PMM Guerreiro","year":"2019","unstructured":"Guerreiro, P.M.M., Cardoso, P.J.S., Fernandes, H.C.L.: Applying NSGA-II to a multiple objective dial a ride problem. In: Rodrigues, J.M.F., et al. (eds.) ICCS 2019. LNCS, vol. 11540, pp. 55\u201369. Springer, Cham (2019). https:\/\/doi.org\/10.1007\/978-3-030-22750-0_5"},{"issue":"12","key":"28_CR16","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 Papers Line 49(12), 1198\u20131203 (2016). https:\/\/doi.org\/10.1016\/j.ifacol.2016.07.671","journal-title":"IFAC Papers Line"},{"key":"28_CR17","unstructured":"Hadka, D.: Platypus - Multiobjective Optimization in Python (2015). https:\/\/platypus.readthedocs.io. Accessed 08 Feb 2019"},{"key":"28_CR18","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. Transp. Res. Part B Methodol. 111, 395\u2013421 (2018). https:\/\/doi.org\/10.1016\/j.trb.2018.02.001","journal-title":"Transp. Res. Part B Methodol."},{"key":"28_CR19","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)","DOI":"10.1109\/HIS.2013.6920454"},{"key":"28_CR20","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"386","DOI":"10.1007\/978-3-540-31880-4_27","volume-title":"Evolutionary Multi-Criterion Optimization","author":"JB Kollat","year":"2005","unstructured":"Kollat, J.B., Reed, P.M.: The value of online adaptive search: a performance comparison of NSGAII, $$\\epsilon $$-NSGAII and $$\\epsilon $$-MOEA. In: Coello Coello, C.A., Hern\u00e1ndez Aguirre, A., Zitzler, E. (eds.) EMO 2005. LNCS, vol. 3410, pp. 386\u2013398. Springer, Heidelberg (2005). https:\/\/doi.org\/10.1007\/978-3-540-31880-4_27"},{"issue":"2","key":"28_CR21","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."},{"key":"28_CR22","doi-asserted-by":"publisher","unstructured":"Laumanns, M., Thiele, L., Deb, K., Zitzler, E.: Combining convergence and diversity in evolutionary multiobjective optimization. Evol. Comput. 10(3), 263\u2013282 (2002). https:\/\/doi.org\/10.1162\/106365602760234108, http:\/\/www.mitpressjournals.org\/doi\/10.1162\/106365602760234108","DOI":"10.1162\/106365602760234108"},{"key":"28_CR23","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, New York, NY, USA, pp. 513\u2013516. ACM (2011). https:\/\/doi.org\/10.1145\/2093973.2094062","DOI":"10.1145\/2093973.2094062"},{"key":"28_CR24","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":"28_CR25","unstructured":"OpenStreetMap contributors: Planet dump (2017). https:\/\/planet.osm.org, https:\/\/www.openstreetmap.org"},{"issue":"1","key":"28_CR26","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. J. f\u00fcr Betriebswirtschaft 58(1), 21\u201351 (2008). https:\/\/doi.org\/10.1007\/s11301-008-0033-7","journal-title":"J. f\u00fcr Betriebswirtschaft"},{"issue":"2","key":"28_CR27","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). https:\/\/doi.org\/10.1287\/trsc.2014.0524","journal-title":"Transp. Sci."},{"key":"28_CR28","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","DOI":"10.1109\/CLEI.2015.7360024"},{"issue":"4","key":"28_CR29","doi-asserted-by":"publisher","first-page":"258","DOI":"10.1002\/net.20177","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. Netw. Int. J. 49(4), 258\u2013272 (2007). https:\/\/doi.org\/10.1002\/net.20177","journal-title":"Netw. Int. J."},{"issue":"11","key":"28_CR30","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."},{"key":"28_CR31","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":"01","key":"28_CR32","doi-asserted-by":"publisher","first-page":"1083","DOI":"10.21917\/ijsc.2015.0150","volume":"06","author":"A Umbarkar","year":"2015","unstructured":"Umbarkar, A., Sheth, P.: Crossover operators in genetic algorithms: a review. ICTACT J. Soft Comput. 06(01), 1083\u20131092 (2015). https:\/\/doi.org\/10.21917\/ijsc.2015.0150","journal-title":"ICTACT J. Soft Comput."},{"issue":"2","key":"28_CR33","doi-asserted-by":"publisher","first-page":"117","DOI":"10.1109\/TEVC.2003.810758","volume":"7","author":"E Zitzler","year":"2003","unstructured":"Zitzler, E., Thiele, L., Laumanns, M., Fonseca, C.M., da Fonseca, V.G.: Performance assessment of multiobjective optimizers: an analysis and review. IEEE Trans. Evol. Comput. 7(2), 117\u2013132 (2003). https:\/\/doi.org\/10.1109\/TEVC.2003.810758","journal-title":"IEEE Trans. Evol. Comput."},{"key":"28_CR34","doi-asserted-by":"publisher","unstructured":"Zitzler, E., Laumanns, M., Thiele, L.: SPEA2: Improving the strength pareto evolutionary algorithm (2001). https:\/\/doi.org\/10.3929\/ETHZ-A-004284029, http:\/\/hdl.handle.net\/20.500.11850\/145755","DOI":"10.3929\/ETHZ-A-004284029"},{"issue":"4","key":"28_CR35","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). https:\/\/doi.org\/10.1109\/4235.797969","journal-title":"IEEE Trans. Evol. Comput."}],"container-title":["Lecture Notes in Computer Science","Computational Science \u2013 ICCS 2020"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-50436-6_28","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,6,18]],"date-time":"2024-06-18T23:05:04Z","timestamp":1718751904000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-030-50436-6_28"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2020]]},"ISBN":["9783030504359","9783030504366"],"references-count":35,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-50436-6_28","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2020]]},"assertion":[{"value":"15 June 2020","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":"Amsterdam","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"The Netherlands","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2020","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"3 June 2020","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"5 June 2020","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"20","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"iccs-computsci2020","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/www.iccs-meeting.org\/iccs2020\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Single-blind","order":1,"name":"type","label":"Type","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"EasyChair","order":2,"name":"conference_management_system","label":"Conference Management System","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"230","order":3,"name":"number_of_submissions_sent_for_review","label":"Number of Submissions Sent for Review","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"98","order":4,"name":"number_of_full_papers_accepted","label":"Number of Full Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"3","order":5,"name":"number_of_short_papers_accepted","label":"Number of Short Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"43% - The value is computed by the equation \"Number of Full Papers Accepted \/ Number of Submissions Sent for Review * 100\" and then rounded to a whole number.","order":6,"name":"acceptance_rate_of_full_papers","label":"Acceptance Rate of Full Papers","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"2.5","order":7,"name":"average_number_of_reviews_per_paper","label":"Average Number of Reviews per Paper","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"4","order":8,"name":"average_number_of_papers_per_reviewer","label":"Average Number of Papers per Reviewer","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"Yes","order":9,"name":"external_reviewers_involved","label":"External Reviewers Involved","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"248 workshop papers were selected from 489 submissions to the thematic tracks. The conference was canceled due to the COVID-19 pandemic.","order":10,"name":"additional_info_on_review_process","label":"Additional Info on Review Process","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"This content has been made available to all.","name":"free","label":"Free to read"}]}}