{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,12]],"date-time":"2026-05-12T17:09:59Z","timestamp":1778605799123,"version":"3.51.4"},"reference-count":57,"publisher":"Springer Science and Business Media LLC","issue":"12","license":[{"start":{"date-parts":[[2019,6,28]],"date-time":"2019-06-28T00:00:00Z","timestamp":1561680000000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2019,6,28]],"date-time":"2019-06-28T00:00:00Z","timestamp":1561680000000},"content-version":"vor","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Neural Comput & Applic"],"published-print":{"date-parts":[[2020,6]]},"DOI":"10.1007\/s00521-019-04293-8","type":"journal-article","created":{"date-parts":[[2019,6,28]],"date-time":"2019-06-28T08:02:51Z","timestamp":1561708971000},"page":"8217-8243","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":24,"title":["Solving a new cost-oriented assembly line balancing problem by classical and hybrid meta-heuristic algorithms"],"prefix":"10.1007","volume":"32","author":[{"given":"Maryam","family":"Salehi","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Hamid Reza","family":"Maleki","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Sadegh","family":"Niroomand","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2019,6,28]]},"reference":[{"key":"4293_CR1","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/S0925-5273(99)00095-X","volume":"68","author":"M Amen","year":"2000","unstructured":"Amen M (2000) Heuristic methods for cost-oriented assembly line balancing: a survey. Int J Prod Econ 68:1\u201314","journal-title":"Int J Prod Econ"},{"key":"4293_CR2","doi-asserted-by":"publisher","first-page":"187","DOI":"10.1016\/S0925-5273(99)00057-2","volume":"64","author":"M Amen","year":"2000","unstructured":"Amen M (2000) An exact method for cost-oriented assembly line balancing. Int J Prod Econ 64:187\u2013195","journal-title":"Int J Prod Econ"},{"key":"4293_CR3","doi-asserted-by":"publisher","first-page":"747","DOI":"10.1016\/j.ejor.2004.07.026","volume":"168","author":"M Amen","year":"2006","unstructured":"Amen M (2006) Cost-oriented assembly line balancing model formulations, solution difficulty, upper and lower bounds. Eur J Oper Res 168:747\u2013770","journal-title":"Eur J Oper Res"},{"key":"4293_CR4","volume-title":"Experimental quality-a strategic approach to achieve and improve quality","author":"J Antony","year":"1999","unstructured":"Antony J, Kaye M (1999) Experimental quality-a strategic approach to achieve and improve quality. Kluwer Academic Publishers, Norwell"},{"key":"4293_CR5","doi-asserted-by":"publisher","first-page":"3095","DOI":"10.1080\/002075497194309","volume":"35","author":"R Askin","year":"1997","unstructured":"Askin R, Zhou M (1997) A parallel station heuristic for the mixed-model production line balancing problem. Int J Prod Res 35:3095\u2013105","journal-title":"Int J Prod Res"},{"issue":"1","key":"4293_CR6","doi-asserted-by":"publisher","first-page":"237","DOI":"10.1007\/s00521-013-1477-9","volume":"25","author":"Y Atasagun","year":"2014","unstructured":"Atasagun Y, Kara Y (2014) Bacterial foraging optimization algorithm for assembly line balancing. Neural Comput Appl 25(1):237\u2013250","journal-title":"Neural Comput Appl"},{"key":"4293_CR7","first-page":"242","volume":"3","author":"Y Bai","year":"2009","unstructured":"Bai Y, Zhao H, Zhu L (2009) Mixed-model assembly line balancing using the hybrid genetic algorithm. ICMTMA 3:242\u2013245","journal-title":"ICMTMA"},{"issue":"2","key":"4293_CR8","doi-asserted-by":"publisher","first-page":"259","DOI":"10.1016\/j.ijpe.2012.10.020","volume":"142","author":"O Batta\u00efa","year":"2013","unstructured":"Batta\u00efa O, Dolgui A (2013) A taxonomy of line balancing problems and their solution approaches. Int J Prod Econ 142(2):259\u2013277","journal-title":"Int J Prod Econ"},{"key":"4293_CR9","doi-asserted-by":"publisher","first-page":"582","DOI":"10.1007\/s00170-006-0861-3","volume":"36","author":"A Baykasoglu","year":"2008","unstructured":"Baykasoglu A, Dereli T (2008) Two-sided assembly line balancing using an ant-colony-based heuristic. Int J Adv Manuf Technol 36:582\u2013588","journal-title":"Int J Adv Manuf Technol"},{"key":"4293_CR10","doi-asserted-by":"publisher","first-page":"217","DOI":"10.1007\/s10845-005-6638-y","volume":"17","author":"A Baykasoglu","year":"2006","unstructured":"Baykasoglu A (2006) Multi-rule multi-objective simulated annealing algorithm for straight and U type assembly line balancing problems. J Intell Manuf 17:217\u2013232","journal-title":"J Intell Manuf"},{"issue":"3","key":"4293_CR11","doi-asserted-by":"publisher","first-page":"694","DOI":"10.1016\/j.ejor.2004.07.023","volume":"168","author":"C Becker","year":"2006","unstructured":"Becker C, Scholl A (2006) A survey on problems and methods in generalized assembly line balancing. Eur J Oper Res 168(3):694\u2013715","journal-title":"Eur J Oper Res"},{"key":"4293_CR12","unstructured":"Chong KE, Omar, MK, Baker NA (2008) Solving assembly line balancing problem using genetic algorithm with heuristic treated initial population. In: Proceedings of the world congress on engineering. ISBN:978-988-17012-3-7"},{"key":"4293_CR13","doi-asserted-by":"publisher","first-page":"287","DOI":"10.1016\/j.ijpe.2008.11.017","volume":"120","author":"IS Cuoglu","year":"2009","unstructured":"Cuoglu IS, Erel E, Alp A (2009) Ant colony optimization for the single model U-type assembly line balancing problem. Int J Prod Econ 120:287\u2013300","journal-title":"Int J Prod Econ"},{"key":"4293_CR14","doi-asserted-by":"publisher","first-page":"183","DOI":"10.1016\/j.cor.2016.03.003","volume":"72","author":"L Deming","year":"2016","unstructured":"Deming L, Xiuping G (2016) Variable neighborhood search for the second type of two-sided assembly line balancing problem. Comput Oper Res 72:183\u2013188","journal-title":"Comput Oper Res"},{"key":"4293_CR15","doi-asserted-by":"publisher","first-page":"53","DOI":"10.1016\/j.renene.2011.12.013","volume":"44","author":"Y Eroglu","year":"2012","unstructured":"Eroglu Y, Se\u00e7kiner SU (2012) Design of wind farm layout using ant colony algorithm. Renew Energy 44:53\u201362","journal-title":"Renew Energy"},{"issue":"5","key":"4293_CR16","doi-asserted-by":"publisher","first-page":"414","DOI":"10.1080\/095372898233902","volume":"9","author":"E Erel","year":"1998","unstructured":"Erel E, Sarin SC (1998) A survey of the assembly line balancing procedures. Prod Plan Control 9(5):414\u2013434","journal-title":"Prod Plan Control"},{"key":"4293_CR17","doi-asserted-by":"publisher","first-page":"363","DOI":"10.1007\/s00170-010-2832-y","volume":"53","author":"P Fattahi","year":"2011","unstructured":"Fattahi P, Roshani A, Roshani A (2011) A mathematical model and ant colony algorithm for multi-manned assembly line balancing problem. Int J Adv Manuf Technol 53:363\u2013378","journal-title":"Int J Adv Manuf Technol"},{"issue":"3","key":"4293_CR18","doi-asserted-by":"publisher","first-page":"190","DOI":"10.1287\/ijoc.1.3.190","volume":"1","author":"F Glover","year":"1989","unstructured":"Glover F (1989) Tabu search, part i. ORSA J Comput 1(3):190\u2013206","journal-title":"ORSA J Comput"},{"issue":"2","key":"4293_CR19","doi-asserted-by":"publisher","first-page":"308","DOI":"10.1287\/mnsc.11.2.308","volume":"11","author":"AL Gutjahr","year":"1964","unstructured":"Gutjahr AL, Nemhauser GL (1964) An algorithm for the line balancing problem. Manag Sci 11(2):308\u2013315","journal-title":"Manag Sci"},{"issue":"2","key":"4293_CR20","doi-asserted-by":"publisher","first-page":"57","DOI":"10.4018\/IJSDS.2016040104","volume":"7","author":"A Heydari","year":"2016","unstructured":"Heydari A, Mahmoodirad A, Niroomand S (2016) An entropy-based mathematical formulation for straight assembly line balancing problem. Int J Strat Decision Sci (IJSDS) 7(2):57\u201368","journal-title":"Int J Strat Decision Sci (IJSDS)"},{"key":"4293_CR21","volume-title":"Adaptation in natural and artificial systems: an introductory analysis with applications to biology, control and artificial intelligence","author":"JH Holland","year":"1975","unstructured":"Holland JH (1975) Adaptation in natural and artificial systems: an introductory analysis with applications to biology, control and artificial intelligence. MIT Press, Cambridge"},{"key":"4293_CR22","doi-asserted-by":"publisher","DOI":"10.1007\/s00521-013-1357-3","author":"C Hsu","year":"2013","unstructured":"Hsu C (2013) Application of SVR, Taguchi loss function, and the artificial bee colony algorithm to resolve multiresponse parameter design problems: a case study on optimizing the design of a TIR lens. Neural Comput Appl. \n                  https:\/\/doi.org\/10.1007\/s00521-013-1357-3","journal-title":"Neural Comput Appl"},{"key":"4293_CR23","doi-asserted-by":"publisher","first-page":"1111","DOI":"10.1007\/s00170-010-3120-6","volume":"55","author":"SM Kazemi","year":"2011","unstructured":"Kazemi SM, Ghodsi R, Rabbani M, Tavakkoli-Moghaddam R (2011) A novel two-stage genetic algorithm for a mixed-model U-line balancing problem with duplicated tasks. Int J Adv Manuf Technol 55:1111\u20131122","journal-title":"Int J Adv Manuf Technol"},{"issue":"3","key":"4293_CR24","doi-asserted-by":"publisher","first-page":"397","DOI":"10.1016\/0360-8352(96)00009-5","volume":"30","author":"YK Kim","year":"1996","unstructured":"Kim YK, Kim YJU, Kim Y (1996) Genetic algorithms for assembly line balancing with various objectives. Comput Ind Eng 30(3):397\u2013409","journal-title":"Comput Ind Eng"},{"issue":"4598","key":"4293_CR25","doi-asserted-by":"publisher","first-page":"671","DOI":"10.1126\/science.220.4598.671","volume":"220","author":"S Kirkpatrick","year":"1983","unstructured":"Kirkpatrick S, Gelatt CD, Vecchi MP (1983) Optimization by simulated annealing. Science 220(4598):671\u2013680","journal-title":"Science"},{"key":"4293_CR26","doi-asserted-by":"publisher","DOI":"10.1007\/s00521-017-2855-5","author":"Z Li","year":"2017","unstructured":"Li Z, Dey N, Ashour AS, Tang Q (2017) Discrete cuckoo search algorithms for two-sided robotic assembly line balancing problem. Neural Comput Appl. \n                  https:\/\/doi.org\/10.1007\/s00521-017-2855-5","journal-title":"Neural Comput Appl"},{"key":"4293_CR27","doi-asserted-by":"publisher","first-page":"1939","DOI":"10.1007\/s00170-013-5383-1","volume":"70","author":"A Mahmoodi-Rad","year":"2014","unstructured":"Mahmoodi-Rad A, Molla-Alizadeh-Zavardehi S, Dehghan R, Sanei M, Niroomand S (2014) Genetic and differential evolution algorithms for the allocation of customers to potential distribution centers in a fuzzy environment. Int J Adv Manuf Technol 70:1939\u20131954. \n                  https:\/\/doi.org\/10.1007\/s00170-013-5383-1","journal-title":"Int J Adv Manuf Technol"},{"issue":"11","key":"4293_CR28","doi-asserted-by":"publisher","first-page":"3323","DOI":"10.1007\/s00521-016-2254-3","volume":"28","author":"HR Maleki","year":"2017","unstructured":"Maleki HR, Khanduzi R, Akbari R (2017) A novel hybrid algorithm for solving continuous single-objective defensive location problem. Neural Comput Appl 28(11):3323\u20133340","journal-title":"Neural Comput Appl"},{"key":"4293_CR29","doi-asserted-by":"publisher","first-page":"669","DOI":"10.1016\/j.cie.2012.11.010","volume":"64","author":"N Manavizadeh","year":"2013","unstructured":"Manavizadeh N, Hosseini NS, Rabbani M, Jolai F (2013) A simulated annealing algorithm for a mixed model assembly U-line balancing type-I problem considering human efficiency and JustIn-time approach. Comput Ind Eng 64:669\u2013685","journal-title":"Comput Ind Eng"},{"key":"4293_CR30","doi-asserted-by":"publisher","first-page":"12026","DOI":"10.1016\/j.eswa.2012.03.044","volume":"39","author":"N Manavizadeh","year":"2012","unstructured":"Manavizadeh N, Rabbani M, Moshtaghi D, Jolai F (2012) Mixed-model assembly line balancing in the make-to-order and stochastic environment using multi-objective evolutionary algorithms. Expert Syst Appl 39:12026\u201312031","journal-title":"Expert Syst Appl"},{"key":"4293_CR31","doi-asserted-by":"publisher","first-page":"10462","DOI":"10.1016\/j.eswa.2011.02.093","volume":"38","author":"S Molla-Alizadeh-Zavardehi","year":"2011","unstructured":"Molla-Alizadeh-Zavardehi S, Hajiaghaei-Keshteli M, Tavakkoli-Moghaddam R (2011) Solving a capacitated fixed-charge transportation problem by artificial immune and genetic algorithms with a Pr\u00fcfer number representation. Expert Syst Appl 38:10462\u201310474. \n                  https:\/\/doi.org\/10.1016\/j.eswa.2011.02.093","journal-title":"Expert Syst Appl"},{"issue":"6","key":"4293_CR32","doi-asserted-by":"publisher","first-page":"1379","DOI":"10.1007\/s00521-014-1811-x","volume":"26","author":"J Mukund Nilakantan","year":"2015","unstructured":"Mukund Nilakantan J, Ponnambalam SG, Jawahar N et al (2015) Bio-inspired search algorithms to solve robotic assembly line balancing problems. Neural Comput Appl 26(6):1379\u20131393","journal-title":"Neural Comput Appl"},{"key":"4293_CR33","doi-asserted-by":"publisher","first-page":"9625","DOI":"10.1016\/j.eswa.2008.09.063","volume":"36","author":"B Naderi","year":"2009","unstructured":"Naderi B, Zandieh M, Ghoshe Balagh AK, Roshanaei V (2009) An improved simulated annealing for hybrid flow shops with sequence-dependent setup and transportation times to minimize total completion time and total tardiness. Expert Syst Appl 36:9625\u20139633. \n                  https:\/\/doi.org\/10.1016\/j.eswa.2008.09.063","journal-title":"Expert Syst Appl"},{"key":"4293_CR34","doi-asserted-by":"publisher","first-page":"46","DOI":"10.1016\/j.jmsy.2015.02.007","volume":"36","author":"D Ogan","year":"2015","unstructured":"Ogan D, Azizoglu M (2015) A branch and bound method for the line balancing problem in U-shaped assembly lines with equipment requirements. J Manuf Syst 36:46\u201354","journal-title":"J Manuf Syst"},{"key":"4293_CR35","doi-asserted-by":"publisher","first-page":"123","DOI":"10.1007\/s10845-008-0108-2","volume":"20","author":"U Ozcan","year":"2009","unstructured":"Ozcan U, Toklu B (2009) A new hybrid improvement heuristic approach to simple straight and U-type assembly line balancing problems. J Intell Manuf 20:123\u2013136","journal-title":"J Intell Manuf"},{"key":"4293_CR36","doi-asserted-by":"publisher","first-page":"341","DOI":"10.1007\/s001700050166","volume":"16","author":"SG Ponnambalam","year":"2000","unstructured":"Ponnambalam SG, Aravindan P, Naidu GM (2000) A multiobjective genetic algorithm for solving assembly line balancing problem. Int J Adv Manuf Technol 16:341\u2013352","journal-title":"Int J Adv Manuf Technol"},{"issue":"6","key":"4293_CR37","doi-asserted-by":"publisher","first-page":"477","DOI":"10.1007\/BF01416240","volume":"36","author":"O Rosenberg","year":"1992","unstructured":"Rosenberg O, Ziegler H (1992) A comparison of heuristic algorithms for cost-oriented assembly line balancing. Math Methods Oper Res 36(6):477\u2013495","journal-title":"Math Methods Oper Res"},{"issue":"8","key":"4293_CR38","doi-asserted-by":"publisher","first-page":"689","DOI":"10.1080\/0951192X.2012.664786","volume":"25","author":"A Roshani","year":"2012","unstructured":"Roshani A, Fattahi P, Roshani A, Salehi M, Roshani A (2012) Cost-oriented two-sided assembly line balancing problem: a simulated annealing approach. Int J Comput Integr Manuf 25(8):689\u2013715","journal-title":"Int J Comput Integr Manuf"},{"issue":"1","key":"4293_CR39","doi-asserted-by":"publisher","first-page":"343","DOI":"10.1016\/0925-5273(95)00059-3","volume":"41","author":"J Rubinnovitz","year":"1995","unstructured":"Rubinnovitz J, Levitin G (1995) Genetic algorithm for assembly line balancing. Int J Prod Econ 41(1):343\u2013354","journal-title":"Int J Prod Econ"},{"key":"4293_CR40","doi-asserted-by":"publisher","first-page":"295","DOI":"10.1023\/A:1008923410076","volume":"11","author":"I Sabuncuoglu","year":"2000","unstructured":"Sabuncuoglu I, Erel R, Tanyer M (2000) Assembly line balancing using genetic algorithm. J Intell Manuf 11:295\u2013310","journal-title":"J Intell Manuf"},{"issue":"4","key":"4293_CR41","doi-asserted-by":"publisher","first-page":"4460","DOI":"10.1016\/j.eswa.2010.09.117","volume":"38","author":"R Sahin","year":"2011","unstructured":"Sahin R (2011) A simulated annealing algorithm for solving the bi-objective facility layout problem. Expert Syst Appl 38(4):4460\u20134465","journal-title":"Expert Syst Appl"},{"issue":"2","key":"4293_CR42","doi-asserted-by":"publisher","first-page":"308","DOI":"10.1016\/j.cie.2010.04.013","volume":"59","author":"R Sahin","year":"2010","unstructured":"Sahin R, Ertogral K, T\u00fcrkbey O (2010) A simulated annealing heuristic for the dynamic layout problem with budget constraint. Comput Ind Eng 59(2):308\u2013313","journal-title":"Comput Ind Eng"},{"issue":"24","key":"4293_CR43","doi-asserted-by":"publisher","first-page":"6855","DOI":"10.1080\/00207540802376323","volume":"47","author":"R Sahin","year":"2009","unstructured":"Sahin R, T\u00fcrkbey O (2009) A new hybrid tabu-simulated annealing heuristic for the dynamic facility layout problem. Int J Prod Res 47(24):6855\u20136873","journal-title":"Int J Prod Res"},{"key":"4293_CR44","doi-asserted-by":"publisher","first-page":"1003","DOI":"10.1007\/s00170-008-1530-5","volume":"41","author":"R Sahin","year":"2009","unstructured":"Sahin R, T\u00fcrkbey O (2009) A simulated annealing algorithm to find approximate Pareto optimal solutions for the multi-objective facility layout problem. Int J Adv Manuf Technol 41:1003\u20131018","journal-title":"Int J Adv Manuf Technol"},{"issue":"2","key":"4293_CR45","doi-asserted-by":"publisher","first-page":"95","DOI":"10.1007\/s11465-014-0302-1","volume":"9","author":"U Saif","year":"2014","unstructured":"Saif U, Guan Z, Wang B, Mirza J, Huang S (2014) A survey on assembly lines and its types. Front Mech Eng 9(2):95\u2013105","journal-title":"Front Mech Eng"},{"key":"4293_CR46","doi-asserted-by":"publisher","first-page":"343","DOI":"10.1016\/j.ijpe.2004.09.009","volume":"97","author":"A Scholl","year":"2005","unstructured":"Scholl A, Becker C (2005) A note on \u201can exact method for cost-oriented assembly line balancing\u201d. Int J Prod Econ 97:343\u2013352","journal-title":"Int J Prod Econ"},{"key":"4293_CR47","doi-asserted-by":"publisher","first-page":"666","DOI":"10.1016\/j.ejor.2004.07.022","volume":"168","author":"A Scholl","year":"2006","unstructured":"Scholl A, Becker C (2006) State-of-the-art exact and heuristic solution procedures for simple assembly line balancing. Eur J Oper Res 168:666\u2013693","journal-title":"Eur J Oper Res"},{"key":"4293_CR48","unstructured":"Scholl A (1997) Data of assembly line balancing problems. Technische Hochschule Darmstadt, Institut f\u00fcr Betriebswirtschaftslehre Hochschulstra\u00dfe 1, D-64289 Darmstadt, Germany"},{"key":"4293_CR49","first-page":"4163","volume":"219","author":"SU Se\u00e7kiner","year":"2013","unstructured":"Se\u00e7kiner SU, Eroglu Y, Emrullah M, Dereli T (2013) Ant colony optimization for continuous functions by using novel pheromone updating. Appl Math Comput 219:4163\u20134175","journal-title":"Appl Math Comput"},{"issue":"3","key":"4293_CR50","doi-asserted-by":"publisher","first-page":"805","DOI":"10.1080\/00207540903471486","volume":"49","author":"SA Seyed-Alagheband","year":"2011","unstructured":"Seyed-Alagheband SA, Ghomi SMTF, Zandieh M (2011) A simulated annealing algorithm for balancing the assembly line type II problem with sequence-dependent setup times between tasks. Int J Prod Res 49(3):805\u2013825","journal-title":"Int J Prod Res"},{"issue":"2","key":"4293_CR51","doi-asserted-by":"publisher","first-page":"489","DOI":"10.1016\/j.cie.2007.10.007","volume":"56","author":"AS Simaria","year":"2009","unstructured":"Simaria AS, Vilarinho PM (2009) 2-ANTBAL: an ant colony optimization for balancing two-sided assembly lines. Comput Ind Eng 56(2):489\u2013506. \n                  https:\/\/doi.org\/10.1016\/j.cie.2007.10.007","journal-title":"Comput Ind Eng"},{"key":"4293_CR52","doi-asserted-by":"publisher","first-page":"290","DOI":"10.1016\/j.jmsy.2014.08.004","volume":"37","author":"B Sungur","year":"2015","unstructured":"Sungur B, Yavuz Y (2015) Assembly line balancing with hierarchical worker assignment. J Manuf Syst 37:290\u2013298","journal-title":"J Manuf Syst"},{"key":"4293_CR53","volume-title":"Introduction to quality engineering","author":"G Taguchi","year":"1986","unstructured":"Taguchi G (1986) Introduction to quality engineering. Asian Productivity Organization\/UNIPUB, White Plains"},{"key":"4293_CR54","doi-asserted-by":"publisher","first-page":"733","DOI":"10.1007\/s00170-010-2847-4","volume":"53","author":"R Tavakkoli-Moghaddam","year":"2011","unstructured":"Tavakkoli-Moghaddam R, Azarkish M, Sadeghnejad-Barkousaraie A (2011) Solving a multi-objective job shop scheduling problem with sequence-dependent setup times by a Pareto archive PSO combined with genetic operators and VNS. Int J Adv Manuf Technol 53:733\u2013750","journal-title":"Int J Adv Manuf Technol"},{"issue":"2","key":"4293_CR55","first-page":"445","volume":"176","author":"R Tavakkoli-Moghaddam","year":"2006","unstructured":"Tavakkoli-Moghaddam R, Safaei N, Gholipour Y (2006) A hybrid simulated annealing for capacitated vehicle routing problems with the independent route length. Appl Math Comput 176(2):445\u2013454","journal-title":"Appl Math Comput"},{"issue":"4","key":"4293_CR56","doi-asserted-by":"publisher","first-page":"550","DOI":"10.1016\/j.ress.2007.02.009","volume":"93","author":"R Tavakkoli-Moghaddam","year":"2008","unstructured":"Tavakkoli-Moghaddam R, Safarib J, Sassani F (2008) Reliability optimization of series-parallel systems with a choice of redundancy strategies using a genetic algorithm. Reliab Eng Syst Saf 93(4):550\u2013556","journal-title":"Reliab Eng Syst Saf"},{"key":"4293_CR57","doi-asserted-by":"publisher","first-page":"84","DOI":"10.1016\/j.ins.2014.02.084","volume":"272","author":"A Turky","year":"2014","unstructured":"Turky A, Salwani A (2014) A multi-population harmony search algorithm with external archive for dynamic optimization problems. Inf Sci 272:84\u201395","journal-title":"Inf Sci"}],"container-title":["Neural Computing and Applications"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00521-019-04293-8.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s00521-019-04293-8\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00521-019-04293-8.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,6,27]],"date-time":"2020-06-27T03:26:08Z","timestamp":1593228368000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s00521-019-04293-8"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019,6,28]]},"references-count":57,"journal-issue":{"issue":"12","published-print":{"date-parts":[[2020,6]]}},"alternative-id":["4293"],"URL":"https:\/\/doi.org\/10.1007\/s00521-019-04293-8","relation":{},"ISSN":["0941-0643","1433-3058"],"issn-type":[{"value":"0941-0643","type":"print"},{"value":"1433-3058","type":"electronic"}],"subject":[],"published":{"date-parts":[[2019,6,28]]},"assertion":[{"value":"28 March 2018","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"17 June 2019","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"28 June 2019","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":"The authors declare that they have no conflict of interest.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Conflict of interest"}},{"value":"This article does not contain any studies with human participants or animals performed by any of the authors.","order":3,"name":"Ethics","group":{"name":"EthicsHeading","label":"Ethical approval"}}]}}