{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,6,25]],"date-time":"2026-06-25T10:20:48Z","timestamp":1782382848513,"version":"3.54.5"},"reference-count":36,"publisher":"Springer Science and Business Media LLC","issue":"2","license":[{"start":{"date-parts":[[2019,3,29]],"date-time":"2019-03-29T00:00:00Z","timestamp":1553817600000},"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":["Soft Comput"],"published-print":{"date-parts":[[2020,1]]},"DOI":"10.1007\/s00500-019-03951-2","type":"journal-article","created":{"date-parts":[[2019,3,29]],"date-time":"2019-03-29T13:02:45Z","timestamp":1553864565000},"page":"1153-1169","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":11,"title":["A genetic algorithm with local search for solving single-source single-sink nonlinear non-convex minimum cost flow problems"],"prefix":"10.1007","volume":"24","author":[{"given":"Behrooz","family":"Ghasemishabankareh","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Melih","family":"Ozlen","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Xiaodong","family":"Li","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Kalyanmoy","family":"Deb","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2019,3,29]]},"reference":[{"key":"3951_CR1","first-page":"4","volume-title":"Network flows: theory, algorithms, and applications","author":"RK Ahuja","year":"1993","unstructured":"Ahuja RK, Magnanti TL, Orlin JB (1993) Network flows: theory, algorithms, and applications. Prentice Hall, Upper Saddle River, pp 4\u20136"},{"issue":"2","key":"3951_CR2","first-page":"97","volume":"17","author":"S Burer","year":"2012","unstructured":"Burer S, Letchford AN (2012) Non-convex mixed-integer nonlinear programming: a survey. Surv Oper Res Manag Sci 17(2):97\u2013106","journal-title":"Surv Oper Res Manag Sci"},{"issue":"2","key":"3951_CR3","doi-asserted-by":"publisher","first-page":"121","DOI":"10.1023\/A:1008379621400","volume":"19","author":"RE Burkard","year":"2001","unstructured":"Burkard RE, Dollani H, Thach PT (2001) Linear approximations in a dynamic programming approach for the uncapacitated single-source minimum concave cost network flow problem in acyclic networks. J Glob Optim 19(2):121\u2013139","journal-title":"J Glob Optim"},{"issue":"3","key":"3951_CR4","doi-asserted-by":"publisher","first-page":"274","DOI":"10.1080\/095119298130804","volume":"11","author":"R Cheng","year":"1998","unstructured":"Cheng R, Gen M (1998) An evolution programme for the resource-constrained project scheduling problem. Int J Comput Integr Manuf 11(3):274\u2013287","journal-title":"Int J Comput Integr Manuf"},{"issue":"4","key":"3951_CR5","doi-asserted-by":"publisher","first-page":"634","DOI":"10.1287\/moor.12.4.634","volume":"12","author":"RE Erickson","year":"1987","unstructured":"Erickson RE, Monma CL, Veinott AF Jr (1987) Send-and-split method for minimum-concave-cost network flows. Math Oper Res 12(4):634\u2013664","journal-title":"Math Oper Res"},{"issue":"1","key":"3951_CR6","first-page":"67","volume":"50","author":"DBMM Fontes","year":"2007","unstructured":"Fontes DBMM, Gonalves JF (2007) Heuristic solutions for general concave minimum cost network flow problems. Netw Int J 50(1):67\u201376","journal-title":"Netw Int J"},{"issue":"1","key":"3951_CR7","doi-asserted-by":"publisher","first-page":"127","DOI":"10.1007\/s10898-005-1658-x","volume":"34","author":"DBMM Fontes","year":"2006","unstructured":"Fontes DBMM, Hadjiconstantinou E, Christofides N (2006a) A branch-and-bound algorithm for concave network flow problems. J Glob Optim 34(1):127\u2013155","journal-title":"J Glob Optim"},{"issue":"2","key":"3951_CR8","doi-asserted-by":"publisher","first-page":"1205","DOI":"10.1016\/j.ejor.2005.03.024","volume":"174","author":"DBMM Fontes","year":"2006","unstructured":"Fontes DBMM, Hadjiconstantinou E, Christofides N (2006b) A dynamic programming approach for solving single-source uncapacitated concave minimum cost network flow problems. Eur J Oper Res 174(2):1205\u20131219","journal-title":"Eur J Oper Res"},{"key":"3951_CR9","unstructured":"Garey MR, Johnson DS (2002) Computers and intractability, vol 29. wh freeman, New York"},{"key":"3951_CR10","unstructured":"Gen M, Cheng R, Wang D (1997) Genetic algorithms for solving shortest path problems. In: IEEE International conference on evolutionary computation, 1997. IEEE"},{"key":"3951_CR11","volume-title":"Network models and optimization: multiobjective genetic algorithm approach","author":"M Gen","year":"2008","unstructured":"Gen M, Cheng R, Lin L (2008) Network models and optimization: multiobjective genetic algorithm approach. Springer, Berlin"},{"key":"3951_CR12","doi-asserted-by":"publisher","first-page":"69","DOI":"10.1007\/978-3-319-99253-2_6","volume-title":"In: International conference on parallel problem solving from nature","author":"B Ghasemishabankareh","year":"2018","unstructured":"Ghasemishabankareh B, Ozlen M, Neumann F, Li X (2018) A probabilistic tree-based representation for nonconvex minimum cost flow problems. In: International conference on parallel problem solving from nature. Springer, Cham, pp 69\u201381"},{"issue":"2","key":"3951_CR13","doi-asserted-by":"publisher","first-page":"95","DOI":"10.1023\/A:1022602019183","volume":"3","author":"DE Goldberg","year":"1988","unstructured":"Goldberg DE, Holland JH (1988) Genetic algorithms and machine learning. Mach Learn 3(2):95\u201399","journal-title":"Mach Learn"},{"issue":"4","key":"3951_CR14","doi-asserted-by":"publisher","first-page":"309","DOI":"10.1007\/BF00130828","volume":"1","author":"GM Guisewite","year":"1991","unstructured":"Guisewite GM, Pardalos PM (1991a) Global search algorithms for minimum concave-cost network flow problems. J Glob Optim 1(4):309\u2013330","journal-title":"J Glob Optim"},{"issue":"3","key":"3951_CR15","doi-asserted-by":"publisher","first-page":"245","DOI":"10.1007\/BF00119934","volume":"1","author":"GM Guisewite","year":"1991","unstructured":"Guisewite GM, Pardalos PM (1991b) Algorithms for the single-source uncapacitated minimum concave-cost network flow problem. J Glob Optim 1(3):245\u2013265","journal-title":"J Glob Optim"},{"issue":"1","key":"3951_CR16","doi-asserted-by":"publisher","first-page":"47","DOI":"10.1007\/BF01545530","volume":"20","author":"R Horst","year":"1998","unstructured":"Horst R, Thoai NV (1998) An integer concave minimization approach for the minimum concave cost capacitated flow problem on networks. Oper Res Spektrum 20(1):47\u201353","journal-title":"Oper Res Spektrum"},{"issue":"1\u20134","key":"3951_CR17","doi-asserted-by":"publisher","first-page":"95","DOI":"10.1023\/A:1021145103592","volume":"115","author":"H-J Kim","year":"2002","unstructured":"Kim H-J, Hooker JN (2002) Solving fixed-charge network flow problems with a hybrid optimization and constraint programming approach. Ann Oper Res 115(1\u20134):95\u2013124","journal-title":"Ann Oper Res"},{"issue":"1","key":"3951_CR18","doi-asserted-by":"publisher","first-page":"1","DOI":"10.3846\/16484142.2013.815134","volume":"29","author":"U Klansek","year":"2014","unstructured":"Klansek U (2014) Solving the nonlinear discrete transportation problem by MINLP optimization. Transport 29(1):1\u201311","journal-title":"Transport"},{"issue":"3","key":"3951_CR19","doi-asserted-by":"publisher","first-page":"314","DOI":"10.3846\/transport.2010.39","volume":"25","author":"U Klansek","year":"2010","unstructured":"Klansek U, Psunder M (2010) Solving the nonlinear transportation problem by global optimization. Transport 25(3):314\u2013324","journal-title":"Transport"},{"issue":"1","key":"3951_CR20","doi-asserted-by":"publisher","first-page":"94","DOI":"10.1080\/10556788.2014.895828","volume":"30","author":"P Kovacs","year":"2015","unstructured":"Kovacs P (2015) Minimum-cost flow algorithms: an experimental evaluation. Optim Methods Softw 30(1):94\u2013127","journal-title":"Optim Methods Softw"},{"key":"3951_CR21","doi-asserted-by":"publisher","first-page":"141","DOI":"10.1007\/978-3-540-95978-6_10","volume-title":"Intelligent and evolutionary systems","author":"L Lin","year":"2009","unstructured":"Lin L, Gen M (2009) Multiobjective genetic algorithm for bicriteria network design problems. In: Gen M, Katai O, McKay B, Namatame A, Sarker RA, Zhang B-T (eds) Intelligent and evolutionary systems. Springer, Berlin, pp 141\u2013161"},{"issue":"4","key":"3951_CR22","first-page":"225","volume":"29","author":"SY Lin","year":"1997","unstructured":"Lin SY, Lin CH (1997) A computationally efficient method for nonlinear multicommodity network flow problems. Netw Int J 29(4):225\u2013244","journal-title":"Netw Int J"},{"issue":"4\u20135","key":"3951_CR23","doi-asserted-by":"publisher","first-page":"657","DOI":"10.1080\/10556780902753221","volume":"24","author":"Y Lin","year":"2009","unstructured":"Lin Y, Schrage L (2009) The global solver in the LINDO API. Optim Methods Softw 24(4\u20135):657\u2013668","journal-title":"Optim Methods Softw"},{"key":"3951_CR24","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-662-03315-9","volume-title":"Genetic Algorithms + Data Structures = Evolution Programs","author":"Zbigniew Michalewicz","year":"1996","unstructured":"Michalewicz Z, Stephen H (1996) Genetic algorithms + data structures = evolution programs. Math Intell. \nhttps:\/\/doi.org\/10.1007\/978-3-662-03315-9"},{"issue":"4","key":"3951_CR25","doi-asserted-by":"publisher","first-page":"307","DOI":"10.1287\/ijoc.3.4.307","volume":"3","author":"Z Michalewicz","year":"1991","unstructured":"Michalewicz Z, Vignaux GA, Hobbs M (1991) A nonstandard genetic algorithm for the nonlinear transportation problem. ORSA J Comput 3(4):307\u2013316","journal-title":"ORSA J Comput"},{"key":"3951_CR26","doi-asserted-by":"crossref","unstructured":"Monteiro MSR, Fontes DB, Fontes FA (2011) An ant colony optimization algorithm to solve the minimum cost network flow problem with concave cost functions. In: Proceedings of the 13th annual conference on Genetic and evolutionary computation, pp 139\u2013146","DOI":"10.1145\/2001576.2001596"},{"issue":"1","key":"3951_CR27","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/s10732-012-9214-6","volume":"19","author":"MSR Monteiro","year":"2013","unstructured":"Monteiro MSR, Fontes DBMM, Fontes FACC (2013) Concave minimum cost network flow problems solved with a colony of ants. J Heuristics 19(1):1\u201333","journal-title":"J Heuristics"},{"issue":"1","key":"3951_CR28","doi-asserted-by":"publisher","first-page":"32","DOI":"10.1287\/trsc.30.1.32","volume":"30","author":"GF Newell","year":"1996","unstructured":"Newell GF (1996) Non-convex traffic assignment on a rectangular grid network. Transp Sci 30(1):32\u201342","journal-title":"Transp Sci"},{"issue":"3","key":"3951_CR29","first-page":"143","volume":"41","author":"F Ortega","year":"2003","unstructured":"Ortega F, Wolsey LA (2003) A branch-and-cut algorithm for the single-commodity, uncapacitated, fixed-charge network flow problem. Netw Int J 41(3):143\u2013158","journal-title":"Netw Int J"},{"key":"3951_CR30","unstructured":"Reca J, Martnez J, Lpez-Luque R (2017) A new efficient bounding strategy applied to the heuristic optimization of the water distribution networks design. In: Congress on numerical methods in engineering CMN"},{"key":"3951_CR31","volume-title":"A reformulation-linearization technique for solving discrete and continuous nonconvex problems","author":"HD Sherali","year":"2013","unstructured":"Sherali HD, Adams WP (2013) A reformulation-linearization technique for solving discrete and continuous nonconvex problems, vol 31. Springer, Berlin"},{"issue":"2","key":"3951_CR32","doi-asserted-by":"publisher","first-page":"395","DOI":"10.1016\/j.ejor.2016.08.027","volume":"257","author":"A Sinha","year":"2017","unstructured":"Sinha A, Malo P, Deb K (2017) Evolutionary algorithm for bilevel optimization using approximations of the lower level optimal solution mapping. Eur J Oper Res 257(2):395\u2013411","journal-title":"Eur J Oper Res"},{"key":"3951_CR33","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-4757-3532-1","volume-title":"Convexification and global optimization in continuous and mixed-integer nonlinear programming: theory, algorithms, software, and applications","author":"M Tawarmalani","year":"2002","unstructured":"Tawarmalani M, Sahinidis NV, Sahinidis N (2002) Convexification and global optimization in continuous and mixed-integer nonlinear programming: theory, algorithms, software, and applications, vol 65. Springer, Berlin"},{"issue":"5","key":"3951_CR34","doi-asserted-by":"publisher","first-page":"1729","DOI":"10.1137\/140978296","volume":"45","author":"LA Vegh","year":"2016","unstructured":"Vegh LA (2016) A strongly polynomial algorithm for a class of minimum-cost flow problems with separable convex objectives. SIAM J Comput 45(5):1729\u20131761","journal-title":"SIAM J Comput"},{"issue":"4","key":"3951_CR35","doi-asserted-by":"publisher","first-page":"763","DOI":"10.1016\/j.cie.2012.04.016","volume":"63","author":"F Xie","year":"2012","unstructured":"Xie F, Jia R (2012) Nonlinear fixed charge transportation problem by minimum cost flow-based genetic algorithm. Comput Ind Eng 63(4):763\u2013778","journal-title":"Comput Ind Eng"},{"issue":"11","key":"3951_CR36","doi-asserted-by":"publisher","first-page":"983","DOI":"10.1080\/03052150903563751","volume":"42","author":"S Yan","year":"2010","unstructured":"Yan S, Shih YL, Wang CL (2010) An ant colony system-based hybrid algorithm for square root concave cost transhipment problems. Eng Optim 42(11):983\u20131001","journal-title":"Eng Optim"}],"container-title":["Soft Computing"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00500-019-03951-2.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s00500-019-03951-2\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00500-019-03951-2.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,3,28]],"date-time":"2020-03-28T00:14:15Z","timestamp":1585354455000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s00500-019-03951-2"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019,3,29]]},"references-count":36,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2020,1]]}},"alternative-id":["3951"],"URL":"https:\/\/doi.org\/10.1007\/s00500-019-03951-2","relation":{},"ISSN":["1432-7643","1433-7479"],"issn-type":[{"value":"1432-7643","type":"print"},{"value":"1433-7479","type":"electronic"}],"subject":[],"published":{"date-parts":[[2019,3,29]]},"assertion":[{"value":"29 March 2019","order":1,"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"}}]}}