IDEAS home Printed from https://ideas.repec.org/a/gam/jsusta/v15y2023i20p14821-d1258698.html
   My bibliography  Save this article

Improved Dual-Population Genetic Algorithm: A Straightforward Optimizer Applied to Engineering Optimization

Author

Listed:
  • Zhihua Chen

    (State Key Laboratory of Hydraulic Engineering Simulation and Safety, Tianjin University, Tianjin 300072, China
    Department of Civil Engineering, Tianjin University, Tianjin 300072, China)

  • Xuchen Xu

    (Department of Civil Engineering, Tianjin University, Tianjin 300072, China)

  • Hongbo Liu

    (State Key Laboratory of Hydraulic Engineering Simulation and Safety, Tianjin University, Tianjin 300072, China
    Department of Civil Engineering, Hebei University of Engineering, Handan 056038, China)

Abstract

Aiming at the current limitations of the dual-population genetic algorithm, an improved dual-population genetic algorithm (IDPGA) for solving multi-constrained optimization problems is proposed by introducing a series of strategies, such as remaining elite individuals, a dynamic immigration operator, separating the objective and constraints, normalized constraints, etc. We selected 14 standard mathematical benchmarks to check the performance of IDPGA, and the results were compared with the theoretical value of CEC 2006. The results show that IDPGA with the current parameters obtains good solutions for most problems. Then 6 well-known engineering optimization problems were solved and compared with other algorithms. The results show that all of the solutions are feasible, the solution precision of IDPGA is better than other algorithms, and IDPGA performs with good efficiency and robustness. Meanwhile, no parameters need to be ignored when IDPGA is applied to solving engineering problems, which is enough to prove that IDPGA is suitable for solving engineering optimization. A Friedman test showed no significant difference between IDPGA and six algorithms, but significant differences between IDPGA and seven other algorithms; thus, a larger number of evaluators will be needed in the future. In addition, further research is still needed about the performance of IDPGA for solving practical large-scale engineering problems.

Suggested Citation

  • Zhihua Chen & Xuchen Xu & Hongbo Liu, 2023. "Improved Dual-Population Genetic Algorithm: A Straightforward Optimizer Applied to Engineering Optimization," Sustainability, MDPI, vol. 15(20), pages 1-32, October.
    • Handle: RePEc:gam:jsusta:v:15:y:2023:i:20:p:14821-:d:1258698
    as

    Download full text from publisher

    File URL: https://www.mdpi.com/2071-1050/15/20/14821/pdf
    Download Restriction: no
    File URL: https://www.mdpi.com/2071-1050/15/20/14821/
    Download Restriction: no
    ---><---

    References listed on IDEAS

    as
    1. Atidel Ben Hadj-Alouane & James C. Bean, 1997. "A Genetic Algorithm for the Multiple-Choice Integer Program," Operations Research, INFORMS, vol. 45(1), pages 92-101, February.
    Full references (including those not matched with items on IDEAS)

    Most related items

    These are the items that most often cite the same works as this one and are cited by the same works as this one.
    1. Zong-Zhi Lin & James C. Bean & Chelsea C. White, 2004. "A Hybrid Genetic/Optimization Algorithm for Finite-Horizon, Partially Observed Markov Decision Processes," INFORMS Journal on Computing, INFORMS, vol. 16(1), pages 27-38, February.
    2. Martin Schlüter & Matthias Gerdts, 2010. "The oracle penalty method," Journal of Global Optimization, Springer, vol. 47(2), pages 293-325, June.
    3. Miettinen, Kaisa & Makela, Marko M., 2006. "Synchronous approach in interactive multiobjective optimization," European Journal of Operational Research, Elsevier, vol. 170(3), pages 909-922, May.
    4. Alice E. Smith, 2023. "Note from the Editor," INFORMS Journal on Computing, INFORMS, vol. 35(4), pages 711-712, July.
    5. Jeffrey W. Ohlmann & Barrett W. Thomas, 2007. "A Compressed-Annealing Heuristic for the Traveling Salesman Problem with Time Windows," INFORMS Journal on Computing, INFORMS, vol. 19(1), pages 80-90, February.
    6. Jacob R. Fooks & Kent D. Messer & Maik Kecinski, 2018. "A Cautionary Note on the Use of Benefit Metrics for Cost-Effective Conservation," Environmental & Resource Economics, Springer;European Association of Environmental and Resource Economists, vol. 71(4), pages 985-999, December.
    7. Alexouda, Georgia & Paparrizos, Konstantinos, 2001. "A genetic algorithm approach to the product line design problem using the seller's return criterion: An extensive comparative computational study," European Journal of Operational Research, Elsevier, vol. 134(1), pages 165-178, October.
    8. Zhihua Chen & Xuchen Xu & Hongbo Liu, 2023. "The Successive Approximation Genetic Algorithm (SAGA) for Optimization Problems with Single Constraint," Mathematics, MDPI, vol. 11(8), pages 1-26, April.
    9. Jeffrey W. Ohlmann & James C. Bean & Shane G. Henderson, 2004. "Convergence in Probability of Compressed Annealing," Mathematics of Operations Research, INFORMS, vol. 29(4), pages 837-860, November.
    10. Lee, Yusin & Cheng, Juey-Fu, 2001. "A model for calculating optimal vertical alignments of interchanges," Transportation Research Part B: Methodological, Elsevier, vol. 35(5), pages 423-445, June.
    11. Kurt DeMaagd & Johannes M. Bauer, 2011. "Modeling the dynamic interactions of agents in the provision of network infrastructure," Information Systems Frontiers, Springer, vol. 13(5), pages 669-680, November.

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:gam:jsusta:v:15:y:2023:i:20:p:14821-:d:1258698. See general information about how to correct material in RePEc.

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    If CitEc recognized a bibliographic reference but did not link an item in RePEc to it, you can help with this form .

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: MDPI Indexing Manager (email available below). General contact details of provider: https://www.mdpi.com .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.