{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,24]],"date-time":"2026-04-24T04:30:09Z","timestamp":1777005009170,"version":"3.51.4"},"reference-count":23,"publisher":"Springer Science and Business Media LLC","issue":"2","license":[{"start":{"date-parts":[[2020,6,18]],"date-time":"2020-06-18T00:00:00Z","timestamp":1592438400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2020,6,18]],"date-time":"2020-06-18T00:00:00Z","timestamp":1592438400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Neural Comput & Applic"],"published-print":{"date-parts":[[2021,1]]},"DOI":"10.1007\/s00521-020-05048-6","type":"journal-article","created":{"date-parts":[[2020,6,18]],"date-time":"2020-06-18T18:04:30Z","timestamp":1592503470000},"page":"525-534","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":29,"title":["Algorithms for solving assembly sequence planning problems"],"prefix":"10.1007","volume":"33","author":[{"given":"Yingying","family":"Su","sequence":"first","affiliation":[]},{"given":"Haixu","family":"Mao","sequence":"additional","affiliation":[]},{"given":"Xianzhao","family":"Tang","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2020,6,18]]},"reference":[{"key":"5048_CR1","doi-asserted-by":"crossref","unstructured":"Abdullah MA, Ab Rashid MFF, Ghazali Z (2019) A case study of energy efficient assembly sequence planning problem. In: IOP conference series materials science and engineering, vol 469, p 012013","DOI":"10.1088\/1757-899X\/469\/1\/012013"},{"key":"5048_CR2","doi-asserted-by":"crossref","unstructured":"Gunji AB, Deepak BBBVL, Bahubalendruni CMVAR (2018) An optimal robotic assembly sequence planning by assembly subsets detection method using teaching learning-based optimization algorithm. IEEE Trans Autom Sci Eng 15(3):1369\u20131385","DOI":"10.1109\/TASE.2018.2791665"},{"issue":"2","key":"5048_CR3","doi-asserted-by":"publisher","first-page":"276","DOI":"10.1007\/s12204-018-1937-6","volume":"23","author":"Q Jiao","year":"2018","unstructured":"Jiao Q, Xu D (2018) A discrete bat algorithm for disassembly sequence planning. J Shanghai Jiaotong Univ Sci 23(2):276\u2013285","journal-title":"J Shanghai Jiaotong Univ Sci"},{"issue":"2","key":"5048_CR4","first-page":"1","volume":"94","author":"H Ma","year":"2018","unstructured":"Ma H, Peng Q, Zhang J (2018) Assembly sequence planning for open-architecture products. Chin J Eng Des 94(2):1\u201314","journal-title":"Chin J Eng Des"},{"key":"5048_CR5","doi-asserted-by":"publisher","first-page":"347","DOI":"10.1007\/s00521-018-3834-1","volume":"31","author":"Y Li","year":"2019","unstructured":"Li Y, Wang H, Yang Z (2019) Type II assembly line balancing problem with multi-operators. Neural Appl 31:347\u2013357","journal-title":"Neural Comput & Applic"},{"issue":"6","key":"5048_CR6","first-page":"1243","volume":"23","author":"D Wang","year":"2017","unstructured":"Wang D, Shao X, Liu H (2017) Assembly sequence planning for panels of reflector antenna based on hybrid algorithm. Comput Integr Manuf Syst 23(6):1243\u20131252","journal-title":"Comput Integr Manuf Syst"},{"issue":"2","key":"5048_CR7","first-page":"831","volume":"33","author":"F Castronovo","year":"2017","unstructured":"Castronovo F, Van Meter PN, Zappe SE (2017) Developing problem-solving skills in construction education with the virtual construction simulator. Int J Eng Educ 33(2):831\u2013846","journal-title":"Int J Eng Educ"},{"key":"5048_CR8","doi-asserted-by":"publisher","first-page":"209","DOI":"10.1016\/j.ins.2015.08.020","volume":"342","author":"C Son","year":"2015","unstructured":"Son C (2015) Intelligent rule-based sequence planning algorithm with fuzzy optimization for robot manipulation tasks in partially dynamic environments. Inf Sci 342:209\u2013221","journal-title":"Inf Sci"},{"issue":"1\u20134","key":"5048_CR9","doi-asserted-by":"publisher","first-page":"987","DOI":"10.1007\/s00170-016-9822-7","volume":"91","author":"D Wang","year":"2017","unstructured":"Wang D, Shao X, Liu S (2017) Assembly sequence planning for reflector panels based on genetic algorithm and ant colony optimization. Int J Adv Manuf Technol 91(1\u20134):987\u2013997","journal-title":"Int J Adv Manuf Technol"},{"issue":"5\u20138","key":"5048_CR10","first-page":"1","volume":"90","author":"L Xin","year":"2017","unstructured":"Xin L, Jianzhong S, Yujun C (2017) An efficient method of automatic assembly sequence planning for aerospace industry based on genetic algorithm. Int J Adv Manuf Technol 90(5\u20138):1\u20139","journal-title":"Int J Adv Manuf Technol"},{"issue":"1\u20134","key":"5048_CR11","first-page":"1","volume":"90","author":"W Zhang","year":"2017","unstructured":"Zhang W, Ma M, Li H (2017) Generating interference matrices for automatic assembly sequence planning. Int J Adv Manuf Technol 90(1\u20134):1\u201315","journal-title":"Int J Adv Manuf Technol"},{"key":"5048_CR12","doi-asserted-by":"publisher","first-page":"2989","DOI":"10.1007\/s00521-019-04027-w","volume":"32","author":"M Yavari","year":"2020","unstructured":"Yavari M, Marvi M, Akbari AH (2020) Semi-permutation-based genetic algorithm for order acceptance and scheduling in two-stage assembly problem. Neural Comput Appl 32:2989\u20133003","journal-title":"Neural Comput Appl"},{"issue":"6","key":"5048_CR13","first-page":"1","volume":"93","author":"J Yu","year":"2017","unstructured":"Yu J, Zhang J (2017) Hierarchical exploded view generation based on recursive assembly sequence planning. Int J Adv Manuf Technol 93(6):1\u201322","journal-title":"Int J Adv Manuf Technol"},{"issue":"5\u20138","key":"5048_CR14","first-page":"1","volume":"90","author":"M Kheder","year":"2017","unstructured":"Kheder M, Trigui M, Aifaoui N (2017) Optimization of disassembly sequence planning for preventive maintenance. Int J Adv Manuf Technol 90(5\u20138):1\u201313","journal-title":"Int J Adv Manuf Technol"},{"issue":"13","key":"5048_CR15","doi-asserted-by":"publisher","first-page":"175","DOI":"10.3901\/JME.2016.13.175","volume":"52","author":"J Yu","year":"2016","unstructured":"Yu J, Wang J (2016) Automatic generation of hierarchical exploded view based on recursive iteration method. J Mech Eng 52(13):175\u2013188","journal-title":"J Mech Eng"},{"issue":"2","key":"5048_CR16","doi-asserted-by":"publisher","first-page":"138","DOI":"10.1108\/AA-11-2015-094","volume":"36","author":"B Song","year":"2016","unstructured":"Song B, Wang Z, Sheng L (2016) A new genetic algorithm approach to smooth path planning for mobile robots. Assem Autom 36(2):138\u2013145","journal-title":"Assem Autom"},{"issue":"2","key":"5048_CR17","doi-asserted-by":"publisher","first-page":"950","DOI":"10.1109\/TASE.2015.2432746","volume":"13","author":"D Spensieri","year":"2016","unstructured":"Spensieri D, Carlson JS, Ekstedt F et al (2016) An iterative approach for collision free routing and scheduling in multirobot stations. IEEE Trans Autom Sci Eng 13(2):950\u2013962","journal-title":"IEEE Trans Autom Sci Eng"},{"key":"5048_CR18","doi-asserted-by":"crossref","unstructured":"Hadj RB, Trigui M, Aifaoui N (2015) Integrated CAD approach for generating assembly sequence plans based on collision study results. Lecture Notes in Control & Information Sciences, vol 789, pp 63\u201372","DOI":"10.1007\/978-3-319-17527-0_7"},{"issue":"9","key":"5048_CR19","doi-asserted-by":"publisher","first-page":"715","DOI":"10.1111\/mice.12121","volume":"30","author":"J-S Chou","year":"2015","unstructured":"Chou J-S, Pham A-D (2015) Smart artificial firefly colony algorithm-based support vector regression for enhanced forecasting in civil engineering. Comput-Aided Civ Infrastruct Eng 30(9):715\u2013732","journal-title":"Comput-Aided Civ Infrastruct Eng"},{"issue":"4","key":"5048_CR20","first-page":"799","volume":"20","author":"B Zeng","year":"2014","unstructured":"Zeng B, Li M, Zhang Y (2014) Assembly sequence planning based on improved firefly algorithm. Comput Integr Manuf Syst 20(4):799\u2013806","journal-title":"Comput Integr Manuf Syst"},{"issue":"5","key":"5048_CR21","doi-asserted-by":"publisher","first-page":"969","DOI":"10.21629\/JSEE.2018.05.09","volume":"29","author":"M Tang","year":"2018","unstructured":"Tang M, Chen S, Zheng X (2018) Sensors deployment optimization in multi-dimensional space based on improved particle swarm optimization algorithm. J Syst Eng Electron 29(5):969\u2013982","journal-title":"J Syst Eng Electron"},{"issue":"3","key":"5048_CR22","first-page":"173","volume":"34","author":"Y Xu","year":"2018","unstructured":"Xu Y, Zhu C, Li C (2018) Field crop segmentation based on color coefficient reverse mutation particle swarm optimization algorithm. Trans Chin Soc Agric Eng 34(3):173\u2013179","journal-title":"Trans Chin Soc Agric Eng"},{"issue":"3","key":"5048_CR23","first-page":"2365","volume":"38","author":"R Li","year":"2018","unstructured":"Li R, Huang J, Chen C (2018) Hybrid precoding scheme based on improved particle swarm optimization algorithm in mm Wave massive MIMO system. J Comput Appl 38(3):2365\u20132369","journal-title":"J Comput Appl"}],"container-title":["Neural Computing and Applications"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s00521-020-05048-6.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s00521-020-05048-6\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s00521-020-05048-6.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,6,17]],"date-time":"2021-06-17T23:38:01Z","timestamp":1623973081000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s00521-020-05048-6"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2020,6,18]]},"references-count":23,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2021,1]]}},"alternative-id":["5048"],"URL":"https:\/\/doi.org\/10.1007\/s00521-020-05048-6","relation":{},"ISSN":["0941-0643","1433-3058"],"issn-type":[{"value":"0941-0643","type":"print"},{"value":"1433-3058","type":"electronic"}],"subject":[],"published":{"date-parts":[[2020,6,18]]},"assertion":[{"value":"7 February 2020","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"3 June 2020","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"18 June 2020","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}},{"order":1,"name":"Ethics","group":{"name":"EthicsHeading","label":"Compliance with ethical standards"}},{"value":"There are no potential competing interests in our paper. And all authors have seen the manuscript and approved to submit to your journal. We confirm that the content of the manuscript has not been published or submitted for publication elsewhere.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Conflict of interest"}}]}}