{"id":"https://openalex.org/W4297830358","doi":"https://doi.org/10.1080/00207543.2022.2113928","title":"A two-stage stochastic programming model for collaborative asset protection routing problem enhanced with machine learning: a learning-based matheuristic algorithm","display_name":"A two-stage stochastic programming model for collaborative asset protection routing problem enhanced with machine learning: a learning-based matheuristic algorithm","publication_year":2022,"publication_date":"2022-09-07","ids":{"openalex":"https://openalex.org/W4297830358","doi":"https://doi.org/10.1080/00207543.2022.2113928"},"language":"en","primary_location":{"id":"doi:10.1080/00207543.2022.2113928","is_oa":true,"landing_page_url":"https://doi.org/10.1080/00207543.2022.2113928","pdf_url":null,"source":{"id":"https://openalex.org/S65690446","display_name":"International Journal of Production Research","issn_l":"0020-7543","issn":["0020-7543","1366-588X"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310320547","host_organization_name":"Taylor & Francis","host_organization_lineage":["https://openalex.org/P4310320547","https://openalex.org/P4310320449"],"host_organization_lineage_names":["Taylor & Francis","Informa"],"type":"journal"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"International Journal of Production Research","raw_type":"journal-article"},"type":"article","indexed_in":["crossref"],"open_access":{"is_oa":true,"oa_status":"hybrid","oa_url":"https://doi.org/10.1080/00207543.2022.2113928","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5006624672","display_name":"Erfaneh Nikzad","orcid":"https://orcid.org/0000-0001-9012-7942"},"institutions":[{"id":"https://openalex.org/I119025939","display_name":"Shahed University","ror":"https://ror.org/01e8ff003","country_code":"IR","type":"education","lineage":["https://openalex.org/I119025939"]}],"countries":["IR"],"is_corresponding":false,"raw_author_name":"Erfaneh Nikzad","raw_affiliation_strings":["Industrial Engineering Department, Faculty of Engineering, Shahed University, Tehran, Iran"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Industrial Engineering Department, Faculty of Engineering, Shahed University, Tehran, Iran","institution_ids":["https://openalex.org/I119025939"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5086964010","display_name":"Mahdi Bashiri","orcid":"https://orcid.org/0000-0002-5448-1773"},"institutions":[{"id":"https://openalex.org/I73417466","display_name":"Coventry University","ror":"https://ror.org/01tgmhj36","country_code":"GB","type":"education","lineage":["https://openalex.org/I73417466"]}],"countries":["GB"],"is_corresponding":true,"raw_author_name":"Mahdi Bashiri","raw_affiliation_strings":["Centre for Business in Society, Coventry University, Coventry, UK"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Centre for Business in Society, Coventry University, Coventry, UK","institution_ids":["https://openalex.org/I73417466"]}]}],"institutions":[],"countries_distinct_count":2,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5086964010"],"corresponding_institution_ids":["https://openalex.org/I73417466"],"apc_list":null,"apc_paid":null,"fwci":1.0169,"has_fulltext":true,"cited_by_count":12,"citation_normalized_percentile":{"value":0.78310295,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":96,"max":99},"biblio":{"volume":"61","issue":"1","first_page":"81","last_page":"113"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10567","display_name":"Vehicle Routing Optimization Methods","score":0.9987999796867371,"subfield":{"id":"https://openalex.org/subfields/2209","display_name":"Industrial and Manufacturing Engineering"},"field":{"id":"https://openalex.org/fields/22","display_name":"Engineering"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},"topics":[{"id":"https://openalex.org/T10567","display_name":"Vehicle Routing Optimization Methods","score":0.9987999796867371,"subfield":{"id":"https://openalex.org/subfields/2209","display_name":"Industrial and Manufacturing Engineering"},"field":{"id":"https://openalex.org/fields/22","display_name":"Engineering"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T11502","display_name":"Facility Location and Emergency Management","score":0.9976999759674072,"subfield":{"id":"https://openalex.org/subfields/1407","display_name":"Organizational Behavior and Human Resource Management"},"field":{"id":"https://openalex.org/fields/14","display_name":"Business, Management and Accounting"},"domain":{"id":"https://openalex.org/domains/2","display_name":"Social Sciences"}},{"id":"https://openalex.org/T12709","display_name":"Optimization and Mathematical Programming","score":0.9968000054359436,"subfield":{"id":"https://openalex.org/subfields/2207","display_name":"Control and Systems Engineering"},"field":{"id":"https://openalex.org/fields/22","display_name":"Engineering"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.6143903732299805},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.5565358400344849},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.44880276918411255},{"id":"https://openalex.org/keywords/profit","display_name":"Profit (economics)","score":0.4322829246520996},{"id":"https://openalex.org/keywords/set","display_name":"Set (abstract data type)","score":0.42599019408226013},{"id":"https://openalex.org/keywords/heuristic","display_name":"Heuristic","score":0.418866366147995},{"id":"https://openalex.org/keywords/asset","display_name":"Asset (computer security)","score":0.41661977767944336},{"id":"https://openalex.org/keywords/artificial-intelligence","display_name":"Artificial intelligence","score":0.25270703434944153},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.19443517923355103}],"concepts":[{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.6143903732299805},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.5565358400344849},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.44880276918411255},{"id":"https://openalex.org/C181622380","wikidata":"https://www.wikidata.org/wiki/Q26911","display_name":"Profit (economics)","level":2,"score":0.4322829246520996},{"id":"https://openalex.org/C177264268","wikidata":"https://www.wikidata.org/wiki/Q1514741","display_name":"Set (abstract data type)","level":2,"score":0.42599019408226013},{"id":"https://openalex.org/C173801870","wikidata":"https://www.wikidata.org/wiki/Q201413","display_name":"Heuristic","level":2,"score":0.418866366147995},{"id":"https://openalex.org/C76178495","wikidata":"https://www.wikidata.org/wiki/Q4808784","display_name":"Asset (computer security)","level":2,"score":0.41661977767944336},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.25270703434944153},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.19443517923355103},{"id":"https://openalex.org/C175444787","wikidata":"https://www.wikidata.org/wiki/Q39072","display_name":"Microeconomics","level":1,"score":0.0},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.0},{"id":"https://openalex.org/C162324750","wikidata":"https://www.wikidata.org/wiki/Q8134","display_name":"Economics","level":0,"score":0.0},{"id":"https://openalex.org/C38652104","wikidata":"https://www.wikidata.org/wiki/Q3510521","display_name":"Computer security","level":1,"score":0.0}],"mesh":[],"locations_count":4,"locations":[{"id":"doi:10.1080/00207543.2022.2113928","is_oa":true,"landing_page_url":"https://doi.org/10.1080/00207543.2022.2113928","pdf_url":null,"source":{"id":"https://openalex.org/S65690446","display_name":"International Journal of Production Research","issn_l":"0020-7543","issn":["0020-7543","1366-588X"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310320547","host_organization_name":"Taylor & Francis","host_organization_lineage":["https://openalex.org/P4310320547","https://openalex.org/P4310320449"],"host_organization_lineage_names":["Taylor & Francis","Informa"],"type":"journal"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"International Journal of Production Research","raw_type":"journal-article"},{"id":"pmh:oai:pure.atira.dk:publications/e31ac92a-27bb-4786-a01a-b3581e7f38c2","is_oa":true,"landing_page_url":"http://www.scopus.com/inward/record.url?scp=85137788993&partnerID=8YFLogxK","pdf_url":"https://pure.coventry.ac.uk/ws/files/56444403/Binder1.pdf","source":{"id":"https://openalex.org/S4306402411","display_name":"Pure (Coventry University)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I73417466","host_organization_name":"Coventry University","host_organization_lineage":["https://openalex.org/I73417466"],"host_organization_lineage_names":[],"type":"repository"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"Nikzad, E & Bashiri, M 2023, 'A two-stage stochastic programming model for collaborative asset protection routing problem enhanced with machine learning : a learning-based matheuristic algorithm', International Journal of Production Research, vol. 61, no. 1, pp. 81-113. https://doi.org/10.1080/00207543.2022.2113928","raw_type":"info:eu-repo/semantics/article"},{"id":"pmh:oai:RePEc:taf:tprsxx:v:61:y:2023:i:1:p:81-113","is_oa":false,"landing_page_url":"http://hdl.handle.net/10.1080/00207543.2022.2113928","pdf_url":null,"source":{"id":"https://openalex.org/S4306401271","display_name":"RePEc: Research Papers in Economics","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I77793887","host_organization_name":"Federal Reserve Bank of St. Louis","host_organization_lineage":["https://openalex.org/I77793887"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"article"},{"id":"pmh:oai:pure.atira.dk:openaire/e31ac92a-27bb-4786-a01a-b3581e7f38c2","is_oa":true,"landing_page_url":"https://pureportal.coventry.ac.uk/en/publications/e31ac92a-27bb-4786-a01a-b3581e7f38c2","pdf_url":null,"source":{"id":"https://openalex.org/S4306402411","display_name":"Pure (Coventry University)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I73417466","host_organization_name":"Coventry University","host_organization_lineage":["https://openalex.org/I73417466"],"host_organization_lineage_names":[],"type":"repository"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"Nikzad, E & Bashiri, M 2023, 'A two-stage stochastic programming model for collaborative asset protection routing problem enhanced with machine learning : a learning-based matheuristic algorithm', International Journal of Production Research, vol. 61, no. 1, pp. 81-113. https://doi.org/10.1080/00207543.2022.2113928","raw_type":"info:eu-repo/semantics/article"}],"best_oa_location":{"id":"doi:10.1080/00207543.2022.2113928","is_oa":true,"landing_page_url":"https://doi.org/10.1080/00207543.2022.2113928","pdf_url":null,"source":{"id":"https://openalex.org/S65690446","display_name":"International Journal of Production Research","issn_l":"0020-7543","issn":["0020-7543","1366-588X"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310320547","host_organization_name":"Taylor & Francis","host_organization_lineage":["https://openalex.org/P4310320547","https://openalex.org/P4310320449"],"host_organization_lineage_names":["Taylor & Francis","Informa"],"type":"journal"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"International Journal of Production Research","raw_type":"journal-article"},"sustainable_development_goals":[],"awards":[],"funders":[{"id":"https://openalex.org/F4320320290","display_name":"University of Oxford","ror":"https://ror.org/052gg0110"}],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":90,"referenced_works":["https://openalex.org/W83290899","https://openalex.org/W1963988630","https://openalex.org/W1981379040","https://openalex.org/W1996723851","https://openalex.org/W2001851698","https://openalex.org/W2011268617","https://openalex.org/W2014979043","https://openalex.org/W2034717186","https://openalex.org/W2056956492","https://openalex.org/W2058995871","https://openalex.org/W2067503240","https://openalex.org/W2068092414","https://openalex.org/W2088273530","https://openalex.org/W2089207315","https://openalex.org/W2114345197","https://openalex.org/W2116047927","https://openalex.org/W2128632608","https://openalex.org/W2146004814","https://openalex.org/W2149723649","https://openalex.org/W2297239076","https://openalex.org/W2342596926","https://openalex.org/W2346699423","https://openalex.org/W2463987837","https://openalex.org/W2515503592","https://openalex.org/W2559748088","https://openalex.org/W2583437448","https://openalex.org/W2726929936","https://openalex.org/W2739716913","https://openalex.org/W2740070378","https://openalex.org/W2767166014","https://openalex.org/W2767339607","https://openalex.org/W2775797427","https://openalex.org/W2783585128","https://openalex.org/W2792554292","https://openalex.org/W2799819576","https://openalex.org/W2804168480","https://openalex.org/W2804375760","https://openalex.org/W2886851374","https://openalex.org/W2886977397","https://openalex.org/W2891590798","https://openalex.org/W2892315936","https://openalex.org/W2895861596","https://openalex.org/W2900906469","https://openalex.org/W2901273912","https://openalex.org/W2904815033","https://openalex.org/W2910844905","https://openalex.org/W2913649977","https://openalex.org/W2915337192","https://openalex.org/W2921939944","https://openalex.org/W2950767639","https://openalex.org/W2953226774","https://openalex.org/W2954992390","https://openalex.org/W2957740360","https://openalex.org/W2970726627","https://openalex.org/W2975809272","https://openalex.org/W2975987111","https://openalex.org/W2976235687","https://openalex.org/W2976624096","https://openalex.org/W2981989034","https://openalex.org/W2987122341","https://openalex.org/W3000289153","https://openalex.org/W3000588793","https://openalex.org/W3002239905","https://openalex.org/W3003100621","https://openalex.org/W3005026185","https://openalex.org/W3005684715","https://openalex.org/W3008008351","https://openalex.org/W3008420692","https://openalex.org/W3011578045","https://openalex.org/W3014585394","https://openalex.org/W3016473191","https://openalex.org/W3016841462","https://openalex.org/W3016903886","https://openalex.org/W3024806877","https://openalex.org/W3032698666","https://openalex.org/W3034529496","https://openalex.org/W3036501114","https://openalex.org/W3036721652","https://openalex.org/W3037334891","https://openalex.org/W3037368075","https://openalex.org/W3047908586","https://openalex.org/W3060466954","https://openalex.org/W3083469263","https://openalex.org/W3090402613","https://openalex.org/W3111817041","https://openalex.org/W3159199892","https://openalex.org/W4238821275","https://openalex.org/W4248841288","https://openalex.org/W4388297464","https://openalex.org/W6607671349"],"related_works":["https://openalex.org/W2370815826","https://openalex.org/W2433057514","https://openalex.org/W2373436826","https://openalex.org/W2167961874","https://openalex.org/W2363214567","https://openalex.org/W2379002089","https://openalex.org/W2361168482","https://openalex.org/W2383852320","https://openalex.org/W2079317909","https://openalex.org/W262326206"],"abstract_inverted_index":{"In":[0,120,161],"this":[1,23,110,162],"paper,":[2],"a":[3,17,32,66,117,124,133,137],"two-stage":[4],"stochastic":[5,57],"mathematical":[6,139,181],"model":[7,140],"is":[8,25,129,141,159],"developed":[9],"for":[10,62,100],"an":[11,46,179],"asset":[12],"protection":[13],"routing":[14,164],"problem":[15,93,115],"under":[16],"wildfire.":[18,33],"The":[19,92,183],"main":[20],"aim":[21],"of":[22,31,51,72,126,189],"study":[24,111],"to":[26,82,87,112,143],"reduce":[27],"the":[28,70,73,114,121,145,169,187,194],"negative":[29],"impact":[30,68],"Some":[34],"parameters,":[35],"such":[36],"as":[37,56],"travel":[38],"and":[39,48],"service":[40],"times,":[41],"obtaining":[42],"profit":[43],"by":[44,97,177],"protecting":[45],"asset,":[47],"upper":[49],"bounds":[50],"time":[52],"windows,":[53],"are":[54,80,107,166,175],"considered":[55],"parameters.":[58],"Generating":[59],"proper":[60],"scenarios":[61,85],"uncertain":[63],"parameters":[64],"has":[65],"large":[67,101,155],"on":[69,132,153],"accuracy":[71],"obtained":[74],"solutions.":[75],"Therefore,":[76],"artificial":[77],"neural":[78],"networks":[79],"employed":[81],"extract":[83],"possible":[84],"according":[86],"previous":[88],"actual":[89],"wildfire":[90],"events.":[91],"cannot":[94],"be":[95],"solved":[96],"exact":[98],"solvers":[99],"instances,":[102],"so":[103],"two":[104],"matheuristic":[105,150],"algorithms":[106],"proposed":[108,191],"in":[109,116],"solve":[113],"reasonable":[118],"time.":[119],"first":[122,195],"algorithm,":[123,163],"set":[125],"feasible":[127],"routes":[128],"generated":[130],"based":[131,152],"heuristic":[134],"approach,":[135],"then":[136],"route-based":[138],"used":[142],"obtain":[144],"final":[146],"solution.":[147],"Also,":[148],"another":[149],"algorithm":[151,171,196],"adaptive":[154],"neighbourhood":[156],"search":[157],"(ALNS)":[158],"proposed.":[160],"decisions":[165,174],"determined":[167],"using":[168],"ALNS":[170],"while":[172],"other":[173],"achieved":[176],"solving":[178],"intermediate":[180],"model.":[182],"numerical":[184],"analysis":[185],"confirms":[186],"efficiency":[188],"both":[190],"algorithms;":[192],"however,":[193],"performs":[197],"more":[198],"efficiently.":[199]},"counts_by_year":[{"year":2026,"cited_by_count":3},{"year":2025,"cited_by_count":3},{"year":2024,"cited_by_count":3},{"year":2023,"cited_by_count":3}],"updated_date":"2026-08-18T07:49:30.821534","created_date":"2025-10-10T00:00:00"}