{"id":"https://openalex.org/W3112950039","doi":"https://doi.org/10.1080/23799927.2020.1861660","title":"A new closed\u2013open vehicle routing approach in stochastic environments","display_name":"A new closed\u2013open vehicle routing approach in stochastic environments","publication_year":2020,"publication_date":"2020-12-09","ids":{"openalex":"https://openalex.org/W3112950039","doi":"https://doi.org/10.1080/23799927.2020.1861660","mag":"3112950039"},"language":"en","primary_location":{"id":"doi:10.1080/23799927.2020.1861660","is_oa":false,"landing_page_url":"https://doi.org/10.1080/23799927.2020.1861660","pdf_url":null,"source":{"id":"https://openalex.org/S4210234901","display_name":"International Journal of Computer Mathematics Computer Systems Theory","issn_l":"2379-9927","issn":["2379-9927","2379-9935"],"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"],"host_organization_lineage_names":["Taylor & Francis"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"International Journal of Computer Mathematics: Computer Systems Theory","raw_type":"journal-article"},"type":"article","indexed_in":["crossref"],"open_access":{"is_oa":false,"oa_status":"closed","oa_url":null,"any_repository_has_fulltext":false},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5052617051","display_name":"Arsalan Rahmani","orcid":"https://orcid.org/0000-0003-4865-3169"},"institutions":[{"id":"https://openalex.org/I3124704065","display_name":"University of Kurdistan","ror":"https://ror.org/04k89yk85","country_code":"IR","type":"education","lineage":["https://openalex.org/I3124704065"]}],"countries":["IR"],"is_corresponding":true,"raw_author_name":"Arsalan Rahmani","raw_affiliation_strings":["Department of Mathematics, University of Kurdistan, Sanandaj, Iran"],"affiliations":[{"raw_affiliation_string":"Department of Mathematics, University of Kurdistan, Sanandaj, Iran","institution_ids":["https://openalex.org/I3124704065"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":["https://openalex.org/A5052617051"],"corresponding_institution_ids":["https://openalex.org/I3124704065"],"apc_list":null,"apc_paid":null,"fwci":0.5411,"has_fulltext":false,"cited_by_count":5,"citation_normalized_percentile":{"value":0.75065067,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":90,"max":99},"biblio":{"volume":"6","issue":"2","first_page":"113","last_page":"129"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10567","display_name":"Vehicle Routing Optimization Methods","score":0.9998999834060669,"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.9998999834060669,"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/T11942","display_name":"Transportation and Mobility Innovations","score":0.9977999925613403,"subfield":{"id":"https://openalex.org/subfields/2203","display_name":"Automotive 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/T12176","display_name":"Optimization and Packing Problems","score":0.9951000213623047,"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"}}],"keywords":[{"id":"https://openalex.org/keywords/vehicle-routing-problem","display_name":"Vehicle routing problem","score":0.805063009262085},{"id":"https://openalex.org/keywords/firefly-protocol","display_name":"Firefly protocol","score":0.6664997339248657},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.6453814506530762},{"id":"https://openalex.org/keywords/genetic-algorithm","display_name":"Genetic algorithm","score":0.5159883499145508},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.5146006345748901},{"id":"https://openalex.org/keywords/operations-research","display_name":"Operations research","score":0.47175365686416626},{"id":"https://openalex.org/keywords/firefly-algorithm","display_name":"Firefly algorithm","score":0.4622807800769806},{"id":"https://openalex.org/keywords/routing","display_name":"Routing (electronic design automation)","score":0.43809089064598083},{"id":"https://openalex.org/keywords/computer-network","display_name":"Computer network","score":0.1877599060535431},{"id":"https://openalex.org/keywords/engineering","display_name":"Engineering","score":0.16416937112808228},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.09711810946464539},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.09364286065101624},{"id":"https://openalex.org/keywords/particle-swarm-optimization","display_name":"Particle swarm optimization","score":0.0748203694820404}],"concepts":[{"id":"https://openalex.org/C123784306","wikidata":"https://www.wikidata.org/wiki/Q944041","display_name":"Vehicle routing problem","level":3,"score":0.805063009262085},{"id":"https://openalex.org/C107477482","wikidata":"https://www.wikidata.org/wiki/Q22570039","display_name":"Firefly protocol","level":2,"score":0.6664997339248657},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.6453814506530762},{"id":"https://openalex.org/C8880873","wikidata":"https://www.wikidata.org/wiki/Q187787","display_name":"Genetic algorithm","level":2,"score":0.5159883499145508},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.5146006345748901},{"id":"https://openalex.org/C42475967","wikidata":"https://www.wikidata.org/wiki/Q194292","display_name":"Operations research","level":1,"score":0.47175365686416626},{"id":"https://openalex.org/C154982244","wikidata":"https://www.wikidata.org/wiki/Q5451844","display_name":"Firefly algorithm","level":3,"score":0.4622807800769806},{"id":"https://openalex.org/C74172769","wikidata":"https://www.wikidata.org/wiki/Q1446839","display_name":"Routing (electronic design automation)","level":2,"score":0.43809089064598083},{"id":"https://openalex.org/C31258907","wikidata":"https://www.wikidata.org/wiki/Q1301371","display_name":"Computer network","level":1,"score":0.1877599060535431},{"id":"https://openalex.org/C127413603","wikidata":"https://www.wikidata.org/wiki/Q11023","display_name":"Engineering","level":0,"score":0.16416937112808228},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.09711810946464539},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.09364286065101624},{"id":"https://openalex.org/C85617194","wikidata":"https://www.wikidata.org/wiki/Q2072794","display_name":"Particle swarm optimization","level":2,"score":0.0748203694820404},{"id":"https://openalex.org/C86803240","wikidata":"https://www.wikidata.org/wiki/Q420","display_name":"Biology","level":0,"score":0.0},{"id":"https://openalex.org/C119857082","wikidata":"https://www.wikidata.org/wiki/Q2539","display_name":"Machine learning","level":1,"score":0.0},{"id":"https://openalex.org/C90856448","wikidata":"https://www.wikidata.org/wiki/Q431","display_name":"Zoology","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1080/23799927.2020.1861660","is_oa":false,"landing_page_url":"https://doi.org/10.1080/23799927.2020.1861660","pdf_url":null,"source":{"id":"https://openalex.org/S4210234901","display_name":"International Journal of Computer Mathematics Computer Systems Theory","issn_l":"2379-9927","issn":["2379-9927","2379-9935"],"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"],"host_organization_lineage_names":["Taylor & Francis"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"International Journal of Computer Mathematics: Computer Systems Theory","raw_type":"journal-article"}],"best_oa_location":null,"sustainable_development_goals":[{"display_name":"Industry, innovation and infrastructure","score":0.550000011920929,"id":"https://metadata.un.org/sdg/9"}],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":56,"referenced_works":["https://openalex.org/W143070698","https://openalex.org/W1596914020","https://openalex.org/W1607692352","https://openalex.org/W1968395937","https://openalex.org/W1970462306","https://openalex.org/W1972398006","https://openalex.org/W1978977648","https://openalex.org/W1984197114","https://openalex.org/W1987747072","https://openalex.org/W1989204273","https://openalex.org/W2012259663","https://openalex.org/W2014667413","https://openalex.org/W2023589711","https://openalex.org/W2025391876","https://openalex.org/W2027314829","https://openalex.org/W2027678739","https://openalex.org/W2047270429","https://openalex.org/W2054991304","https://openalex.org/W2056925841","https://openalex.org/W2059876271","https://openalex.org/W2064096196","https://openalex.org/W2066344237","https://openalex.org/W2078491283","https://openalex.org/W2079487902","https://openalex.org/W2084151425","https://openalex.org/W2088252115","https://openalex.org/W2089071435","https://openalex.org/W2095535964","https://openalex.org/W2097487309","https://openalex.org/W2106069847","https://openalex.org/W2109075243","https://openalex.org/W2111563176","https://openalex.org/W2119235896","https://openalex.org/W2119601963","https://openalex.org/W2120182720","https://openalex.org/W2126598061","https://openalex.org/W2127331687","https://openalex.org/W2134767542","https://openalex.org/W2140887900","https://openalex.org/W2146870367","https://openalex.org/W2152212781","https://openalex.org/W2159525014","https://openalex.org/W2284330674","https://openalex.org/W2296679153","https://openalex.org/W2391292628","https://openalex.org/W2573624161","https://openalex.org/W2954693089","https://openalex.org/W2989577406","https://openalex.org/W2999097774","https://openalex.org/W3010138084","https://openalex.org/W3021792046","https://openalex.org/W3125992630","https://openalex.org/W3127555477","https://openalex.org/W4256536881","https://openalex.org/W4285719527","https://openalex.org/W6609448973"],"related_works":["https://openalex.org/W2222304693","https://openalex.org/W2490269892","https://openalex.org/W4200439108","https://openalex.org/W2940563633","https://openalex.org/W2757862489","https://openalex.org/W2411884393","https://openalex.org/W2138097482","https://openalex.org/W2984874436","https://openalex.org/W2912808862","https://openalex.org/W2890875110"],"abstract_inverted_index":{"Collection":[0],"and":[1,15,20,36,117],"distribution":[2],"of":[3,26,45,79,91],"finished":[4],"goods":[5],"through":[6],"cross-docking":[7],"to":[8,86,131],"predetermined":[9],"customers":[10],"or":[11],"retailers":[12],"are":[13],"practical":[14],"challengeable":[16],"mathematical":[17],"modelling,":[18],"optimization,":[19,112],"logistics":[21],"problems.":[22],"Thus,":[23],"appropriate":[24],"management":[25],"the":[27,49,70,77,88,95,124,133],"transportation":[28],"system":[29],"can":[30,127],"help":[31],"companies":[32],"decrease":[33],"their":[34],"costs":[35],"consequently":[37],"earn":[38],"more":[39],"benefits.":[40],"There":[41],"is":[42,60,74,81,85,101,107],"an":[43],"abundance":[44],"modelling":[46],"proposals":[47],"in":[48,69],"literature.":[50],"In":[51],"this":[52],"paper,":[53],"a":[54,103],"multi-cross-docking":[55],"vehicle":[56,65],"routing":[57,66],"problem":[58,67],"(MCVRP)":[59],"combined":[61],"with":[62],"close\u2013open":[63],"mixed":[64],"(COMVRP)":[68],"stochastic":[71],"environment.":[72],"It":[73],"assumed":[75],"that":[76,123],"fleet":[78],"vehicles":[80],"heterogeneous.":[82],"The":[83],"objective":[84],"minimize":[87],"total":[89],"cost":[90],"serving":[92],"customers.":[93],"Since":[94],"travel":[96],"time":[97],"between":[98],"retailer":[99],"nodes":[100],"non-deterministic,":[102],"hybrid":[104],"solution":[105],"methodology":[106],"developed,":[108],"which":[109],"encompasses":[110],"robust":[111],"as":[113,115],"well":[114],"firefly":[116],"genetic":[118],"algorithm.":[119],"Computational":[120],"results":[121],"demonstrate":[122],"proposed":[125,134],"algorithm":[126],"efficiently":[128],"be":[129],"used":[130],"solve":[132],"model.":[135]},"counts_by_year":[{"year":2026,"cited_by_count":1},{"year":2024,"cited_by_count":1},{"year":2022,"cited_by_count":3}],"updated_date":"2026-03-26T15:22:09.906841","created_date":"2025-10-10T00:00:00"}