Skip to main content
SpringerLink
Log in

Genetic Algorithm Designed for Solving Linear or Nonlinear Mixed-Integer Constrained Optimization Problems

  • Conference paper
  • First Online:
International Proceedings on Advances in Soft Computing, Intelligent Systems and Applications

Part of the book series: Advances in Intelligent Systems and Computing ((AISC,volume 628))

Abstract

Genetic algorithms (GA) initially were not developed to handle the integer restriction or discrete values to the design variables. In the recent years, researchers has focused their work on developing/modifying GAs for handling integer/discrete variables. We have modified the BEX-PM algorithm developed by Thakur et al. [1] to solve the nonlinear constrained mixed-integer optimization problems. Twenty test problems have been used to conduct a comparative study to test the effectiveness of proposed algorithm (MI-BEXPM) with other similar algorithms (viz. MILXPM, RST2ANU, and AXNUM) in this class available in the literature. The efficacy of the results acquired through MI-BEXPM is compared with other algorithms on two well-known criteria. The performance of MI-BEXPM is also analysed and compared for solving real-life mixed-integer optimization problems with other methods available in the literature. It is found that MI-BEXPM is significantly superior to the algorithms considered in this work.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Log in via an institution

Institutional subscriptions

References

  1. Thakur, M., S.S. Meghwani, and H. Jalota. 2014. A modified real coded genetic algorithm for constrained optimization. Applied Mathematics and Computation 235: 292–317.

    Article  MathSciNet  MATH  Google Scholar 

  2. Yokota, T., M. Gen, Y. Li, and C.E. Kim. 1996. A genetic algorithm for interval nonlinear integer programming problem. Computers and industrial engineering 31 (3): 913–917.

    Article  Google Scholar 

  3. Costa, L., and P. Oliveira. 2001. Evolutionary algorithms approach to the solution of mixed integer non-linear programming problems. Computers and Chemical Engineering 25 (2): 257–266.

    Article  Google Scholar 

  4. Lin, Y. 2013. Mixed-integer constrained optimization based on memetic algorithm. Journal of applied research and technology 11 (2): 242–250.

    Article  Google Scholar 

  5. Lin, Y.C., K.S. Hwang, and F.S. Wang. 2004. A mixed-coding scheme of evolutionary algorithms to solve mixed-integer nonlinear programming problems. Computers and Mathematics with Applications 47 (8): 1295–1307.

    Article  MathSciNet  MATH  Google Scholar 

  6. Lin, Y.C., K.S. Hwang, and F.S. Wang. 2001. Co-evolutionary hybrid differential evolution for mixed-integer optimization problems. Engineering Optimization 33 (6): 663–682.

    Article  Google Scholar 

  7. Yan, L., K. Shen, and S. Hu. 2004. Solving mixed integer nonlinear programming problems with line-up competition algorithm. Computers and Chemical Engineering 28 (12): 2647–2657.

    Article  Google Scholar 

  8. Xiong, Y., and S.S. Rao. 2004. Fuzzy nonlinear programming for mixed-discrete design optimization through hybrid genetic algorithm. Fuzzy Sets and Systems 146 (2): 167–186.

    Article  MathSciNet  MATH  Google Scholar 

  9. Cheung, B.S., A. Langevin, and H. Delmaire. 1997. Coupling genetic algorithm with a grid search method to solve mixed integer nonlinear programming problems. Computers and Mathematics with Applications 34 (12): 13–23.

    Article  MathSciNet  MATH  Google Scholar 

  10. Cardoso, M.F., R. Salcedo, S.F. de Azevedo, and D. Barbosa. 1997. A simulated annealing approach to the solution of MINLP problems. Computers and Chemical Engineering 21 (12): 1349–1364.

    Article  Google Scholar 

  11. Metropolis, N., A.W. Rosenbluth, M.N. Rosenbluth, A.H. Teller, and E. Teller. 1953. Equation of state calculations by fast computing machines. The Journal of Chemical Physics 21 (6): 1087–1092.

    Article  Google Scholar 

  12. Kirkpatrick, S., M. Vecchi, et al. 1983. Optimization by simulated annealing. science 220 (4598): 671–680.

    Google Scholar 

  13. Kirkpatrick, S. 1984. Optimization by simulated annealing: quantitative studies. Journal of Statistical Physics 34 (5–6): 975–986.

    Article  MathSciNet  Google Scholar 

  14. Wah, B.W., Y. Chen, and T. Wang. 2007. Simulated annealing with asymptotic convergence for nonlinear constrained optimization. Journal of Global Optimization 39 (1): 1–37.

    Article  MathSciNet  MATH  Google Scholar 

  15. Exler, O., L.T. Antelo, J.A. Egea, A.A. Alonso, and J.R. Banga. 2008. A tabu search-based algorithm for mixed-integer nonlinear problems and its application to integrated process and control system design. Computers and Chemical Engineering 32 (8): 1877–1891.

    Article  Google Scholar 

  16. Ugray, Z., L. Lasdon, J.C Plummer, F. Glover, J. Kelly, J., and R. Marti. 2005. A multistart scatter search heuristic for smooth NLP and MINLP problems. In Metaheuristic optimization via memory and evolution, 25–57. Springer.

    Google Scholar 

  17. dos Santos Coelho, L. 2009. An efficient particle swarm approach for mixed-integer programming in reliability redundancy optimization applications. Reliability Engineering and System Safety 94 (4): 830–837.

    Article  Google Scholar 

  18. Deep, K., K.P. Singh, M. Kansal, and C. Mohan. 2009. A real coded genetic algorithm for solving integer and mixed integer optimization problems. Applied Mathematics and Computation 212 (2): 505–518.

    Article  MathSciNet  MATH  Google Scholar 

  19. Hua, Z., and F. Huang. 2006. An effective genetic algorithm approach to large scale mixed integer programming problems. Applied Mathematics and Computation 174 (2): 897–909.

    Article  MathSciNet  MATH  Google Scholar 

  20. Goldberg, D.E., and K. Deb. 1991. A comparative analysis of selection schemes used in genetic algorithms. Urbana 51: 61801–2996.

    Google Scholar 

  21. da Silva, E.L., H.A. Gil, and J.M. Areiza. 1999. Transmission network expansion planning under an improved genetic algorithm. In Proceedings of the 21st 1999 IEEE international conference on power industry computer applications, PICA’99, 315–321. IEEE.

    Google Scholar 

  22. Blickle, T., and L. Thiele. 1996. A comparison of selection schemes used in evolutionary algorithms. Evolutionary Computation 4 (4): 361–394.

    Article  Google Scholar 

  23. Deep, K., and M. Thakur. 2007. A new mutation operator for real coded genetic algorithms. Applied Mathematics and Computation 193 (1): 211–230.

    Article  MathSciNet  MATH  Google Scholar 

  24. Mohan, C., and H. Nguyen. 1999. A controlled random search technique incorporating the simulated annealing concept for solving integer and mixed integer global optimization problems. Computational Optimization and Applications 14 (1): 103–132.

    Article  MathSciNet  MATH  Google Scholar 

  25. Deb, K. 2000. An efficient constraint handling method for genetic algorithms. Computer Methods in applied Mechanics and Engineering 186 (2): 311–338.

    Article  MATH  Google Scholar 

  26. Floudas, C.A. 1995. Nonlinear and mixed-integer optimization: fundamentals and applications. Oxford University Press.

    Google Scholar 

  27. Sandgren, E. 1990. Nonlinear integer and discrete programming in mechanical design optimization. Journal of Mechanical Design 112 (2): 223–229.

    Article  Google Scholar 

  28. Amir, H.M., and T. Hasegawa. 1989. Nonlinear mixed-discrete structural optimization. Journal of Structural Engineering 115 (3): 626–646.

    Article  Google Scholar 

  29. Ku, K.J., S. Rao, and L. Chen. 1998. Taguchi-aided search method for design optimization of engineering systems. Engineering Optimization 30 (1): 1–23.

    Article  Google Scholar 

  30. Gandomi, A.H., X.S. Yang, and A.H. Alavi. 2011. Mixed variable structural optimization using firefly algorithm. Computers and Structures 89 (23): 2325–2336.

    Article  Google Scholar 

  31. Deb, K., and M. Goyal. 1996. A combined genetic adaptive search (GeneAS) for engineering design. Computer Science and Informatics 26: 30–45.

    Google Scholar 

  32. Bharti. 1994. Controlled random search technique and their applications. PhD thesis, Department of Mathematics, University of Roorkee, Roorkee, India.

    Google Scholar 

  33. Deep, K., and M. Thakur. 2007. A new crossover operator for real coded genetic algorithms. Applied Mathematics and Computation 188 (1): 895–911.

    Article  MathSciNet  MATH  Google Scholar 

  34. Kannan, B., and S.N. Kramer. 1994. An augmented lagrange multiplier based method for mixed integer discrete continuous optimization and its applications to mechanical design. Journal of Mechanical Design 116 (2): 405–411.

    Article  Google Scholar 

  35. Zhang, C., and H.P. Wang. 1993. Mixed-discrete nonlinear optimization with simulated annealing. Engineering Optimization 21 (4): 277–291.

    Article  Google Scholar 

  36. Gandomi, A.H., X.S. Yang, and A.H. Alavi. 2013. Cuckoo search algorithm: a metaheuristic approach to solve structural optimization problems. Engineering with Computers 29 (1): 17–35.

    Article  Google Scholar 

  37. Parsopoulos, K.E., and M.N. Vrahatis. 2005. United particle swarm optimization for solving constrained engineering optimization problems. In Advances in natural computation, 582–591. Springer.

    Google Scholar 

  38. Gandomi, A.H., G.J. Yun, X.S. Yang, and S. Talatahari. 2013. Chaos-enhanced accelerated particle swarm optimization. Communications in Nonlinear Science and Numerical Simulation 18 (2): 327–340.

    Article  MathSciNet  MATH  Google Scholar 

  39. Ali, M.Z., N.H. Awad, P.N. Suganthan, R.M. Duwairi, and R.G. Reynolds. 2016. A novel hybrid cultural algorithms framework with trajectory-based search for global numerical optimization. Information Sciences 334: 219–249.

    Article  Google Scholar 

  40. Yun, Y. 2005. Study on adaptive hybrid genetic algorithm and its applications to engineering design problems. Master’s thesis, Waseda University.

    Google Scholar 

  41. Mezura-Montes, E., B. Hernández-Ocaña. 2009. Modified bacterial foraging optimization for engineering design. In Intelligent engineering systems through artificial neural networks. ASME Press.

    Google Scholar 

  42. Ray, T., and P. Saini. 2001. Engineering design optimization using a swarm with an intelligent information sharing among individuals. Engineering Optimization 33 (6): 735–748.

    Article  Google Scholar 

  43. Mollinetti, M.A.F., D.L. Souza, R.L., Pereira, E.K.K. Yasojima, O.N. Teixeira, O.N. 2016. ABC+ES: Combining artificial bee colony algorithm and evolution strategies on engineering design problems and benchmark functions. In Hybrid intelligent systems, 53–66. Springer.

    Google Scholar 

  44. Akhtar, S., K. Tai, and T. Ray. 2002. A socio-behavioural simulation model for engineering design optimization. Engineering Optimization 34 (4): 341–354.

    Article  Google Scholar 

  45. Mezura-Montes, E., C.A.C. Coello, and R. Landa-Becerra. 2003. Engineering optimization using simple evolutionary algorithm. In Proceedings of 15th IEEE international conference on tools with artificial intelligence, 149–156. IEEE.

    Google Scholar 

  46. Wang, J., and Z. Yin. 2008. A ranking selection-based particle swarm optimizer for engineering design optimization problems. Structural and Multidisciplinary Optimization 37 (2): 131–147.

    Article  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Indian Institute of Technology Mandi, Mandi, 175001, Himachal Pradesh, India

    Hemant Jalota & Manoj Thakur

