AN IMPROVED GENETIC ALGORITHM WITH GENE VALUE REPRESENTATION AND SHORT TERM MEMORY FOR SHAPE ASSIGNMENT PROBLEM

Ismadi Md Badarudin, Abu Bakar Md Sultan, Md Nasir Sulaiman, Ali Mamat, Mahmud Tengku Muda Mohamed

Abstract

The purpose in shape assignment is to find the optimal solution that combines a number of shapes with attention to full use of area. To achieve this, an analysis needs to be done several times because of the different solutions produce dissimilar number of items. Although to find the optimal solution is a certainty, the ambiguity matters and huge possible solutions require an intelligent approach to be applied. Genetic Algorithm (GA) was chosen to overcome this problem. We found that basic implementation of Genetic Algorithm produces uncertainty time and most probably contribute the longer processing time with several reasons. Thus, in order to reduce time in analysis process, we improved the Genetic Algorithm by focusing on 1) specific-domain initialization that gene values are based on the X and Y of area coordinate 2) the use of short term memory to avoid the revisit solutions occur. Through a series of experiment, the repetition of time towards obtaining the optimal result using basic GA (BGA) and improved GA (IGA) gradually increase when size of area of combined shapes raise. Using the same datasets, however, the BGA shows more repetition number than IGA indicates that IGA spent less computation time.

References

  1. Blum, C., Roli, A., 2003. Metaheuristic in Combinatorial Optimization: Overview and Conceptual Comparison, ACM Computing Journal, 268-238.
  2. Burke, E., Kendall, G. 1999. Comparison of MetaHeuristic Algorithm for Clustering Rectangle. Computer and Industrial Engineering 37, 383-386.
  3. Chen-Fang Tsai1, Kuo-Ming Chao, 2007. An Effective Chromosome Representation for Optimising Product Quality, Proceedings of the 2007 11th International Conference on Computer Supported Cooperative Work in Design, 1032-1037.
  4. Eiben, A. E., Schippers, C. A., 1998. On Evolutionary Exploration and Exploitation, Fund. Inf. 35, 1-16.
  5. Ismadi, M. B., Abu Bakar, M.S., Md Nasir, S., Ali, M., Mahmud, T.M.M., 2010. Shape Assignment by Genetic Algorithm towards Designing Optimal Areas, International Journal of Computer Science Issues IJCSI, Vol. 7, Issue 4, No 5, 1-7.
  6. Goldberg, D.E., 1989. Genetic Algorithms in Search, Optimization and Machine Learning. AddisonWesley, Reading, MA.
  7. Jason, C., Chris, H., 2003. Improving Genetic Algorithms Efficiency Using Intelligent Fitness Functions, IEA/AIE 2003, LNAI 2718, pp. 636-643.
  8. Miihlenbein, H., Schlierkamp, V.D., 1993. Predictive Models for the Breeder Genetic Algorithm I. Evolutionary Computation. 1( 1), 25-50.
  9. Pham, D. T., Karaboga, D., 2000. Intelligent Optimisation Techniques: Genetic Algorithm, Tabu Search, Simulated Annealing and Neural Network, SpringerVerlag.
  10. Rae-Dong Kim, Ok-Chul Lung, Hyochoong Bang, 2007. A Computational Approach to Reduce the Revisit Time Using a Genetic Algorithm, International Conference on Control, Automation and Systems 2007, Oct. 17-20, 2007 in COEX, Seoul, Korea, 184- 189.
  11. Richard, J. P., 2000. Comparing Genetic Algorithms Computational Performance Improvement Techniques, Artificial Neural Networks in Engineering, Proceedings, 305-310.
  12. Schaffer, J. D., 1985. Learning Multiclass Pattern Discrimination,, Proceedings of the First International Conference on Genetic Algorithms, 74-79
  13. Srinivas, M., Patnaik, L., 1994. Genetic Algorithms: A Survey. Computer. IEEE Press, 17-26.
  14. Stewart, T. J., Janssen, R. and Herwijnen, M. V. 2004. A Genetic Algorithm Approach to Multiobjective Landuse Planning, Computers & Operations Research Journal, 2293-2313.
  15. Stutzle, 1999. Local Search Algorithms for Combinatorial Problem - Analysis, Algorithms and New Applications. FISKI - Dissertationen zur Kunstliken Intelligez. Infix, Sankt Augustin, Germany.
Download


Paper Citation


in Harvard Style

Md Badarudin I., Md Sultan A., Sulaiman M., Mamat A. and Tengku Muda Mohamed M. (2011). AN IMPROVED GENETIC ALGORITHM WITH GENE VALUE REPRESENTATION AND SHORT TERM MEMORY FOR SHAPE ASSIGNMENT PROBLEM . In Proceedings of the 13th International Conference on Enterprise Information Systems - Volume 2: ICEIS, ISBN 978-989-8425-54-6, pages 178-183. DOI: 10.5220/0003493601780183


in Bibtex Style

@conference{iceis11,
author={Ismadi Md Badarudin and Abu Bakar Md Sultan and Md Nasir Sulaiman and Ali Mamat and Mahmud Tengku Muda Mohamed},
title={AN IMPROVED GENETIC ALGORITHM WITH GENE VALUE REPRESENTATION AND SHORT TERM MEMORY FOR SHAPE ASSIGNMENT PROBLEM},
booktitle={Proceedings of the 13th International Conference on Enterprise Information Systems - Volume 2: ICEIS,},
year={2011},
pages={178-183},
publisher={SciTePress},
organization={INSTICC},
doi={10.5220/0003493601780183},
isbn={978-989-8425-54-6},
}


in EndNote Style

TY - CONF
JO - Proceedings of the 13th International Conference on Enterprise Information Systems - Volume 2: ICEIS,
TI - AN IMPROVED GENETIC ALGORITHM WITH GENE VALUE REPRESENTATION AND SHORT TERM MEMORY FOR SHAPE ASSIGNMENT PROBLEM
SN - 978-989-8425-54-6
AU - Md Badarudin I.
AU - Md Sultan A.
AU - Sulaiman M.
AU - Mamat A.
AU - Tengku Muda Mohamed M.
PY - 2011
SP - 178
EP - 183
DO - 10.5220/0003493601780183