6 Conclusions
Memetic Algorithms (MAs) are Evolutionary Algorithms (EAs) that apply some sort of local search to further improve the fitness of individuals in the population. This paper provides a forum for identifying and exploring the key issues that affect the design and application of Memetic Algorithms. Several approaches of integrating Evolutionary Computation models with local search techniques (i.e Memetic Algorithms) for efficiently solving underlying VLSI circuit partitioning problem were presented. A Constructive heuristic technique in the form of GRASP was utilized to inject the initial population with good initial solutions to diversify the search and exploit the solution space. Furthermore, the local search technique was able to enhance the convergence rate of the Evolutionary Algorithm by finely tuning the search on the immediate area of the landscape being considered. Future work involves adaptive techniques to fine-tune parameter of the Genetic Algorithm and Local Search when combined to form a Memetic Algorithm. Balancing exploration and exploitation is yet another issue that needs to be addressed more carefully.
Access provided by Autonomous University of Puebla. Download to read the full chapter text
Chapter PDF
Similar content being viewed by others
Keywords
- Genetic Algorithm
- Local Search
- Crossover Point
- Memetic Algorithm
- Greedy Randomized Adaptive Search Procedure
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.
References
S. Areibi, M. Moussa, and H. Abdullah. A Comparison of Genetic/Memetic Algorithms and Other Heuristic Search Techniques. In International Conference on Artificial Intelligence, pages 660–666, Las Vegas, Nevada, June 2001.
S. Areibi. An Integrated Genetic Algorithm With Dynamic Hill Climbing for VLSI Circuit Partitioning. In GECCO 2000, pages 97–102, Las Vegas, Nevada, July 2000. IEEE.
S. Areibi and A. Vannelli. An Efficient Clustering Technique for Circuit Partitioning. In IEEE ISCAS, pages 671–674, San Diego, California, 1996.
S. Areibi and A. Vannelli. A GRASP Clustering Technique for Circuit Partitioning. 35:711–724, 1997.
P.K. Chan, D.F. Schlag, and J.Y. Zien. Spectral K-way Ratio-Cut Partitioning and Clustering. IEEE Transactions on Computer Aided Design, 13(9):1088–1096, 1994.
S. Dutt and W. Deng. VLSI Circuit Partitioning by Cluster-Removal Using Iterative Improvement Techniques. In IEEE International Conference on CAD, pages 194–200. ACM/IEEE, 1996.
C.M. Fiduccia and R.M. Mattheyses. A Linear-Time Heuristic for Improving Network Partitions. In Proceedings of 19th DAC, pages 175–181, Las Vegas, Nevada, June 1982. ACM/IEEE.
T. Feo, M. Resende, and S. Smith. A Greedy Randomized Adaptive Search Procedure for The Maximum Ind ependent Set. Operations Research, 1994. Journal of Operations Research.
D.E. Goldberg. Genetic Algorithms in Search, Optimization, and Machine Learning. Addison-Wesley Publishing Company, Inc, Reading, Massachusetts, 1989.
B.W. Kernighan and S. Lin. An Efficient Heuristic Procedure for Partitioning Graphs. The Bell System Technical Journal, 49(2):291–307, February 1970.
Z. Michalewicz. Genetic Algorithms + Data Structures = Evolution Programs. Springer-Verlog, Berlin, Heidelberg, 1992.
K. Roberts and B. Preas. Physical Design Workshop 1987. Technical report, MCNC, Marriott’s Hilton Head Resort, South Carolina, April 1987.
L.A. Sanchis. Multiple-Way Network Partitioning. IEEE Transactions on Computers, 38(1):62–81, January 1989.
C. Sechen and D. Chen. An improved Objective Function for Min-Cut Circuit Partitioning. In Proceedings of ICCAD, pages 502–505, San Jose, California, 1988.
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
Areibi, S. (2005). Effective Exploration & Exploitation of the Solution Space via Memetic Algorithms for the Circuit Partition 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_8
Download citation
DOI: https://doi.org/10.1007/3-540-32363-5_8
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-22904-9
Online ISBN: 978-3-540-32363-1
eBook Packages: EngineeringEngineering (R0)