Summary
The objective of the maximum diversity problem (MDP) is to select a set of m-elements from larger set of n-elements such that the selected elements maximize a given diversity measure. The paper presents an evolutionary algorithm incorporating local search — memetic algorithm (MA) — for the MDP which consists of a greedy method, simple evolutionary operators, a repair method, and a k-flip local search based on variable depth search. In the MA, the k-flip local search starts with a feasible solution and obtains a local optimum in the feasible search space. Since infeasible solutions may be created by the simple crossover and mutation operators even if they start with feasible ones found by the local search, the repair method is applied to such infeasible solutions after the crossover and the mutation in order to guarantee feasibility of solutions to the problem. To show the effectiveness of the MA with the k-flip local search, we compare with a MA with 2-flip local search for large-scale problem instances (of up to n=2500) which are larger than those investigated by other researchers. The results show that the k-flip local search based MA is effective particularly for larger instances. We report the best solution found by the MA as this is the first time such large instances are tackled.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Amini, M.M., Alidaee, B., Kochenberger, G.A. (1999) A Scatter Search Approach to Unconstrained Quadratic Binary Programs. In Corne, D., Dorigo, M., Glover, F., eds.: New Ideas in Optimization. McGraw-Hill, London 317–329
Beasley, J.E. (1990) OR-Library: Distributing Test Problems by Electronic Mail. Journal of the Operational Research Society 41: 1069–1072
Beasley, J.E. (1998) Heuristic Algorithms for the Unconstrained Binary Quadratic Programming Problem. Tech. Rep., Management School, Imperial College, UK
Eshelman, L. (1991) The CHC Adaptive Search Algorithm: How to Have Safe Search When Engaging in Nontraditional Genetic Recombination. In Rawlings, G.J.E., ed. Foundations of Genetic Algorithms 265–283
Glover, F., Kuo, C.-C., Dhir, K.S. (1998) Heuristic Algorithms for the Maximum Diversity Problem. Journal of Information and Optimization Sciences 19: 109–132
Glover, F., Kochenberger, G., Alidaee, B., Amini, M. (1999) Tabu Search with Critical Event Memory: An Enhanced Application for Binary Quadratic Programs. In Voss, S., et al., eds.: Meta-Heuristics, Advances and Trends in Local Search Paradigms for Optimization, Kluwer Academic Pub. 93–109
Glover, F., Alidaee, B., Rego, C, Kochenberger, G. (2002) One-Pass Heuristics for Large-Scale Unconstrained Binary Quadratic Problems. European Journal of Operational Research 137: 272–287
Ghosh, J.B. (1996) Computational Aspects of the Maximum Diversity Problem. Operations Research Letters 19: 175–181
Katayama, K., Narihisa, H. (2001) Performance of Simulated Annealing-Based Heuristic for the Unconstrained Binary Quadratic Programming Problem. European Journal of Operational Research 134: 103–119
Katayama, K., Tani, M., Narihisa, H. (2000) Solving Large Binary Quadratic Programming Problems by Effective Genetic Local Search Algorithm. In: Proceedings of the 2000 Genetic and Evolutionary Computation Conference 643–650
Katayama, K., Narihisa, H. (2001) A Variant k-opt Local Search Heuristic for Binary Quadratic Programming. Trans. IEICE (A) J84-A: 430–435 (in Japanese)
Katayama, K., Narihisa, H. (2001) On Fundamental Design of Parthenogenetic Algorithm for the Binary Quadratic Programming Problem. In: Proceedings of the 2001 Congress on Evolutionary Computation 356–363
Kernighan, B.W., Lin, S. (1970) An Efficient Heuristic Procedure for Partitioning Graphs. Bell System Technical Journal 49: 291–307
Kochenberger, G., Glover, F. (1999) Diversity Data Mining. Tech. Rep. HCES-03-99, Hearin Center for Enterprise Science College of Business Administration
Kuo, C.-C, Glover, F., Dhir, K.S. (1993) Analyzing and Modeling the Maximum Diversity Problem by Zero-One Programming. Decision Sciences 24: 1171–1185
Lin, S., Kernighan, B.W. (1973) An Effective Heuristic Algorithm for the Traveling Salesman Problem. Operations Research 21: 498–516
Lodi, A., Allemand, K., Liebling, T.M. (1999) An Evolutionary Heuristic for Quadratic 0–1 Programming. European Journal of Operational Research 119: 662–670
Merz, P., Freisleben, B. (1999) Genetic Algorithms for Binary Quadratic Programming. In: Proceedings of the 1999 Genetic and Evolutionary Computation Conference 417–424
Merz, P., Freisleben, B. (2002) Greedy and Local Search Heuristics for Unconstrained Binary Quadratic Programming. Journal of Heuristics 8: 197–213
Merz, P., Katayama, K. (2002) Memetic Algorithms for the Unconstrained Binary Quadratic Programming Problem. BioSystems (submitted for publication)
Pardalos, P.M., Rodgers, G.P. (1992) A Branch and Bound Algorithm for the Maximum Clique Problem. Computers and Operations Research 19: 363–375
Pardalos, P.M., Xue, J. (1994) The Maximum Clique Problem. Journal of Global Optimization 4: 301–328
Weitz, R.R., Lakshminarayanan, S. (1997) An Empirical Comparison of Heuristic and Graph Theoretic Methods for Creating Maximally Diverse Groups, VLSI Design, and Exam Scheduling. Omega 25: 473–482
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2005 Springer-Verlag Berlin Heidelberg
About this chapter
Cite this chapter
Katayama, K., Narihisa, H. (2005). An Evolutionary Approach for the Maximum Diversity Problem. In: Hart, W.E., Smith, J.E., Krasnogor, N. (eds) Recent Advances in Memetic Algorithms. Studies in Fuzziness and Soft Computing, vol 166. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-32363-5_2
Download citation
DOI: https://doi.org/10.1007/3-540-32363-5_2
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-22904-9
Online ISBN: 978-3-540-32363-1
eBook Packages: EngineeringEngineering (R0)