Adaptive Tabu Search for Flexible Assembly Line Balancing

preprint OA: closed
Full text JSON View at publisher

Abstract

Abstract This research presents the development and evaluation of the Adaptive Tabu Search for Flexible Assembly Line Balancing (ATS-FALB), a metaheuristic algorithm designed to optimize task assignment in flexible automotive production lines. Assembly line balancing problems are computationally complex and classified as NP-hard, making optimal solutions difficult to obtain in large-scale manufacturing systems. To address this challenge, the proposed algorithm integrates adaptive mechanisms based on dynamic long-term memory structures and advanced penalty strategies that guide the search process and reduce the risk of premature convergence. Experimental validation was conducted using a benchmark dataset of 30 vehicle models representing realistic automotive production scenarios. The results indicate that the ATS-FALB algorithm consistently produces optimal or near-optimal solutions while maintaining stable convergence behavior. In particular, the method achieves an average reduction of 0.14 hours in cycle times and reaches high-quality solutions in fewer than 100 iterations. These findings demonstrate the robustness and efficiency of the proposed approach for improving operational performance in manufacturing environments.
Full text 10,268 characters · extracted from preprint-html · click to expand
Adaptive Tabu Search for Flexible Assembly Line Balancing | Research Square window.SnipcartSettings = { analytics: { enabled: false } }; (function() { var accessVector = localStorage.getItem('access_vector') || ''; window.dataLayer = window.dataLayer || []; if (accessVector) { window.dataLayer.push({ user: { profile: { profileInfo: { snid: accessVector } } } }); } })(); (function(w,d,s,l,i){w[l]=w[l]||[];w[l].push({'gtm.start':new Date().getTime(),event:'gtm.js'});var f=d.getElementsByTagName(s)[0],j=d.createElement(s),dl=l!='dataLayer'?'&l='+l:'';j.async=true;j.src='https://www.googletagmanager.com/gtm.js?id='+i+dl;f.parentNode.insertBefore(j,f);})(window,document,'script','dataLayer','GTM-K279D39R'); Browse Preprints In Review Journals COVID-19 Preprints AJE Video Bytes Research Tools Research Promotion AJE Professional Editing AJE Rubriq About Preprint Platform In Review Editorial Policies Our Team Advisory Board Help Center Sign In Submit a Preprint Cite Share Download PDF Method Article Adaptive Tabu Search for Flexible Assembly Line Balancing Jose Luis Peinado-Portillo, Jose Dario Vazquez-Martinez This is a preprint; it has not been peer reviewed by a journal. https://doi.org/ 10.21203/rs.3.rs-9098544/v1 This work is licensed under a CC BY 4.0 License Status: Posted Version 1 posted You are reading this latest preprint version Abstract This research presents the development and evaluation of the Adaptive Tabu Search for Flexible Assembly Line Balancing (ATS-FALB), a metaheuristic algorithm designed to optimize task assignment in flexible automotive production lines. Assembly line balancing problems are computationally complex and classified as NP-hard, making optimal solutions difficult to obtain in large-scale manufacturing systems. To address this challenge, the proposed algorithm integrates adaptive mechanisms based on dynamic long-term memory structures and advanced penalty strategies that guide the search process and reduce the risk of premature convergence. Experimental validation was conducted using a benchmark dataset of 30 vehicle models representing realistic automotive production scenarios. The results indicate that the ATS-FALB algorithm consistently produces optimal or near-optimal solutions while maintaining stable convergence behavior. In particular, the method achieves an average reduction of 0.14 hours in cycle times and reaches high-quality solutions in fewer than 100 iterations. These findings demonstrate the robustness and efficiency of the proposed approach for improving operational performance in manufacturing environments. Assembly line balancing Tabu Search metaheuristics optimization automotive manufacturing Full Text Additional Declarations The authors declare no competing interests. Cite Share Download PDF Status: Posted Version 1 posted You are reading this latest preprint version Research Square lets you share your work early, gain feedback from the community, and start making changes to your manuscript prior to peer review in a journal. As a division of Research Square Company, we’re committed to making research communication faster, fairer, and more useful. We do this by developing innovative software and high quality services for the global research community. Our growing team is made up of researchers and industry professionals working together to solve the most critical problems facing scientific publishing. Also discoverable on Platform About Our Team In Review Editorial Policies Advisory Board Help Center Resources Author Services Accessibility API Access RSS feed Manage Cookie Preferences © Research Square 2026 | ISSN 2693-5015 (online) Privacy Policy Terms of Service Do Not Sell My Personal Information {"props":{"pageProps":{"initialData":{"identity":"rs-9098544","acceptedTermsAndConditions":true,"allowDirectSubmit":true,"archivedVersions":[],"articleType":"Method Article","associatedPublications":[],"authors":[{"id":604723579,"identity":"88633563-8744-46ee-a7e0-7e7b156df969","order_by":0,"name":"Jose Luis Peinado-Portillo","email":"data:image/png;base64,iVBORw0KGgoAAAANSUhEUgAAAZAAAAAyAQMAAABI0h/eAAAABlBMVEX///8AAABVwtN+AAAACXBIWXMAAA7EAAAOxAGVKw4bAAABBUlEQVRIiWNgGAWjYBACxgYIzQPEBgwfoCISRGthnAHURlALMjBg5gFqAQG8Wpjb2x8+YNxhI2POfnjjY9u2P/LMDcwHb/MwbEtswOWwnjPGBoxn0ngse9KKjXPbDAwbG9iSrXkYbhvj9MuMHDYJxrbDPAYHcsykgVoSGBt4zKSBWuRwa0l//oOx7T+Pwfk3ZtKWYC3830BaeHBrSTBjYGw7wGNwA2gLI8QWNvy2AP0iwXgmGajlWbFhzzljw8ZmNmPLOQa4/WIIDLEPjDvs7A3OJ2988KNMTt6wvfnhjTcVt3GGmCFQgvkvsqxhM4g0wGUHA4M82HUN6CKjYBSMglEwCpAAALKaUGBbrHFrAAAAAElFTkSuQmCC","orcid":"https://orcid.org/0000-0002-2162-8118","institution":"Universidad Tecnologica de Ciudad Juarez","correspondingAuthor":true,"prefix":"","firstName":"Jose","middleName":"Luis","lastName":"Peinado-Portillo","suffix":""},{"id":604723673,"identity":"a60eb01a-bbe9-420d-b1b4-6a232fc4abf3","order_by":1,"name":"Jose Dario Vazquez-Martinez","email":"","orcid":"https://orcid.org/0009-0001-4851-3353","institution":"Universidad Tecnologica de Ciudad Juarez","correspondingAuthor":false,"prefix":"","firstName":"Jose","middleName":"Dario","lastName":"Vazquez-Martinez","suffix":""}],"badges":[],"createdAt":"2026-03-11 23:51:02","currentVersionCode":1,"declarations":{"humanSubjects":false,"vertebrateSubjects":false,"conflictsOfInterestStatement":false,"humanSubjectEthicalGuidelines":false,"humanSubjectConsent":false,"humanSubjectClinicalTrial":false,"humanSubjectCaseReport":false,"vertebrateSubjectEthicalGuidelines":false},"doi":"10.21203/rs.3.rs-9098544/v1","doiUrl":"https://doi.org/10.21203/rs.3.rs-9098544/v1","draftVersion":[],"editorialEvents":[],"editorialNote":"","failedWorkflow":false,"files":[{"id":104781336,"identity":"d11d33fc-5551-49a6-8dc0-35f3a9a1149c","added_by":"auto","created_at":"2026-03-17 07:55:27","extension":"pdf","order_by":1,"title":"","display":"","copyAsset":false,"role":"manuscript-pdf","size":498216,"visible":true,"origin":"","legend":"","description":"","filename":"AdaptiveTabuSearchforFlexibleAssemblyLineBalancingEN.pdf","url":"https://assets-eu.researchsquare.com/files/rs-9098544/v1_covered_5db71c65-daae-46a8-ac09-d17335e5d34c.pdf"}],"financialInterests":"The authors declare no competing interests.","formattedTitle":"\u003cp\u003eAdaptive Tabu Search for Flexible Assembly Line Balancing\u003c/p\u003e","fulltext":[],"fulltextSource":"","fullText":"","funders":[],"hasAdminPriorityOnWorkflow":false,"hasManuscriptDocX":false,"hasOptedInToPreprint":true,"hasPassedJournalQc":"","hasAnyPriority":true,"hideJournal":true,"highlight":"","institution":"","isAcceptedByJournal":false,"isAuthorSuppliedPdf":true,"isDeskRejected":"","isHiddenFromSearch":false,"isInQc":false,"isInWorkflow":false,"isPdf":true,"isPdfUpToDate":true,"isWithdrawnOrRetracted":false,"journal":{"display":true,"email":"[email protected]","identity":"researchsquare","isNatureJournal":false,"hasQc":true,"allowDirectSubmit":true,"externalIdentity":"","sideBox":"","snPcode":"","submissionUrl":"/submission","title":"Research Square","twitterHandle":"researchsquare","acdcEnabled":true,"dfaEnabled":false,"editorialSystem":"","reportingPortfolio":"","inReviewEnabled":false,"inReviewRevisionsEnabled":true},"keywords":"Assembly line balancing, Tabu Search, metaheuristics, optimization, automotive manufacturing","lastPublishedDoi":"10.21203/rs.3.rs-9098544/v1","lastPublishedDoiUrl":"https://doi.org/10.21203/rs.3.rs-9098544/v1","license":{"name":"CC BY 4.0","url":"https://creativecommons.org/licenses/by/4.0/"},"manuscriptAbstract":"\u003cp\u003eThis research presents the development and evaluation of the Adaptive Tabu Search for Flexible Assembly Line Balancing (ATS-FALB), a metaheuristic algorithm designed to optimize task assignment in flexible automotive production lines. Assembly line balancing problems are computationally complex and classified as NP-hard, making optimal solutions difficult to obtain in large-scale manufacturing systems. To address this challenge, the proposed algorithm integrates adaptive mechanisms based on dynamic long-term memory structures and advanced penalty strategies that guide the search process and reduce the risk of premature convergence.\u003c/p\u003e \u003cp\u003eExperimental validation was conducted using a benchmark dataset of 30 vehicle models representing realistic automotive production scenarios. The results indicate that the ATS-FALB algorithm consistently produces optimal or near-optimal solutions while maintaining stable convergence behavior. In particular, the method achieves an average reduction of 0.14 hours in cycle times and reaches high-quality solutions in fewer than 100 iterations. These findings demonstrate the robustness and efficiency of the proposed approach for improving operational performance in manufacturing environments.\u003c/p\u003e","manuscriptTitle":"Adaptive Tabu Search for Flexible Assembly Line Balancing","msid":"","msnumber":"","nonDraftVersions":[{"code":1,"date":"2026-03-13 05:17:56","doi":"10.21203/rs.3.rs-9098544/v1","editorialEvents":[{"type":"communityComments","content":0}],"status":"published","journal":{"display":true,"email":"[email protected]","identity":"researchsquare","isNatureJournal":false,"hasQc":true,"allowDirectSubmit":true,"externalIdentity":"","sideBox":"","snPcode":"","submissionUrl":"/submission","title":"Research Square","twitterHandle":"researchsquare","acdcEnabled":true,"dfaEnabled":false,"editorialSystem":"","reportingPortfolio":"","inReviewEnabled":false,"inReviewRevisionsEnabled":true}}],"origin":"","ownerIdentity":"4c3c0efd-f55a-4a4c-836f-2de96566647d","owner":[],"postedDate":"March 13th, 2026","published":true,"recentEditorialEvents":[],"rejectedJournal":[],"revision":"","amendment":"","status":"posted","subjectAreas":[],"tags":[],"updatedAt":"2026-03-13T05:17:56+00:00","versionOfRecord":[],"versionCreatedAt":"2026-03-13 05:17:56","video":"","vorDoi":"","vorDoiUrl":"","workflowStages":[]},"version":"v1","identity":"rs-9098544","journalConfig":"researchsquare"},"__N_SSP":true},"page":"/article/[identity]/[[...version]]","query":{"redirect":"/article/rs-9098544","identity":"rs-9098544","version":["v1"]},"buildId":"XKTyCvWXoU3ODBz1xrDgd","isFallback":false,"isExperimentalCompile":false,"dynamicIds":[84888],"gssp":true,"scriptLoader":[]}

Text is read by the "Ask this paper" AI Q&A widget below. Extraction quality varies by source — PMC NXML preserves structure cleanly, OA-HTML may include some navigation residue, and OA-PDF can have broken hyphenation. The publisher copy (via DOI) is the canonical version.

My notes (saved in your browser only)

Ask this paper AI returns verbatim quotes from the full text · source: preprint-html

Answers must be backed by verbatim quotes from this paper's full text. Hallucinated quotes are dropped automatically; if no verbatim passage answers the question, we say so. How this works

Citation neighborhood (no data yet)

We don't have any in-corpus citations linked to this paper yet. This is a recent paper (2026) — citers typically take a year or two to land, and the OpenAlex reference graph may still be filling in.

Source provenance

europepmc
last seen: 2026-05-20T01:45:00.602351+00:00