{"id":"https://openalex.org/W4417061492","doi":"https://doi.org/10.1007/s44443-025-00369-9","title":"A novel hybrid genetic algorithm with moodie young heuristic and simulated annealing for multi-objective assembly line balancing","display_name":"A novel hybrid genetic algorithm with moodie young heuristic and simulated annealing for multi-objective assembly line balancing","publication_year":2025,"publication_date":"2025-12-05","ids":{"openalex":"https://openalex.org/W4417061492","doi":"https://doi.org/10.1007/s44443-025-00369-9"},"language":"en","primary_location":{"id":"doi:10.1007/s44443-025-00369-9","is_oa":true,"landing_page_url":"https://doi.org/10.1007/s44443-025-00369-9","pdf_url":null,"source":{"id":"https://openalex.org/S2764955546","display_name":"Journal of King Saud University - Computer and Information Sciences","issn_l":"1319-1578","issn":["1319-1578","2213-1248"],"is_oa":true,"is_in_doaj":true,"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":"Journal of King Saud University Computer and Information Sciences","raw_type":"journal-article"},"type":"article","indexed_in":["crossref","doaj"],"open_access":{"is_oa":true,"oa_status":"gold","oa_url":"https://doi.org/10.1007/s44443-025-00369-9","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5099421109","display_name":"Sana El Machouti","orcid":"https://orcid.org/0009-0000-2588-6117"},"institutions":[{"id":"https://openalex.org/I127336678","display_name":"Ecole Mohammadia d'Ing\u00e9nieurs","ror":"https://ror.org/00md3qm14","country_code":"MA","type":"education","lineage":["https://openalex.org/I127336678"]},{"id":"https://openalex.org/I4210117880","display_name":"\u00c9cole Sup\u00e9rieure des Industries du Textile et de l'Habillement","ror":"https://ror.org/02631q704","country_code":"MA","type":"education","lineage":["https://openalex.org/I4210117880"]},{"id":"https://openalex.org/I126477371","display_name":"Mohammed V University","ror":"https://ror.org/00r8w8f84","country_code":"MA","type":"education","lineage":["https://openalex.org/I126477371"]}],"countries":["MA"],"is_corresponding":true,"raw_author_name":"Sana El Machouti","raw_affiliation_strings":["Mohammedia School of Engineers (EMI), LASTIMI Laboratory, Mohammed V University in Rabat, 765, Rabat, Morocco","School of Textile and Clothing (ESITH), Center of Excellence in Logistics (CELOG), 7731, Casablanca, Morocco"],"affiliations":[{"raw_affiliation_string":"Mohammedia School of Engineers (EMI), LASTIMI Laboratory, Mohammed V University in Rabat, 765, Rabat, Morocco","institution_ids":["https://openalex.org/I126477371","https://openalex.org/I127336678"]},{"raw_affiliation_string":"School of Textile and Clothing (ESITH), Center of Excellence in Logistics (CELOG), 7731, Casablanca, Morocco","institution_ids":["https://openalex.org/I4210117880"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5060849972","display_name":"Mustapha Hlyal","orcid":"https://orcid.org/0000-0003-1814-5438"},"institutions":[{"id":"https://openalex.org/I4210117880","display_name":"\u00c9cole Sup\u00e9rieure des Industries du Textile et de l'Habillement","ror":"https://ror.org/02631q704","country_code":"MA","type":"education","lineage":["https://openalex.org/I4210117880"]}],"countries":["MA"],"is_corresponding":false,"raw_author_name":"Mustapha Hlyal","raw_affiliation_strings":["School of Textile and Clothing (ESITH), Center of Excellence in Logistics (CELOG), 7731, Casablanca, Morocco"],"affiliations":[{"raw_affiliation_string":"School of Textile and Clothing (ESITH), Center of Excellence in Logistics (CELOG), 7731, Casablanca, Morocco","institution_ids":["https://openalex.org/I4210117880"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5004202420","display_name":"Jamila El Alami","orcid":"https://orcid.org/0000-0003-4658-4550"},"institutions":[{"id":"https://openalex.org/I126477371","display_name":"Mohammed V University","ror":"https://ror.org/00r8w8f84","country_code":"MA","type":"education","lineage":["https://openalex.org/I126477371"]}],"countries":["MA"],"is_corresponding":false,"raw_author_name":"Jamila El Alami","raw_affiliation_strings":["High School of Technology (EST), LASTIMI Laboratory, Mohammed V University in Rabat, 227, Sale, Morocco"],"affiliations":[{"raw_affiliation_string":"High School of Technology (EST), LASTIMI Laboratory, Mohammed V University in Rabat, 227, Sale, Morocco","institution_ids":["https://openalex.org/I126477371"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":3,"corresponding_author_ids":["https://openalex.org/A5099421109"],"corresponding_institution_ids":["https://openalex.org/I126477371","https://openalex.org/I127336678","https://openalex.org/I4210117880"],"apc_list":{"value":1350,"currency":"USD","value_usd":1350},"apc_paid":{"value":1350,"currency":"USD","value_usd":1350},"fwci":1.3024,"has_fulltext":false,"cited_by_count":1,"citation_normalized_percentile":{"value":0.87148899,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":97,"max":99},"biblio":{"volume":"38","issue":"1","first_page":null,"last_page":null},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T12782","display_name":"Assembly Line Balancing Optimization","score":0.991100013256073,"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/T12782","display_name":"Assembly Line Balancing Optimization","score":0.991100013256073,"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/T11159","display_name":"Manufacturing Process and Optimization","score":0.0008999999845400453,"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.0008999999845400453,"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/simulated-annealing","display_name":"Simulated annealing","score":0.8276000022888184},{"id":"https://openalex.org/keywords/scalability","display_name":"Scalability","score":0.616100013256073},{"id":"https://openalex.org/keywords/assembly-line","display_name":"Assembly line","score":0.5852000117301941},{"id":"https://openalex.org/keywords/metaheuristic","display_name":"Metaheuristic","score":0.5587999820709229},{"id":"https://openalex.org/keywords/genetic-algorithm","display_name":"Genetic algorithm","score":0.5364000201225281},{"id":"https://openalex.org/keywords/workstation","display_name":"Workstation","score":0.5001000165939331},{"id":"https://openalex.org/keywords/heuristic","display_name":"Heuristic","score":0.49570000171661377},{"id":"https://openalex.org/keywords/local-search","display_name":"Local search (optimization)","score":0.4932999908924103}],"concepts":[{"id":"https://openalex.org/C126980161","wikidata":"https://www.wikidata.org/wiki/Q863783","display_name":"Simulated annealing","level":2,"score":0.8276000022888184},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.6491000056266785},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.6222000122070312},{"id":"https://openalex.org/C48044578","wikidata":"https://www.wikidata.org/wiki/Q727490","display_name":"Scalability","level":2,"score":0.616100013256073},{"id":"https://openalex.org/C3019666875","wikidata":"https://www.wikidata.org/wiki/Q455037","display_name":"Assembly line","level":2,"score":0.5852000117301941},{"id":"https://openalex.org/C109718341","wikidata":"https://www.wikidata.org/wiki/Q1385229","display_name":"Metaheuristic","level":2,"score":0.5587999820709229},{"id":"https://openalex.org/C8880873","wikidata":"https://www.wikidata.org/wiki/Q187787","display_name":"Genetic algorithm","level":2,"score":0.5364000201225281},{"id":"https://openalex.org/C67953723","wikidata":"https://www.wikidata.org/wiki/Q192525","display_name":"Workstation","level":2,"score":0.5001000165939331},{"id":"https://openalex.org/C173801870","wikidata":"https://www.wikidata.org/wiki/Q201413","display_name":"Heuristic","level":2,"score":0.49570000171661377},{"id":"https://openalex.org/C135320971","wikidata":"https://www.wikidata.org/wiki/Q1868524","display_name":"Local search (optimization)","level":2,"score":0.4932999908924103},{"id":"https://openalex.org/C40128228","wikidata":"https://www.wikidata.org/wiki/Q460851","display_name":"Ant colony optimization algorithms","level":2,"score":0.46309998631477356},{"id":"https://openalex.org/C62469222","wikidata":"https://www.wikidata.org/wiki/Q17092103","display_name":"Hybrid algorithm (constraint satisfaction)","level":5,"score":0.4237000048160553},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.4203000068664551},{"id":"https://openalex.org/C137836250","wikidata":"https://www.wikidata.org/wiki/Q984063","display_name":"Optimization problem","level":2,"score":0.37610000371932983},{"id":"https://openalex.org/C2780451532","wikidata":"https://www.wikidata.org/wiki/Q759676","display_name":"Task (project management)","level":2,"score":0.3465000092983246},{"id":"https://openalex.org/C192209626","wikidata":"https://www.wikidata.org/wiki/Q190909","display_name":"Focus (optics)","level":2,"score":0.3409000039100647},{"id":"https://openalex.org/C159149176","wikidata":"https://www.wikidata.org/wiki/Q14489129","display_name":"Evolutionary algorithm","level":2,"score":0.3402999937534332},{"id":"https://openalex.org/C4935549","wikidata":"https://www.wikidata.org/wiki/Q6822261","display_name":"Meta-optimization","level":3,"score":0.3244999945163727},{"id":"https://openalex.org/C135450995","wikidata":"https://www.wikidata.org/wiki/Q820272","display_name":"Hill climbing","level":2,"score":0.29260000586509705},{"id":"https://openalex.org/C2778915421","wikidata":"https://www.wikidata.org/wiki/Q3643177","display_name":"Performance improvement","level":2,"score":0.2809999883174896},{"id":"https://openalex.org/C60891933","wikidata":"https://www.wikidata.org/wiki/Q796575","display_name":"Ant colony","level":3,"score":0.2583000063896179},{"id":"https://openalex.org/C141934464","wikidata":"https://www.wikidata.org/wiki/Q3305386","display_name":"Local optimum","level":2,"score":0.25440001487731934}],"mesh":[],"locations_count":2,"locations":[{"id":"doi:10.1007/s44443-025-00369-9","is_oa":true,"landing_page_url":"https://doi.org/10.1007/s44443-025-00369-9","pdf_url":null,"source":{"id":"https://openalex.org/S2764955546","display_name":"Journal of King Saud University - Computer and Information Sciences","issn_l":"1319-1578","issn":["1319-1578","2213-1248"],"is_oa":true,"is_in_doaj":true,"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":"Journal of King Saud University Computer and Information Sciences","raw_type":"journal-article"},{"id":"pmh:oai:doaj.org/article:44e2906e8c784945a1b2f4d199b845d8","is_oa":true,"landing_page_url":"https://doaj.org/article/44e2906e8c784945a1b2f4d199b845d8","pdf_url":null,"source":{"id":"https://openalex.org/S112646816","display_name":"SHILAP Revista de lepidopterolog\u00eda","issn_l":"0300-5267","issn":["0300-5267","2340-4078"],"is_oa":true,"is_in_doaj":true,"is_core":false,"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"journal"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"Journal of King Saud University: Computer and Information Sciences, Vol 38, Iss 1, Pp 1-20 (2025)","raw_type":"article"}],"best_oa_location":{"id":"doi:10.1007/s44443-025-00369-9","is_oa":true,"landing_page_url":"https://doi.org/10.1007/s44443-025-00369-9","pdf_url":null,"source":{"id":"https://openalex.org/S2764955546","display_name":"Journal of King Saud University - Computer and Information Sciences","issn_l":"1319-1578","issn":["1319-1578","2213-1248"],"is_oa":true,"is_in_doaj":true,"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":"Journal of King Saud University Computer and Information Sciences","raw_type":"journal-article"},"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":52,"referenced_works":["https://openalex.org/W79318708","https://openalex.org/W617247253","https://openalex.org/W1964471737","https://openalex.org/W1964581121","https://openalex.org/W1970485081","https://openalex.org/W1972724683","https://openalex.org/W1997528082","https://openalex.org/W2010702635","https://openalex.org/W2015091039","https://openalex.org/W2024087614","https://openalex.org/W2075292279","https://openalex.org/W2085313872","https://openalex.org/W2085355815","https://openalex.org/W2125899728","https://openalex.org/W2159748335","https://openalex.org/W2168079536","https://openalex.org/W2470979029","https://openalex.org/W2726676844","https://openalex.org/W2727890520","https://openalex.org/W2748823108","https://openalex.org/W2807807334","https://openalex.org/W2895964738","https://openalex.org/W2993471286","https://openalex.org/W3108787497","https://openalex.org/W3118485316","https://openalex.org/W3126955592","https://openalex.org/W3132825399","https://openalex.org/W3135716887","https://openalex.org/W3150458138","https://openalex.org/W3174432161","https://openalex.org/W3176068515","https://openalex.org/W3184296607","https://openalex.org/W3196895885","https://openalex.org/W4211130072","https://openalex.org/W4220731895","https://openalex.org/W4220952049","https://openalex.org/W4241727697","https://openalex.org/W4252684946","https://openalex.org/W4294219102","https://openalex.org/W4308950460","https://openalex.org/W4323848850","https://openalex.org/W4377023698","https://openalex.org/W4388233771","https://openalex.org/W4392353049","https://openalex.org/W4392453135","https://openalex.org/W4392888668","https://openalex.org/W4393374596","https://openalex.org/W4394797690","https://openalex.org/W4399927637","https://openalex.org/W4402704441","https://openalex.org/W4404489706","https://openalex.org/W4411655599"],"related_works":[],"abstract_inverted_index":{"The":[0,119,169],"Assembly":[1],"Line":[2],"Balancing":[3],"Problem":[4],"(ALBP)":[5],"is":[6,185],"a":[7,76,125,132,226],"critical":[8,24],"optimization":[9,39,58],"challenge":[10],"in":[11,105,208],"manufacturing":[12,33],"systems":[13],"that":[14,108],"aims":[15,109],"to":[16,19,110,116,137],"assign":[17],"tasks":[18],"workstations":[20],"while":[21],"optimizing":[22],"some":[23],"objectives.":[25,42],"Despite":[26],"extensive":[27],"research":[28],"on":[29,46,56,147],"single-objective":[30],"optimization,":[31],"real-world":[32],"processes":[34],"often":[35],"require":[36],"the":[37,47,71,73,98,106,154,157,186,190,214],"simultaneous":[38],"of":[40,50,150,156,188,219,233],"multiple":[41],"This":[43,183],"study":[44],"focuses":[45],"Simple":[48],"ALBP":[49],"Type":[51],"2,":[52],"with":[53,88,192],"particular":[54],"focus":[55],"multi-objective":[57],"(MO-SALBP-2),":[59],"which":[60,81,199],"includes":[61,122],"minimizing":[62],"both":[63,176],"cycle":[64],"time":[65],"and":[66,93,114,129,141,163,178,196,204,217,228],"squared":[67],"workload.":[68],"To":[69],"solve":[70,117],"MO-SALBP-2,":[72],"authors":[74,99],"propose":[75],"novel":[77],"hybrid":[78,222],"approach,":[79,223],"HGA-MYSA,":[80],"integrates":[82],"an":[83],"improved":[84],"Genetic":[85],"Algorithm":[86],"(GA)":[87],"Moodie":[89],"Young":[90],"heuristic":[91],"(M&Y)":[92],"Simulated":[94],"Annealing":[95],"(SA).":[96],"Furthermore,":[97],"did":[100],"not":[101],"find":[102],"any":[103],"work":[104],"literature":[107],"combine":[111],"GA,":[112],"M&Y,":[113],"SA":[115,130],"ALBP.":[118],"proposed":[120],"HGA-MYSA":[121,158,170],"M&Y":[123],"as":[124,131],"local":[126,134,143,194],"improvement":[127,184,195],"phase":[128],"strategic":[133],"search":[135,197],"mechanism":[136],"improve":[138],"solution":[139,230],"quality":[140],"avoid":[142],"optima.":[144],"Experimental":[145],"results":[146],"three":[148],"problems":[149,232],"different":[151,234],"sizes":[152],"demonstrate":[153],"superiority":[155],"algorithm":[159],"over":[160],"conventional":[161],"GA":[162,191],"Ant":[164],"Colony":[165],"Optimization":[166],"(ACO)":[167],"algorithms.":[168],"method":[171],"achieves":[172],"lower":[173],"values":[174],"for":[175,231],"objectives":[177],"exhibits":[179],"more":[180],"stable":[181],"convergence.":[182],"result":[187],"hybridizing":[189],"two":[193],"phases,":[198],"ensure":[200],"better":[201,229],"task":[202],"assignment":[203],"maximize":[205],"line":[206],"efficiency":[207],"most":[209],"scenarios.":[210],"These":[211],"findings":[212],"highlight":[213],"robustness,":[215],"efficiency,":[216],"scalability":[218],"this":[220],"new":[221],"making":[224],"it":[225],"promising":[227],"sizes.":[235]},"counts_by_year":[{"year":2026,"cited_by_count":1}],"updated_date":"2026-03-20T23:20:44.827607","created_date":"2025-12-05T00:00:00"}