{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,25]],"date-time":"2026-03-25T06:23:19Z","timestamp":1774419799240,"version":"3.50.1"},"reference-count":52,"publisher":"Springer Science and Business Media LLC","issue":"3","license":[{"start":{"date-parts":[[2018,10,12]],"date-time":"2018-10-12T00:00:00Z","timestamp":1539302400000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Appl Intell"],"published-print":{"date-parts":[[2019,3]]},"DOI":"10.1007\/s10489-018-1309-9","type":"journal-article","created":{"date-parts":[[2018,10,12]],"date-time":"2018-10-12T07:23:07Z","timestamp":1539328987000},"page":"963-982","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":11,"title":["Transfer of learning with the co-evolutionary decomposition-based algorithm-II: a realization on the bi-level production-distribution planning system"],"prefix":"10.1007","volume":"49","author":[{"ORCID":"https:\/\/orcid.org\/0000-0003-0283-6111","authenticated-orcid":false,"given":"Abir","family":"Chaabani","sequence":"first","affiliation":[]},{"given":"Lamjed Ben","family":"Said","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2018,10,12]]},"reference":[{"key":"1309_CR1","first-page":"444","volume":"6","author":"E Aiyoshi","year":"1981","unstructured":"Aiyoshi E, Shimizu K (1981) Hierarchical decentralized systems and its new solution by a barrier method. IEEE Trans Syst Man Cybern 6:444\u2013449","journal-title":"IEEE Trans Syst Man Cybern"},{"key":"1309_CR2","unstructured":"Augerat P, Belenguer JM, Benavent E, Corber\u00e1n A, Naddef D, Rinaldi G (1998) Computational results with a branch-and-cut code for the capacitated vehicle routing problem. Rapport de recherche- IMAG"},{"issue":"1","key":"1309_CR3","doi-asserted-by":"publisher","first-page":"77","DOI":"10.1016\/0305-0548(82)90007-7","volume":"9","author":"JF Bard","year":"1982","unstructured":"Bard JF, Falk J (1982) An explicit solution to the multi-level programming problem. Comput Oper Res 9 (1):77\u2013100","journal-title":"Comput Oper Res"},{"issue":"14","key":"1309_CR4","doi-asserted-by":"publisher","first-page":"e49","DOI":"10.1093\/bioinformatics\/btl242","volume":"22","author":"KM Borgwardt","year":"2006","unstructured":"Borgwardt KM, Gretton A, Rasch MJ, Kriegel H-P, Sch\u00f6lkopf B, Smola A (2006) Integrating structured biological data by kernel maximum mean discrepancy. Bioinformatics 22(14):e49\u2013e57","journal-title":"Bioinformatics"},{"issue":"1","key":"1309_CR5","doi-asserted-by":"publisher","first-page":"37","DOI":"10.1287\/opre.21.1.37","volume":"21","author":"J Bracken","year":"1973","unstructured":"Bracken J, McGill J (1973) Mathematical programs with optimization problems in the constraints. Oper Res 21(1):37\u201344","journal-title":"Oper Res"},{"key":"1309_CR6","doi-asserted-by":"crossref","unstructured":"Calvete HI, Gal\u00e9 C (2010) A multiobjective bilevel program for production-distribution planning in a supply chain. Springer, pp 155\u2013165","DOI":"10.1007\/978-3-642-04045-0_13"},{"issue":"1","key":"1309_CR7","doi-asserted-by":"publisher","first-page":"320","DOI":"10.1016\/j.cor.2010.05.007","volume":"38","author":"HI Calvete","year":"2011","unstructured":"Calvete HI, Gal\u00e9 C, Oliveros M (2011) Bilevel model for production\u2013distribution planning solved by using ant colony optimization. Comput Oper Res 38(1):320\u2013327","journal-title":"Comput Oper Res"},{"key":"1309_CR8","doi-asserted-by":"crossref","unstructured":"Calvete HI, Gal\u00e9 C, Oliveros M-J (2013) A hybrid algorithm for solving a bilevel production-distribution planning problem. In: Modeling and simulation in engineering, economics, and management. Springer, pp 138\u2013144","DOI":"10.1007\/978-3-642-38279-6_15"},{"key":"1309_CR9","unstructured":"Candler W, Norton R (1977) Multilevel programming. Tech. rep. Technical Report 20. World Bank Development Research, Washington D. C"},{"key":"1309_CR10","doi-asserted-by":"crossref","unstructured":"Chaabani A, Bechikh S, Ben Said L, Azzouz R (2015) An improved co-evolutionary decomposition-based algorithm for bi-level combinatorial optimization. In: Proceedings of the companion publication of the 2015 annual conference on genetic and evolutionary computation. ACM, pp 1363\u20131364","DOI":"10.1145\/2739482.2764701"},{"key":"1309_CR11","doi-asserted-by":"crossref","unstructured":"Chaabani A, Bechikh S, Said LB (2015) A co-evolutionary decomposition-based algorithm for bi-level combinatorial optimization. In: 2015 IEEE Congress on evolutionary computation (CEC). IEEE, pp 1659\u20131666","DOI":"10.1109\/CEC.2015.7257086"},{"issue":"5","key":"1309_CR12","doi-asserted-by":"publisher","first-page":"591","DOI":"10.1109\/TEVC.2011.2132725","volume":"15","author":"X Chen","year":"2011","unstructured":"Chen X, Ong Y-S, Lim M-H, Tan K (2011) A multi-facet survey on memetic computation. IEEE Trans Evol Comput 15(5):591\u2013607","journal-title":"IEEE Trans Evol Comput"},{"issue":"3","key":"1309_CR13","doi-asserted-by":"publisher","first-page":"309","DOI":"10.1057\/jors.1969.75","volume":"20","author":"N Christofides","year":"1969","unstructured":"Christofides N, Eilon S (1969) An algorithm for the vehicle-dispatching problem. J Oper Res Soc 20 (3):309\u2013318","journal-title":"J Oper Res Soc"},{"issue":"1","key":"1309_CR14","doi-asserted-by":"publisher","first-page":"235","DOI":"10.1007\/s10479-007-0176-2","volume":"153","author":"B Colson","year":"2007","unstructured":"Colson B, Marcotte P, Savard G (2007) An overview of bilevel optimization. Ann Oper Res 153 (1):235\u2013256","journal-title":"Ann Oper Res"},{"issue":"2","key":"1309_CR15","doi-asserted-by":"publisher","first-page":"105","DOI":"10.1002\/(SICI)1097-0037(199709)30:2<105::AID-NET5>3.0.CO;2-G","volume":"30","author":"J-F Cordeau","year":"1997","unstructured":"Cordeau J-F, Gendreau M, Laporte G (1997) A tabu search heuristic for periodic and multi-depot vehicle routing problems. Networks 30(2):105\u2013119","journal-title":"Networks"},{"issue":"3","key":"1309_CR16","doi-asserted-by":"publisher","first-page":"403","DOI":"10.1162\/EVCO_a_00015","volume":"18","author":"K Deb","year":"2010","unstructured":"Deb K, Sinha A (2010) An efficient and accurate solution methodology for bilevel multi-objective programming problems using a hybrid evolutionary-local-search algorithm. Evol Comput 18(3):403\u2013449","journal-title":"Evol Comput"},{"key":"1309_CR17","doi-asserted-by":"crossref","unstructured":"Dempe S (2003) Annotated bibliography on bilevel programming and mathematical programs with equilibrium constraints","DOI":"10.1080\/0233193031000149894"},{"key":"1309_CR18","doi-asserted-by":"crossref","unstructured":"Dempe S, Kalashnikov VV, Kalashnykova N (2006) Optimality conditions for bilevel programming problems. In: Optimization with multivalued mappings. Springer, pp 3\u201328","DOI":"10.1007\/0-387-34221-4_1"},{"issue":"1","key":"1309_CR19","doi-asserted-by":"publisher","first-page":"19","DOI":"10.1016\/j.swevo.2011.02.001","volume":"1","author":"AE Eiben","year":"2011","unstructured":"Eiben AE, Smit S (2011) Parameter tuning for configuring and analyzing evolutionary algorithms. Swarm Evol Comput 1(1):19\u201331","journal-title":"Swarm Evol Comput"},{"issue":"10","key":"1309_CR20","doi-asserted-by":"publisher","first-page":"1286","DOI":"10.1016\/j.epsr.2010.04.011","volume":"80","author":"AA El Ela","year":"2010","unstructured":"El Ela AA, Abido M, Spea S (2010) Differential evolution algorithm for emission constrained economic power dispatch problem. Electr Power Syst Res 80(10):1286\u20131292","journal-title":"Electr Power Syst Res"},{"issue":"3","key":"1309_CR21","doi-asserted-by":"publisher","first-page":"159","DOI":"10.1007\/s12293-015-0166-x","volume":"7","author":"L Feng","year":"2015","unstructured":"Feng L, Ong Y-S, Tan A-H, Tsang I (2015) Memes as building blocks: a case study on evolutionary optimization+ transfer learning for routing problems. Memetic Comput 7(3):159\u2013180","journal-title":"Memetic Comput"},{"issue":"2","key":"1309_CR22","doi-asserted-by":"publisher","first-page":"209","DOI":"10.1007\/s10957-006-9136-2","volume":"131","author":"J Fliege","year":"2006","unstructured":"Fliege J, Vicente L (2006) Multicriteria approach to bilevel optimization. J Optim Theory Appl 131 (2):209\u2013225","journal-title":"J Optim Theory Appl"},{"key":"1309_CR23","doi-asserted-by":"crossref","unstructured":"Fortuny-Amat J, McCarl B (1981) A representation and economic interpretation of a two-level programming problem. J Oper Res Soc, 783\u2013792","DOI":"10.1057\/jors.1981.156"},{"key":"1309_CR24","doi-asserted-by":"crossref","unstructured":"Gretton A, Bousquet O, Smola A, Sch\u00f6lkopf B (2005) Measuring statistical dependence with Hilbert-Schmidt norms. In: International conference on algorithmic learning theory, pp 63\u201377","DOI":"10.1007\/11564089_7"},{"key":"1309_CR25","unstructured":"Gretton A, Fukumizu K, Teo CH, Song L, Sch\u00f6lkopf B, Smola A (2008) A kernel statistical test of independence. Adv Neural Inf Process Syst, 585\u2013592"},{"key":"1309_CR26","unstructured":"Kolstad C (1985) A review of the literature on bi-level mathematical programming. Tech rep., Los Alamos National Laboratory Los Alamos, NM"},{"key":"1309_CR27","doi-asserted-by":"crossref","unstructured":"Kuhn H, Tucker A (1951a) Non linear programming. In: Proceedings of the second Berkeley symposium on mathematical statistics and probability, Berkeley, University of California, pp 481\u2013492","DOI":"10.1525\/9780520411586-036"},{"issue":"8","key":"1309_CR28","doi-asserted-by":"publisher","first-page":"9287","DOI":"10.1016\/j.eswa.2011.01.034","volume":"38","author":"H Lan","year":"2011","unstructured":"Lan H, Li R, Liu Z, Wang R (2011) Study on the inventory control of deteriorating items under vmi model based on bi-level programming. Expert Syst Appl 38(8):9287\u20139295","journal-title":"Expert Syst Appl"},{"key":"1309_CR29","doi-asserted-by":"crossref","unstructured":"Legillon F, Liefooghe A, Talbi E-G (2012) Cobra: A cooperative coevolutionary algorithm for bi-level optimization. In: 2012 IEEE Congress on evolutionary computation, 1\u20138","DOI":"10.1109\/CEC.2012.6256620"},{"issue":"1","key":"1309_CR30","doi-asserted-by":"publisher","first-page":"49","DOI":"10.1080\/13675560701410144","volume":"11","author":"Y Marinakis","year":"2008","unstructured":"Marinakis Y, Marinaki M (2008) A bilevel genetic algorithm for a real life location routing problem. Int J Logist Res Appl 11(1):49\u201365","journal-title":"Int J Logist Res Appl"},{"issue":"1","key":"1309_CR31","first-page":"1","volume":"28","author":"R Mathieu","year":"1994","unstructured":"Mathieu R, Pittard L, Anandalingam G (1994) Genetic algorithm based approach to bi-level linear programming. Revue fran\u010baise d\u2019automatique, d\u2019informatique et de recherche op\u00e9rationnelle. Recherche Op\u00e9rationnelle 28(1):1\u201321","journal-title":"Recherche Op\u00e9rationnelle"},{"issue":"1","key":"1309_CR32","doi-asserted-by":"publisher","first-page":"83","DOI":"10.1016\/S0191-2615(00)00016-3","volume":"35","author":"Q Meng","year":"2001","unstructured":"Meng Q, Yang H, Bell M (2001) An equivalent continuously differentiable model and a locally convergent algorithm for the continuous network design problem. Transp Res B Methodol 35(1):83\u2013105","journal-title":"Transp Res B Methodol"},{"key":"1309_CR33","doi-asserted-by":"crossref","unstructured":"Oduguwa V, Roy R (2002) Bi-level optimisation using genetic algorithm. In: IEEE International conference on artificial intelligence systems (ICAIS), pp 322\u2013327","DOI":"10.1109\/ICAIS.2002.1048121"},{"issue":"1","key":"1309_CR34","doi-asserted-by":"publisher","first-page":"2","DOI":"10.1109\/TSMCB.2006.883274","volume":"37","author":"Y-S Ong","year":"2007","unstructured":"Ong Y-S, Krasnogor N, Ishibuchi H (2007) Special issue on memetic algorithms. IEEE Trans Syst Man Cybern Part B (Cybern) 37(1):2\u20135","journal-title":"IEEE Trans Syst Man Cybern Part B (Cybern)"},{"issue":"8","key":"1309_CR35","first-page":"739","volume":"13","author":"Y-S Ong","year":"2009","unstructured":"Ong Y-S, Lim M-H, Neri F, Ishibuchi H (2009) Special issue on emerging trends in soft computing: memetic algorithms. Soft Comput- Fus Found Methodol Appl 13(8):739\u2013740","journal-title":"Soft Comput- Fus Found Methodol Appl"},{"key":"1309_CR36","unstructured":"Phadke MS (1995) Quality engineering using robust design. Prentice Hall PTR"},{"issue":"2","key":"1309_CR37","doi-asserted-by":"publisher","first-page":"165","DOI":"10.1287\/ijoc.8.2.165","volume":"8","author":"J-Y Potvin","year":"1996","unstructured":"Potvin J-Y, Bengio S (1996) The vehicle routing problem with time windows part ii: genetic search. INFORMS J Comput 8(2):165\u2013172","journal-title":"INFORMS J Comput"},{"key":"1309_CR38","unstructured":"Ross PJ (1988) Taguchi techniques for quality engineering: loss function, orthogonal experiments, parameter and tolerance design"},{"key":"1309_CR39","doi-asserted-by":"publisher","first-page":"374","DOI":"10.1016\/j.cor.2013.07.010","volume":"41","author":"A Sinha","year":"2014","unstructured":"Sinha A, Malo P, Frantsev A, Deb K (2014) Finding optimal strategies in a multi-period multi-leader\u2013follower Stackelberg game using an evolutionary algorithm. Comput Oper Res 41:374\u2013385","journal-title":"Comput Oper Res"},{"key":"1309_CR40","volume-title":"The theory of the market economy","author":"H Stackelberg","year":"1952","unstructured":"Stackelberg H (1952) The theory of the market economy. Oxford University Press, New York"},{"issue":"3","key":"1309_CR41","doi-asserted-by":"publisher","first-page":"291","DOI":"10.1007\/BF01096458","volume":"5","author":"LN Vicente","year":"1994","unstructured":"Vicente LN, Calamai P (1994) Bilevel and multilevel programming: a bibliography review. J Global Optim 5(3):291\u2013306","journal-title":"J Global Optim"},{"issue":"2","key":"1309_CR42","doi-asserted-by":"publisher","first-page":"221","DOI":"10.1109\/TSMCC.2004.841908","volume":"35","author":"Y Wang","year":"2005","unstructured":"Wang Y, Jiao Y-C, Li H (2005) An evolutionary algorithm for solving nonlinear bilevel programming based on a new constraint-handling scheme. IEEE Trans Syst Man Cybern Part C (Appl Rev) 35(2):221\u2013232","journal-title":"IEEE Trans Syst Man Cybern Part C (Appl Rev)"},{"issue":"2","key":"1309_CR43","doi-asserted-by":"publisher","first-page":"115","DOI":"10.1061\/(ASCE)0733-947X(2000)126:2(115)","volume":"126","author":"Y Yin","year":"2000","unstructured":"Yin Y (2000) Genetic-algorithms-based approach for bilevel programming models. J Transp Eng 126(2):115\u2013120","journal-title":"J Transp Eng"},{"issue":"7","key":"1309_CR44","doi-asserted-by":"publisher","first-page":"1652","DOI":"10.1109\/TCYB.2016.2554622","volume":"47","author":"A Gupta","year":"2017","unstructured":"Gupta A, Ong YS, Feng L, Tan KC (2017) Multiobjective multifactorial optimization in evolutionary multitasking. IEEE Trans Cybern 47(7):1652\u20131665","journal-title":"IEEE Trans Cybern"},{"key":"1309_CR45","unstructured":"Wang, Li H, Wang L, Hei X, Li W, Jiang Q (2017) A decomposition-based chemical reaction optimization for multi-objective vehicle routing problem for simultaneous delivery and pickup with time windows. Memetic Comput, 1\u201318"},{"issue":"2","key":"1309_CR46","doi-asserted-by":"publisher","first-page":"482","DOI":"10.1007\/s10489-017-0997-x","volume":"48","author":"H Fazlollahtabar","year":"2018","unstructured":"Fazlollahtabar H, Hassanli S (2018) Hybrid cost and time path planning for multiple autonomous guided vehicles. Appl Intell 48(2):482\u2013498","journal-title":"Appl Intell"},{"issue":"5","key":"1309_CR47","doi-asserted-by":"publisher","first-page":"760","DOI":"10.1109\/TEVC.2017.2682274","volume":"21","author":"L Feng","year":"2017","unstructured":"Feng L, Ong YS, Jiang S, Gupta A (2017) Autoencoding evolutionary search with learning across heterogeneous problems. IEEE Trans Evol Comput 21(5):760\u2013772","journal-title":"IEEE Trans Evol Comput"},{"issue":"1-4","key":"1309_CR48","doi-asserted-by":"publisher","first-page":"83","DOI":"10.1007\/s40747-016-0011-y","volume":"1","author":"A Gupta","year":"2016","unstructured":"Gupta A, Mandziuk J, Ong YS (2016) Evolutionary multitasking in bi-level optimization. Complex Intell Syst 1(1-4):83\u201395","journal-title":"Complex Intell Syst"},{"key":"1309_CR49","unstructured":"Handoko SD, Chuin LH, Gupta A, Soon OY, Kim HC, Siew TP (2015) Solving multi-vehicle profitable tour problem via knowledge adoption in evolutionary bi-level programming. In: IEEE Congress on evolutionary computation (CEC), pp 2713\u20132720"},{"key":"1309_CR50","doi-asserted-by":"crossref","unstructured":"Dorigo M, St\u00fctzle T (2010) Ant colony optimization: overview and recent advances. In: Handbook of metaheuristics. Springer, Boston, pp 227\u2013263","DOI":"10.1007\/978-1-4419-1665-5_8"},{"issue":"2","key":"1309_CR51","doi-asserted-by":"publisher","first-page":"276","DOI":"10.1109\/TEVC.2017.2712906","volume":"22","author":"A Sinha","year":"2018","unstructured":"Sinha A, Malo P, Deb K (2018) A review on bilevel optimization: from classical to evolutionary approaches and applications. IEEE Trans Evol Comput 22(2):276\u2013295","journal-title":"IEEE Trans Evol Comput"},{"issue":"4","key":"1309_CR52","doi-asserted-by":"publisher","first-page":"607","DOI":"10.1162\/evco_a_00198","volume":"25","author":"MM Islam","year":"2017","unstructured":"Islam MM, Singh HK, Ray T, Sinha A (2017) An enhanced memetic algorithm for single-objective bilevel optimization problems. Evol Comput 25(4):607\u2013642","journal-title":"Evol Comput"}],"container-title":["Applied Intelligence"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10489-018-1309-9\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10489-018-1309-9.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10489-018-1309-9.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,7,11]],"date-time":"2024-07-11T08:13:13Z","timestamp":1720685593000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10489-018-1309-9"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2018,10,12]]},"references-count":52,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2019,3]]}},"alternative-id":["1309"],"URL":"https:\/\/doi.org\/10.1007\/s10489-018-1309-9","relation":{},"ISSN":["0924-669X","1573-7497"],"issn-type":[{"value":"0924-669X","type":"print"},{"value":"1573-7497","type":"electronic"}],"subject":[],"published":{"date-parts":[[2018,10,12]]},"assertion":[{"value":"12 October 2018","order":1,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}