{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,27]],"date-time":"2025-03-27T07:21:37Z","timestamp":1743060097530,"version":"3.40.3"},"publisher-location":"Cham","reference-count":19,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783030501426"},{"type":"electronic","value":"9783030501433"}],"license":[{"start":{"date-parts":[[2020,1,1]],"date-time":"2020-01-01T00:00:00Z","timestamp":1577836800000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2020,1,1]],"date-time":"2020-01-01T00:00:00Z","timestamp":1577836800000},"content-version":"vor","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2020]]},"DOI":"10.1007\/978-3-030-50143-3_56","type":"book-chapter","created":{"date-parts":[[2020,6,5]],"date-time":"2020-06-05T21:03:01Z","timestamp":1591390981000},"page":"715-727","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Fuzzy Greedy Randomized Adaptive Search Procedure and Simulation Model to Solve the Team Orienteering Problem with Time Windows"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0000-0003-2272-175X","authenticated-orcid":false,"given":"Airam","family":"Exp\u00f3sito-M\u00e1rquez","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-0846-1675","authenticated-orcid":false,"given":"Christopher","family":"Exp\u00f3sito-Izquierdo","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-9577-6247","authenticated-orcid":false,"given":"Bel\u00e9n","family":"Meli\u00e1n-Batista","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-7675-8577","authenticated-orcid":false,"given":"Jos\u00e9 Marcos","family":"Moreno-Vega","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2020,6,5]]},"reference":[{"key":"56_CR1","doi-asserted-by":"publisher","first-page":"13","DOI":"10.1016\/j.cosrev.2017.03.001","volume":"24","author":"S Abar","year":"2017","unstructured":"Abar, S., Theodoropoulos, G.K., Lemarinier, P., O\u2019Hare, G.M.P.: Agent based modelling and simulation tools: a review of the state-of-art software. Comput. Sci. Rev. 24, 13\u201333 (2017)","journal-title":"Comput. Sci. Rev."},{"issue":"11","key":"56_CR2","first-page":"1134","volume":"10","author":"B Aghezzaf","year":"2015","unstructured":"Aghezzaf, B., El Fahim, H.: Solving the capacitated team orienteering problem with time windows through variable neighborhood search. Int. Rev. Comput. Softw. 10(11), 1134\u20131142 (2015)","journal-title":"Int. Rev. Comput. Softw."},{"issue":"1","key":"56_CR3","doi-asserted-by":"publisher","first-page":"351","DOI":"10.1007\/s10479-015-2019-x","volume":"240","author":"S Amaran","year":"2015","unstructured":"Amaran, S., Sahinidis, N.V., Sharda, B., Bury, S.J.: Simulation optimization: a review of algorithms and applications. Ann. Oper. Res. 240(1), 351\u2013380 (2015). \nhttps:\/\/doi.org\/10.1007\/s10479-015-2019-x","journal-title":"Ann. Oper. Res."},{"issue":"3","key":"56_CR4","doi-asserted-by":"publisher","first-page":"464","DOI":"10.1016\/0377-2217(94)00289-4","volume":"88","author":"IM Chao","year":"1996","unstructured":"Chao, I.M., Golden, B.L., Wasil, E.A.: The team orienteering problem. Eur. J. Oper. Res. 88(3), 464\u2013474 (1996)","journal-title":"Eur. J. Oper. Res."},{"issue":"1","key":"56_CR5","doi-asserted-by":"publisher","first-page":"42","DOI":"10.1057\/jos.2009.25","volume":"4","author":"MM G\u00fcnal","year":"2010","unstructured":"G\u00fcnal, M.M., Pidd, M.: Discrete event simulation for performance modelling in health care: a review of the literature. J. Simul. 4(1), 42\u201351 (2010)","journal-title":"J. Simul."},{"issue":"2","key":"56_CR6","doi-asserted-by":"publisher","first-page":"315","DOI":"10.1016\/j.ejor.2016.04.059","volume":"255","author":"A Gunawan","year":"2016","unstructured":"Gunawan, A., Lau, H.C., Vansteenwegen, P.: Orienteering problem: a survey of recent variants, solution approaches and applications. Eur. J. Oper. Res. 255(2), 315\u2013332 (2016)","journal-title":"Eur. J. Oper. Res."},{"issue":"8","key":"56_CR7","doi-asserted-by":"publisher","first-page":"861","DOI":"10.1057\/s41274-017-0244-1","volume":"68","author":"A Gunawan","year":"2017","unstructured":"Gunawan, A., Lau, H.C., Vansteenwegen, P., Lu, K.: Well-tuned algorithms for the team orienteering problem with time windows. J. Oper. Res. Soc. 68(8), 861\u2013876 (2017)","journal-title":"J. Oper. Res. Soc."},{"issue":"4","key":"56_CR8","doi-asserted-by":"publisher","first-page":"679","DOI":"10.1007\/s40092-019-0315-9","volume":"15","author":"I Hapsari","year":"2019","unstructured":"Hapsari, I., Surjandari, I., Komarudin, K.: Solving multi-objective team orienteering problem with time windows using adjustment iterated local search. J. Ind. Eng. Int. 15(4), 679\u2013693 (2019). \nhttps:\/\/doi.org\/10.1007\/s40092-019-0315-9","journal-title":"J. Ind. Eng. Int."},{"issue":"1","key":"56_CR9","doi-asserted-by":"publisher","first-page":"15","DOI":"10.1016\/j.ejor.2012.01.030","volume":"220","author":"N Labadie","year":"2012","unstructured":"Labadie, N., Mansini, R., Melechovsky, J., Wolfler Calvo, R.: The team orienteering problem with time windows: an LP-based granular variable neighborhood search. Eur. J. Oper. Res. 220(1), 15\u201327 (2012)","journal-title":"Eur. J. Oper. Res."},{"issue":"6","key":"56_CR10","doi-asserted-by":"publisher","first-page":"729","DOI":"10.1007\/s10732-010-9153-z","volume":"17","author":"N Labadie","year":"2011","unstructured":"Labadie, N., Mansini, J., Melechovsky, J., Wolfler Calvo, R.: Hybridized evolutionary local search algorithm for the team orienteering problem with time windows. J. Heuristics 17(6), 729\u2013753 (2011)","journal-title":"J. Heuristics"},{"issue":"1","key":"56_CR11","doi-asserted-by":"publisher","first-page":"94","DOI":"10.1016\/j.ejor.2011.08.024","volume":"217","author":"S-W Lin","year":"2012","unstructured":"Lin, S.-W., Yu, V.F.: A simulated annealing heuristic for the team orienteering problem with time windows. Eur. J. Oper. Res. 217(1), 94\u2013107 (2012)","journal-title":"Eur. J. Oper. Res."},{"key":"56_CR12","doi-asserted-by":"publisher","first-page":"632","DOI":"10.1016\/j.asoc.2015.08.058","volume":"37","author":"S-W Lin","year":"2015","unstructured":"Lin, S.-W., Yu, V.F.: A simulated annealing heuristic for the multiconstraint team orienteering problem with multiple time windows. Appl. Soft Comput. J. 37, 632\u2013642 (2015)","journal-title":"Appl. Soft Comput. J."},{"key":"56_CR13","doi-asserted-by":"publisher","first-page":"195","DOI":"10.1016\/j.cie.2017.10.020","volume":"114","author":"S-W Lin","year":"2017","unstructured":"Lin, S.-W., Yu, V.F.: Solving the team orienteering problem with time windows and mandatory visits by multi-start simulated annealing. Comput. Ind. Eng. 114, 195\u2013205 (2017)","journal-title":"Comput. Ind. Eng."},{"key":"56_CR14","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-4939-6530-4","volume-title":"Optimization by GRASP: Greedy Randomized Adaptive Search Procedures","author":"MGC Resende","year":"2016","unstructured":"Resende, M.G.C., Ribeiro, C.C.: Optimization by GRASP: Greedy Randomized Adaptive Search Procedures. Springer, New York (2016)"},{"key":"56_CR15","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"3","DOI":"10.1007\/978-3-319-68496-3_1","volume-title":"Computational Logistics","author":"V Schmid","year":"2017","unstructured":"Schmid, V., Ehmke, J.F.: An effective large neighborhood search for the team orienteering problem with time windows. In: Bekta\u015f, T., Coniglio, S., Martinez-Sykora, A., Vo\u00df, S., et al. (eds.) ICCL 2017. LNCS, vol. 10572, pp. 3\u201318. Springer, Cham (2017). \nhttps:\/\/doi.org\/10.1007\/978-3-319-68496-3_1"},{"issue":"2","key":"56_CR16","doi-asserted-by":"publisher","first-page":"254","DOI":"10.1287\/opre.35.2.254","volume":"35","author":"MM Solomon","year":"1987","unstructured":"Solomon, M.M.: Algorithms for the vehicle routing and scheduling problems with time window constraints. Oper. Res. 35(2), 254\u2013265 (1987)","journal-title":"Oper. Res."},{"issue":"2","key":"56_CR17","doi-asserted-by":"publisher","first-page":"351","DOI":"10.1016\/j.cor.2009.05.012","volume":"37","author":"F Tricoire","year":"2010","unstructured":"Tricoire, F., Romauch, M., Doerner, K.F., Hartl, R.F.: Heuristics for the multi-period orienteering problem with multiple time windows. Comput. Oper. Res. 37(2), 351\u2013367 (2010)","journal-title":"Comput. Oper. Res."},{"key":"56_CR18","doi-asserted-by":"publisher","first-page":"3281","DOI":"10.1016\/j.cor.2009.03.008","volume":"36","author":"P Vansteenwegen","year":"2009","unstructured":"Vansteenwegen, P., Souffriau, W., Vanden Berghe, G., Van Oudheusden, D.: Iterated local search for the team orienteering problem with time windows. Comput. Oper. Res. 36, 3281\u2013290 (2009)","journal-title":"Comput. Oper. Res."},{"key":"56_CR19","doi-asserted-by":"publisher","first-page":"63403","DOI":"10.1109\/ACCESS.2019.2917089","volume":"7","author":"J Wang","year":"2019","unstructured":"Wang, J., Guo, J., Chen, J., Tian, S., Gu, T.: Uncertain team orienteering problem with time windows based on uncertainty theory. IEEE Access 7, 63403\u201363414 (2019)","journal-title":"IEEE Access"}],"container-title":["Communications in Computer and Information Science","Information Processing and Management of Uncertainty in Knowledge-Based Systems"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-50143-3_56","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,6,5]],"date-time":"2020-06-05T23:39:47Z","timestamp":1591400387000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-030-50143-3_56"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2020]]},"ISBN":["9783030501426","9783030501433"],"references-count":19,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-50143-3_56","relation":{},"ISSN":["1865-0929","1865-0937"],"issn-type":[{"type":"print","value":"1865-0929"},{"type":"electronic","value":"1865-0937"}],"subject":[],"published":{"date-parts":[[2020]]},"assertion":[{"value":"5 June 2020","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"IPMU","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Information Processing and Management of Uncertainty in Knowledge-Based Systems","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Lisbon","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":"2020","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"15 June 2020","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"19 June 2020","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"18","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"ipmu2020","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/ipmu2020.inesc-id.pt\/","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":"213","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":"146","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":"27","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":"69% - 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":"3,2","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":"The IPMU 2020 was held virtually due to the coronavirus 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"}]}}