{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,4]],"date-time":"2026-04-04T14:23:56Z","timestamp":1775312636977,"version":"3.50.1"},"reference-count":31,"publisher":"MDPI AG","issue":"9","license":[{"start":{"date-parts":[[2022,8,26]],"date-time":"2022-08-26T00:00:00Z","timestamp":1661472000000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Algorithms"],"abstract":"<jats:p>A new bio-inspired method for optimizing the objective function on a parallelepiped set of admissible solutions is proposed. It uses a model of the behavior of tomtits during the search for food. This algorithm combines some techniques for finding the extremum of the objective function, such as the memory matrix and the Levy flight from the cuckoo algorithm. The trajectories of tomtits are described by the jump-diffusion processes. The algorithm is applied to the classic and nonseparable optimal control problems for deterministic discrete dynamical systems. This type of control problem can often be solved using the discrete maximum principle or more general necessary optimality conditions, and the Bellman\u2019s equation, but sometimes it is extremely difficult or even impossible. For this reason, there is a need to create new methods to solve these problems. The new metaheuristic algorithm makes it possible to obtain solutions of acceptable quality in an acceptable time. The efficiency and analysis of this method are demonstrated by solving a number of optimal deterministic discrete open-loop control problems: nonlinear nonseparable problems (Luus\u2013Tassone and Li\u2013Haimes) and separable problems for linear control dynamical systems.<\/jats:p>","DOI":"10.3390\/a15090301","type":"journal-article","created":{"date-parts":[[2022,8,28]],"date-time":"2022-08-28T21:22:56Z","timestamp":1661721776000},"page":"301","update-policy":"https:\/\/doi.org\/10.3390\/mdpi_crossmark_policy","source":"Crossref","is-referenced-by-count":27,"title":["Application of the Tomtit Flock Metaheuristic Optimization Algorithm to the Optimal Discrete Time Deterministic Dynamical Control Problem"],"prefix":"10.3390","volume":"15","author":[{"given":"Andrei V.","family":"Panteleev","sequence":"first","affiliation":[{"name":"Department of Mathematics and Cybernetics, Moscow Aviation Institute, National Research University, 4, Volokolamskoe Shosse, 125993 Moscow, Russia"}]},{"given":"Anna A.","family":"Kolessa","sequence":"additional","affiliation":[{"name":"Department of Mathematics and Cybernetics, Moscow Aviation Institute, National Research University, 4, Volokolamskoe Shosse, 125993 Moscow, Russia"}]}],"member":"1968","published-online":{"date-parts":[[2022,8,26]]},"reference":[{"key":"ref_1","unstructured":"Luus, R. (2000). Iterative Dynamic Programming, Chapman & Hall\/CRC. [1st ed.]."},{"key":"ref_2","doi-asserted-by":"crossref","unstructured":"Yang, X.S., Chien, S.F., and Ting, T.O. (2015). Bio-Inspired Computation and Optimization, Morgan Kaufmann. [1st ed.].","DOI":"10.1016\/B978-0-12-801538-4.00001-X"},{"key":"ref_3","unstructured":"Goldberg, D. (1989). Genetic Algorithms in Search, Optimization and Machine Learning, Addison-Wesley Publishing Company. [1st ed.]."},{"key":"ref_4","doi-asserted-by":"crossref","unstructured":"Michalewicz, Z., and Fogel, D. (2004). How to Solve It: Modern Heuristics, Springer. [2nd ed.].","DOI":"10.1007\/978-3-662-07807-5"},{"key":"ref_5","doi-asserted-by":"crossref","unstructured":"Panteleev, A.V., and Lobanov, A.V. (2021). Application of Mini-Batch Metaheuristic algorithms in problems of optimization of deterministic systems with incomplete information about the state vector. Algorithms, 14.","DOI":"10.3390\/a14110332"},{"key":"ref_6","doi-asserted-by":"crossref","first-page":"999","DOI":"10.1007\/s40435-021-00892-3","article-title":"Recent trends in bio-inspired meta-heuristic optimization techniques in control applications for electrical systems: A review","volume":"10","author":"Roni","year":"2022","journal-title":"Int. J. Dyn. Control."},{"key":"ref_7","doi-asserted-by":"crossref","unstructured":"Floudas, C.A., Pardalos, P.M., Adjiman, C.S., Esposito, W.R., G\u00fcm\u00fcs, Z.H., Harding, S.T., Klepeis, J.L., Meyer, C.A., and Schweiger, C.A. (1999). Handbook of Test Problems in Local and Global Optimization, Kluwer Academic Publishers. [1st ed.].","DOI":"10.1007\/978-1-4757-3040-1"},{"key":"ref_8","doi-asserted-by":"crossref","first-page":"373","DOI":"10.1016\/j.ejcon.2020.08.001","article-title":"Hybrid data-driven fuzzy active disturbance rejection control for tower crane systems","volume":"58","author":"Roman","year":"2021","journal-title":"Eur. J. Control"},{"key":"ref_9","doi-asserted-by":"crossref","unstructured":"Chi, R., Li, H., Shen, D., Hou, Z., and Huang, B. (2022). Enhanced P-type control: Indirect adaptive learning from set-point updates. IEEE Trans. Autom. Control.","DOI":"10.1109\/TAC.2022.3154347"},{"key":"ref_10","doi-asserted-by":"crossref","unstructured":"Panteleev, A.V., and Kolessa, A.A. (2022). Optimal open-loop control of discrete deterministic systems by application of the perch school metaheuristic optimization algorithm. Algorithms, 15.","DOI":"10.3390\/a15050157"},{"key":"ref_11","doi-asserted-by":"crossref","first-page":"453","DOI":"10.1038\/s41598-017-18940-4","article-title":"On the efficiency of nature-inspired metaheuristics in expensive global optimization with limited budget","volume":"8","author":"Sergeyev","year":"2018","journal-title":"Sci. Rep."},{"key":"ref_12","doi-asserted-by":"crossref","unstructured":"Sergeyev, Y.D., and Kvasov, D.E. (2017). Deterministic Global Optimization: An Introduction to the Diagonal Approach, Springer. [1st ed.].","DOI":"10.1007\/978-1-4939-7199-2"},{"key":"ref_13","unstructured":"Pinter, J.D. (1996). Global Optimization in Action (Continuous and Lipschitz Optimization: Algorithms, Implementations and Applications), Kluwer Academic Publishers. [1st ed.]."},{"key":"ref_14","doi-asserted-by":"crossref","unstructured":"Chambers, D.L. (2001). Practical Handbook of Genetic Algorithms, Applications, Chapman & Hall\/CRC. [2nd ed.].","DOI":"10.1201\/9781420035568"},{"key":"ref_15","doi-asserted-by":"crossref","unstructured":"Floudas, C., and Pardalos, P. (2009). Encyclopedia of Optimization, Springer. [2nd ed.].","DOI":"10.1007\/978-0-387-74759-0"},{"key":"ref_16","doi-asserted-by":"crossref","unstructured":"Gendreau, M. (2010). Handbook of Metaheuristics, Springer. [2nd ed.].","DOI":"10.1007\/978-1-4419-1665-5"},{"key":"ref_17","doi-asserted-by":"crossref","unstructured":"Glover, F.W., and Kochenberger, G.A. (2003). Handbook of Metaheuristics, Kluwer Academic Publishers.","DOI":"10.1007\/b101874"},{"key":"ref_18","doi-asserted-by":"crossref","unstructured":"Neri, F., Cotta, C., and Moscato, P. (2012). Handbook of Memetic Algorithms, Springer. [1st ed.].","DOI":"10.1007\/978-3-642-23247-3"},{"key":"ref_19","doi-asserted-by":"crossref","unstructured":"Chattopadhyay, S., Marik, A., and Pramanik, R. (2022). A brief overview of physics-inspired metaheuristic optimization techniques. arXiv.","DOI":"10.1016\/B978-0-323-91781-0.00003-X"},{"key":"ref_20","first-page":"1","article-title":"A review of population-based meta-heuristic algorithms","volume":"5","author":"Beheshti","year":"2013","journal-title":"Int. J. Adv. Soft Comput. Appl."},{"key":"ref_21","doi-asserted-by":"crossref","first-page":"100012","DOI":"10.1016\/j.ejco.2021.100012","article-title":"(Global) Optimization: Historical notes and recent developments","volume":"9","author":"Locatelli","year":"2021","journal-title":"EURO J. Comput. Optim."},{"key":"ref_22","doi-asserted-by":"crossref","unstructured":"Dragoi, E.N., and Dafinescu, V. (2021). Review of metaheuristics inspired from the animal kingdom. Mathematics, 9.","DOI":"10.3390\/math9182335"},{"key":"ref_23","unstructured":"Brownlee, J. (2011). Clever Algorithms: Nature-Inspired Programming Recipes, LuLu.com. [1st ed.]."},{"key":"ref_24","doi-asserted-by":"crossref","first-page":"105792","DOI":"10.1016\/j.dib.2020.105792","article-title":"A comprehensive database of nature-inspired algorithms","volume":"31","author":"Tzanetos","year":"2020","journal-title":"Data Brief"},{"key":"ref_25","unstructured":"Fister, I., Yang, X.-S., Fister, I., Brest, J., and Fister, D. (2013). A brief review of nature-inspired algorithms for optimization. arXiv."},{"key":"ref_26","unstructured":"Yang, X.S. (2010). Nature-Inspired Metaheuristic Algorithms, Luniver Press. [2nd ed.]."},{"key":"ref_27","doi-asserted-by":"crossref","first-page":"012002","DOI":"10.1088\/1742-6596\/2308\/1\/012002","article-title":"Comparative analysis of optimization strategies by software complex \u201cMetaheuristic nature-inspired methods of global optimization\u201d","volume":"2308","author":"Panteleev","year":"2022","journal-title":"J. Phys. Conf. Ser."},{"key":"ref_28","doi-asserted-by":"crossref","first-page":"220","DOI":"10.1016\/j.swevo.2019.04.008","article-title":"Bio-inspired computation: Where we stand and what\u2019s next","volume":"48","author":"Osaba","year":"2019","journal-title":"Swarm Evol. Comput."},{"key":"ref_29","doi-asserted-by":"crossref","unstructured":"Yang, X.S., and Deb, S. (2009, January 9\u201311). Cuckoo search via Levy flights. In Proceedings of World Congress on Nature and Biologically Inspired Computing, Coimbatore, India.","DOI":"10.1109\/NABIC.2009.5393690"},{"key":"ref_30","doi-asserted-by":"crossref","first-page":"67","DOI":"10.1109\/4235.585893","article-title":"No free lunch theorems for optimization","volume":"1","author":"Wolpert","year":"1997","journal-title":"IEEE Trans. Evolut. Comput."},{"key":"ref_31","doi-asserted-by":"crossref","unstructured":"Averina, T.A., and Rybakov, K.A. (2019, January 26\u201330). Maximum cross section method in optimal filtering of jump-diffusion random processes. Proceedings of the 15th International Asian School-Seminar Optimization Problems of Complex Systems, Novosibirsk, Russia.","DOI":"10.1109\/OPCS.2019.8880234"}],"container-title":["Algorithms"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/www.mdpi.com\/1999-4893\/15\/9\/301\/pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,10,11]],"date-time":"2025-10-11T00:15:54Z","timestamp":1760141754000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.mdpi.com\/1999-4893\/15\/9\/301"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022,8,26]]},"references-count":31,"journal-issue":{"issue":"9","published-online":{"date-parts":[[2022,9]]}},"alternative-id":["a15090301"],"URL":"https:\/\/doi.org\/10.3390\/a15090301","relation":{},"ISSN":["1999-4893"],"issn-type":[{"value":"1999-4893","type":"electronic"}],"subject":[],"published":{"date-parts":[[2022,8,26]]}}}