{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,1]],"date-time":"2026-04-01T01:59:38Z","timestamp":1775008778505,"version":"3.50.1"},"reference-count":44,"publisher":"Springer Science and Business Media LLC","issue":"19","license":[{"start":{"date-parts":[[2022,7,27]],"date-time":"2022-07-27T00:00:00Z","timestamp":1658880000000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2022,7,27]],"date-time":"2022-07-27T00:00:00Z","timestamp":1658880000000},"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":["Soft Comput"],"published-print":{"date-parts":[[2022,10]]},"DOI":"10.1007\/s00500-022-07344-w","type":"journal-article","created":{"date-parts":[[2022,7,29]],"date-time":"2022-07-29T14:45:42Z","timestamp":1659105942000},"page":"10301-10320","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":12,"title":["An improved quadratic approximation-based Jaya algorithm for two-echelon fixed-cost transportation problem under uncertain environment"],"prefix":"10.1007","volume":"26","author":[{"ORCID":"https:\/\/orcid.org\/0000-0001-5508-3462","authenticated-orcid":false,"given":"Rajeev","family":"Das","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Kedar Nath","family":"Das","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Saurabh","family":"Mallik","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2022,7,27]]},"reference":[{"issue":"12","key":"7344_CR1","doi-asserted-by":"publisher","first-page":"1275","DOI":"10.1057\/palgrave.jors.2601753","volume":"55","author":"V Adlakha","year":"2004","unstructured":"Adlakha V, Kowalski K (2004) A simple algorithm for the source induced fixed charge transportation problem J. Oper Res Soc 55(12):1275\u20131280","journal-title":"Oper Res Soc"},{"key":"7344_CR2","doi-asserted-by":"publisher","first-page":"64","DOI":"10.1016\/j.omega.2013.06.005","volume":"43","author":"V Adlakha","year":"2014","unstructured":"Adlakha V, Kowalski K, Wang S, Lev B, Shen W (2014) On approximation of the fixed charge transportation problem. Omega 43:64\u201370","journal-title":"Omega"},{"issue":"1","key":"7344_CR3","doi-asserted-by":"publisher","first-page":"447","DOI":"10.1007\/s12351-017-0332-7","volume":"20","author":"M Akbari","year":"2017","unstructured":"Akbari M, Molla-Alizadeh-Zavardehi S, Niroomand S (2017) Meta-heuristic approaches for fixed-charge solid transportation problem in two-stage supply chain network. Oper Res 20(1):447\u2013471. https:\/\/doi.org\/10.1007\/s12351-017-0332-7","journal-title":"Oper Res"},{"key":"7344_CR4","doi-asserted-by":"publisher","first-page":"275","DOI":"10.1016\/j.orl.2017.04.001","volume":"45","author":"G Angulo","year":"2017","unstructured":"Angulo G, Vyve M (2017) Fixed-charge transportation problems on trees. Oper Res Lett 45:275\u2013281","journal-title":"Oper Res Lett"},{"key":"7344_CR5","doi-asserted-by":"publisher","DOI":"10.1016\/j.asoc.2019.105576","volume":"82","author":"M Aslan","year":"2019","unstructured":"Aslan M, Gunduz M, Kiran MS (2019) JayaX: Jaya algorithm with xor operator for binary optimization. Appl Soft Comput 82:105576","journal-title":"Appl Soft Comput"},{"issue":"1\u20132","key":"7344_CR6","doi-asserted-by":"publisher","first-page":"207","DOI":"10.1007\/s10479-017-2692-z","volume":"273","author":"A Balaji","year":"2019","unstructured":"Balaji A, Nilakantan J, Nielsen I, Jawahar N, Ponnambalam S (2019) Solving fixed charge transportation problem with truck load constraint using meta-heuristics. Ann Oper Res 273(1\u20132):207\u2013236","journal-title":"Ann Oper Res"},{"key":"7344_CR7","doi-asserted-by":"crossref","unstructured":"Bansal J, Deep K (2010) Quadratic approximation PSO for economic dispatch problems with valve-point effects. In: International conference on swarm, evolutionary, and memetic computing. LNCS, 6466, pp 460\u2013467","DOI":"10.1007\/978-3-642-17563-3_55"},{"issue":"2","key":"7344_CR8","doi-asserted-by":"publisher","first-page":"555","DOI":"10.1016\/j.ejor.2017.12.004","volume":"267","author":"L Bertazzi","year":"2018","unstructured":"Bertazzi L, Maggioni F (2018) A stochastic multi-stage fixed charge transportation problem: worst-case analysis of the rolling horizon approach. Eur J Oper Res 267(2):555\u2013569","journal-title":"Eur J Oper Res"},{"key":"7344_CR9","doi-asserted-by":"publisher","first-page":"113","DOI":"10.1016\/j.cor.2018.03.007","volume":"95","author":"H Calvete","year":"2018","unstructured":"Calvete H, Gal\u00e9 C, Iranzo J, Toth P (2018) A matheuristic for the two-stage fixed-charge transportation problem. Comput Oper Res 95:113\u2013122","journal-title":"Comput Oper Res"},{"issue":"2","key":"7344_CR10","first-page":"342","volume":"15","author":"Q Cui","year":"2013","unstructured":"Cui Q, Sheng Y (2013) Uncertain programming model for solid transportation problem. Information 15(2):342\u2013348","journal-title":"Information"},{"issue":"4","key":"7344_CR11","doi-asserted-by":"publisher","first-page":"559","DOI":"10.1007\/s13042-016-0538-7","volume":"9","author":"H Dalman","year":"2018","unstructured":"Dalman H (2018a) Uncertain programming model for multi-item solid transportation problem. Int J Mach Learn Cybern 9(4):559\u2013567","journal-title":"Int J Mach Learn Cybern"},{"issue":"14","key":"7344_CR12","doi-asserted-by":"publisher","first-page":"5931","DOI":"10.1007\/s00500-018-3255-1","volume":"23","author":"H Dalman","year":"2018","unstructured":"Dalman H (2018b) Entropy-based multi-item solid transportation problems with uncertain variables. Soft Comput 23(14):5931\u20135943. https:\/\/doi.org\/10.1007\/s00500-018-3255-1","journal-title":"Soft Comput"},{"issue":"1","key":"7344_CR13","doi-asserted-by":"publisher","first-page":"37","DOI":"10.20852\/ntmsci.2018.244","volume":"6","author":"H Dalman","year":"2018","unstructured":"Dalman H (2018c) Uncertain random programming models for fixed charge multi-item solid transportation problem. New Trends Math Sci 6(1):37\u201351","journal-title":"New Trends Math Sci"},{"issue":"2","key":"7344_CR14","doi-asserted-by":"publisher","first-page":"195","DOI":"10.11121\/ijocta.01.2018.00601","volume":"8","author":"H Dalman","year":"2018","unstructured":"Dalman H (2018d) A simulation algorithm with uncertain random variables. Int J Optim Control Theor Appl 8(2):195\u2013200","journal-title":"Int J Optim Control Theor Appl"},{"issue":"2","key":"7344_CR15","doi-asserted-by":"publisher","first-page":"505","DOI":"10.1007\/s40995-017-0254-5","volume":"41","author":"H Dalman","year":"2017","unstructured":"Dalman H, Sivri M (2017) Multi-objective solid transportation problem in uncertain environment. Iran J Sci Technol Trans A Sci 41(2):505\u2013514","journal-title":"Iran J Sci Technol Trans A Sci"},{"key":"7344_CR16","doi-asserted-by":"publisher","unstructured":"Dalman H, SivriM (2018) A fuzzy logic based approach to solve interval multi-objective nonlinear transportation problem. In: Proceedings of the national academy of sciences, India section A: physical sciences. https:\/\/doi.org\/10.1007\/s40010-017-0469-z","DOI":"10.1007\/s40010-017-0469-z"},{"issue":"4","key":"7344_CR17","first-page":"319","volume":"2","author":"K Deep","year":"2009","unstructured":"Deep K, Das K (2009) Performance improvement of real-coded genetic algorithm with quadratic approximation based hybridization. Int J Intell Defence Support Syst 2(4):319\u2013334","journal-title":"Int J Intell Defence Support Syst"},{"key":"7344_CR18","first-page":"1","volume":"7","author":"J Demsar","year":"2006","unstructured":"Demsar J (2006) statistical comparison of classifiers over multiple data sets. J Mach Learn Res 7:1\u201330","journal-title":"J Mach Learn Res"},{"key":"7344_CR19","doi-asserted-by":"crossref","unstructured":"Fan Z, Fang Y, Li W, Yuan Y, Wang Z, Bian X (2018) LSHADE44 with an improved \u20ac constraint-handling method for solving constrained single-objective optimization problems. In: 2018 IEEE congress on evolutionary computation (CEC). IEEE, pp 1\u20138","DOI":"10.1109\/CEC.2018.8477943"},{"issue":"4","key":"7344_CR20","doi-asserted-by":"publisher","first-page":"307","DOI":"10.1007\/s10732-005-2135-x","volume":"11","author":"F Glover","year":"2005","unstructured":"Glover F, Amini M, Kochenberger G (2005) Parametric ghost image processes for fixed charge problems: a study of transportation networks. J Heuristics 11(4):307\u2013336","journal-title":"J Heuristics"},{"key":"7344_CR21","doi-asserted-by":"publisher","DOI":"10.1016\/j.asoc.2021.107275","volume":"105","author":"M Gunduz","year":"2021","unstructured":"Gunduz M, Aslan M (2021) DJAYA: a discrete Jaya algorithm for solving traveling salesman problem. Appl Soft Comput 105:107275","journal-title":"Appl Soft Comput"},{"key":"7344_CR22","unstructured":"He F (2012) A stochastic programming model and algorithm for transportation problem. In: International conference on computer science and information processing, pp 24\u201326"},{"key":"7344_CR23","doi-asserted-by":"crossref","unstructured":"Hellwig M, Beyer HG (2018) A matrix adaptation evolution strategy for constrained real-parameter optimization. In: 2018 IEEE congress on evolutionary computation (CEC). IEEE, pp 1\u20138","DOI":"10.1109\/CEC.2018.8477950"},{"key":"7344_CR24","doi-asserted-by":"publisher","first-page":"413","DOI":"10.1002\/nav.3800150306","volume":"15","author":"W Hirsch","year":"1968","unstructured":"Hirsch W, Dantzig G (1968) The fixed charge problem. Nav Res Logist 15:413\u2013424","journal-title":"Nav Res Logist"},{"key":"7344_CR25","doi-asserted-by":"publisher","first-page":"224","DOI":"10.1002\/sapm1941201224","volume":"20","author":"F Hitchcock","year":"1941","unstructured":"Hitchcock F (1941) The distribution of a product from several sources to numerous localities. J Math Phys 20:224\u2013230","journal-title":"J Math Phys"},{"key":"7344_CR26","unstructured":"Klose A (2006) Single-sink fixed-charge transportation: applications and exact solution algorithms. Working papers, Department of Mathematical Sciences, University of Aarhus, p 5"},{"issue":"1","key":"7344_CR27","first-page":"1","volume":"1","author":"K Kowalski","year":"2014","unstructured":"Kowalski K, Lev B, Shen W, Tu Y (2014) A fast and simple branching algorithm for solving small scale fixed-charge transportation problem. Oper Res Perspect 1(1):1\u20135","journal-title":"Oper Res Perspect"},{"key":"7344_CR28","doi-asserted-by":"publisher","DOI":"10.1016\/j.swevo.2020.100693","volume":"56","author":"A Kumar","year":"2020","unstructured":"Kumar A, Wu G, Ali MZ, Mallipeddi R, Suganthan PN, Das S (2020) A test-suite of non-convex constrained optimization problems from the real-world and some baseline results. Swarm Evol Comput 56:100693","journal-title":"Swarm Evol Comput"},{"key":"7344_CR29","unstructured":"Liang J, Runarsson T, Montes E, Clerc M, Suganthan P, Coello C, Deb K (2006) Problem definitions and evaluation criteria for the CEC 2006 special session on constrained real-parameter optimization. Technical report. Nanyang Technological University http:\/\/www.ntu.edu.sg\/home\/EPNSugan"},{"key":"7344_CR30","volume-title":"Uncertainty theory","author":"B Liu","year":"2007","unstructured":"Liu B (2007) Uncertainty theory, 2nd edn. Springer, Berlin","edition":"2"},{"issue":"1","key":"7344_CR31","first-page":"3","volume":"3","author":"B Liu","year":"2009","unstructured":"Liu B (2009) Some research problems in uncertainty theory. J Uncertain Syst 3(1):3\u201310","journal-title":"J Uncertain Syst"},{"key":"7344_CR32","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-13959-8","volume-title":"Uncertainty theory: a branch of mathematics for modeling human uncertainty","author":"B Liu","year":"2010","unstructured":"Liu B (2010a) Uncertainty theory: a branch of mathematics for modeling human uncertainty. Springer, Berlin"},{"issue":"10","key":"7344_CR34","doi-asserted-by":"publisher","first-page":"3279","DOI":"10.1007\/s00500-017-2987-7","volume":"23","author":"S Majumder","year":"2019","unstructured":"Majumder S, Kundu P, Kar S, Pal T (2019) Uncertain multi-objective multi-item fixed charge solid transportation problem with budget constraint. Soft Comput 23(10):3279\u20133301","journal-title":"Soft Comput"},{"key":"7344_CR35","first-page":"93","volume":"11","author":"C Mohan","year":"1994","unstructured":"Mohan C, Shanker K (1994) A random search technique for global optimization based on quadratic approximation. Asia Pac J Oper Res 11:93\u2013101","journal-title":"Asia Pac J Oper Res"},{"issue":"1","key":"7344_CR36","first-page":"30","volume":"12","author":"D Mou","year":"2013","unstructured":"Mou D, Zhou W, Chang X (2013) A transportation problem with uncertain truck times and unit costs. Ind Eng Manag Syst 12(1):30\u201335","journal-title":"Ind Eng Manag Syst"},{"key":"7344_CR37","first-page":"19","volume":"7","author":"R Rao","year":"2016","unstructured":"Rao R (2016) Jaya: A simple and new optimization algorithm for solving constrained and unconstrained optimization problems. Int J Ind Eng Comput 7:19\u201334","journal-title":"Int J Ind Eng Comput"},{"key":"7344_CR38","doi-asserted-by":"publisher","first-page":"8341","DOI":"10.1016\/j.apm.2013.03.053","volume":"37","author":"M Safi","year":"2013","unstructured":"Safi M, Razmjoo A (2013) Solving fixed charge transportation problem with interval parameters. Appl Math Model 37:8341\u20138347","journal-title":"Appl Math Model"},{"key":"7344_CR39","doi-asserted-by":"publisher","first-page":"3529","DOI":"10.1007\/s00500-019-04119-8","volume":"24","author":"J Shen","year":"2020","unstructured":"Shen J, Zhu K (2020) An uncertain two-echelon fixed charge transportation problem. Soft Comput 24:3529\u20133541","journal-title":"Soft Comput"},{"issue":"1","key":"7344_CR40","first-page":"27","volume":"2","author":"N Shirazi","year":"2015","unstructured":"Shirazi N, Esfahani M, Soleimani H (2015) Modeling and solving a three-stage fixed charge transportation problem considering stochastic demand and price. J Ind Eng Manag Stud 2(1):27\u201340","journal-title":"J Ind Eng Manag Stud"},{"key":"7344_CR41","doi-asserted-by":"crossref","unstructured":"Trivedi A, Sanyal K, Verma P, Srinivasan D (2017) A unified differential evolution algorithm for constrained optimization problems. In: 2017 IEEE congress on evolutionary computation (CEC). IEEE, pp 1231\u20131238","DOI":"10.1109\/CEC.2017.7969446"},{"issue":"9","key":"7344_CR42","doi-asserted-by":"publisher","first-page":"678","DOI":"10.3390\/en9090678","volume":"9","author":"W Warid","year":"2016","unstructured":"Warid W, Hizam H, Mariun N, Abdul-Wahab NI (2016) Optimal power flow using the Jaya algorithm. Energies 9(9):678","journal-title":"Energies"},{"key":"7344_CR43","unstructured":"Wolpert DH, Macready WG (1995) No free lunch theorems for search. Technical report SFI-TR-95-02-010 Vol. 10 Citeseer"},{"key":"7344_CR44","doi-asserted-by":"publisher","first-page":"67","DOI":"10.1109\/4235.585893","volume":"1","author":"DH Wolpert","year":"1997","unstructured":"Wolpert DH, Macready WG (1997) No free lunch theorems for optimization. IEEE Trans Evol Comput 1:67\u201382","journal-title":"IEEE Trans Evol Comput"},{"issue":"12","key":"7344_CR45","doi-asserted-by":"publisher","first-page":"2668","DOI":"10.1016\/j.apm.2006.10.011","volume":"31","author":"L Yang","year":"2007","unstructured":"Yang L, Feng Y (2007) A bicriteria solid transportation problem with fixed charge under stochastic environment. Appl Math Modell 31(12):2668\u20132683","journal-title":"Appl Math Modell"}],"container-title":["Soft Computing"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s00500-022-07344-w.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s00500-022-07344-w\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s00500-022-07344-w.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,9,12]],"date-time":"2022-09-12T15:21:47Z","timestamp":1662996107000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s00500-022-07344-w"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022,7,27]]},"references-count":44,"journal-issue":{"issue":"19","published-print":{"date-parts":[[2022,10]]}},"alternative-id":["7344"],"URL":"https:\/\/doi.org\/10.1007\/s00500-022-07344-w","relation":{},"ISSN":["1432-7643","1433-7479"],"issn-type":[{"value":"1432-7643","type":"print"},{"value":"1433-7479","type":"electronic"}],"subject":[],"published":{"date-parts":[[2022,7,27]]},"assertion":[{"value":"17 June 2022","order":1,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"27 July 2022","order":2,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}},{"order":1,"name":"Ethics","group":{"name":"EthicsHeading","label":"Declarations"}},{"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"}},{"value":"Informed consent was obtained from all individual participants included in the study.","order":4,"name":"Ethics","group":{"name":"EthicsHeading","label":"Informed consent"}}]}}