{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,25]],"date-time":"2026-01-25T11:05:49Z","timestamp":1769339149109,"version":"3.49.0"},"reference-count":51,"publisher":"Springer Science and Business Media LLC","issue":"3","license":[{"start":{"date-parts":[[2022,6,9]],"date-time":"2022-06-09T00:00:00Z","timestamp":1654732800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2022,6,9]],"date-time":"2022-06-09T00:00:00Z","timestamp":1654732800000},"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":["Comput Optim Appl"],"published-print":{"date-parts":[[2022,7]]},"DOI":"10.1007\/s10589-022-00379-7","type":"journal-article","created":{"date-parts":[[2022,6,9]],"date-time":"2022-06-09T04:02:46Z","timestamp":1654747366000},"page":"717-751","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":4,"title":["Design of a heuristic algorithm for the generalized multi-objective set covering problem"],"prefix":"10.1007","volume":"82","author":[{"given":"Lakmali","family":"Weerasena","sequence":"first","affiliation":[]},{"given":"Aniekan","family":"Ebiefung","sequence":"additional","affiliation":[]},{"given":"Anthony","family":"Skjellum","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2022,6,9]]},"reference":[{"key":"379_CR1","doi-asserted-by":"crossref","unstructured":"Alsheddy, A., Tsang, E.E.: Guided pareto local search based frameworks for biobjective optimization. In: IEEE Congress on Evolutionary Computation, pp. 1\u20138. IEEE (2010)","DOI":"10.1109\/CEC.2010.5585983"},{"issue":"2","key":"379_CR2","doi-asserted-by":"publisher","first-page":"195","DOI":"10.1504\/IJOR.2012.048867","volume":"15","author":"D Bandara","year":"2012","unstructured":"Bandara, D., Mayorga, M., McLay, M.L.: Optimal dispatching strategies for emergency vehicles to increase patient survivability. Int. J. Oper. Res. 15(2), 195\u2013214 (2012)","journal-title":"Int. J. Oper. Res."},{"issue":"2","key":"379_CR3","doi-asserted-by":"publisher","first-page":"171","DOI":"10.1007\/s12532-014-0064-0","volume":"6","author":"A Bettinelli","year":"2014","unstructured":"Bettinelli, A., Ceselli, A., Righini, G.: A branch-and-price algorithm for the multi-depot heterogeneous-fleet pickup and delivery problem with soft time windows. Math. Program. Comput. 6(2), 171\u2013197 (2014)","journal-title":"Math. Program. Comput."},{"issue":"3","key":"379_CR4","doi-asserted-by":"publisher","first-page":"233","DOI":"10.1287\/moor.4.3.233","volume":"4","author":"V Chvatal","year":"1979","unstructured":"Chvatal, V.: A greedy heuristic for the set-covering problem. Math. Oper. Res. 4(3), 233\u2013235 (1979)","journal-title":"Math. Oper. Res."},{"issue":"1","key":"379_CR5","doi-asserted-by":"publisher","first-page":"34","DOI":"10.1002\/(SICI)1099-1360(199801)7:1<34::AID-MCDA161>3.0.CO;2-6","volume":"7","author":"P Czyz\u017cak","year":"1998","unstructured":"Czyz\u017cak, P., Jaszkiewicz, A.: Pareto simulated annealing-a metaheuristic technique for multiple-objective combinatorial optimization. J. Multi-criteria Decis. Anal. 7(1), 34\u201347 (1998)","journal-title":"J. Multi-criteria Decis. Anal."},{"issue":"2","key":"379_CR6","doi-asserted-by":"publisher","first-page":"137","DOI":"10.1287\/trsc.15.2.137","volume":"15","author":"MS Daskin","year":"1981","unstructured":"Daskin, M.S., Stern, E.H.: A hierarchical objective set covering model for emergency medical service vehicle deployment. Transp. Sci. 15(2), 137\u2013152 (1981)","journal-title":"Transp. Sci."},{"issue":"1","key":"379_CR7","doi-asserted-by":"publisher","first-page":"5","DOI":"10.1111\/j.1475-3995.2000.tb00182.x","volume":"7","author":"M Ehrgott","year":"2000","unstructured":"Ehrgott, M.: Approximation algorithms for combinatorial multicriteria optimization problems. Int. Trans. Oper. Res. 7(1), 5\u201331 (2000)","journal-title":"Int. Trans. Oper. Res."},{"key":"379_CR8","volume-title":"Multicriteria Optimization","author":"M Ehrgott","year":"2006","unstructured":"Ehrgott, M.: Multicriteria Optimization. Springer, New York (2006)"},{"issue":"4","key":"379_CR9","doi-asserted-by":"publisher","first-page":"425","DOI":"10.1007\/s002910000046","volume":"22","author":"M Ehrgott","year":"2000","unstructured":"Ehrgott, M., Gandibleux, X.: A survey and annotated bibliography of multiobjective combinatorial optimization. OR-Spektrum 22(4), 425\u2013460 (2000)","journal-title":"OR-Spektrum"},{"issue":"2","key":"379_CR10","doi-asserted-by":"publisher","first-page":"390","DOI":"10.1016\/j.ejor.2009.12.027","volume":"205","author":"JR Figueira","year":"2010","unstructured":"Figueira, J.R., Liefooghe, A., Talbi, E.-G., Wierzbicki, A.P.: A parallel multiple reference point approach for multi-objective optimization. Eur. J. Oper. Res. 205(2), 390\u2013400 (2010)","journal-title":"Eur. J. Oper. Res."},{"issue":"1\u20133","key":"379_CR11","doi-asserted-by":"publisher","first-page":"23","DOI":"10.1007\/s10107-003-0395-5","volume":"98","author":"M Fischetti","year":"2003","unstructured":"Fischetti, M., Lodi, A.: Local branching. Math. Program. 98(1\u20133), 23\u201347 (2003)","journal-title":"Math. Program."},{"key":"379_CR12","first-page":"1","volume":"237","author":"K Florios","year":"2014","unstructured":"Florios, K., Mavrotas, G.: Generation of the exact pareto set in multi-objective traveling salesman and set covering problems. Appl. Math. Comput. 237, 1\u201319 (2014)","journal-title":"Appl. Math. Comput."},{"key":"379_CR13","doi-asserted-by":"crossref","unstructured":"Gandibleux, X., Mezdaoui, N., Fr\u00e9ville, A.: A tabu search procedure to solve multiobjective combinatorial optimization problems. In: Advances in Multiple Objective and Goal Programming, pp. 291\u2013300. Springer, New York (1997)","DOI":"10.1007\/978-3-642-46854-4_32"},{"issue":"1","key":"379_CR14","doi-asserted-by":"publisher","first-page":"116","DOI":"10.1016\/j.ejor.2006.03.041","volume":"180","author":"C Garc\u00eda-Mart\u00ednez","year":"2007","unstructured":"Garc\u00eda-Mart\u00ednez, C., Cord\u00f3n, O., Herrera, F.: A taxonomy and an empirical analysis of multiple objective ant colony optimization algorithms for the bi-criteria tsp. Eur. J. Oper. Res. 180(1), 116\u2013148 (2007)","journal-title":"Eur. J. Oper. Res."},{"issue":"3","key":"379_CR15","first-page":"296","volume":"1","author":"Y Haimes","year":"1971","unstructured":"Haimes, Y.: On a bicriterion formulation of the problems of integrated system identification and system optimization. IEEE Trans. Syst. Man Cybern. 1(3), 296\u2013297 (1971)","journal-title":"IEEE Trans. Syst. Man Cybern."},{"issue":"1","key":"379_CR16","doi-asserted-by":"publisher","first-page":"203","DOI":"10.1007\/s10479-006-0075-y","volume":"148","author":"PL Hammer","year":"2006","unstructured":"Hammer, P.L., Bonates, T.O.: Logical analysis of data: an overview: from combinatorial optimization to medical applications. Ann. Oper. Res. 148(1), 203\u2013225 (2006)","journal-title":"Ann. Oper. Res."},{"issue":"2","key":"379_CR17","doi-asserted-by":"publisher","first-page":"147","DOI":"10.1002\/j.1538-7305.1950.tb00463.x","volume":"29","author":"RW Hamming","year":"1950","unstructured":"Hamming, R.W.: Error detecting and error correcting codes. Bell Syst. Tech. J. 29(2), 147\u2013160 (1950)","journal-title":"Bell Syst. Tech. J."},{"issue":"3","key":"379_CR18","doi-asserted-by":"publisher","first-page":"419","DOI":"10.1023\/A:1009690717521","volume":"6","author":"MP Hansen","year":"2000","unstructured":"Hansen, M.P.: Use of substitute scalarizing functions to guide a local search based heuristic: the case of MOTSP. J. Heuristics 6(3), 419\u2013431 (2000)","journal-title":"J. Heuristics"},{"key":"379_CR19","unstructured":"https:\/\/github.com\/vOptSolver\/vOptLib\/tree\/master\/SCP"},{"issue":"1","key":"379_CR20","doi-asserted-by":"publisher","first-page":"50","DOI":"10.1016\/S0377-2217(01)00104-7","volume":"137","author":"A Jaszkiewicz","year":"2002","unstructured":"Jaszkiewicz, A.: Genetic local search for multi-objective combinatorial optimization. Eur. J. Oper. Res. 137(1), 50\u201371 (2002)","journal-title":"Eur. J. Oper. Res."},{"issue":"2","key":"379_CR21","doi-asserted-by":"publisher","first-page":"133","DOI":"10.1109\/TEVC.2003.810759","volume":"7","author":"A Jaszkiewicz","year":"2003","unstructured":"Jaszkiewicz, A.: Do multiple-objective metaheuristics deliver on their promises? A computational experiment on the set-covering problem. IEEE Trans. Evol. Comput. 7(2), 133\u2013143 (2003)","journal-title":"IEEE Trans. Evol. Comput."},{"issue":"1\u20134","key":"379_CR22","doi-asserted-by":"publisher","first-page":"135","DOI":"10.1023\/B:ANOR.0000039516.50069.5b","volume":"131","author":"A Jaszkiewicz","year":"2004","unstructured":"Jaszkiewicz, A.: A comparative study of multiple-objective metaheuristics on the bi-objective set covering problem and the pareto memetic algorithm. Ann. Oper. Res. 131(1\u20134), 135\u2013158 (2004)","journal-title":"Ann. Oper. Res."},{"key":"379_CR23","doi-asserted-by":"crossref","unstructured":"Karp, R.M.: Reducibility among combinatorial problems. In: Complexity of Computer Computations, pp. 85\u2013103. Springer (1972)","DOI":"10.1007\/978-1-4684-2001-2_9"},{"issue":"6","key":"379_CR24","doi-asserted-by":"publisher","first-page":"1845","DOI":"10.1109\/TSMCB.2012.2231860","volume":"43","author":"L Ke","year":"2013","unstructured":"Ke, L., Zhang, Q., Battiti, R.: Moea\/d-aco: a multiobjective evolutionary algorithm using decomposition and antcolony. IEEE Trans. Cybern. 43(6), 1845\u20131859 (2013)","journal-title":"IEEE Trans. Cybern."},{"issue":"1\u20134","key":"379_CR25","doi-asserted-by":"publisher","first-page":"223","DOI":"10.1023\/B:ANOR.0000019091.54417.ca","volume":"127","author":"N Kohl","year":"2004","unstructured":"Kohl, N., Karisch, S.E.: Airline crew rostering: problem types, modeling, and optimization. Ann. Oper. Res. 127(1\u20134), 223\u2013257 (2004)","journal-title":"Ann. Oper. Res."},{"issue":"3","key":"379_CR26","doi-asserted-by":"publisher","first-page":"1387","DOI":"10.1016\/j.ejor.2005.09.028","volume":"176","author":"G Lan","year":"2007","unstructured":"Lan, G., DePuy, G.W., Whitehouse, G.E.: An effective and simple heuristic for the set covering problem. Eur. J. Oper. Res. 176(3), 1387\u20131403 (2007)","journal-title":"Eur. J. Oper. Res."},{"issue":"3","key":"379_CR27","doi-asserted-by":"publisher","first-page":"511","DOI":"10.1007\/s10732-009-9108-4","volume":"16","author":"Y-C Liang","year":"2010","unstructured":"Liang, Y.-C., Lo, M.-H.: Multi-objective redundancy allocation optimization using a variable neighborhood search algorithm. J. Heuristics 16(3), 511\u2013535 (2010)","journal-title":"J. Heuristics"},{"key":"379_CR28","doi-asserted-by":"crossref","unstructured":"Lust, T., Teghem, J., Tuyttens, D.: Very large-scale neighborhood search for solving multiobjective combinatorial optimization problems. In: International Conference on Evolutionary Multi-Criterion Optimization, pp. 254\u2013268. Springer (2011)","DOI":"10.1007\/978-3-642-19893-9_18"},{"issue":"2","key":"379_CR29","doi-asserted-by":"publisher","first-page":"165","DOI":"10.1007\/s10732-013-9236-8","volume":"20","author":"T Lust","year":"2014","unstructured":"Lust, T., Tuyttens, D.: Variable and large neighborhood search to solve the multiobjective set covering problem. J. Heuristics 20(2), 165\u2013188 (2014)","journal-title":"J. Heuristics"},{"key":"379_CR30","doi-asserted-by":"crossref","unstructured":"Marchiori, E., Steenbeek, A.: An evolutionary algorithm for large scale set covering problems with application to airline crew scheduling. In: Workshops on Real-World Applications of Evolutionary Computation, pp. 370\u2013384. Springer (2000)","DOI":"10.1007\/3-540-45561-2_36"},{"key":"379_CR31","doi-asserted-by":"crossref","unstructured":"Marchiori. E., Steenbeek, A.: An evolutionary algorithm for large scale set covering problems with application to airline crew scheduling. In: 41st Annual Symposium on Real-World Applications of Evolutionary Computation, Workshops, pp. 370\u2013384. Springer, Berlin (2000)","DOI":"10.1007\/3-540-45561-2_36"},{"issue":"2","key":"379_CR32","doi-asserted-by":"publisher","first-page":"165","DOI":"10.1002\/net.3230110208","volume":"11","author":"RE Marsten","year":"1981","unstructured":"Marsten, R.E., Shepardson, F.: Exact solution of crew scheduling problems using the set partitioning model: recent successful applications. Networks 11(2), 165\u2013177 (1981)","journal-title":"Networks"},{"issue":"18","key":"379_CR33","first-page":"9652","volume":"219","author":"G Mavrotas","year":"2013","unstructured":"Mavrotas, G., Florios, K.: An improved version of the augmented $\\varepsilon $-constraint method (augmecon2) for finding the exact pareto set in multi-objective integer programming problems. Appl. Math. Comput. 219(18), 9652\u20139669 (2013)","journal-title":"Appl. Math. Comput."},{"issue":"2","key":"379_CR34","doi-asserted-by":"publisher","first-page":"107","DOI":"10.1023\/A:1015649716111","volume":"7","author":"MD McDonnell","year":"2002","unstructured":"McDonnell, M.D., Possingham, H.P., Ball, I.R., Cousins, E.A.: Mathematical methods for spatially cohesive reserve design. Environ. Model. Assess. 7(2), 107\u2013114 (2002)","journal-title":"Environ. Model. Assess."},{"key":"379_CR35","doi-asserted-by":"crossref","unstructured":"Nikas, A., Fountoulakis, A., Forouli, A., Doukas, H.: A robust augmented $\\varepsilon $-constraint method (augmecon-r) for finding exact solutions of multi-objective linear programming problems. Oper. Res. 1\u201342 (2020)","DOI":"10.1007\/s12351-020-00574-6"},{"issue":"9","key":"379_CR36","doi-asserted-by":"publisher","first-page":"2619","DOI":"10.1016\/j.cor.2008.11.013","volume":"36","author":"L Paquete","year":"2009","unstructured":"Paquete, L., St\u00fctzle, T.: Design and analysis of stochastic local search for the multiobjective traveling salesman problem. Comput. Oper. Res. 36(9), 2619\u20132631 (2009)","journal-title":"Comput. Oper. Res."},{"issue":"1","key":"379_CR37","doi-asserted-by":"publisher","first-page":"23","DOI":"10.1007\/s10479-006-0060-5","volume":"147","author":"C Prins","year":"2006","unstructured":"Prins, C., Prodhon, C., Calvo, R.W.: Two-phase method and Lagrangian relaxation to solve the bi-objective set covering problem. Ann. Oper. Res. 147(1), 23\u201341 (2006)","journal-title":"Ann. Oper. Res."},{"issue":"1","key":"379_CR38","doi-asserted-by":"publisher","first-page":"155","DOI":"10.1007\/BF02097801","volume":"18","author":"C Revelle","year":"1989","unstructured":"Revelle, C., Hogan, K.: The maximum reliability location problem and $\\alpha $-reliablep-center problem: derivatives of the probabilistic location set covering problem. Ann. Oper. Res. 18(1), 155\u2013173 (1989)","journal-title":"Ann. Oper. Res."},{"issue":"2","key":"379_CR39","first-page":"165","volume":"11","author":"RR Saxena","year":"1981","unstructured":"Saxena, R.R., Arora, S.R.: Exact solution of crew scheduling problems using the set partitioning model: recent successful applications. Optimization 11(2), 165\u2013177 (1981)","journal-title":"Optimization"},{"issue":"3","key":"379_CR40","doi-asserted-by":"publisher","first-page":"690","DOI":"10.1016\/j.ejor.2015.04.010","volume":"245","author":"B Soylu","year":"2015","unstructured":"Soylu, B.: Heuristic approaches for biobjective mixed 0\u20131 integer linear programming problems. Eur. J. Oper. Res. 245(3), 690\u2013703 (2015)","journal-title":"Eur. J. Oper. Res."},{"key":"379_CR41","unstructured":"Steuer, R.E.: Multiple criteria optimization. Theory Comput. Appl. (1986)"},{"issue":"2","key":"379_CR42","doi-asserted-by":"publisher","first-page":"83","DOI":"10.1002\/mcda.4020030204","volume":"3","author":"EL Ulungu","year":"1994","unstructured":"Ulungu, E.L., Teghem, J.: Multi-objective combinatorial optimization problems: a survey. J. Multi-criteria Decis. Anal. 3(2), 83\u2013104 (1994)","journal-title":"J. Multi-criteria Decis. Anal."},{"issue":"1","key":"379_CR43","doi-asserted-by":"publisher","first-page":"163","DOI":"10.1002\/nav.3800310118","volume":"31","author":"FJ Vasko","year":"1984","unstructured":"Vasko, F.J.: An efficient heuristic for large set covering problems. Naval Res. Logist. Q. 31(1), 163\u2013171 (1984)","journal-title":"Naval Res. Logist. Q."},{"issue":"2","key":"379_CR44","first-page":"167","volume":"10","author":"L Weerasena","year":"2020","unstructured":"Weerasena, L.: Algorithm for generalised multi-objective set covering problem with an application in ecological conservation. Int. J. Math. Model. Numer. Optim. 10(2), 167\u2013186 (2020)","journal-title":"Int. J. Math. Model. Numer. Optim."},{"issue":"5","key":"379_CR45","doi-asserted-by":"publisher","first-page":"437","DOI":"10.1007\/s10666-013-9393-z","volume":"19","author":"L Weerasena","year":"2014","unstructured":"Weerasena, L., Shier, D., Tonkyn, D.: A hierarchical approach to designing compact ecological reserve systems. Environ. Model. Assess. 19(5), 437\u2013449 (2014)","journal-title":"Environ. Model. Assess."},{"key":"379_CR46","doi-asserted-by":"crossref","unstructured":"Weerasena, L., Wiecek, M.M.: A tolerance function for the multiobjective set covering problem. Optim. Lett. 1\u201319 (2018)","DOI":"10.1007\/s11590-018-1267-5"},{"issue":"1\u20132","key":"379_CR47","doi-asserted-by":"publisher","first-page":"493","DOI":"10.1007\/s10479-016-2229-x","volume":"248","author":"L Weerasena","year":"2017","unstructured":"Weerasena, L., Wiecek, M.M., Soylu, B.: An algorithm for approximating the pareto set of the multiobjective set covering problem. Ann. Oper. Res. 248(1\u20132), 493\u2013514 (2017)","journal-title":"Ann. Oper. Res."},{"key":"379_CR48","doi-asserted-by":"crossref","unstructured":"Wierzbicki, A.P.: The use of reference objectives in multiobjective optimization. In: Multiple Criteria Decision Making Theory and Application, pp. 468\u2013486. Springer (1980)","DOI":"10.1007\/978-3-642-48782-8_32"},{"issue":"2","key":"379_CR49","doi-asserted-by":"publisher","first-page":"73","DOI":"10.1007\/BF01719738","volume":"8","author":"AP Wierzbicki","year":"1986","unstructured":"Wierzbicki, A.P.: On the completeness and constructiveness of parametric characterizations to vector optimization problems. Oper. Res. Spektrum 8(2), 73\u201387 (1986)","journal-title":"Oper. Res. Spektrum"},{"issue":"1","key":"379_CR50","doi-asserted-by":"publisher","first-page":"15","DOI":"10.1016\/j.ejor.2013.09.001","volume":"234","author":"W Zhang","year":"2014","unstructured":"Zhang, W., Reimann, M.: A simple augmented\u00e2-constraint method for multi-objective mathematical integer programming problems. Eur. J. Oper. Res. 234(1), 15\u201324 (2014)","journal-title":"Eur. J. Oper. Res."},{"issue":"2","key":"379_CR51","doi-asserted-by":"publisher","first-page":"173","DOI":"10.1162\/106365600568202","volume":"8","author":"E Zitzler","year":"2000","unstructured":"Zitzler, E., Deb, K., Thiele, L.: Comparison of multiobjective evolutionary algorithms: empirical results. Evol. Comput. 8(2), 173\u2013195 (2000)","journal-title":"Evol. Comput."}],"container-title":["Computational Optimization and Applications"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10589-022-00379-7.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s10589-022-00379-7\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10589-022-00379-7.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,6,20]],"date-time":"2022-06-20T11:13:37Z","timestamp":1655723617000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s10589-022-00379-7"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022,6,9]]},"references-count":51,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2022,7]]}},"alternative-id":["379"],"URL":"https:\/\/doi.org\/10.1007\/s10589-022-00379-7","relation":{},"ISSN":["0926-6003","1573-2894"],"issn-type":[{"value":"0926-6003","type":"print"},{"value":"1573-2894","type":"electronic"}],"subject":[],"published":{"date-parts":[[2022,6,9]]},"assertion":[{"value":"29 April 2021","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"12 May 2022","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"9 June 2022","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}