Solving multiobjective functions of dynamics optimization based on constraint and unconstraint non-linear programming
Keywords:
Dynamic Optimization (DO), Mathematical model, Optimization techniques, Python languageAbstract
To better understand the connection between nonlinear optimization problems and differential equations, this study uses the mathematical models with one or more objective functions that are constrained by restrictions and therefore take the form of differential equations called dynamical optimization systems, which mean a decision-making method that uses differential and algebraic equation mathematical models to design-wise policies based on forecasts of future events. This paper focuses on solving mathematical models systems using the Python programming language.
Downloads
References
T. T. Nguyen, "Continuous dynamic optimization using evolutionary algorithms," Ph.D. dissertation, University of Birmingham, 2011.
T. T. Nguyen, S. Yang, and J. Branke, "Evolutionary dynamic optimization: A survey of state of the art," Swarm and Evolutionary Computation, vol. 6, pp. 1–24, 2012. DOI: https://doi.org/10.1016/j.swevo.2012.05.001
D. Yazdani, "Particle swarm optimization for dynamically changing environments with particular focus on scalability and switching cost," Ph.D. dissertation, Liverpool John Moores University, Liverpool, UK, 2018.
C. Li, T. T. Nguyen, S. Zeng, M. Yang, and M. Wu, "An open framework for constructing continuous optimization problems," IEEE Transactions on Cybernetics, pp. 1–15, 2018.
C. Cruz, J. R. Gonz'alez, and D. A. Pelta, "Optimization in dynamic environments: a survey on problems, methods, and measures," Soft Computing, vol. 15, no. 7, pp. 1427–1448, 2011. DOI: https://doi.org/10.1007/s00500-010-0681-0
S. Yang, Y. Jiang, and T. T. Nguyen, "Metaheuristics for dynamic combinatorial optimization problems," IMA Journal of Management Mathematics, vol. 24, no. 4, pp. 451–480, 2013. DOI: https://doi.org/10.1093/imaman/dps021
M. Mavrovouniotis, F. M. Muller, and S. Yang, "Ant colony optimization with local search for dynamic traveling salesman problems," IEEE Transactions on Cybernetics, vol. 47, no. 7, pp. 1743–1756, 2017. DOI: https://doi.org/10.1109/TCYB.2016.2556742
J. Branke, "Memory enhanced evolutionary algorithms for changing optimization problems," in IEEE Congress on Evolutionary Computation. IEEE, 1999, pp. 1875–1882.
S. B. Gee, K. C. Tan, and H. A. Abbass, "A benchmark test suite for dynamic evolutionary multiobjective optimization," IEEE Transactions on Cybernetics, vol. 47, no. 2, pp. 461–472, 2017.
S. Jiang, M. Kaiser, S. Yang, S. Kollias, and N. Krasnogor, "A scalable test suite for continuous dynamic multiobjective optimization," IEEE Transactions on Cybernetics, pp. 1–13, 2019.
S. Jiang and S. Yang, "Evolutionary dynamic multiobjective optimization: Benchmarks and algorithm comparisons," IEEE Transactions on Cybernetics, vol. 47, no. 1, pp. 198–211, 2017. DOI: https://doi.org/10.1109/TCYB.2015.2510698
T. T. Nguyen and X. Yao, "Continuous dynamic constrained optimization— the challenges," IEEE Transactions on Evolutionary Computation, vol. 16, no. 6, pp. 769–786, 2012. DOI: https://doi.org/10.1109/TEVC.2011.2180533
C. Bu, W. Luo, and L. Yue, "Continuous dynamic constrained optimization with ensemble of locating and tracking feasible regions strategies," IEEE Transactions on Evolutionary Computation, vol. 21, no. 1, pp. 14–33, 2017. DOI: https://doi.org/10.1109/TEVC.2016.2567644
Y. Wang, J. Yu, S. Yang, S. Jiang, and S. Zhao, "Evolutionary dynamic constrained optimization: Test suite construction and algorithm comparisons," Swarm and Evolutionary Computation, vol. 50, p. 100559, 2019. DOI: https://doi.org/10.1016/j.swevo.2019.100559
Yazdani, D, Omidvar, MN orcid.org/0000-0003-1944-4624, Cheng, R et al. (3 more authors) (2020) Benchmarking Continuous Dynamic Optimization: Survey and Generalized Test Suite. IEEE Transactions on Cybernetics. ISSN 2168-2267 https://doi.org/10.1109/TCYB.2020.3011828. DOI: https://doi.org/10.1109/TCYB.2020.3011828
INTEGRATED METHODS FOR OPTIMIZATION by JOHN N. HOOKER.
introduction to numerical methods of differential equations.
INTRODUCTION TO APPLIED OPTIMIZATION, Second Edition. By URMILA DIWEKAR, Vishwamitra Research Institute, Clarendon Hills, IL, USA.
Convex Optimization, Stephen Boyd, Department of Electrical Engineering, Stanford University, Lieven Vandenberghe, Electrical Engineering Department, University of California, Los Angeles.
L. Bianchi, Notes on dynamic vehicle routing - state of the art - Technical report idsia 05-01, Italy, 2000.
Introduction to Algorithms. Third Edition, Thomas H. Cormen, Charles E. Leiserson, Ronald L. Rivest, Clifford Stein.
J. Branke, Evolutionary Optimization in Dynamic Environments. Kluwer Academic Publishers, 2002. DOI: https://doi.org/10.1007/978-1-4615-0911-0
J. Grefenstette, Evolvability in Dynamic Fitness Landscapes: A Genetic Algorithm Approach. In Proc. 1999 Congress on Evolutionary Computation (CEC 99), Washington, DC. IEEE Press, pp. 2031-2038.
OPTIMIZATION Algorithms and Applications Rajesh Kumar Arora, Senior Engineer, Vikram Sarabhai Space Centre, Indian Space Research Organization, Trivandrum, India.
Al-Jilawi, A. S., & Abd Alsharify, F. H. (2022). Review of Mathematical Modelling Techniques with Applications in Biosciences. Iraqi Journal For Computer Science and Mathematics, 3(1), 135-144.
Alridha, A., Wahbi, F. A., & Kadhim, M. K. (2021). Training analysis of optimization models in machine learning. International Journal of Nonlinear Analysis and Applications, 12(2), 1453-1461.
Kadhim, M. K., Wahbi, F. A., & Hasan Alridha, A. (2022). Mathematical optimization modeling for estimating the incidence of clinical diseases. International Journal of Nonlinear Analysis and Applications, 13(1), 185-195.
Alridha, A., Salman, A. M., & Al-Jilawi, A. S. (2021, March). The Applications of NP-hardness optimizations problem. In Journal of Physics: Conference Series (Vol. 1818, No. 1, p. 012179). IOP Publishing. DOI: https://doi.org/10.1088/1742-6596/1818/1/012179
Salman, A. M., Alridha, A., & Hussain, A. H. (2021, March). Some Topics on Convex Optimization. In Journal of Physics: Conference Series (Vol. 1818, No. 1, p. 012171). IOP Publishing. DOI: https://doi.org/10.1088/1742-6596/1818/1/012171
Alridha, A., & Al-Jilawi, A. S. (2021, March). Mathematical Programming Computational for Solving NP-Hardness Problem. In Journal of Physics: Conference Series (Vol. 1818, No. 1, p. 012137). IOP Publishing. DOI: https://doi.org/10.1088/1742-6596/1818/1/012137
Alridha, A. H., & Al-Jilawi, A. S. (2022). Solving NP-hard problems using a new relaxation of approximate methods. International Journal of Health Sciences, 6(S3), 523–536. https://doi.org/10.53730/ijhs.v6nS3.5375 DOI: https://doi.org/10.53730/ijhs.v6nS3.5375
Published
How to Cite
Issue
Section
Copyright (c) 2022 International journal of health sciences
This work is licensed under a Creative Commons Attribution-NonCommercial-NoDerivatives 4.0 International License.
Articles published in the International Journal of Health Sciences (IJHS) are available under Creative Commons Attribution Non-Commercial No Derivatives Licence (CC BY-NC-ND 4.0). Authors retain copyright in their work and grant IJHS right of first publication under CC BY-NC-ND 4.0. Users have the right to read, download, copy, distribute, print, search, or link to the full texts of articles in this journal, and to use them for any other lawful purpose.
Articles published in IJHS can be copied, communicated and shared in their published form for non-commercial purposes provided full attribution is given to the author and the journal. Authors are able to enter into separate, additional contractual arrangements for the non-exclusive distribution of the journal's published version of the work (e.g., post it to an institutional repository or publish it in a book), with an acknowledgment of its initial publication in this journal.
This copyright notice applies to articles published in IJHS volumes 4 onwards. Please read about the copyright notices for previous volumes under Journal History.
