Creating a Model for Genetic Mutants using Integer Programming Techniques

Abstract

Improving the quality and functionality of life is becoming an increasing concern globally. This has led to studies to help develop better varieties of life products with improved qualities and reduced defects. This paper uses the techniques of integer programming and genetic algorithm to develop a Genetic Algorithm GA that evolution schemes of species, in which we have a population of individuals, plants, or life element represented by their own chromosome, as time goes by we breed them, mutate some of them and select who shall live and who shall die, and p a better an individual. A programmatic implementation of the schemes is given in C++ language.

Country : Nigeria

1 Ahmadu A.D2 Ahmadu S. Asabe Ph.D3 Philemon Uten Emmoh

  1. ICT Center, Federal University, Wukari, Nigeria
  2. ModibboAdama University of Technology, Yola, Nigeria
  3. ICT Center, Federal University, Wukari, Nigeria

IRJIET, Volume 2, Issue 5, July 2018 pp. 1-11

doi.org/10.47001/IRJIET/2021.205001

References

  1. Holland, J. H. “Adaption in Natural and Artificial Systems” Cambridge, MA: MIT Press, 1975.
  2. Van, N. R. “Handbook of Genetic Algorithms”. New York:, 1991.
  3. Srinivas, M and Patnaik, L. M.  “Genetic algorithms: A survey,” Computer, pp. 17-26, June 1994.
  4. Braca J., Bramel J., Posner B. and Simchi-Levi D. “A computerized approach to the New York City school bus routing problem. IIE Trans vol. 29, pp. 693-702. 1997.
  5. Li L. and Fu Z. “The school bus routing problem”, A case Study. J Opl Res, Soc vol. 53, pp. 552-558, 2002.
  6. Letchford N., Lysgaard J. and Eglese R. “A branch-and-cut algorithm for the capacitated open vehicle at routine problem” 2002.
  7. Sariklis, D. and Powell, S. “A heuristic method for the open vehicle routine problem. J Opl Res Soc Vol. 51, pp. 564-573, 2000.
  8. Tarantilis, C.D., Ioannou, G., Kiranoudis C.T. and Prastacos G.P. “solving the open vehicle routing problem via a single parameter metaheuristic algorithm”, J Opl Res Soc vol.56, pp. 588-596, 2005.