{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,28]],"date-time":"2025-03-28T09:31:26Z","timestamp":1743154286406,"version":"3.40.3"},"publisher-location":"Cham","reference-count":15,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783031207877"},{"type":"electronic","value":"9783031207884"}],"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-20788-4_10","type":"book-chapter","created":{"date-parts":[[2023,2,9]],"date-time":"2023-02-09T02:52:16Z","timestamp":1675911136000},"page":"143-161","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["New Models for\u00a0Finding K Short and\u00a0Dissimilar Paths"],"prefix":"10.1007","author":[{"given":"Marta","family":"Pascoal","sequence":"first","affiliation":[]},{"given":"Maria Teresa","family":"Godinho","sequence":"additional","affiliation":[]},{"given":"Ali","family":"Moghanni","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2023,2,9]]},"reference":[{"key":"10_CR1","doi-asserted-by":"publisher","first-page":"232","DOI":"10.1016\/S0377-2217(99)00214-3","volume":"121","author":"V Akg\u00fcn","year":"2000","unstructured":"Akg\u00fcn, V., Erkut, E., Batta, R.: On finding dissimilar paths. Eur. J. Oper. Res. 121, 232\u2013246 (2000)","journal-title":"Eur. J. Oper. Res."},{"issue":"5","key":"10_CR2","doi-asserted-by":"publisher","first-page":"2088","DOI":"10.1109\/TSMCB.2004.834438","volume":"34","author":"S Bandyopadhyay","year":"2004","unstructured":"Bandyopadhyay, S., Pal, S., Aruna, B.: Multiobjective gas, quantitative indices, and pattern classification. IEEE Trans. Syst. Man Cybern. Part B: Cybern. 34(5), 2088\u20132099 (2004)","journal-title":"IEEE Trans. Syst. Man Cybern. Part B: Cybern."},{"issue":"5","key":"10_CR3","doi-asserted-by":"publisher","first-page":"1304","DOI":"10.1016\/j.cor.2005.06.003","volume":"34","author":"P Carotenuto","year":"2007","unstructured":"Carotenuto, P., Giordani, S., Ricciardelli, S.: Finding minimum and equitable risk routes for hazmat shipments. Comput. Oper. Res. 34(5), 1304\u20131327 (2007)","journal-title":"Comput. Oper. Res."},{"key":"10_CR4","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, 182\u2013197 (2002)","journal-title":"IEEE Trans. Evol. Comput."},{"key":"10_CR5","doi-asserted-by":"publisher","first-page":"70","DOI":"10.1016\/j.ejor.2003.10.033","volume":"162","author":"P Dell\u2019Olmo","year":"2005","unstructured":"Dell\u2019Olmo, P., Gentili, M., Scozzari, A.: On finding dissimilar Pareto-optimal paths. Eur. J. Oper. Res. 162, 70\u201382 (2005)","journal-title":"Eur. J. Oper. Res."},{"key":"10_CR6","doi-asserted-by":"publisher","first-page":"625","DOI":"10.1287\/opre.46.5.625","volume":"46","author":"E Erkut","year":"1998","unstructured":"Erkut, E., Verter, V.: Modeling of transport risk for hazardous materials. Oper. Res. 46, 625\u2013642 (1998)","journal-title":"Oper. Res."},{"issue":"1","key":"10_CR7","doi-asserted-by":"publisher","first-page":"130","DOI":"10.1287\/opre.43.1.130","volume":"43","author":"L Gouveia","year":"1995","unstructured":"Gouveia, L.: A 2n constraint formulation for the capacitated minimal spanning tree problem. Oper. Res. 43(1), 130\u2013141 (1995)","journal-title":"Oper. Res."},{"key":"10_CR8","doi-asserted-by":"crossref","unstructured":"Haimes, Y., Lasdon, L., Wismer, D.: On a bicriterion formulation of the problems of integrated system identification and system optimization. IEEE Trans. Syst. Man Cybernet. SMC-1:296\u2013297 (1971)","DOI":"10.1109\/TSMC.1971.4308298"},{"key":"10_CR9","doi-asserted-by":"crossref","unstructured":"Johnson, P.E., Joy, D.S., Clarke, D.: Highway 3.01, an enhancement routing model: program, description, methodology and revised user\u2019s manual. Working Paper, Oak Ridge National Laboratories, Washington, DC (1992)","DOI":"10.2172\/10154166"},{"key":"10_CR10","doi-asserted-by":"publisher","first-page":"298","DOI":"10.1111\/j.1538-4632.1997.tb00966.x","volume":"29","author":"M Kuby","year":"1997","unstructured":"Kuby, M., Zhongyi, X., Xiaodong, X.: A minimax method for finding the $$k$$ best \u201cdifferentiated\u2019\u2019 paths. Geogr. Anal. 29, 298\u2013313 (1997)","journal-title":"Geogr. Anal."},{"key":"10_CR11","doi-asserted-by":"publisher","first-page":"2905","DOI":"10.1016\/j.cor.2009.01.003","volume":"36","author":"R Mart\u00ed","year":"2009","unstructured":"Mart\u00ed, R., Gonz\u00e1lez-Velarde, J., Duarte, A.: Heuristics for the bi-objective path dissimilarity problem. Comput. Oper. Res. 36, 2905\u20132912 (2009)","journal-title":"Comput. Oper. Res."},{"key":"10_CR12","doi-asserted-by":"crossref","unstructured":"Moghanni, A., Pascoal, M., Godinho, M.T.: Finding $$K$$ dissimilar paths: single-commodity and discretized flow formulations. Comput. Oper. Res. 147, 105939 (2022)","DOI":"10.1016\/j.cor.2022.105939"},{"key":"10_CR13","unstructured":"Moghanni, A., Pascoal, M., Godinho, M.T.: Finding dissimilar paths using integer linear formulations. Technical report 21\u201333, Department of Mathematics, University of Coimbra (2021)"},{"key":"10_CR14","doi-asserted-by":"publisher","first-page":"1573","DOI":"10.1111\/itor.13060","volume":"29","author":"A Moghanni","year":"2021","unstructured":"Moghanni, A., Pascoal, M., Godinho, M.T.: Finding $$K$$ shortest and dissimilar paths. Int. Trans. Oper. Res. 29, 1573\u20131601 (2021)","journal-title":"Int. Trans. Oper. Res."},{"key":"10_CR15","doi-asserted-by":"publisher","first-page":"25","DOI":"10.5711\/morj.10.1.25","volume":"10","author":"K Thyagarajan","year":"2005","unstructured":"Thyagarajan, K., Batta, R., Karwan, M., Szczerba, R.: Planning dissimilar paths for military units. Mil. Oper. Res. 10, 25\u201342 (2005)","journal-title":"Mil. Oper. Res."}],"container-title":["Springer Proceedings in Mathematics & Statistics","Operational Research"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-031-20788-4_10","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,2,9]],"date-time":"2023-02-09T02:54:06Z","timestamp":1675911246000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-20788-4_10"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023]]},"ISBN":["9783031207877","9783031207884"],"references-count":15,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-20788-4_10","relation":{},"ISSN":["2194-1009","2194-1017"],"issn-type":[{"type":"print","value":"2194-1009"},{"type":"electronic","value":"2194-1017"}],"subject":[],"published":{"date-parts":[[2023]]},"assertion":[{"value":"9 February 2023","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"IO","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Congress of APDIO, the Portuguese Operational Research Society","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Figueira da Foz","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":"2021","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"7 November 2021","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"8 November 2021","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"apdio2021","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}