{"id":"https://openalex.org/W7127054356","doi":"https://doi.org/10.1016/j.cie.2026.111865","title":"Integrated flexible production scheduling and vehicle routing with MLOR constraints: A hybrid metaheuristic approach","display_name":"Integrated flexible production scheduling and vehicle routing with MLOR constraints: A hybrid metaheuristic approach","publication_year":2026,"publication_date":"2026-02-02","ids":{"openalex":"https://openalex.org/W7127054356","doi":"https://doi.org/10.1016/j.cie.2026.111865"},"language":"en","primary_location":{"id":"doi:10.1016/j.cie.2026.111865","is_oa":true,"landing_page_url":"https://doi.org/10.1016/j.cie.2026.111865","pdf_url":null,"source":{"id":"https://openalex.org/S196821226","display_name":"Computers & Industrial Engineering","issn_l":"0360-8352","issn":["0360-8352","1879-0550"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310320990","host_organization_name":"Elsevier BV","host_organization_lineage":["https://openalex.org/P4310320990"],"host_organization_lineage_names":["Elsevier BV"],"type":"journal"},"license":"cc-by-nc-nd","license_id":"https://openalex.org/licenses/cc-by-nc-nd","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Computers & Industrial Engineering","raw_type":"journal-article"},"type":"article","indexed_in":["crossref"],"open_access":{"is_oa":true,"oa_status":"hybrid","oa_url":"https://doi.org/10.1016/j.cie.2026.111865","any_repository_has_fulltext":false},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5124731463","display_name":"Mohammad Kaviyani-Charati","orcid":null},"institutions":[{"id":"https://openalex.org/I79817857","display_name":"University of Guelph","ror":"https://ror.org/01r7awg59","country_code":"CA","type":"education","lineage":["https://openalex.org/I79817857"]}],"countries":["CA"],"is_corresponding":true,"raw_author_name":"Mohammad Kaviyani-Charati","raw_affiliation_strings":["Smart Manufacturing Lab, School of Engineering, University of Guelph, Guelph, Ontario, Canada"],"raw_orcid":"https://orcid.org/0000-0002-7541-2339","affiliations":[{"raw_affiliation_string":"Smart Manufacturing Lab, School of Engineering, University of Guelph, Guelph, Ontario, Canada","institution_ids":["https://openalex.org/I79817857"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5032311556","display_name":"Fantahun M. Defersha","orcid":"https://orcid.org/0000-0002-7717-7686"},"institutions":[{"id":"https://openalex.org/I79817857","display_name":"University of Guelph","ror":"https://ror.org/01r7awg59","country_code":"CA","type":"education","lineage":["https://openalex.org/I79817857"]}],"countries":["CA"],"is_corresponding":false,"raw_author_name":"Fantahun M. Defersha","raw_affiliation_strings":["Smart Manufacturing Lab, School of Engineering, University of Guelph, Guelph, Ontario, Canada"],"raw_orcid":"https://orcid.org/0000-0002-7717-7686","affiliations":[{"raw_affiliation_string":"Smart Manufacturing Lab, School of Engineering, University of Guelph, Guelph, Ontario, Canada","institution_ids":["https://openalex.org/I79817857"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5124731463"],"corresponding_institution_ids":["https://openalex.org/I79817857"],"apc_list":{"value":3310,"currency":"USD","value_usd":3310},"apc_paid":{"value":3310,"currency":"USD","value_usd":3310},"fwci":0.0,"has_fulltext":false,"cited_by_count":0,"citation_normalized_percentile":{"value":0.18186176,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":null,"biblio":{"volume":"214","issue":null,"first_page":"111865","last_page":"111865"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10567","display_name":"Vehicle Routing Optimization Methods","score":0.939300000667572,"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.939300000667572,"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/T11814","display_name":"Advanced Manufacturing and Logistics Optimization","score":0.013199999928474426,"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.006099999882280827,"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/simulated-annealing","display_name":"Simulated annealing","score":0.5925999879837036},{"id":"https://openalex.org/keywords/metaheuristic","display_name":"Metaheuristic","score":0.5746999979019165},{"id":"https://openalex.org/keywords/scheduling","display_name":"Scheduling (production processes)","score":0.552299976348877},{"id":"https://openalex.org/keywords/vehicle-routing-problem","display_name":"Vehicle routing problem","score":0.5480999946594238},{"id":"https://openalex.org/keywords/genetic-algorithm","display_name":"Genetic algorithm","score":0.46549999713897705},{"id":"https://openalex.org/keywords/scalability","display_name":"Scalability","score":0.44429999589920044},{"id":"https://openalex.org/keywords/hybrid-algorithm","display_name":"Hybrid algorithm (constraint satisfaction)","score":0.37220001220703125},{"id":"https://openalex.org/keywords/job-shop-scheduling","display_name":"Job shop scheduling","score":0.36899998784065247}],"concepts":[{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.6337000131607056},{"id":"https://openalex.org/C126980161","wikidata":"https://www.wikidata.org/wiki/Q863783","display_name":"Simulated annealing","level":2,"score":0.5925999879837036},{"id":"https://openalex.org/C109718341","wikidata":"https://www.wikidata.org/wiki/Q1385229","display_name":"Metaheuristic","level":2,"score":0.5746999979019165},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.5666999816894531},{"id":"https://openalex.org/C206729178","wikidata":"https://www.wikidata.org/wiki/Q2271896","display_name":"Scheduling (production processes)","level":2,"score":0.552299976348877},{"id":"https://openalex.org/C123784306","wikidata":"https://www.wikidata.org/wiki/Q944041","display_name":"Vehicle routing problem","level":3,"score":0.5480999946594238},{"id":"https://openalex.org/C8880873","wikidata":"https://www.wikidata.org/wiki/Q187787","display_name":"Genetic algorithm","level":2,"score":0.46549999713897705},{"id":"https://openalex.org/C48044578","wikidata":"https://www.wikidata.org/wiki/Q727490","display_name":"Scalability","level":2,"score":0.44429999589920044},{"id":"https://openalex.org/C62469222","wikidata":"https://www.wikidata.org/wiki/Q17092103","display_name":"Hybrid algorithm (constraint satisfaction)","level":5,"score":0.37220001220703125},{"id":"https://openalex.org/C55416958","wikidata":"https://www.wikidata.org/wiki/Q6206757","display_name":"Job shop scheduling","level":3,"score":0.36899998784065247},{"id":"https://openalex.org/C185798385","wikidata":"https://www.wikidata.org/wiki/Q1161707","display_name":"Benchmark (surveying)","level":2,"score":0.36160001158714294},{"id":"https://openalex.org/C127705205","wikidata":"https://www.wikidata.org/wiki/Q5748245","display_name":"Heuristics","level":2,"score":0.3560999929904938},{"id":"https://openalex.org/C154982244","wikidata":"https://www.wikidata.org/wiki/Q5451844","display_name":"Firefly algorithm","level":3,"score":0.33629998564720154},{"id":"https://openalex.org/C41045048","wikidata":"https://www.wikidata.org/wiki/Q202843","display_name":"Linear programming","level":2,"score":0.3294000029563904},{"id":"https://openalex.org/C108713360","wikidata":"https://www.wikidata.org/wiki/Q1824206","display_name":"Supply chain","level":2,"score":0.3255999982357025},{"id":"https://openalex.org/C2778348673","wikidata":"https://www.wikidata.org/wiki/Q739302","display_name":"Production (economics)","level":2,"score":0.3125999867916107},{"id":"https://openalex.org/C56086750","wikidata":"https://www.wikidata.org/wiki/Q6042592","display_name":"Integer programming","level":2,"score":0.3027999997138977},{"id":"https://openalex.org/C40128228","wikidata":"https://www.wikidata.org/wiki/Q460851","display_name":"Ant colony optimization algorithms","level":2,"score":0.2734000086784363},{"id":"https://openalex.org/C182299520","wikidata":"https://www.wikidata.org/wiki/Q1289588","display_name":"Total cost","level":2,"score":0.2694999873638153},{"id":"https://openalex.org/C135320971","wikidata":"https://www.wikidata.org/wiki/Q1868524","display_name":"Local search (optimization)","level":2,"score":0.2646999955177307},{"id":"https://openalex.org/C159149176","wikidata":"https://www.wikidata.org/wiki/Q14489129","display_name":"Evolutionary algorithm","level":2,"score":0.25940001010894775},{"id":"https://openalex.org/C125583679","wikidata":"https://www.wikidata.org/wiki/Q755673","display_name":"Search algorithm","level":2,"score":0.2538999915122986},{"id":"https://openalex.org/C127413603","wikidata":"https://www.wikidata.org/wiki/Q11023","display_name":"Engineering","level":0,"score":0.25369998812675476}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1016/j.cie.2026.111865","is_oa":true,"landing_page_url":"https://doi.org/10.1016/j.cie.2026.111865","pdf_url":null,"source":{"id":"https://openalex.org/S196821226","display_name":"Computers & Industrial Engineering","issn_l":"0360-8352","issn":["0360-8352","1879-0550"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310320990","host_organization_name":"Elsevier BV","host_organization_lineage":["https://openalex.org/P4310320990"],"host_organization_lineage_names":["Elsevier BV"],"type":"journal"},"license":"cc-by-nc-nd","license_id":"https://openalex.org/licenses/cc-by-nc-nd","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Computers & Industrial Engineering","raw_type":"journal-article"}],"best_oa_location":{"id":"doi:10.1016/j.cie.2026.111865","is_oa":true,"landing_page_url":"https://doi.org/10.1016/j.cie.2026.111865","pdf_url":null,"source":{"id":"https://openalex.org/S196821226","display_name":"Computers & Industrial Engineering","issn_l":"0360-8352","issn":["0360-8352","1879-0550"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310320990","host_organization_name":"Elsevier BV","host_organization_lineage":["https://openalex.org/P4310320990"],"host_organization_lineage_names":["Elsevier BV"],"type":"journal"},"license":"cc-by-nc-nd","license_id":"https://openalex.org/licenses/cc-by-nc-nd","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Computers & Industrial Engineering","raw_type":"journal-article"},"sustainable_development_goals":[],"awards":[{"id":"https://openalex.org/G8679162687","display_name":null,"funder_award_id":"RGPIN-2023-03291","funder_id":"https://openalex.org/F4320334593","funder_display_name":"Natural Sciences and Engineering Research Council of Canada"}],"funders":[{"id":"https://openalex.org/F4320334593","display_name":"Natural Sciences and Engineering Research Council of Canada","ror":"https://ror.org/01h531d29"}],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":48,"referenced_works":["https://openalex.org/W1851050760","https://openalex.org/W1966916662","https://openalex.org/W1980073965","https://openalex.org/W2001927412","https://openalex.org/W2004576491","https://openalex.org/W2050860869","https://openalex.org/W2056922736","https://openalex.org/W2064542310","https://openalex.org/W2111174053","https://openalex.org/W2119601963","https://openalex.org/W2136963152","https://openalex.org/W2162969801","https://openalex.org/W2290075614","https://openalex.org/W2604280268","https://openalex.org/W2606770867","https://openalex.org/W2745690522","https://openalex.org/W2757143398","https://openalex.org/W2791305079","https://openalex.org/W2884414339","https://openalex.org/W2896938346","https://openalex.org/W2921634079","https://openalex.org/W2942919360","https://openalex.org/W2945598375","https://openalex.org/W2947207892","https://openalex.org/W3012296323","https://openalex.org/W3039856838","https://openalex.org/W3044439259","https://openalex.org/W3091984700","https://openalex.org/W3094127673","https://openalex.org/W3125227262","https://openalex.org/W3132565632","https://openalex.org/W3178821040","https://openalex.org/W3198542923","https://openalex.org/W3211715474","https://openalex.org/W4206312176","https://openalex.org/W4214874932","https://openalex.org/W4281552602","https://openalex.org/W4286513993","https://openalex.org/W4313399594","https://openalex.org/W4313491352","https://openalex.org/W4320725369","https://openalex.org/W4382934513","https://openalex.org/W4386783443","https://openalex.org/W4393249226","https://openalex.org/W4394793339","https://openalex.org/W4400380939","https://openalex.org/W4403145082","https://openalex.org/W4406143130"],"related_works":[],"abstract_inverted_index":{"This":[0],"study":[1,156,276],"addresses":[2],"an":[3,227,239],"integrated":[4,106,228],"multi-line":[5],"flexible":[6],"flow-shop":[7],"production":[8,166,206],"scheduling":[9],"and":[10,24,51,78,81,112,125,131,136,138,144,181,190,201,207,211,234,245,259,267],"multi-trip":[11],"vehicle":[12],"routing":[13],"problem":[14],"(MLFFSPS\u2013MTVR)":[15],"in":[16,214],"perishable":[17,215],"supply":[18,216],"chains,":[19,217],"where":[20],"due":[21,232],"date":[22,233],"compliance":[23],"minimum":[25],"life-on-receipt":[26],"(MLOR)":[27],"constraints":[28,213],"are":[29],"critical.":[30],"We":[31],"formulate":[32],"a":[33,61,113,199,251],"new":[34],"mixed-integer":[35],"linear":[36],"programming":[37],"(MILP)":[38],"model":[39],"to":[40,151,221],"minimize":[41],"total":[42],"operational":[43],"costs,":[44],"including":[45],"inventory":[46],"holding,":[47,242],"earliness/lateness":[48],"penalties,":[49],"delivery,":[50,243],"fixed":[52],"fleet-usage":[53],"costs.":[54,248],"To":[55],"overcome":[56],"scalability":[57],"challenges,":[58],"we":[59],"propose":[60],"hybrid":[62,99,252],"genetic":[63,100,107],"algorithm":[64,101,108],"with":[65,147,218,231,254],"local":[66,74,257],"search":[67],"(HGALS)":[68],"that":[69,90,164],"combines":[70],"strategic":[71,255],"mutations,":[72],"problem-specific":[73],"searches,":[75],"adaptive":[76],"delay":[77],"departure-time":[79],"adjustments,":[80],"diversity":[82,260],"management.":[83],"Comparative":[84],"experiments":[85],"on":[86],"benchmark":[87],"instances":[88],"show":[89,265],"HGALS":[91],"consistently":[92],"outperforms":[93],"three":[94],"strong":[95],"metaheuristic":[96],"baselines,":[97],"the":[98,105,159,177,195],"(HGA)":[102],"of":[103,110,123,179],"Vidal,":[104],"(GA)":[109],"Ullrich,":[111],"multi-path":[114],"simulated":[115],"annealing":[116],"(MPSA)":[117],"scheme,":[118],"achieving":[119],"average":[120],"cost":[121],"reductions":[122],"6.5%":[124],"5.9%":[126],"over":[127,133,140,269],"Vidal\u2019s":[128],"HGA,":[129],"17.8%":[130],"15.6%":[132],"Ullrich\u2019s":[134],"GA,":[135],"7.9%":[137],"12.6%":[139],"MPSA":[141],"for":[142,204],"medium":[143],"large":[145],"instances,":[146],"absolute":[148],"savings":[149],"up":[150],"89,000":[152],"units.":[153],"A":[154,273],"case":[155,275],"inspired":[157],"by":[158],"dairy":[160,274],"sector":[161],"further":[162],"indicates":[163],"heterogeneous":[165],"resources":[167],"outperform":[168],"homogeneous":[169],"configurations,":[170],"load-consolidation":[171],"strategies":[172],"reduce":[173],"costs":[174],"despite":[175],"increasing":[176],"number":[178],"trips,":[180],"MLOR":[182,210,235],"enforcement":[183],"eliminates":[184],"violations":[185],"while":[186],"supporting":[187],"Just-in-Time":[188],"(JIT)":[189],"Make-to-Order":[191],"(MTO)":[192],"strategies.":[193],"Overall,":[194],"proposed":[196],"framework":[197,230],"provides":[198],"robust":[200],"scalable":[202],"method":[203],"synchronizing":[205],"distribution":[208],"under":[209,280],"due-date":[212],"potential":[219],"applicability":[220],"broader":[222],"logistics":[223],"contexts.":[224],"\u2022":[225,237,249,262,272],"Studied":[226],"MLFFSPS-MTVR":[229],"constraints.":[236],"Proposed":[238],"MILP":[240],"minimizing":[241],"earliness,":[244],"fleet":[246],"usage":[247],"Developed":[250],"GA":[253],"mutation,":[256],"search,":[258],"control.":[261],"Benchmark":[263],"results":[264],"efficiency":[266],"robustness":[268],"baseline":[270],"algorithms.":[271],"reveals":[277],"practical":[278],"insights":[279],"varied":[281],"configurations.":[282]},"counts_by_year":[],"updated_date":"2026-05-05T08:41:31.759640","created_date":"2026-02-03T00:00:00"}