{"id":"https://openalex.org/W4280588714","doi":"https://doi.org/10.1108/ijicc-01-2022-0021","title":"Solving vehicle routing problem with time windows using metaheuristic approaches","display_name":"Solving vehicle routing problem with time windows using metaheuristic approaches","publication_year":2022,"publication_date":"2022-05-13","ids":{"openalex":"https://openalex.org/W4280588714","doi":"https://doi.org/10.1108/ijicc-01-2022-0021"},"language":"en","primary_location":{"id":"doi:10.1108/ijicc-01-2022-0021","is_oa":false,"landing_page_url":"https://doi.org/10.1108/ijicc-01-2022-0021","pdf_url":null,"source":{"id":"https://openalex.org/S124503262","display_name":"International Journal of Intelligent Computing and Cybernetics","issn_l":"1756-378X","issn":["1756-378X","1756-3798"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319811","host_organization_name":"Emerald Publishing Limited","host_organization_lineage":["https://openalex.org/P4310319811"],"host_organization_lineage_names":["Emerald Publishing Limited"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"International Journal of Intelligent Computing and Cybernetics","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/A5063345977","display_name":"Zeynep Aydinalp Birecik","orcid":"https://orcid.org/0000-0002-7410-2638"},"institutions":[{"id":"https://openalex.org/I4101805","display_name":"Y\u0131ld\u0131z Technical University","ror":"https://ror.org/0547yzj13","country_code":"TR","type":"education","lineage":["https://openalex.org/I4101805"]}],"countries":["TR"],"is_corresponding":false,"raw_author_name":"Zeynep Ayd\u0131nalp","raw_affiliation_strings":["Y\u0131ld\u0131z Technical University, Istanbul, Turkey"],"raw_orcid":"https://orcid.org/0000-0002-7410-2638","affiliations":[{"raw_affiliation_string":"Y\u0131ld\u0131z Technical University, Istanbul, Turkey","institution_ids":["https://openalex.org/I4101805"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5080666088","display_name":"Do\u011fan \u00d6zgen","orcid":null},"institutions":[{"id":"https://openalex.org/I4101805","display_name":"Y\u0131ld\u0131z Technical University","ror":"https://ror.org/0547yzj13","country_code":"TR","type":"education","lineage":["https://openalex.org/I4101805"]}],"countries":["TR"],"is_corresponding":false,"raw_author_name":"Do\u011fan \u00d6zgen","raw_affiliation_strings":["Y\u0131ld\u0131z Technical University, Istanbul, Turkey"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Y\u0131ld\u0131z Technical University, Istanbul, Turkey","institution_ids":["https://openalex.org/I4101805"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":[],"corresponding_institution_ids":["https://openalex.org/I4101805"],"apc_list":null,"apc_paid":null,"fwci":1.4908,"has_fulltext":false,"cited_by_count":14,"citation_normalized_percentile":{"value":0.83982714,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":90,"max":99},"biblio":{"volume":"16","issue":"1","first_page":"121","last_page":"138"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10567","display_name":"Vehicle Routing Optimization Methods","score":0.9997000098228455,"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.9997000098228455,"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/T12709","display_name":"Optimization and Mathematical Programming","score":0.9882000088691711,"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"}},{"id":"https://openalex.org/T12306","display_name":"Urban and Freight Transport Logistics","score":0.9857000112533569,"subfield":{"id":"https://openalex.org/subfields/2215","display_name":"Building and Construction"},"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.8423991799354553},{"id":"https://openalex.org/keywords/metaheuristic","display_name":"Metaheuristic","score":0.8315980434417725},{"id":"https://openalex.org/keywords/simulated-annealing","display_name":"Simulated annealing","score":0.7913504838943481},{"id":"https://openalex.org/keywords/solver","display_name":"Solver","score":0.7602795362472534},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.7323434352874756},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.6661393046379089},{"id":"https://openalex.org/keywords/integer-programming","display_name":"Integer programming","score":0.41626033186912537},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.37244167923927307},{"id":"https://openalex.org/keywords/routing","display_name":"Routing (electronic design automation)","score":0.3388332724571228},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.230832040309906}],"concepts":[{"id":"https://openalex.org/C123784306","wikidata":"https://www.wikidata.org/wiki/Q944041","display_name":"Vehicle routing problem","level":3,"score":0.8423991799354553},{"id":"https://openalex.org/C109718341","wikidata":"https://www.wikidata.org/wiki/Q1385229","display_name":"Metaheuristic","level":2,"score":0.8315980434417725},{"id":"https://openalex.org/C126980161","wikidata":"https://www.wikidata.org/wiki/Q863783","display_name":"Simulated annealing","level":2,"score":0.7913504838943481},{"id":"https://openalex.org/C2778770139","wikidata":"https://www.wikidata.org/wiki/Q1966904","display_name":"Solver","level":2,"score":0.7602795362472534},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.7323434352874756},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.6661393046379089},{"id":"https://openalex.org/C56086750","wikidata":"https://www.wikidata.org/wiki/Q6042592","display_name":"Integer programming","level":2,"score":0.41626033186912537},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.37244167923927307},{"id":"https://openalex.org/C74172769","wikidata":"https://www.wikidata.org/wiki/Q1446839","display_name":"Routing (electronic design automation)","level":2,"score":0.3388332724571228},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.230832040309906},{"id":"https://openalex.org/C31258907","wikidata":"https://www.wikidata.org/wiki/Q1301371","display_name":"Computer network","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1108/ijicc-01-2022-0021","is_oa":false,"landing_page_url":"https://doi.org/10.1108/ijicc-01-2022-0021","pdf_url":null,"source":{"id":"https://openalex.org/S124503262","display_name":"International Journal of Intelligent Computing and Cybernetics","issn_l":"1756-378X","issn":["1756-378X","1756-3798"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319811","host_organization_name":"Emerald Publishing Limited","host_organization_lineage":["https://openalex.org/P4310319811"],"host_organization_lineage_names":["Emerald Publishing Limited"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"International Journal of Intelligent Computing and Cybernetics","raw_type":"journal-article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":55,"referenced_works":["https://openalex.org/W804744637","https://openalex.org/W1525353024","https://openalex.org/W1694068690","https://openalex.org/W1966884570","https://openalex.org/W1983168083","https://openalex.org/W1990135083","https://openalex.org/W1992793771","https://openalex.org/W1999274012","https://openalex.org/W2010418932","https://openalex.org/W2015785429","https://openalex.org/W2024060531","https://openalex.org/W2025988413","https://openalex.org/W2043459322","https://openalex.org/W2048088042","https://openalex.org/W2052018616","https://openalex.org/W2090366431","https://openalex.org/W2096305430","https://openalex.org/W2105002757","https://openalex.org/W2109101401","https://openalex.org/W2122645776","https://openalex.org/W2139869884","https://openalex.org/W2146004814","https://openalex.org/W2154061444","https://openalex.org/W2169523248","https://openalex.org/W2177916571","https://openalex.org/W2203698880","https://openalex.org/W2460560651","https://openalex.org/W2551019733","https://openalex.org/W2617831053","https://openalex.org/W2804177115","https://openalex.org/W2810051154","https://openalex.org/W2829129652","https://openalex.org/W2884149332","https://openalex.org/W2886977397","https://openalex.org/W2924506256","https://openalex.org/W2927378423","https://openalex.org/W2947686762","https://openalex.org/W2968890119","https://openalex.org/W2990452149","https://openalex.org/W3032929810","https://openalex.org/W3037834981","https://openalex.org/W3041415755","https://openalex.org/W3047076690","https://openalex.org/W3047827833","https://openalex.org/W3107052635","https://openalex.org/W3119684667","https://openalex.org/W3132572198","https://openalex.org/W3133109710","https://openalex.org/W3159977491","https://openalex.org/W3195548603","https://openalex.org/W3198841180","https://openalex.org/W3208490297","https://openalex.org/W3216263043","https://openalex.org/W4205922839","https://openalex.org/W4210881891"],"related_works":["https://openalex.org/W3117281083","https://openalex.org/W4206070139","https://openalex.org/W2996796639","https://openalex.org/W1939200287","https://openalex.org/W2403875102","https://openalex.org/W2596350817","https://openalex.org/W2082305040","https://openalex.org/W4366149309","https://openalex.org/W4381955380","https://openalex.org/W2148102208"],"abstract_inverted_index":{"Purpose":[0],"Drugs":[1],"are":[2,132],"strategic":[3],"products":[4],"with":[5,40,86,99,113,184],"essential":[6],"functions":[7],"in":[8,70,203,214,221,239,248],"human":[9,29],"health.":[10,30],"An":[11],"optimum":[12,107,212],"design":[13],"of":[14,56,143,170,272],"the":[15,37,61,82,95,103,114,141,144,200,207,211,219,222,260,270,273],"pharmaceutical":[16,68],"supply":[17],"chain":[18],"is":[19,52,72,90,177,251],"critical":[20],"to":[21,93,139,227],"avoid":[22],"economic":[23],"damage":[24],"and":[25,43,49,126,152,160,164,230,233],"adverse":[26],"effects":[27],"on":[28,35,81],"The":[31,147,175,244,255],"vehicle-routing":[32],"problem,":[33],"focused":[34],"finding":[36],"lowest-cost":[38],"routes":[39],"available":[41],"vehicles":[42],"constraints,":[44],"such":[45],"as":[46],"time":[47,87,241],"constraints":[48],"road":[50],"length,":[51],"an":[53,106],"important":[54],"aspect":[55],"this.":[57],"In":[58],"this":[59,204,240,249],"paper,":[60],"vehicle":[62,83,256],"routing":[63,84],"problem":[64,85,111,119,172,201,246],"(VRP)":[65],"for":[66,109,117,180,187],"a":[67,168,181,189,252],"company":[69],"Turkey":[71],"discussed.":[73],"Design/methodology/approach":[74],"A":[75,134],"mixed-integer":[76],"programming":[77],"(MIP)":[78],"model":[79,104,176],"based":[80],"windows":[88],"(VRPTW)":[89],"presented,":[91],"aiming":[92],"minimize":[94],"total":[96],"route":[97],"cost":[98],"certain":[100,266],"constraints.":[101],"As":[102],"provides":[105],"solution":[108,213,220,235,271],"small":[110],"sizes":[112],"GUROBI\u00ae":[115,163,223],"solver,":[116],"large":[118,128,154],"sizes,":[120],"metaheuristic":[121,145,193,208],"methods":[122],"that":[123],"simulate":[124],"annealing":[125,150],"adaptive":[127,153],"neighborhood":[129,155],"search":[130,156],"algorithms":[131,194,209],"proposed.":[133],"real":[135,171],"dataset":[136,183],"was":[137,225],"used":[138],"analyze":[140],"effectiveness":[142],"algorithms.":[146],"proposed":[148],"simulated":[149],"(SA)":[151],"(ALNS)":[157],"were":[158],"evaluated":[159],"compared":[161],"against":[162],"each":[165],"other":[166],"through":[167],"set":[169],"instances.":[173],"Findings":[174],"solved":[178],"optimally":[179],"small-sized":[182],"exact":[185],"algorithms;":[186],"solving":[188],"larger":[190],"dataset,":[191],"however,":[192],"require":[195],"significantly":[196],"lesser":[197],"time.":[198],"For":[199],"addressed":[202],"study,":[205],"while":[206],"obtained":[210,238],"less":[215],"than":[216],"one":[217,228],"minute,":[218],"solver":[224],"limited":[226],"hour":[229],"three":[231],"hours,":[232],"no":[234],"could":[236],"be":[237,263],"interval.":[242],"Originality/value":[243],"VRPTW":[245],"presented":[247],"paper":[250],"real-life":[253],"problem.":[254,274],"fleet":[257],"owned":[258],"by":[259],"factory":[261],"cannot":[262],"transported":[264],"between":[265],"suppliers,":[267],"which":[268],"complicates":[269]},"counts_by_year":[{"year":2026,"cited_by_count":3},{"year":2025,"cited_by_count":3},{"year":2024,"cited_by_count":5},{"year":2023,"cited_by_count":2},{"year":2022,"cited_by_count":1}],"updated_date":"2026-06-26T08:34:08.712188","created_date":"2025-10-10T00:00:00"}