{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,26]],"date-time":"2025-03-26T05:56:35Z","timestamp":1742968595158,"version":"3.40.3"},"publisher-location":"Cham","reference-count":23,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783031265037"},{"type":"electronic","value":"9783031265044"}],"license":[{"start":{"date-parts":[[2023,1,1]],"date-time":"2023-01-01T00:00:00Z","timestamp":1672531200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2023,1,1]],"date-time":"2023-01-01T00:00:00Z","timestamp":1672531200000},"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":[[2023]]},"DOI":"10.1007\/978-3-031-26504-4_7","type":"book-chapter","created":{"date-parts":[[2023,2,22]],"date-time":"2023-02-22T08:02:59Z","timestamp":1677052979000},"page":"88-102","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["MineReduce-Based Metaheuristic for\u00a0the\u00a0Minimum Latency Problem"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-7207-1698","authenticated-orcid":false,"given":"Marcelo Rodrigues de Holanda","family":"Maia","sequence":"first","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0002-2424-5382","authenticated-orcid":false,"given":"\u00cdtalo","family":"Santana","sequence":"additional","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0001-8560-5313","authenticated-orcid":false,"given":"Isabel","family":"Rosseti","sequence":"additional","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0002-5320-9209","authenticated-orcid":false,"given":"U\u00e9verton dos Santos","family":"Souza","sequence":"additional","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0003-4039-0915","authenticated-orcid":false,"given":"Alexandre","family":"Plastino","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2023,2,23]]},"reference":[{"key":"7_CR1","doi-asserted-by":"publisher","first-page":"27","DOI":"10.1007\/s12532-012-0047-y","volume":"5","author":"H Abeledo","year":"2013","unstructured":"Abeledo, H., Fukasawa, R., Pessoa, A., Uchoa, E.: The time dependent traveling salesman problem: polyhedra and algorithm. Math. Program. Comput. 5, 27\u201355 (2013). https:\/\/doi.org\/10.1007\/s12532-012-0047-y","journal-title":"Math. Program. Comput."},{"issue":"4","key":"7_CR2","doi-asserted-by":"publisher","first-page":"2257","DOI":"10.1016\/j.apm.2012.05.026","volume":"37","author":"F Angel-Bello","year":"2013","unstructured":"Angel-Bello, F., Alvarez, A., Garc\u00eda, I.: Two improved formulations for the minimum latency problem. Appl. Math. Model. 37(4), 2257\u20132266 (2013). https:\/\/doi.org\/10.1016\/j.apm.2012.05.026","journal-title":"Appl. Math. Model."},{"key":"7_CR3","doi-asserted-by":"publisher","unstructured":"Blum, A., Chalasani, P., Coppersmith, D., Pulleyblank, B., Raghavan, P., Sudan, M.: The minimum latency problem. In: Proceedings of the Twenty-Sixth Annual ACM Symposium on Theory of Computing, STOC 1994, pp. 163\u2013171. Association for Computing Machinery, New York (1994). https:\/\/doi.org\/10.1145\/195058.195125","DOI":"10.1145\/195058.195125"},{"key":"7_CR4","doi-asserted-by":"publisher","first-page":"66","DOI":"10.1016\/j.cor.2018.01.016","volume":"93","author":"T Bulh\u00f5es","year":"2018","unstructured":"Bulh\u00f5es, T., Sadykov, R., Uchoa, E.: A branch-and-price algorithm for the minimum latency problem. Comput. Oper. Res. 93, 66\u201378 (2018). https:\/\/doi.org\/10.1016\/j.cor.2018.01.016","journal-title":"Comput. Oper. Res."},{"issue":"2","key":"7_CR5","doi-asserted-by":"publisher","first-page":"127","DOI":"10.1287\/trsc.1070.0209","volume":"42","author":"AM Campbell","year":"2008","unstructured":"Campbell, A.M., Vandenbussche, D., Hermann, W.: Routing for relief efforts. Transp. Sci. 42(2), 127\u2013145 (2008). https:\/\/doi.org\/10.1287\/trsc.1070.0209","journal-title":"Transp. Sci."},{"issue":"2","key":"7_CR6","doi-asserted-by":"publisher","first-page":"109","DOI":"10.1007\/BF01096763","volume":"6","author":"TA Feo","year":"1995","unstructured":"Feo, T.A., Resende, M.G.C.: Greedy randomized adaptive search procedures. J. Global Optim. 6(2), 109\u2013133 (1995). https:\/\/doi.org\/10.1007\/BF01096763","journal-title":"J. Global Optim."},{"issue":"6","key":"7_CR7","doi-asserted-by":"publisher","first-page":"1055","DOI":"10.1287\/opre.41.6.1055","volume":"41","author":"M Fischetti","year":"1993","unstructured":"Fischetti, M., Laporte, G., Martello, S.: The delivery man problem and cumulative matroids. Oper. Res. 41(6), 1055\u20131064 (1993). https:\/\/doi.org\/10.1287\/opre.41.6.1055","journal-title":"Oper. Res."},{"key":"7_CR8","unstructured":"Grahne, G., Zhu, J.: Efficiently using prefix-trees in mining frequent itemsets. In: Goethals, B., Zaki, M.J. (eds.) Proceedings of the IEEE ICDM Workshop on Frequent Itemset Mining Implementations (2003)"},{"key":"7_CR9","doi-asserted-by":"publisher","unstructured":"Kindervater, G.A.P., Savelsbergh, M.W.P.: Vehicle routing: handling edge exchanges, pp. 337\u2013360. Princeton University Press (2018). https:\/\/doi.org\/10.1515\/9780691187563-013","DOI":"10.1515\/9780691187563-013"},{"key":"7_CR10","doi-asserted-by":"publisher","unstructured":"Louren\u00e7o, H.R., Martin, O.C., St\u00fctzle, T.: Iterated Local Search, pp. 320\u2013353. Springer, Boston (2003). https:\/\/doi.org\/10.1007\/0-306-48056-5_11","DOI":"10.1007\/0-306-48056-5_11"},{"key":"7_CR11","unstructured":"Maia, M.R.H., Plastino, A., Souza, U.S.: MineReduce for the minimum weight vertex cover problem. In: Proceedings of the International Conference on Optimization and Learning (OLA 2020), pp. 11\u201322 (2020)"},{"key":"7_CR12","doi-asserted-by":"publisher","unstructured":"Maia, M.R.H., Plastino, A., Penna, P.H.V.: MineReduce: an approach based on data mining for problem size reduction. Comput. Oper. Res. 122, 104995 (2020). https:\/\/doi.org\/10.1016\/j.cor.2020.104995","DOI":"10.1016\/j.cor.2020.104995"},{"key":"7_CR13","doi-asserted-by":"publisher","unstructured":"Mladenovi\u0107, N., Uro\u0161evi\u0107, D., Goos, P., Hanafi, S.: Variable neighborhood search for the travelling deliveryman problem. 4OR 11, 57\u201373 (2013). https:\/\/doi.org\/10.1007\/s10288-012-0212-1","DOI":"10.1007\/s10288-012-0212-1"},{"key":"7_CR14","doi-asserted-by":"publisher","first-page":"1899","DOI":"10.1007\/s10732-013-9231-0","volume":"20","author":"A Plastino","year":"2014","unstructured":"Plastino, A., Barbalho, H., Santos, L.F.M., Fuchshuber, R., Martins, S.L.: Adaptive and multi-mining versions of the DM-GRASP hybrid metaheuristic. J. Heurist. 20, 1899\u20131911 (2014). https:\/\/doi.org\/10.1007\/s10732-013-9231-0","journal-title":"J. Heurist."},{"issue":"4","key":"7_CR15","doi-asserted-by":"publisher","first-page":"376","DOI":"10.1287\/ijoc.3.4.376","volume":"3","author":"G Reinelt","year":"1991","unstructured":"Reinelt, G.: TSPLIB-a traveling salesman problem library. ORSA J. Comput. 3(4), 376\u2013384 (1991). https:\/\/doi.org\/10.1287\/ijoc.3.4.376","journal-title":"ORSA J. Comput."},{"issue":"3","key":"7_CR16","doi-asserted-by":"publisher","first-page":"413","DOI":"10.1287\/trsc.2013.0474","volume":"48","author":"R Roberti","year":"2014","unstructured":"Roberti, R., Mingozzi, A.: Dynamic ng-path relaxation for the delivery man problem. Transp. Sci. 48(3), 413\u2013424 (2014). https:\/\/doi.org\/10.1287\/trsc.2013.0474","journal-title":"Transp. Sci."},{"key":"7_CR17","doi-asserted-by":"publisher","unstructured":"Salehipour, A., S\u00f6rensen, K., Goos, P., Br\u00e4ysy, O.: Efficient GRASP+VND and GRASP+VNS metaheuristics for the traveling repairman problem. 4OR 9(2), 189\u2013209 (2011). https:\/\/doi.org\/10.1007\/s10288-011-0153-0","DOI":"10.1007\/s10288-011-0153-0"},{"issue":"2","key":"7_CR18","doi-asserted-by":"publisher","first-page":"959","DOI":"10.1111\/itor.12774","volume":"29","author":"I Santana","year":"2022","unstructured":"Santana, I., Plastino, A., Rosseti, I.: Improving a state-of-the-art heuristic for the minimum latency problem with data mining. Int. Trans. Oper. Res. 29(2), 959\u2013986 (2022). https:\/\/doi.org\/10.1111\/itor.12774","journal-title":"Int. Trans. Oper. Res."},{"issue":"3","key":"7_CR19","doi-asserted-by":"publisher","first-page":"513","DOI":"10.1016\/j.ejor.2012.03.044","volume":"221","author":"MM Silva","year":"2012","unstructured":"Silva, M.M., Subramanian, A., Vidal, T., Ochi, L.S.: A simple and effective metaheuristic for the minimum latency problem. Eur. J. Oper. Res. 221(3), 513\u2013520 (2012). https:\/\/doi.org\/10.1016\/j.ejor.2012.03.044","journal-title":"Eur. J. Oper. Res."},{"issue":"11","key":"7_CR20","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."},{"issue":"6","key":"7_CR21","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1145\/3459664","volume":"54","author":"EG Talbi","year":"2021","unstructured":"Talbi, E.G.: Machine learning into metaheuristics: a survey and taxonomy. ACM Comput. Surv. 54(6), 1\u201332 (2021). https:\/\/doi.org\/10.1145\/3459664","journal-title":"ACM Comput. Surv."},{"key":"7_CR22","unstructured":"Vidal, T., Crainic, T.G., Gendreau, M., Prins, C.: A unifying view on timing problems and algorithms. Technical report, CIRRELT (2011)"},{"key":"7_CR23","doi-asserted-by":"publisher","unstructured":"Yang, G.: The complexity of mining maximal frequent itemsets and maximal frequent patterns. In: Proceedings of the Tenth ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, KDD 2004, pp. 344\u2013353. Association for Computing Machinery, New York (2004). https:\/\/doi.org\/10.1145\/1014052.1014091","DOI":"10.1145\/1014052.1014091"}],"container-title":["Lecture Notes in Computer Science","Metaheuristics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-031-26504-4_7","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,7,1]],"date-time":"2023-07-01T08:03:07Z","timestamp":1688198587000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-26504-4_7"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023]]},"ISBN":["9783031265037","9783031265044"],"references-count":23,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-26504-4_7","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2023]]},"assertion":[{"value":"23 February 2023","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"MIC","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Metaheuristics International Conference","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Ortigia-Syracuse","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Italy","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2022","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"11 July 2022","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"14 July 2022","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"14","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"metic2022","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/www.ants-lab.it\/mic2022\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Double-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":"72","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":"48","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":"17","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":"67% - 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","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":"3","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":"No","order":9,"name":"external_reviewers_involved","label":"External Reviewers Involved","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}}]}}