{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,12]],"date-time":"2026-05-12T16:01:07Z","timestamp":1778601667289,"version":"3.51.4"},"reference-count":46,"publisher":"Springer Science and Business Media LLC","issue":"3","license":[{"start":{"date-parts":[[2008,6,25]],"date-time":"2008-06-25T00:00:00Z","timestamp":1214352000000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Soft Comput"],"published-print":{"date-parts":[[2009,2]]},"DOI":"10.1007\/s00500-008-0320-1","type":"journal-article","created":{"date-parts":[[2008,6,24]],"date-time":"2008-06-24T15:05:24Z","timestamp":1214319924000},"page":"227-243","source":"Crossref","is-referenced-by-count":30,"title":["A multi-objective GRASP for partial classification"],"prefix":"10.1007","volume":"13","author":[{"given":"Alan P.","family":"Reynolds","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Beatriz","family":"de la Iglesia","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2008,6,25]]},"reference":[{"key":"320_CR1","doi-asserted-by":"crossref","first-page":"119","DOI":"10.1090\/dimacs\/050\/06","volume-title":"External memory algorithms and visualization, vol 50","author":"J Abello","year":"1999","unstructured":"Abello J, Pardalos PM, Resende MGC (1999) On Maximum clique problems in very large graphs. In: Abello J, Vitter J (eds) External memory algorithms and visualization, vol 50. American Mathematical Society, New York, pp 119\u2013130"},{"key":"320_CR2","doi-asserted-by":"crossref","first-page":"393","DOI":"10.1016\/S0167-8191(03)00014-0","volume":"29","author":"RM Aiex","year":"2003","unstructured":"Aiex RM, Binato S, Resende MGC (2003) Parallel GRASP with path-relinking for job shop scheduling. Parallel Comput 29: 393\u2013430","journal-title":"Parallel Comput"},{"key":"320_CR3","unstructured":"Ali K, Manganaris S, Srikant R (1997) Partial classification using association rules. In: Proceedings of the third international conference on knowledge discovery and data mining, pp 115\u2013118"},{"key":"320_CR4","doi-asserted-by":"crossref","first-page":"429","DOI":"10.1023\/A:1015439913121","volume":"8","author":"AA Andreatta","year":"2002","unstructured":"Andreatta AA, Ribeiro CC (2002) Heuristics for the phylogeny problem. J Heuristics 8: 429\u2013447","journal-title":"J Heuristics"},{"key":"320_CR5","doi-asserted-by":"crossref","first-page":"211","DOI":"10.1023\/A:1009772208981","volume":"5","author":"MF Arg\u00fcello","year":"1997","unstructured":"Arg\u00fcello MF, Bard JF (1997) A GRASP for aircraft routing in response to groundings and delays. J Comb Optim 5: 211\u2013228","journal-title":"J Comb Optim"},{"key":"320_CR6","unstructured":"Bayardo RJ Jr, Agrawal R (1999) Mining the most interesting rules. In: Proceedings of the 5th international conference on knowledge discovery and data mining (KDD \u201999), pp 145\u2013154"},{"key":"320_CR7","first-page":"58","volume-title":"Essays and surveys in metaheuristics","author":"S Binato","year":"2002","unstructured":"Binato S, Hery WJ, Loewenstern DM, Resende MGC (2002) A greedy randomized adaptive search procedure for job shop scheduling. In: Ribeiro CC, Hansen P (eds) Essays and surveys in metaheuristics. Kluwer, Dordrecht, pp 58\u201379"},{"key":"320_CR8","doi-asserted-by":"crossref","DOI":"10.1093\/oso\/9780198538493.001.0001","volume-title":"Neural networks for pattern recognition","author":"CM Bishop","year":"1995","unstructured":"Bishop CM (1995) Neural networks for pattern recognition. Oxford University Press, New York"},{"key":"320_CR9","volume-title":"Classification and regression trees","author":"L Breiman","year":"1984","unstructured":"Breiman L, Friedman JH, Olshen RA, Stone C (1984) Classification and regression trees. Wadsworth, Belmont"},{"issue":"3\u20134","key":"320_CR10","first-page":"235","volume":"12","author":"JR Cano","year":"2002","unstructured":"Cano JR, Cord\u00f3n O, Herrera F, S\u00e1nchez L (2002) A greedy randomized adaptive search procedure applied to the clustering problem as an initialization process using K-Means as a local search procedure. J Intell Fuzzy Syst 12(3\u20134): 235\u2013242","journal-title":"J Intell Fuzzy Syst"},{"key":"320_CR11","doi-asserted-by":"crossref","DOI":"10.1017\/CBO9780511801389","volume-title":"An introduction to support vector machines and other kernel-based learning methods","author":"N Cristianini","year":"2000","unstructured":"Cristianini N, Shawe-Taylor J (2000) An introduction to support vector machines and other kernel-based learning methods. Cambridge University Press, London"},{"key":"320_CR12","doi-asserted-by":"crossref","unstructured":"de la Iglesia B, Philpott MS, Bagnall AJ, Rayward-Smith VJ (2003) Data mining rules using multi-objective evolutionary algorithms. In: Proceedings of the 2003 IEEE congress on evolutionary computation, pp 1552\u20131559","DOI":"10.1109\/CEC.2003.1299857"},{"key":"320_CR13","doi-asserted-by":"crossref","unstructured":"de la Iglesia B, Reynolds A, Rayward-Smith VJ (2005) Developments on a multi-objective metaheuristic (MOMH) algorithm for finding interesting sets of classification rules. In: Evolutionary multi-criterion optimization: third international conference, EMO 2005, pp 826\u2013840","DOI":"10.1007\/978-3-540-31880-4_57"},{"issue":"3","key":"320_CR14","doi-asserted-by":"crossref","first-page":"898","DOI":"10.1016\/j.ejor.2004.08.025","volume":"169","author":"B Iglesia de la","year":"2006","unstructured":"de la Iglesia B, Richards G, Philpott MS, Rayward-Smith VJ (2006) The application and effectiveness of a multi-objective metaheuristic algorithm for partial classification. Eur J Oper Res 169(3): 898\u2013917","journal-title":"Eur J Oper Res"},{"key":"320_CR15","volume-title":"Multi-objective optimization using evolutionary algorithms","author":"K Deb","year":"2001","unstructured":"Deb K (2001) Multi-objective optimization using evolutionary algorithms. Wiley, New York"},{"issue":"2","key":"320_CR16","doi-asserted-by":"crossref","first-page":"182","DOI":"10.1109\/4235.996017","volume":"6","author":"K Deb","year":"2002","unstructured":"Deb K, Pratap A, Agarwal S, Meyarivan T (2002) A fast and elitist multiobjective genetic algorithm: NSGA-II. IEEE Trans Evol Comput 6(2): 182\u2013197","journal-title":"IEEE Trans Evol Comput"},{"key":"320_CR17","doi-asserted-by":"crossref","first-page":"109","DOI":"10.1007\/BF01096763","volume":"6","author":"TA Feo","year":"1995","unstructured":"Feo TA, Resende MGC (1995) Greedy randomized adaptive search procedures. J Glob Optim 6: 109\u2013133","journal-title":"J Glob Optim"},{"key":"320_CR18","unstructured":"Festa P, Resende MGC (2004) An annotated bibliography of GRASP. Technical Report TD-5WYSEW, AT and T Labs"},{"issue":"3","key":"320_CR19","doi-asserted-by":"crossref","first-page":"305","DOI":"10.1109\/TEVC.2003.810733","volume":"7","author":"JE Fieldsend","year":"2003","unstructured":"Fieldsend JE, Everson RM, Singh S (2003) Using unconstrained elite archives for multi-objective optimization. IEEE Trans Evol Comput 7(3): 305\u2013323","journal-title":"IEEE Trans Evol Comput"},{"key":"320_CR20","doi-asserted-by":"crossref","first-page":"123","DOI":"10.1016\/j.ins.2003.03.021","volume":"163","author":"A Ghosh","year":"2004","unstructured":"Ghosh A, Nath B (2004) Multi-objective rule mining using genetic algorithms. Inf Sci 163: 123\u2013133","journal-title":"Inf Sci"},{"key":"320_CR21","volume-title":"Data mining: concepts and techniques","author":"J Han","year":"2006","unstructured":"Han J, Kamber M (2006) Data mining: concepts and techniques, 2nd edn. Morgan Kaufmann, Menlo Park","edition":"2"},{"key":"320_CR22","unstructured":"Hettich S, Bay DD (1999) The UCI KDD archive. http:\/\/kdd.ics.uci.edu"},{"issue":"3","key":"320_CR23","doi-asserted-by":"crossref","first-page":"392","DOI":"10.1109\/5326.704576","volume":"28","author":"H Ishibuchi","year":"1998","unstructured":"Ishibuchi H, Murata T (1998) A multi-objective genetic local search algorithm and its application to flowshop scheduling. IEEE Trans Syst Man Cybern Part C Appl Rev 28(3): 392\u2013403","journal-title":"IEEE Trans Syst Man Cybern Part C Appl Rev"},{"key":"320_CR24","doi-asserted-by":"crossref","unstructured":"Ishibuchi H, Murata T (1999) Local search procedures in a multi-objective genetic local search algorithm for scheduling problems. In: Proceedings of the IEEE international conference on systems, man, and cybernetics, vol 1, pp 665\u2013670","DOI":"10.1109\/ICSMC.1999.814171"},{"issue":"1","key":"320_CR25","doi-asserted-by":"crossref","first-page":"50","DOI":"10.1016\/S0377-2217(01)00104-7","volume":"137","author":"A Jaszkiewicz","year":"2002","unstructured":"Jaszkiewicz A (2002) Genetic local search for multi-objective combinatorial optimization. Eur J Oper Res 137(1): 50\u201371","journal-title":"Eur J Oper Res"},{"key":"320_CR26","doi-asserted-by":"crossref","DOI":"10.1002\/9780470316801","volume-title":"Finding groups in data: an introduction to cluster analysis, Wiley series in probability and mathematical statistics","author":"L Kaufman","year":"1990","unstructured":"Kaufman L, Rousseuw PJ (1990) Finding groups in data: an introduction to cluster analysis, Wiley series in probability and mathematical statistics. Wiley, New York"},{"key":"320_CR27","unstructured":"Khabzaoui M, Dhaenens C, Talbi E-G (2005) Parallel Genetic algorithms for multi-objective rule mining. In: Proceedings of the 6th metaheuristics international conference (MIC 2005), pp 571\u2013576"},{"key":"320_CR28","doi-asserted-by":"crossref","unstructured":"Knowles JD, Corne D (1999) The pareto archived evolution strategy: a new baseline algorithm for pareto multiobjective optimisation. In: Angeline PJ, Michalewicz Z, Schoenauer M, Yao X, Zalzala A (eds) Proceedings of the 1999 congress on evolutionary computation (CEC \u201999), vol 1, pp 98\u2013105","DOI":"10.1109\/CEC.1999.781913"},{"issue":"2","key":"320_CR29","doi-asserted-by":"crossref","first-page":"149","DOI":"10.1162\/106365600568167","volume":"8","author":"JD Knowles","year":"2000","unstructured":"Knowles JD, Corne D (2000) Approximating the nondominated front using the pareto archived evolution strategy. Evol Comput 8(2): 149\u2013172","journal-title":"Evol Comput"},{"issue":"3","key":"320_CR30","doi-asserted-by":"crossref","first-page":"331","DOI":"10.1287\/trsc.35.3.331.10147","volume":"35","author":"HR Louren\u00e7o","year":"2001","unstructured":"Louren\u00e7o HR, Paixpo JP, Portugal R (2001) Multiobjective metaheuristics for the bus-driver scheduling problem. Transp Sci 35(3): 331\u2013343","journal-title":"Transp Sci"},{"key":"320_CR31","first-page":"203","volume-title":"Mobile networks and computing. DIMACS series in discrete mathematics and theoretical computer science, vol 52","author":"RA Murphey","year":"2000","unstructured":"Murphey RA, Pardalos PM, Pasiliao E (2000) Multicriteria optimization for frequency assignment. In: Rajasekaran S, Pardalos P, Hsu DF (eds) Mobile networks and computing. DIMACS series in discrete mathematics and theoretical computer science, vol 52. American Mathematical Society, New York, pp 203\u2013219"},{"key":"320_CR32","unstructured":"Newman DJ, Hettich S, Blake CL, Merz CJ (1998) UCI repository of machine learning databases. http:\/\/www.ics.uci.edu\/~mlearn\/MLRepository.html"},{"key":"320_CR33","doi-asserted-by":"crossref","unstructured":"Okabe T, Jin Y, Sendhoff B (2003) A critical survey of performance indices for multi-objective optimisation. In: Abbass H, Verma B (eds) Proceedings of the 2003 congress on evolutionary computation (CEC 2003), vol 2, pp 878\u2013885","DOI":"10.1109\/CEC.2003.1299759"},{"key":"320_CR34","doi-asserted-by":"crossref","unstructured":"Oltean M, Grosan C, Abraham A, K\u00f6ppen M (2005) Multiobjective optimization using adaptive pareto archived evolution strategy. In: Proceedings of the 5th international conference on intelligent systems design and applications (ISDA \u201905), pp 558\u2013563","DOI":"10.1109\/ISDA.2005.69"},{"key":"320_CR35","doi-asserted-by":"crossref","unstructured":"Paquete L, Chiarandini M, St\u00fctzle T (2004) Pareto local optimum sets in the biobjective traveling salesman problem: an experimental study. In: Gandibleux X, Sevaux M, S\u00f6rensen K, T\u2019kindt V (eds) Metaheuristics for multiobjective optimisation. Lecture notes in economics and mathematical systems, vol 535. Springer, Heidelberg, pp 177\u2013199","DOI":"10.1007\/978-3-642-17144-4_7"},{"key":"320_CR36","doi-asserted-by":"crossref","first-page":"179","DOI":"10.1023\/A:1024427114516","volume":"7","author":"PM Pardalos","year":"2003","unstructured":"Pardalos PM, Chaovalitwongse W, Kim D (2003) GRASP with a new local search scheme for vehicle routing problems with time windows. J Comb Optim 7: 179\u2013207","journal-title":"J Comb Optim"},{"key":"320_CR37","unstructured":"Pasiliao EL (1998) A greedy randomized adaptive search procedure for the multi-criteria radio link frequency assignment problem. Technical report, Department of Industrial and Systems Engineering, University of Florida, Gainesville, FL, USA"},{"key":"320_CR38","first-page":"168","volume-title":"Handbook of applied optimization","author":"L Pitsoulis","year":"2001","unstructured":"Pitsoulis L, Resende MGC (2001) Greedy randomized adaptive search procedures. In: Pitsoulis LS, Resende MGC (eds) Handbook of applied optimization. Oxford University Press, New York, pp 168\u2013181"},{"key":"320_CR39","volume-title":"C4.5: Programs for machine learning","author":"JR Quinlan","year":"1993","unstructured":"Quinlan JR (1993) C4.5: Programs for machine learning. Morgan Kaufmann, Menlo Park"},{"key":"320_CR40","unstructured":"Reynolds A, de la Iglesia B (2006) Rule induction using multi-objective metaheuristics: encouraging rule diversity. In: Proceedings of the 2006 IEEE world congress on computational intelligence, pp 6375\u20136382"},{"issue":"4","key":"320_CR41","doi-asserted-by":"crossref","first-page":"475","DOI":"10.1007\/s10852-005-9022-1","volume":"5","author":"AP Reynolds","year":"2006","unstructured":"Reynolds AP, Richards G, de la Iglesia B, Rayward-Smith VJ (2006) Clustering rules: a comparison of partitioning and hierarchical clustering algorithms. J Math Modell Algorithms 5(4): 475\u2013504","journal-title":"J Math Modell Algorithms"},{"key":"320_CR42","doi-asserted-by":"crossref","first-page":"125","DOI":"10.1080\/08839519408945435","volume":"8","author":"P Riddle","year":"1994","unstructured":"Riddle P, Segal R, Etzioni O (1994) Representation design and brute-force induction in a Boeing manufacturing domain. Appl Artif Intell 8: 125\u2013147","journal-title":"Appl Artif Intell"},{"key":"320_CR43","doi-asserted-by":"crossref","unstructured":"Vianna DS, Arroyo JEC (2004) A GRASP algorithm for the multi-objective knapsack problem. In: Proceedings of the XXIV international conference of the Chilean Computer Science Society (SCCC\u201904), pp 69\u201375","DOI":"10.1109\/QEST.2004.2"},{"key":"320_CR44","unstructured":"Zitzler E, Laumanns M, Thiele L (2001) SPEA2: improving the strength pareto evolutionary algorithm. Technical Report 103, Computer Engineering and Networks Laboratory (TIK), Department of Electrical Engineering, Swiss Federal Institute of Technology (ETH)"},{"key":"320_CR45","unstructured":"Zitzler E, Laumanns M, Thiele L (2002) SPEA2: improving the strength pareto evolutionary algorithm for multiobjective optimization. In: Gainnakoglou K, Tsahalis D, Periaux J, Papailiou K, Fogarty T (eds) Evolutionary methods for design, optimisation and control, pp 95\u2013100"},{"issue":"4","key":"320_CR46","doi-asserted-by":"crossref","first-page":"257","DOI":"10.1109\/4235.797969","volume":"3","author":"E Zitzler","year":"1999","unstructured":"Zitzler E, Thiele L (1999) Multiobjective optimization using evolutionary algorithms: a comparative case study and the strength pareto approach. IEEE Trans Evol Comput 3(4): 257\u2013271","journal-title":"IEEE Trans Evol Comput"}],"container-title":["Soft Computing"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00500-008-0320-1.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s00500-008-0320-1\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00500-008-0320-1","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,2,27]],"date-time":"2024-02-27T20:53:21Z","timestamp":1709067201000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s00500-008-0320-1"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2008,6,25]]},"references-count":46,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2009,2]]}},"alternative-id":["320"],"URL":"https:\/\/doi.org\/10.1007\/s00500-008-0320-1","relation":{},"ISSN":["1432-7643","1433-7479"],"issn-type":[{"value":"1432-7643","type":"print"},{"value":"1433-7479","type":"electronic"}],"subject":[],"published":{"date-parts":[[2008,6,25]]}}}