{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,8,22]],"date-time":"2026-08-22T22:21:36Z","timestamp":1787437296064,"version":"build-2736575974"},"publisher-location":"Cham","reference-count":23,"publisher":"Springer Nature Switzerland","isbn-type":[{"value":"9783032362223","type":"print"},{"value":"9783032362230","type":"electronic"}],"license":[{"start":{"date-parts":[[2026,8,23]],"date-time":"2026-08-23T00:00:00Z","timestamp":1787443200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2026,8,23]],"date-time":"2026-08-23T00:00:00Z","timestamp":1787443200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2027]]},"DOI":"10.1007\/978-3-032-36223-0_6","type":"book-chapter","created":{"date-parts":[[2026,8,22]],"date-time":"2026-08-22T21:44:49Z","timestamp":1787435089000},"page":"87-102","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Benchmarking the\u00a0Multi-objective Evolutionary Algorithms for\u00a0Solving Non-linear Multi-objective Fixed-Charge Transportation Problems"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0009-0002-3733-8059","authenticated-orcid":false,"given":"Cristian","family":"Pop","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-6877-027X","authenticated-orcid":false,"given":"Adrian","family":"Petrovan","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-0626-9284","authenticated-orcid":false,"given":"Petric\u0103 C.","family":"Pop","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2026,8,23]]},"reference":[{"key":"6_CR1","doi-asserted-by":"publisher","DOI":"10.1016\/j.asoc.2022.108501","volume":"118","author":"A Biswas","year":"2022","unstructured":"Biswas, A., C\u00e1rdenas-Barr\u00f3n, L.E., Shaikh, A.A., Duary, A., C\u00e9spedes-Mota, A.: A study of multi-objective restricted multi-item fixed charge transportation problem considering different types of demands. Appl. Soft Comput. 118, 108501 (2022)","journal-title":"Appl. Soft Comput."},{"key":"6_CR2","doi-asserted-by":"publisher","DOI":"10.1016\/j.eswa.2020.114491","volume":"170","author":"A Biswas","year":"2021","unstructured":"Biswas, A., Pal, T.: A comparison between metaheuristics for solving a capacitated fixed charge transportation problem with multiple objectives. Expert Syst. Appl. 170, 114491 (2021)","journal-title":"Expert Syst. Appl."},{"key":"6_CR3","doi-asserted-by":"publisher","first-page":"628","DOI":"10.1016\/j.asoc.2019.04.011","volume":"80","author":"A Biswas","year":"2019","unstructured":"Biswas, A., Shaikh, A.A., Niaki, S.T.A.: Multi-objective non-linear fixed charge transportation problem with multiple modes of transportation in crisp and interval environments. Appl. Soft Comput. 80, 628\u2013649 (2019)","journal-title":"Appl. Soft Comput."},{"issue":"3","key":"6_CR4","doi-asserted-by":"publisher","first-page":"256","DOI":"10.1109\/TEVC.2004.826067","volume":"8","author":"CAC Coello","year":"2004","unstructured":"Coello, C.A.C., Pulido, G.T., Lechuga, M.S.: Handling multiple objectives with particle swarm optimization. IEEE Trans. Evol. Comput. 8(3), 256\u2013279 (2004)","journal-title":"IEEE Trans. Evol. Comput."},{"key":"6_CR5","doi-asserted-by":"publisher","DOI":"10.1016\/j.cor.2020.104906","volume":"118","author":"O Cosma","year":"2020","unstructured":"Cosma, O., Pop, P.C., D\u0103nciulescu, D.: A novel matheuristic approach for a two-stage transportation problem with fixed costs associated to the routes. Comput. Oper. Res. 118, 104906 (2020)","journal-title":"Comput. Oper. Res."},{"issue":"4","key":"6_CR6","first-page":"681","volume":"31","author":"O Cosma","year":"2020","unstructured":"Cosma, O., Pop, P.C., D\u0103nciulescu, D.: A parallel algorithm for solving a two-stage fixed-charge transportation problem. Informatica 31(4), 681\u2013706 (2020)","journal-title":"Informatica"},{"issue":"5","key":"6_CR7","doi-asserted-by":"publisher","first-page":"712","DOI":"10.3390\/math8050712","volume":"8","author":"O Cosma","year":"2020","unstructured":"Cosma, O., Pop, P.C., Sabo, C.: An efficient hybrid genetic approach for solving the two-stage supply chain network design problem with fixed costs. Mathematics 8(5), 712 (2020)","journal-title":"Mathematics"},{"issue":"2","key":"6_CR8","doi-asserted-by":"publisher","first-page":"182","DOI":"10.1109\/4235.996017","volume":"6","author":"K Deb","year":"2002","unstructured":"Deb, K., Pratap, A., Agarwal, S., Meyarivan, T.: A fast and elitist multiobjective genetic algorithm: Nsga-ii. IEEE Trans. Evol. Comput. 6(2), 182\u2013197 (2002)","journal-title":"IEEE Trans. Evol. Comput."},{"key":"6_CR9","doi-asserted-by":"publisher","first-page":"337","DOI":"10.1007\/s00291-005-0029-9","volume":"28","author":"M Gen","year":"2006","unstructured":"Gen, M., Altiparmak, F., Lin, L.: A genetic algorithm for two-stage transportation problem using priority-based encoding. OR Spectrum 28, 337\u2013354 (2006)","journal-title":"OR Spectrum"},{"key":"6_CR10","unstructured":"Gen, M., Cheng, R.: Genetic algorithms and engineering optimization. John Wiley & Sons (1997)"},{"issue":"2","key":"6_CR11","doi-asserted-by":"publisher","first-page":"290","DOI":"10.1016\/j.cie.2007.06.022","volume":"53","author":"JB Jo","year":"2007","unstructured":"Jo, J.B., Li, Y., Gen, M.: Nonlinear fixed charge transportation problem by spanning tree-based genetic algorithm. Comput. Ind. Eng. 53(2), 290\u2013298 (2007)","journal-title":"Comput. Ind. Eng."},{"key":"6_CR12","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/s40819-021-01134-y","volume":"7","author":"Y Kacher","year":"2021","unstructured":"Kacher, Y., Singh, P.: A comprehensive literature review on transportation problems. Int. J. Appl. Comput. Math. 7, 1\u201349 (2021)","journal-title":"Int. J. Appl. Comput. Math."},{"issue":"5","key":"6_CR13","doi-asserted-by":"publisher","first-page":"2711","DOI":"10.1016\/j.asoc.2012.11.016","volume":"13","author":"MM Lotfi","year":"2013","unstructured":"Lotfi, M.M., Tavakkoli-Moghaddam, R.: A genetic algorithm using priority-based encoding with new operators for fixed charge transportation problems. Appl. Soft Comput. 13(5), 2711\u20132726 (2013)","journal-title":"Appl. Soft Comput."},{"key":"6_CR14","doi-asserted-by":"publisher","DOI":"10.1016\/j.eswa.2022.119372","volume":"215","author":"A Petrovan","year":"2023","unstructured":"Petrovan, A., Pop, P., Sabo, C., Zelina, I.: Novel two-level hybrid genetic algorithms based on different cayley-type encodings for solving the clustered shortest-path tree problem. Expert Syst. Appl. 215, 119372 (2023)","journal-title":"Expert Syst. Appl."},{"key":"6_CR15","doi-asserted-by":"crossref","unstructured":"Pop, C., Pop, P.C., Petrovan, A.: An improved pareto front for the non-linear multi-objective fixed cost transportation problem. In: 2025 IEEE Congress on Evolutionary Computation (CEC), pp.\u00a01\u20134. IEEE (2025)","DOI":"10.1109\/CEC65147.2025.11042989"},{"key":"6_CR16","doi-asserted-by":"crossref","unstructured":"Pop, C., Pop, P.C., Petrovan, A.: A pr\u00fcfer-based genetic algorithm for solving a non-linear multi-objective fixed-charge transportation problem. In: 2025 IEEE International Conference on Systems, Man, and Cybernetics (SMC), pp. 468\u2013473. IEEE (2025)","DOI":"10.1109\/SMC58881.2025.11343248"},{"issue":"3","key":"6_CR17","doi-asserted-by":"publisher","first-page":"365","DOI":"10.37193\/CJM.2017.03.11","volume":"33","author":"PC Pop","year":"2017","unstructured":"Pop, P.C., Sabo, C., Biesinger, B., Hu, B., Raidl, G.R.: Solving the two-stage fixed-charge transportation problem with a hybrid genetic algorithm. Carpathian J. Math. 33(3), 365\u2013371 (2017)","journal-title":"Carpathian J. Math."},{"key":"6_CR18","doi-asserted-by":"publisher","unstructured":"Sabo, C., Teglas, B., Pop, P.C., Petrovan, A.: Solving the clustered minimum routing tree problem using pr\u00fcfer-coding based hybrid genetic algorithms. In: International Conference on Hybrid Artificial Intelligence Systems, pp. 312\u2013323. Springer, Cham (2024). https:\/\/doi.org\/10.1007\/978-3-031-74183-8_26","DOI":"10.1007\/978-3-031-74183-8_26"},{"issue":"1","key":"6_CR19","doi-asserted-by":"publisher","first-page":"86","DOI":"10.1109\/TEVC.2010.2077298","volume":"16","author":"L While","year":"2011","unstructured":"While, L., Bradstreet, L., Barone, L.: A fast way of calculating exact hypervolumes. IEEE Trans. Evol. Comput. 16(1), 86\u201395 (2011)","journal-title":"IEEE Trans. Evol. Comput."},{"key":"6_CR20","doi-asserted-by":"crossref","unstructured":"Yousefi, K., Afshari, J., Hajiaghaei-Keshteli, A., M.: Heuristic approaches to solve the fixed-charge transportation problem with discount supposition. J. Ind. Prod. Eng. 35(7), 444\u2013470 (2018)","DOI":"10.1080\/21681015.2018.1518933"},{"issue":"6","key":"6_CR21","doi-asserted-by":"publisher","first-page":"712","DOI":"10.1109\/TEVC.2007.892759","volume":"11","author":"Q Zhang","year":"2007","unstructured":"Zhang, Q., Li, H.: Moea\/d: A multiobjective evolutionary algorithm based on decomposition. IEEE Trans. Evol. Comput. 11(6), 712\u2013731 (2007)","journal-title":"IEEE Trans. Evol. Comput."},{"key":"6_CR22","unstructured":"Zitzler, E., Laumanns, M., Thiele, L.: Spea 2: Improving the strength pareto evolutionary algorithm. TIK report, 103 (2001)"},{"issue":"4","key":"6_CR23","doi-asserted-by":"publisher","first-page":"257","DOI":"10.1109\/4235.797969","volume":"3","author":"E Zitzler","year":"2002","unstructured":"Zitzler, E., Thiele, L.: Multiobjective evolutionary algorithms: a comparative case study and the strength pareto approach. IEEE Trans. Evol. Comput. 3(4), 257\u2013271 (2002)","journal-title":"IEEE Trans. Evol. Comput."}],"container-title":["Lecture Notes in Computer Science","Parallel Problem Solving from Nature \u2013 PPSN XIX"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-032-36223-0_6","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,8,22]],"date-time":"2026-08-22T21:44:50Z","timestamp":1787435090000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-032-36223-0_6"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2026,8,23]]},"ISBN":["9783032362223","9783032362230"],"references-count":23,"URL":"https:\/\/doi.org\/10.1007\/978-3-032-36223-0_6","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2026,8,23]]},"assertion":[{"value":"23 August 2026","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"PPSN","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Parallel Problem Solving from Nature","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Trento","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Italy","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2026","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"29 August 2026","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2 September 2026","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"19","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"ppsn2026","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}