Authors
  1. Hemant Jalota
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Manoj Thakur
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Hemant Jalota .

Editor information

Editors and Affiliations

  1. R.L. Jalappa Institute of Technology, Doddaballapur, Bengaluru, Karnataka, India

    M. Sreenivasa Reddy

  2. R.L. Jalappa Institute of Technology, Doddaballapur, Bengaluru, Karnataka, India

    K. Viswanath

  3. R.L. Jalappa Institute of Technology, Doddaballapur, Bengaluru, Karnataka, India

    Shiva Prasad K.M.

Rights and permissions

Reprints and permissions

Copyright information

© 2018 Springer Nature Singapore Pte Ltd.

About this paper

Check for updates. Verify currency and authenticity via CrossMark

Cite this paper

Jalota, H., Thakur, M. (2018). Genetic Algorithm Designed for Solving Linear or Nonlinear Mixed-Integer Constrained Optimization Problems. In: Reddy, M., Viswanath, K., K.M., S. (eds) International Proceedings on Advances in Soft Computing, Intelligent Systems and Applications . Advances in Intelligent Systems and Computing, vol 628. Springer, Singapore. https://doi.org/10.1007/978-981-10-5272-9_27

Download citation

  • DOI: https://doi.org/10.1007/978-981-10-5272-9_27

  • Published:

  • Publisher Name: Springer, Singapore

  • Print ISBN: 978-981-10-5271-2

  • Online ISBN: 978-981-10-5272-9

  • eBook Packages: EngineeringEngineering (R0)

Publish with us

Policies and ethics

Search

Navigation