Iterated greedy for the maximum diversity problem

European Journal of Operational Research

Volumn 214, Issue 1, 2011, Pages 31-38

  Lozano, M ^a   Molina, D ^b   Garcia Martinez C ^c  

^a UNIVERSITY OF GRANADA   (Spain)

^b UNIVERSITY OF CÁDIZ   (Spain)

^c UNIVERSITY OF CÓRDOBA   (Spain)

Author keywords

Acceptance criterion; Iterated greedy; Local search; Maximum diversity problem

Indexed keywords

ACCEPTANCE CRITERIA; COMBINATORIAL PROBLEM; COMPUTATIONAL EXPERIMENT; CONSTRUCTION PHASIS; ITERATED GREEDY; LOCAL SEARCH; MAXIMUM DIVERSITY PROBLEM; MAXIMUM DIVERSITY PROBLEMS; META HEURISTICS; METAHEURISTIC;

ALGORITHMS;

EID: 79958003662     PISSN: 03772217     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.ejor.2011.04.018     Document Type: Article

References (42)

1. B. Alidaee, F. Glover, G. Kochenberger, and H. Wang Solving the maximum edge weight clique problem via unconstrained quadratic programming European Journal of Operational Research 181 2 2007 592 597 (Pubitemid 46413584)
2. M. Andrade, P. Andrade, S. Martins, and A. Plastino GRASP with path-relinking for the maximum diversity problem S. Nikoletseas, Experimental and Efficient Algorithms vol. 3503 2005 Springer Berlin 558 569 (Pubitemid 41322475)
3. P.M.D. Andrade, A. Plastino, L.S. Ochi, S.L. Martins, GRASP for the maximum diversity problem. in: Proceedings of the Fifth Metaheuristics International Conference (MIC 2003), 2003, CD-ROM Paper: MIC03 15.
4. R. Aringhieri, R. Cordone, and Y. Melzani Tabu search versus GRASP for the maximum diversity problem 4OR 6 1 2008 45 60
5. R. Aringhieri, and R. Cordone Comparing local search metaheuristics for the maximum diversity problem Journal of the Operational Research Society 62 2 2011 266 280
6. J.E. Beasley Obtaining test problems via internet Journal of Global Optimization 8 1996 429 433
7. J. Brimberg, N. Mladenović, and D. Urošević Variable neighborhood search for the heaviest ksubgraph Computers & Operations Research 36 11 2009 2885 2891
8. J. Culberson, and F. Luo Exploring the k-colorable landscape with iterated greedy D.S. Johnson, M.A. Trick, Cliques, coloring, and satisfiability: second DIMACS implementation challenge vol. 26 1996 American Mathematical Society 245 284
9. A. Duarte, and R. Martí Tabu search and GRASP for the maximum diversity problem European Journal of Operational Research 178 2007 71 84 (Pubitemid 44716633)
10. L. Fanjul-Peyroa, and R. Ruiz Iterated greedy local search methods for unrelated parallel machine scheduling European Journal of Operational Research 207 2010 55 69
11. B. Feng, Z-Z. Jiang, Z-P. Fan, and N. Fu A method for member selection of cross-functional teams using the individual and collaborative performances European Journal of Operational Research 203 3 2010 652 661
12. J.M. Framinan, and R. Leisten A multi-objective iterated greedy search for flowshop scheduling with makespan and flowtime criteria OR Spectrum 30 4 2008 787 804
13. M. Gallego, A. Duarte, M. Laguna, and R. Martí Hybrid heuristics for the maximum diversity problem Computational Optimization and Applications 200 1 2009 36 44
14. S. García, D. Molina, M. Lozano, and F. Herrera A study on the use of nonparametric tests for analyzing the evolutionary algorithms' behaviour: a case study on the CEC'2005 special session on real parameter optimization Journal of Heuristics 15 2009 617 644
15. J.B. Ghosh Computational aspects of the maximum diversity problem Operations Research Letters 19 1996 175 181 (Pubitemid 126394965)
16. F. Glover Multi-start and strategic oscillation methods - principles to exploit adaptive memory - a tutorial on unexplored opportunities M. Laguna, J.L. Gonzales-Valarde, Computing Tools for Modeling, Optimization and Simulation: Interfaces in Computer Science and Operations Research 2000 Kluwer Academic Publishers. 1 24
17. F. Glover, C.C. Kuo, and K.S. Dhir Analyzing and modeling the maximum diversity problem by zero-one programming Decision Sciences 24 1993 1171 1185
18. F. Glover, C.C. Kuo, and K.S. Dhir Heuristic algorithms for the maximum diversity problem Journal of Information and Optimization Sciences 19 1998 109 132 (Pubitemid 128108799)
19. F. Gortázar, A. Duarte, M. Laguna, and R. Martí Black box scatter search for general classes of binary optimization problems Computers & Operations Research 37 11 2010 1977 1986
20. L.W. Jacobs, and M.J. Brusco A local-search heuristic for large set-covering problems Naval Research Logistics 42 1995 1129 1140
21. K. Katayama, and H. Narihisa An evolutionary approach for the maximum diversity problem W. Hart, N. Krasnogor, J.E. Smith, Recent Advances in Memetic Algorithms 2004 Springer Berlin 31 47
22. R.K. Kincaid Good solutions to discrete noxious location problems via metaheuristics Annals of Operations Research 40 1-4 1992 265 281
23. C.C. Kuo, F. Glover, and K.S. Dhir Analyzing and modeling the maximum diversity problem by zero-one programming Decision Sciences 24 1993 1171 1185
24. S. Lin, and B. Kernighan An effective heuristic algorithm for the traveling salesman problem Operations Research 21 1973 498 516
25. S.W. Lin, Z.J. Lee, K.C. Ying, and C.C. Lu Minimization of maximum lateness on parallel machines with sequence-dependent setup times and job release dates Computers & Operations Research 38 5 2011 809 815
26. E.M. Macambira An application of tabu search heuristic for the maximum edge-weighted subgraph problem Annals of Operations Research 117 1-4 2002 175 190
27. R. Martí, M. Gallego, and A. Duarte A branch and bound algorithm for the maximum diversity problem European Journal of Operational Research 200 1 2009 36 44
28. G. Palubeckis Iterated tabu search for the maximum diversity problem Applied Mathematics and Computation 189 2007 371 383 (Pubitemid 46734245)
29. M. Prais, and C.C. Ribeiro Reactive GRASP: an application to a matrix decomposition problem in TDMA traffic assignment INFORMS Journal on Computing 12 2000 164 176
30. O.A. Prokopyev, N.K. Dayna, and L. Martínez-Torres The equitable dispersion problem European Journal of Operational Research 197 2009 59 67
31. M.G.C. Resende, C.C. Ribeiro, Greedy randomized adaptive search procedures, in: Glover, F.; Kochenberger, G. (Eds.), Handbook of Metaheuristics, 2003, pp. 219-249.
32. I. Ribas, R. Companys, and X. Tort-Martorell An iterated greedy algorithm for the flowshop scheduling problem with blocking Omega 39 3 2011 293 301
33. R. Ruiz, and T. Stützle A simple and effective iterated greedy algorithm for the permutation flowshop scheduling problem European Journal of Operational Research 177 2007 2033 2049 (Pubitemid 44712036)
34. R. Ruiz, and T. Stützle An Iterated Greedy heuristic for the sequence dependent setup times flowshop problem with makespan and weighted tardiness objectives European Journal of Operational Research 187 2008 1143 1159 (Pubitemid 350245722)
35. L.F. Santos, M.H. Ribeiro, A. Plastino, and S.L. Martins A hybrid GRASP with data mining for the maximum diversity problem M. Blesa, C. Blum, A. Roli, M. Sampels, Hybrid Metaheuristics vol. 3636 2005 Springer Berlin 116 127 (Pubitemid 41480524)
36. G.C. Silva, L.S. Ochi, and S.L. Martins Experimental comparison of greedy randomized adaptive search procedures for the maximum diversity problem C. Ribeiro, C. Martins, L. Simone, Experimental and Efficient Algorithms vol. 3059 2004 Springer Berlin 498 512
37. G.C. Silva, M.R.Q. De Andrade, L.S. Ochi, S.L. Martins, and A. Plastino New heuristics for the maximum diversity problem Journal of Heuristics 13 4 2007 315 336 (Pubitemid 47117879)
38. T. Urlings, R. Ruiz, and T. Stützle Shifting representation search for hybrid flexible flowline problems European Journal of Operational Research 207 2010 1086 1095
39. J. Wang, Y. Zhou, J. Yin, and Y. Zhang Competitive Hopfield network combined with estimation of distribution for maximum diversity problems IEEE Transactions on Systems, Man, and Cybernetics - Part B: Cybernetics 39 4 2009 1048 1066
40. K.-C. Ying Solving non-permutation flowshop scheduling problems by an effective iterated greedy heuristic International Journal of Advanced Manufacturing Technology 38 3-4 2008 348 354
41. K.-C. Kuo-Ching Ying, and H.-M. Cheng Dynamic parallel machine scheduling with sequence-dependent setup times using an iterated greedy heuristic Expert Systems with Applications 37 4 2010 2848 2852
42. Z. Yuan, A. Fügenschuh, H. Homfeld, P. Balaprakash, T. Stützle, and M. Schoch Iterated greedy algorithms for a real-world cyclic train scheduling problem Blesa Hybrid Metaheuristics vol. 5296 2008 Springer Berlin 102 116