메뉴 건너뛰기




Volumn 230, Issue , 2013, Pages 183-196

An artificial bee colony algorithm for the maximally diverse grouping problem

Author keywords

Artificial bee colony algorithm; Iterated greedy; Maximally diverse grouping problem

Indexed keywords

ARTIFICIAL BEE COLONY ALGORITHMS; CONSTRUCTIVE METHODS; EFFECTIVE PERFORMANCE; FORAGING BEHAVIOURS; GROUPING PROBLEM; INITIAL SOLUTION; ITERATED GREEDY; ITERATED GREEDY ALGORITHM; NEIGHBOURHOOD; OPTIMISATION PROBLEMS; SEARCH STRATEGIES; STATE-OF-THE-ART ALGORITHMS; SWARM INTELLIGENCE TECHNIQUES;

EID: 84874115377     PISSN: 00200255     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.ins.2012.12.020     Document Type: Article
Times cited : (67)

References (53)
  • 1
    • 84857832525 scopus 로고    scopus 로고
    • A modified artificial bee colony algorithm for real-parameter optimization
    • B. Akay, and D. Karaboga A modified artificial bee colony algorithm for real-parameter optimization Information Sciences 192 2012 120 142
    • (2012) Information Sciences , vol.192 , pp. 120-142
    • Akay, B.1    Karaboga, D.2
  • 3
    • 0024622747 scopus 로고
    • A three phased approach to final exam scheduling
    • T. Arani, and V. Lofti A three phased approach to final exam scheduling IIE Transactions 21 1989 86 96
    • (1989) IIE Transactions , vol.21 , pp. 86-96
    • Arani, T.1    Lofti, V.2
  • 4
    • 0036531746 scopus 로고    scopus 로고
    • Methods for assigning students to groups: A study of alternative objective functions
    • K. Baker, and S. Powell Methods for assigning students to groups: a study of alternative objective functions Journal of the Operational Research Society 53 2002 397 404
    • (2002) Journal of the Operational Research Society , vol.53 , pp. 397-404
    • Baker, K.1    Powell, S.2
  • 6
    • 0034165530 scopus 로고    scopus 로고
    • Maximizing workforce diversity in project teams: A network flow approach
    • J. Bhadury, E. Mighty, and H. Damar Maximizing workforce diversity in project teams: a network flow approach Omega 28 2000 143 153
    • (2000) Omega , vol.28 , pp. 143-153
    • Bhadury, J.1    Mighty, E.2    Damar, H.3
  • 9
    • 80055056236 scopus 로고    scopus 로고
    • Performance assessment of foraging algorithms vs. evolutionary algorithms
    • M. El-Abd Performance assessment of foraging algorithms vs. evolutionary algorithms Journal of the Operational Research Society 182 2012 243 263
    • (2012) Journal of the Operational Research Society , vol.182 , pp. 243-263
    • El-Abd, M.1
  • 10
    • 78649958356 scopus 로고    scopus 로고
    • A hybrid genetic algorithmic approach to the maximally diverse grouping problem
    • Z. Fan, Y. Chen, J. Ma, and S. Zeng A hybrid genetic algorithmic approach to the maximally diverse grouping problem Journal of the Operational Research Society 62 2010 92 99
    • (2010) Journal of the Operational Research Society , vol.62 , pp. 92-99
    • Fan, Z.1    Chen, Y.2    Ma, J.3    Zeng, S.4
  • 11
    • 77953870243 scopus 로고    scopus 로고
    • Iterated greedy local search methods for unrelated parallel machine scheduling
    • L. Fanjul-Peyro, and R. Ruiz Iterated greedy local search methods for unrelated parallel machine scheduling European Journal of Operational Research 207 2010 55 69
    • (2010) European Journal of Operational Research , vol.207 , pp. 55-69
    • Fanjul-Peyro, L.1    Ruiz, R.2
  • 12
    • 0001249693 scopus 로고
    • One-half approximation algorithms for the k-partition problem
    • T. Feo, O. Goldschmidt, and M. Khellaf One-half approximation algorithms for the k-partition problem Operations Research 40 1992 170 173
    • (1992) Operations Research , vol.40 , pp. 170-173
    • Feo, T.1    Goldschmidt, O.2    Khellaf, M.3
  • 13
    • 84987041387 scopus 로고
    • A class of bounded approximation algorithms for graph partitioning
    • T. Feo, and M. Khellaf A class of bounded approximation algorithms for graph partitioning Networks 20 1990 181 195
    • (1990) Networks , vol.20 , pp. 181-195
    • Feo, T.1    Khellaf, M.2
  • 14
    • 47849084195 scopus 로고    scopus 로고
    • A multi-objective iterated greedy search for flowshop scheduling with makespan and flowtime criteria
    • J. Framinan, and R. Leisten A multi-objective iterated greedy search for flowshop scheduling with makespan and flowtime criteria OR Spectrum 30 2008 787 804
    • (2008) OR Spectrum , vol.30 , pp. 787-804
    • Framinan, J.1    Leisten, R.2
  • 15
    • 84875931054 scopus 로고    scopus 로고
    • Tabu search with strategic oscillation for the maximally diverse grouping problem
    • (in press)
    • M. Gallego, M. Laguna, R. Martí, A. Duarte, Tabu search with strategic oscillation for the maximally diverse grouping problem, Journal of Operational Research Society (in press), < http://dx.doi.org/10.1057/jors. 2012.66 >.
    • Journal of Operational Research Society
    • M. Gallego1
  • 17
    • 70349270458 scopus 로고    scopus 로고
    • A study on the use of non-parametric tests for analyzing the evolutionary algorithms' behaviour: A case study on the CEC'2005 special session on real parameter optimization
    • S. Garcia, D. Molina, M. Lozano, and F. Herrera A study on the use of non-parametric tests for analyzing the evolutionary algorithms' behaviour: a case study on the CEC'2005 special session on real parameter optimization Journal of Heuristics 15 2008 617 644
    • (2008) Journal of Heuristics , vol.15 , pp. 617-644
    • Garcia, S.1    Molina, D.2    Lozano, M.3    Herrera, F.4
  • 20
    • 0002294347 scopus 로고
    • A simple sequentially rejective multiple test procedure
    • S. Holm A simple sequentially rejective multiple test procedure Scandinavian Journal of Statistics 6 1979 65 70
    • (1979) Scandinavian Journal of Statistics , vol.6 , pp. 65-70
    • Holm, S.1
  • 21
    • 78751613501 scopus 로고    scopus 로고
    • Forecasting stock markets using wavelet transforms and recurrent neural networks: An integrated system based on artificial bee colony algorithm
    • T. Hsieh, H. Hsiao, and W. Yeh Forecasting stock markets using wavelet transforms and recurrent neural networks: an integrated system based on artificial bee colony algorithm Applied Soft Computing 11 2011 2510 2525
    • (2011) Applied Soft Computing , vol.11 , pp. 2510-2525
    • Hsieh, T.1    Hsiao, H.2    Yeh, W.3
  • 22
    • 0001750957 scopus 로고
    • Approximations of the critical region of the Friedman statistic
    • R. Iman, J. Davenport, Approximations of the critical region of the Friedman statistic, in: Communications in, Statistics, 1980, pp. 571-595.
    • (1980) Communications In, Statistics , pp. 571-595
    • Iman, R.1    Davenport, J.2
  • 23
    • 79957509556 scopus 로고    scopus 로고
    • Rosenbrock artificial bee colony algorithm for accurate global optimization of numerical functions
    • F. Kang, J. Li, and Z. Ma Rosenbrock artificial bee colony algorithm for accurate global optimization of numerical functions Information Sciences 181 2011 3508 3531
    • (2011) Information Sciences , vol.181 , pp. 3508-3531
    • Kang, F.1    Li, J.2    Ma, Z.3
  • 24
    • 35148827874 scopus 로고    scopus 로고
    • An idea based on honey bee swarm for numerical optimization
    • Computer Engineering Department, Erciyes University, Turkey
    • D. Karaboga, An idea based on honey bee swarm for numerical optimization, Technical Report TR06, Computer Engineering Department, Erciyes University, Turkey, 2005.
    • (2005) Technical Report TR06
    • Karaboga, D.1
  • 25
    • 79951858405 scopus 로고    scopus 로고
    • A modified artificial bee colony (ABC) algorithm for constrained optimization problems
    • D. Karaboga, and B. Akay A modified artificial bee colony (ABC) algorithm for constrained optimization problems Applied Soft Computing 11 2011 3021 3031
    • (2011) Applied Soft Computing , vol.11 , pp. 3021-3031
    • Karaboga, D.1    Akay, B.2
  • 26
    • 35148821762 scopus 로고    scopus 로고
    • A powerful and efficient algorithm for numerical function optimization: Artificial bee colony (ABC) algorithm
    • D. Karaboga, and B. Basturk A powerful and efficient algorithm for numerical function optimization: artificial bee colony (ABC) algorithm Journal of Global Optimization 39 2007 459 471
    • (2007) Journal of Global Optimization , vol.39 , pp. 459-471
    • Karaboga, D.1    Basturk, B.2
  • 27
    • 34548479029 scopus 로고    scopus 로고
    • On the performance of artificial bee colony (ABC) algorithm
    • D. Karaboga, and B. Basturk On the performance of artificial bee colony (ABC) algorithm Applied Soft Computing 8 2008 687 697
    • (2008) Applied Soft Computing , vol.8 , pp. 687-697
    • Karaboga, D.1    Basturk, B.2
  • 28
    • 84901190234 scopus 로고    scopus 로고
    • A comprehensive survey: Artificial bee colony (ABC) algorithm and applications
    • (in press)
    • D. Karaboga, B. Gorkemli, C. Ozturk, N. Karaboga, A comprehensive survey: artificial bee colony (ABC) algorithm and applications, Artificial Intelligence Review (in press) 1-37, < http://dx.doi.org/10.1007/s10462-012-9328-0 >.
    • Artificial Intelligence Review , pp. 1-37
    • Karaboga, D.1    Gorkemli, B.2    Ozturk, C.3    Karaboga, N.4
  • 29
    • 77957901422 scopus 로고    scopus 로고
    • A novel clustering approach: Artificial bee colony (ABC) algorithm
    • D. Karaboga, and C. Ozturk A novel clustering approach: artificial bee colony (ABC) algorithm Applied Soft Computing 11 2011 652 657
    • (2011) Applied Soft Computing , vol.11 , pp. 652-657
    • Karaboga, D.1    Ozturk, C.2
  • 31
    • 81155126173 scopus 로고    scopus 로고
    • DisABC: A new artificial bee colony algorithm for binary optimization
    • M. Kashan, N. Nahavandi, and A. Kashan DisABC: a new artificial bee colony algorithm for binary optimization Applied Soft Computing 12 2012 342 352
    • (2012) Applied Soft Computing , vol.12 , pp. 342-352
    • Kashan, M.1    Nahavandi, N.2    Kashan, A.3
  • 32
    • 84874118448 scopus 로고
    • To the problem of segmentation of a program
    • J. Kral To the problem of segmentation of a program Information Processing Machines 2 1965 116 127
    • (1965) Information Processing Machines , vol.2 , pp. 116-127
    • Kral, J.1
  • 34
    • 80053571767 scopus 로고    scopus 로고
    • Sar image segmentation based on artificial bee colony algorithm
    • M. Ma, J. Liang, M. Guo, and Y. Fan Sar image segmentation based on artificial bee colony algorithm Applied Soft Computing 11 2011 5205 5214
    • (2011) Applied Soft Computing , vol.11 , pp. 5205-5214
    • Ma, M.1    Liang, J.2    Guo, M.3    Fan, Y.4
  • 35
    • 84857845986 scopus 로고    scopus 로고
    • Artificial bee colony algorithm for the design of multiplier-less nonuniform filter bank transmultiplexer
    • V. Manoj, and E. Elias Artificial bee colony algorithm for the design of multiplier-less nonuniform filter bank transmultiplexer Information Sciences 192 2012 193 203
    • (2012) Information Sciences , vol.192 , pp. 193-203
    • Manoj, V.1    Elias, E.2
  • 36
    • 0031116155 scopus 로고    scopus 로고
    • A heuristic algorithm for the equitable partitioning problem
    • F. O'Brien, and J. Mingers A heuristic algorithm for the equitable partitioning problem Omega 45 1997 215 223
    • (1997) Omega , vol.45 , pp. 215-223
    • O'Brien, F.1    Mingers, J.2
  • 38
    • 84855286856 scopus 로고    scopus 로고
    • Comparative performance of three metaheuristic approaches for the maximally diverse grouping problem
    • G. Palubeckis, and A.R.E. Karciauskas Comparative performance of three metaheuristic approaches for the maximally diverse grouping problem Information Technology and Control 40 2011 277 285
    • (2011) Information Technology and Control , vol.40 , pp. 277-285
    • Palubeckis, G.1    Karciauskas, A.R.E.2
  • 39
    • 79953031480 scopus 로고    scopus 로고
    • A discrete artificial bee colony algorithm for the lot-streaming flow shop scheduling problem
    • Q.K. Pan, M. Tasgetiren, P. Suganthan, and T. Chua A discrete artificial bee colony algorithm for the lot-streaming flow shop scheduling problem Information Sciences 181 2011 2455 2468
    • (2011) Information Sciences , vol.181 , pp. 2455-2468
    • Pan, Q.K.1    Tasgetiren, M.2    Suganthan, P.3    Chua, T.4
  • 41
    • 79960558299 scopus 로고    scopus 로고
    • Swarm intelligence based routing protocol for wireless sensor networks: Survey and future directions
    • M. Saleem, G.A.D. Caro, and M. Farooq Swarm intelligence based routing protocol for wireless sensor networks: survey and future directions Information Sciences 181 2011 4597 4624
    • (2011) Information Sciences , vol.181 , pp. 4597-4624
    • Saleem, M.1    Caro, G.A.D.2    Farooq, M.3
  • 42
    • 84860310986 scopus 로고    scopus 로고
    • Beesensor: An energy-efficient and scalable routing protocol for wireless sensor networks
    • M. Saleem, I. Ullah, and M. Farooq Beesensor: an energy-efficient and scalable routing protocol for wireless sensor networks Information Sciences 200 2012 38 56
    • (2012) Information Sciences , vol.200 , pp. 38-56
    • Saleem, M.1    Ullah, I.2    Farooq, M.3
  • 43
    • 58549117667 scopus 로고    scopus 로고
    • An artificial bee colony algorithm for the leaf-constrained minimum spanning tree problem
    • A. Singh An artificial bee colony algorithm for the leaf-constrained minimum spanning tree problem Applied Soft Computing 9 2009 625 631
    • (2009) Applied Soft Computing , vol.9 , pp. 625-631
    • Singh, A.1
  • 44
    • 77953649650 scopus 로고    scopus 로고
    • A swarm intelligence approach to the quadratic minimum spanning tree problem
    • S. Sundar, and A. Singh A swarm intelligence approach to the quadratic minimum spanning tree problem Information Sciences 180 2010 3182 3191
    • (2010) Information Sciences , vol.180 , pp. 3182-3191
    • Sundar, S.1    Singh, A.2
  • 45
    • 84865842759 scopus 로고    scopus 로고
    • Modeling and solving constrained two-sided assembly line balancing problem via bee algorithms
    • P. Tapkan, L. Ozbakir, and A. Baykasoglu Modeling and solving constrained two-sided assembly line balancing problem via bee algorithms Applied Soft Computing 12 2012 3343 3355
    • (2012) Applied Soft Computing , vol.12 , pp. 3343-3355
    • Tapkan, P.1    Ozbakir, L.2    Baykasoglu, A.3
  • 46
    • 79957526144 scopus 로고    scopus 로고
    • A discrete artificial bee colony algorithm for the total flowtime minimization in permutation flow shops
    • M.F. Tasgetiren, Q.K. Pan, P. Suganthan, and A.L. Chen A discrete artificial bee colony algorithm for the total flowtime minimization in permutation flow shops Information Sciences 181 2011 3459 3475
    • (2011) Information Sciences , vol.181 , pp. 3459-3475
    • Tasgetiren, M.F.1    Pan, Q.K.2    Suganthan, P.3    Chen, A.L.4
  • 47
    • 84947934382 scopus 로고    scopus 로고
    • Reaction-diffusion model of a honeybee colonys foraging behaviour
    • M. Schoenauer, K. Deb, G. Rudolph, X. Yao, E. Lutton, J.J. Merelo, H.P. Schwefel, (Eds.)
    • V. Tereshko, Reaction-diffusion model of a honeybee colonys foraging behaviour, in: M. Schoenauer, K. Deb, G. Rudolph, X. Yao, E. Lutton, J.J. Merelo, H.P. Schwefel, (Eds.), Parallel Problem Solving from Nature PPSN VI, LNCS, vol. 1917, 2000, pp. 807-816.
    • (2000) Parallel Problem Solving from Nature PPSN VI, LNCS , vol.1917 , pp. 807-816
    • Tereshko, V.1
  • 48
    • 77957272442 scopus 로고    scopus 로고
    • Parallel artificial bee colony algorithm approaches for protein structure prediction using the 3DHP-SC model
    • M. Essaaidi, M. Malgeri, C. Badica, (Eds.)
    • C. Vargas Benítez, H. Lopes, Parallel artificial bee colony algorithm approaches for protein structure prediction using the 3DHP-SC model, in: M. Essaaidi, M. Malgeri, C. Badica, (Eds.), Intelligent Distributed Computing IV, vol. 315 of Studies in, Computational Intelligence, 2010, pp. 255-264.
    • (2010) Intelligent Distributed Computing IV, Vol. 315 of Studies In, Computational Intelligence , pp. 255-264
    • Vargas Benítez, C.1    Lopes, H.2
  • 49
    • 0031206365 scopus 로고    scopus 로고
    • An empirical comparison of heuristic and graph theoretic methods for creating maximally diverse groups
    • R. Weitz, and S. Lakshminarayanan An empirical comparison of heuristic and graph theoretic methods for creating maximally diverse groups VLSI design and exam scheduling, Omega 25 1997 473 482
    • (1997) VLSI Design and Exam Scheduling, Omega , vol.25 , pp. 473-482
    • Weitz, R.1    Lakshminarayanan, S.2
  • 50
    • 0032094794 scopus 로고    scopus 로고
    • An empirical comparison of heuristic methods for creating maximally diverse groups
    • R. Weitz, and S. Lakshminarayanan An empirical comparison of heuristic methods for creating maximally diverse groups Journal of Operation Research Society 49 1998 635 646
    • (1998) Journal of Operation Research Society , vol.49 , pp. 635-646
    • Weitz, R.1    Lakshminarayanan, S.2
  • 51
    • 84985761715 scopus 로고
    • Assigning students to groups: A multi-criteria decision support system approach
    • R.R. Weitz, and M.T. Jelassi Assigning students to groups: a multi-criteria decision support system approach Decision Sciences 23 1992 746 757
    • (1992) Decision Sciences , vol.23 , pp. 746-757
    • Weitz, R.R.1    Jelassi, M.T.2
  • 52
    • 0001884644 scopus 로고
    • Individual comparisons by ranking methods
    • F. Wilcoxon Individual comparisons by ranking methods Biometrics 1 1945 80 83
    • (1945) Biometrics , vol.1 , pp. 80-83
    • Wilcoxon, F.1


* 이 정보는 Elsevier사의 SCOPUS DB에서 KISTI가 분석하여 추출한 것입니다.