{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,14]],"date-time":"2025-10-14T07:13:09Z","timestamp":1760425989281,"version":"3.37.3"},"reference-count":41,"publisher":"Springer Science and Business Media LLC","issue":"6","license":[{"start":{"date-parts":[[2021,6,29]],"date-time":"2021-06-29T00:00:00Z","timestamp":1624924800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2021,6,29]],"date-time":"2021-06-29T00:00:00Z","timestamp":1624924800000},"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":["Int J Syst Assur Eng Manag"],"published-print":{"date-parts":[[2021,12]]},"DOI":"10.1007\/s13198-021-01171-2","type":"journal-article","created":{"date-parts":[[2021,6,29]],"date-time":"2021-06-29T21:02:41Z","timestamp":1625000561000},"page":"1073-1086","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":9,"title":["Solving fixed-charge transportation problem using a modified particle swarm optimization algorithm"],"prefix":"10.1007","volume":"12","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-8378-5637","authenticated-orcid":false,"given":"Gurwinder","family":"Singh","sequence":"first","affiliation":[]},{"given":"Amarinder","family":"Singh","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2021,6,29]]},"reference":[{"issue":"3","key":"1171_CR1","doi-asserted-by":"publisher","first-page":"205","DOI":"10.1016\/S0305-0483(03)00025-2","volume":"31","author":"V Adlakha","year":"2003","unstructured":"Adlakha V, Kowalski K (2003) A simple heuristic for solving small fixed-charge transportation problems. Omega 31(3):205\u2013211","journal-title":"Omega"},{"issue":"2","key":"1171_CR2","doi-asserted-by":"publisher","first-page":"132","DOI":"10.1007\/BF03398770","volume":"43","author":"V Adlakha","year":"2006","unstructured":"Adlakha V, Kowalski K, Vemuganti R (2006) Heuristic algorithms for the fixed-charge transportation problem. Opsearch 43(2):132\u2013151","journal-title":"Opsearch"},{"key":"1171_CR3","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":"1171_CR4","first-page":"447","volume":"20","author":"M Akbari","year":"2020","unstructured":"Akbari M, Molla-Alizadeh-Zavardehi S, Niroomand S (2020) Meta-heuristic approaches for fixed-charge solid transportation problem in two-stage supply chain network. Oper Res 20(1):447\u2013471","journal-title":"Oper Res"},{"issue":"1","key":"1171_CR5","doi-asserted-by":"publisher","first-page":"41","DOI":"10.1002\/nav.3800080104","volume":"8","author":"ML Balinski","year":"1961","unstructured":"Balinski ML (1961) Fixed-cost transportation problems. Naval Res Logistics Q 8(1):41\u201354","journal-title":"Naval Res Logistics Q"},{"issue":"3","key":"1171_CR6","doi-asserted-by":"publisher","first-page":"448","DOI":"10.1287\/opre.29.3.448","volume":"29","author":"RS Barr","year":"1981","unstructured":"Barr RS, Glover F, Klingman D (1981) A new optimization method for large scale fixed charge transportation problems. Oper Res 29(3):448\u2013463","journal-title":"Oper Res"},{"issue":"1","key":"1171_CR7","doi-asserted-by":"publisher","first-page":"145","DOI":"10.1002\/nav.3800310115","volume":"31","author":"AV Cabot","year":"1984","unstructured":"Cabot AV, Erenguc SS (1984) Some branch-and-bound procedures for fixed-cost transportation problems. Naval Resh Logistics Q 31(1):145\u2013154","journal-title":"Naval Resh Logistics Q"},{"issue":"1","key":"1171_CR8","doi-asserted-by":"publisher","first-page":"41","DOI":"10.1007\/s11633-006-0041-9","volume":"3","author":"J Chen","year":"2006","unstructured":"Chen J, Pan F, Cai T (2006) Acceleration factor harmonious particle swarm optimizer. Int J Automation Comput 3(1):41\u201346","journal-title":"Int J Automation Comput"},{"issue":"1","key":"1171_CR9","doi-asserted-by":"publisher","first-page":"58","DOI":"10.1109\/4235.985692","volume":"6","author":"M Clerc","year":"2002","unstructured":"Clerc M, Kennedy J (2002) The particle swarm-explosion, stability, and convergence in a multidimensional complex space. IEEE Trans Evolut Comput 6(1):58\u201373","journal-title":"IEEE Trans Evolut Comput"},{"key":"1171_CR10","unstructured":"Eberhart R, Kennedy J (1995) A new optimizer using particle swarm theory. In: Proceedings of the Sixth International Symposium on Micro Machine and Human Science, pp. 39\u201343. Nagoya, Japan"},{"issue":"2","key":"1171_CR11","doi-asserted-by":"publisher","first-page":"610","DOI":"10.1016\/j.cie.2012.12.001","volume":"64","author":"MM El-Sherbiny","year":"2013","unstructured":"El-Sherbiny MM, Alhamali RM (2013) A hybrid particle swarm algorithm with artificial immune learning for solving the fixed charge transportation problem. Comput Ind Eng 64(2):610\u2013620","journal-title":"Comput Ind Eng"},{"issue":"1","key":"1171_CR12","first-page":"167","volume":"12","author":"MB Fakhrzad","year":"2019","unstructured":"Fakhrzad MB, Goodarzian F, Golmohammadi A (2019) Addressing a fixed charge transportation problem with multi-route and different capacities by novel hybrid meta-heuristics. J Ind Syst Eng 12(1):167\u2013184","journal-title":"J Ind Syst Eng"},{"issue":"3","key":"1171_CR13","doi-asserted-by":"publisher","first-page":"405","DOI":"10.1109\/TEVC.2010.2053935","volume":"15","author":"JL Fernandez-Martinez","year":"2011","unstructured":"Fernandez-Martinez JL, Garcia-Gonzalo E (2011) Stochastic stability analysis of the linear continuous and discrete pso models. IEEE Trans Evolutionary Comput 15(3):405\u2013423","journal-title":"IEEE Trans Evolutionary Comput"},{"key":"1171_CR14","doi-asserted-by":"crossref","first-page":"292","DOI":"10.1016\/j.amc.2015.11.001","volume":"274","author":"H Garg","year":"2016","unstructured":"Garg H (2016) A hybrid pso-ga algorithm for constrained optimization problems. Appl Math Comput 274:292\u2013305","journal-title":"Appl Math Comput"},{"key":"1171_CR15","doi-asserted-by":"publisher","first-page":"499","DOI":"10.1016\/j.ins.2018.11.041","volume":"478","author":"H Garg","year":"2019","unstructured":"Garg H (2019) A hybrid gsa-ga algorithm for constrained optimization problems. Inf Sci 478:499\u2013523","journal-title":"Inf Sci"},{"issue":"1","key":"1171_CR16","doi-asserted-by":"publisher","first-page":"539","DOI":"10.1109\/TSMCB.2003.817077","volume":"34","author":"V Gazi","year":"2004","unstructured":"Gazi V, Passino KM (2004) Stability analysis of social foraging swarms. IEEE Trans Syst Man Cybernetics Part B (Cybernetics) 34(1):539\u2013557","journal-title":"IEEE Trans Syst Man Cybernetics Part B (Cybernetics)"},{"key":"1171_CR17","unstructured":"Gottlieb J, Paulmann L (1998) Genetic algorithms for the fixed charge transportation problem. In: Evolutionary Computation Proceedings, 1998. IEEE World Congress on Computational Intelligence., The 1998 IEEE International Conference on, pp. 330\u2013335. IEEE"},{"issue":"6","key":"1171_CR18","doi-asserted-by":"publisher","first-page":"1529","DOI":"10.1287\/opre.19.6.1529","volume":"19","author":"P Gray","year":"1971","unstructured":"Gray P (1971) Exact solution of the fixed-charge transportation problem. Oper Res 19(6):1529\u20131538","journal-title":"Oper Res"},{"issue":"3","key":"1171_CR19","doi-asserted-by":"publisher","first-page":"413","DOI":"10.1002\/nav.3800150306","volume":"15","author":"WM Hirsch","year":"1968","unstructured":"Hirsch WM, Dantzig GB (1968) The fixed charge problem. Naval Res Logistics Q 15(3):413\u2013424","journal-title":"Naval Res Logistics Q"},{"key":"1171_CR20","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 locations. J Math Phys 20:224\u2013230","journal-title":"J Math Phys"},{"key":"1171_CR21","doi-asserted-by":"crossref","unstructured":"Huang H, Zhifang H (2009) Particle swarm optimization algorithm for transportation problems. Particle Swarm Optimization, Intech, Shanghai, pp 275\u2013290","DOI":"10.5772\/6754"},{"issue":"3","key":"1171_CR22","doi-asserted-by":"publisher","first-page":"41","DOI":"10.1002\/eej.20077","volume":"151","author":"A Ide","year":"2005","unstructured":"Ide A, Yasuda K (2005) A basic study of adaptive particle swarm optimization. Electr Eng Japan 151(3):41\u201349","journal-title":"Electr Eng Japan"},{"issue":"3","key":"1171_CR23","doi-asserted-by":"publisher","first-page":"245","DOI":"10.1109\/TEVC.2005.857077","volume":"10","author":"V Kadirkamanathan","year":"2006","unstructured":"Kadirkamanathan V, Selvarajah K, Fleming PJ (2006) Stability analysis of the particle dynamics in particle swarm optimizer. IEEE Trans Evolutionary Comput 10(3):245\u2013255","journal-title":"IEEE Trans Evolutionary Comput"},{"key":"1171_CR24","doi-asserted-by":"crossref","unstructured":"Koopmans T (1947) Optimum utilization of the transport system. In: Proceedings of International Statistical Conferences : Econometric, pp. 136\u2013145","DOI":"10.2307\/1907301"},{"issue":"5","key":"1171_CR25","doi-asserted-by":"publisher","first-page":"2711","DOI":"10.1016\/j.asoc.2012.11.016","volume":"13","author":"M Lotfi","year":"2013","unstructured":"Lotfi M, Tavakkoli-Moghaddam R (2013) A genetic algorithm using priority-based encoding with new operators for fixed charge transportation problems. Appl Soft Comput 13(5):2711\u20132726","journal-title":"Appl Soft Comput"},{"key":"1171_CR26","doi-asserted-by":"crossref","unstructured":"Madeno\u011flu, FS (2021) Managing transportation in supply chain: Metaheuristics for solving a capacitated fixed-charge transportation problem. In: Handbook of Research on Recent Perspectives on Management, International Trade, and Logistics, pp. 198\u2013218. IGI Global","DOI":"10.4018\/978-1-7998-5886-7.ch011"},{"issue":"2","key":"1171_CR27","doi-asserted-by":"publisher","first-page":"268","DOI":"10.1287\/opre.16.2.268","volume":"16","author":"KG Murty","year":"1968","unstructured":"Murty KG (1968) Solving the fixed charge problem by ranking the extreme points. Oper. Res. 16(2):268\u2013279","journal-title":"Oper. Res."},{"issue":"9","key":"1171_CR28","doi-asserted-by":"publisher","first-page":"1092","DOI":"10.1287\/mnsc.36.9.1092","volume":"36","author":"US Palekar","year":"1990","unstructured":"Palekar US, Karwan MH, Zionts S (1990) A branch-and-bound method for the fixed charge transportation problem. Manag Sci 36(9):1092\u20131105","journal-title":"Manag Sci"},{"key":"1171_CR29","doi-asserted-by":"publisher","first-page":"225","DOI":"10.37193\/CJM.2016.02.10","volume":"32","author":"P Pop","year":"2016","unstructured":"Pop P, Matei O, Sitar CP, Zelina I (2016) A hybrid based genetic algorithm for solving a capacitated fixed-charge transportation problem. Carpath J Math 32:225\u2013232","journal-title":"Carpath J Math"},{"key":"1171_CR30","doi-asserted-by":"crossref","unstructured":"Qin Z, Yu F, Shi Z, Wang Y (2006) Adaptive inertia weight particle swarm optimization. In International conference on Artificial Intelligence and Soft Computing, pp. 450\u2013459. Springer","DOI":"10.1007\/11785231_48"},{"issue":"1","key":"1171_CR31","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/s13727-012-0001-2","volume":"2","author":"KAAD Raj","year":"2011","unstructured":"Raj KAAD, Rajendran C (2011) A hybrid genetic algorithm for solving single-stage fixed-charge transportation problems. Technol Oper Manag 2(1):1\u201315","journal-title":"Technol Oper Manag"},{"issue":"3","key":"1171_CR32","doi-asserted-by":"publisher","first-page":"240","DOI":"10.1109\/TEVC.2004.826071","volume":"8","author":"A Ratnaweera","year":"2004","unstructured":"Ratnaweera A, Halgamuge SK, Watson HC (2004) Self-organizing hierarchical particle swarm optimizer with time-varying acceleration coefficients. IEEE Trans Evolut Comput 8(3):240\u2013255","journal-title":"IEEE Trans Evolut Comput"},{"issue":"2","key":"1171_CR33","doi-asserted-by":"publisher","first-page":"125","DOI":"10.1016\/0898-1221(76)90024-9","volume":"2","author":"P Robers","year":"1976","unstructured":"Robers P, Cooper L (1976) A study of the fixed charge transportation problem. Comput Math Appl 2(2):125\u2013135","journal-title":"Comput Math Appl"},{"issue":"2","key":"1171_CR34","doi-asserted-by":"publisher","first-page":"221","DOI":"10.1007\/BF00934768","volume":"37","author":"S Sadagopan","year":"1982","unstructured":"Sadagopan S, Ravindran A (1982) A vertex ranking algorithm for the fixed-charge transportation problem. J Optim Theory Appl 37(2):221\u2013230","journal-title":"J Optim Theory Appl"},{"issue":"1","key":"1171_CR35","doi-asserted-by":"publisher","first-page":"373","DOI":"10.1016\/j.ejor.2019.12.024","volume":"284","author":"S Sagratella","year":"2020","unstructured":"Sagratella S, Schmidt M, Sudermann-Merx N (2020) The noncooperative fixed charge transportation problem. Euro J Oper Res 284(1):373\u2013382","journal-title":"Euro J Oper Res"},{"key":"1171_CR36","unstructured":"Shi Y, Eberhart R (1998) A modified particle swarm optimizer. In: 1998 IEEE international conference on evolutionary computation proceedings. IEEE world congress on computational intelligence (Cat. No. 98TH8360), pp. 69\u201373. IEEE"},{"issue":"2","key":"1171_CR37","doi-asserted-by":"publisher","first-page":"217","DOI":"10.1002\/nav.3800170209","volume":"17","author":"DI Steinberg","year":"1970","unstructured":"Steinberg DI (1970) The fixed charge problem. Naval Res Logistics Q 17(2):217\u2013235","journal-title":"Naval Res Logistics Q"},{"issue":"2\u20133","key":"1171_CR38","doi-asserted-by":"publisher","first-page":"441","DOI":"10.1016\/S0377-2217(97)00284-1","volume":"106","author":"M Sun","year":"1998","unstructured":"Sun M, Aronson JE, McKeown PG, Drinka D (1998) A tabu search heuristic procedure for the fixed charge transportation problem. Euro J Oper Res 106(2\u20133):441\u2013456","journal-title":"Euro J Oper Res"},{"key":"1171_CR39","doi-asserted-by":"publisher","first-page":"63","DOI":"10.1016\/j.cie.2018.09.019","volume":"126","author":"FG Tari","year":"2018","unstructured":"Tari FG, Hashemi Z (2018) Prioritized k-mean clustering hybrid ga for discounted fixed charge transportation problems. Comput Ind Eng 126:63\u201374","journal-title":"Comput Ind Eng"},{"issue":"8","key":"1171_CR40","doi-asserted-by":"publisher","first-page":"937","DOI":"10.1016\/j.ins.2005.02.003","volume":"176","author":"F Van den Bergh","year":"2006","unstructured":"Van den Bergh F, Engelbrecht AP (2006) A study of particle swarm optimization particle trajectories. Inf Sci 176(8):937\u2013971","journal-title":"Inf Sci"},{"issue":"1","key":"1171_CR41","first-page":"41","volume":"12","author":"K Yousefi","year":"2019","unstructured":"Yousefi K, J\u00a0Afshari A, Hajiaghaei-Keshteli M (2019) Solving the fixed charge transportation problem by new heuristic approach. J Optim Ind Eng 12(1):41\u201352","journal-title":"J Optim Ind Eng"}],"container-title":["International Journal of System Assurance Engineering and Management"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s13198-021-01171-2.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s13198-021-01171-2\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s13198-021-01171-2.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,11,5]],"date-time":"2023-11-05T12:40:49Z","timestamp":1699188049000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s13198-021-01171-2"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021,6,29]]},"references-count":41,"journal-issue":{"issue":"6","published-print":{"date-parts":[[2021,12]]}},"alternative-id":["1171"],"URL":"https:\/\/doi.org\/10.1007\/s13198-021-01171-2","relation":{},"ISSN":["0975-6809","0976-4348"],"issn-type":[{"type":"print","value":"0975-6809"},{"type":"electronic","value":"0976-4348"}],"subject":[],"published":{"date-parts":[[2021,6,29]]},"assertion":[{"value":"31 December 2019","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"30 May 2021","order":2,"name":"revised","label":"Revised","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"7 June 2021","order":3,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"29 June 2021","order":4,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}},{"order":1,"name":"Ethics","group":{"name":"EthicsHeading","label":"Declarations"}},{"value":"The authors do not have any conflict of interest.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Conflict of interest"}}]}}