?
Решение задач маршрутизации транспорта методом муравьиных колоний
Мехатроника, автоматизация, управление. 2014. № 1. С. 18–21.
In this paper we consider application of ant colony optimization techniques for capacitated vehicle routing problem. Modified ant colony optimization algorithm is proposed, computational results are reported.
Derkacheva A., Sakirkina M., Kraev G. et al., /. 2026.
Comprehensive data on natural hazards and their consequences are crucial for effective for risk assessment, adaptation planning, and emergency response. However, many countries face challenges with fragmented, inconsistent, and inaccessible data, particularly regarding local-scale events. To address this data gap in Russia, we developed an end-to-end processing pipeline that scrapes news from various online sources, ...
Added: April 28, 2026
Qin X., Deng Y., Shchur L. et al., / Series arXiv "math". 2026. No. 2603.02962.
We perform a Monte Carlo analysis of the Ising model on many three-dimensional lattices. By means of finite-size scaling we obtain the critical points and determine the scaling dimensions. As expected, the critical exponents agree with the three-dimensional Ising universality class for all models. The irrelevant field, as revealed by the correction-to-scaling amplitudes, appears to ...
Added: April 20, 2026
Pilé I., Deng Y., Shchur L., / Series arXiv "math". 2026. No. 2604.10254.
We investigate the spatial overlap of successive spin configurations in Markov chain Monte Carlo simulations using the local Metropolis algorithm and the Svendsen-Wang and Wolff cluster algorithms. We examine the dynamics of these algorithms for two models in different universality classes: the Ising model and the Potts model with three components. The overlap of two ...
Added: April 20, 2026
Gabdullin N., Androsov I., / Series Computer Science "arxiv.org". 2026.
Label prediction in neural networks (NNs) has O(n) complexity proportional to the number of classes. This holds true for classification using fully connected layers and cosine similarity with some set of class prototypes. In this paper we show that if NN latent space (LS) geometry is known and possesses specific properties, label prediction complexity can ...
Added: April 2, 2026
Sorokin K., Beketov M., Онучин А. et al., / arxiv.org. Серия cs.SI "Social and Information Networks ". 2025.
Community detection in complex networks is a fundamental problem, open to new approaches in various scientific settings. We introduce a novel community detection method, based on Ricci flow on graphs. Our technique iteratively updates edge weights (their metric lengths) according to their (combinatorial) Foster version of Ricci curvature computed from effective resistance distance between the ...
Added: January 15, 2026
Petrovanov I., Sergeev A., / Series Computer Science "arxiv.org". 2025. No. 2512.18332.
Transport coding reduces message delay in packet-switched networks by introducing controlled redundancy at the transport layer: original packets are encoded into coded packets, and the message is reconstructed after the first successful deliveries, effectively shifting latency from the maximum packet delay to the -th order statistic. We present a concise, reproducible discrete-event implementation of transport coding in OMNeT++, including ...
Added: December 24, 2025
Hessian-based lightweight neural network for brain vessel segmentation on a minimal training dataset
Меньшиков И. А., Бернадотт А. К., Elvimov N. S., / Series arXie "Statistical mechanics". 2025.
Accurate segmentation of blood vessels in brain magnetic resonance angiography (MRA) is essential for successful surgical procedures, such as aneurysm repair or bypass surgery. Currently, annotation is primarily performed through manual segmentation or classical methods, such as the Frangi filter, which often lack sufficient accuracy. Neural networks have emerged as powerful tools for medical image ...
Added: December 1, 2025
Чернышов Д. П., Satanin A., Shchur L., / Series arXiv "math". 2025.
We investigate the boundary separating regular and chaotic dynamics in the generalized Chirikov map, an extension of the standard map with phase-shifted secondary kicks. Lyapunov maps were computed across the parameter space (K,K(α, τ)) and used to train a convolutional neural network (ResNet18) for binary classification of dynamical regimes. The model reproduces the known critical ...
Added: November 21, 2025
Rubchinskiy A., Chubarova D., / Series WP7 "Математические методы анализа решений в экономике, бизнесе и политике". 2025. No. WP7/2025/01.
The article examines one of the most famous examples of socio-economic systems, characterized by significant uncertainty – the S&P-500 stock market, where shares of 500 largest US companies are traded. No assumptions are made about the probabilistic characteristics of the stock market. A flexible algorithm for daily trading has been developed, based on both known fixed data ...
Added: November 9, 2025
Meshchaninov V., Strashnov, P., Shevtsov A. et al., / Cornell University. Серия CoRR, arXiv:2403.03726 "Computing Research Repository,". 2025.
Protein design requires a deep understanding of the inherent complexities of the protein universe. While many efforts lean towards conditional generation or focus on specific families of proteins, the foundational task of unconditional generation remains underexplored and undervalued. Here, we explore this pivotal domain, introducing DiMA, a model that leverages continuous diffusion on embeddings derived ...
Added: October 5, 2025
Shabalin A., Meshchaninov V., Vetrov D., / Series cs.CL, arXiv:2505.18853 "Computation and Language". 2025.
Diffusion models have achieved state-of-the-art performance in generating images, audio, and video, but their adaptation to text remains challenging due to its discrete nature. Prior approaches either apply Gaussian diffusion in continuous latent spaces, which inherits semantic structure but struggles with token decoding, or operate in categorical simplex space, which respect discreteness but disregard semantic ...
Added: October 5, 2025
Абрамов А. С., Chernyshev V. L., Mikhaylets E. et al., / Series Social Science Research Network "Social Science Research Network". 2025.
Computer vision is one of the most relevant modern research areas with broad practical applications. However, traditional solutions based on deep learning have signicant limitations and can be misleading. Topological data analysis, on the other hand, is a modern approach to solving similar problems using mathematically deterministic methods of algebraic topology that reduce the risk ...
Added: September 23, 2025
Kochetkov Y., / Series arXiv.org e-print archive "arXiv.math". 2025. No. 07600.
We demonstrate in an elementary way how to construct a frieze pattern of width m-3 from a partition of a convex m-gon
by not intersecting diagonals. ...
Added: September 17, 2025
Kochetkov Y., / Series arXiv.org e-print archive "arXiv.math". 2025. No. 20584.
We give a new proof of the following statement: the Catalan number C_n is divisible
by n+2, if n is odd and n<> 3k+1. ...
Added: September 9, 2025
Ivanashev Y., / Series Computer Science "arxiv.org". 2025.
Added: July 29, 2025
Ilya Bychkov, Mikhail Batsyn, , in: Optimization Problems and Their Applications. 7th International Conference, OPTA 2018, Omsk, Russia, July 8-14, 2018, Revised Selected Papers.: Springer, 2018. P. 66–81.
The Vehicle Routing Problem (VRP) is one of the most popular combinatorial optimization problems which is closely related to the real-life optimization challenges. Being developed for more than 60 years the problem has been considered in many different formulations. In real-life goods distribution such constraints as fleet size and mix, sitedependency constraints, hard and soft ...
Added: October 23, 2018
Beresneva E., В кн.: Межвузовская научно-техническая конференция студентов, аспирантов и молодых специалистов им. Е.В. Арменского.: МИЭМ НИУ ВШЭ, 2018. С. 17–18.
В материалах конференции студентов, аспирантов и молодых специалистов представлены тезисы докладов по следующим направлениям: математика и компьютерное моделирование; информационно-коммуникационные технологии; автоматизация проектирования, банки данных и знаний, интеллектуальные системы; компьютерные образовательные продукты; информационная безопасность; электроника и приборостроение; производственные технологии, нанотехнологии и новые материалы; инновационные технологии цифровой экономики; инновационные технологии в дизайне.
Материалы конференции могут быть полезны для ...
Added: June 21, 2018
Gordenko M., В кн.: Межвузовская научно-техническая конференция студентов, аспирантов и молодых специалистов им. Е.В. Арменского.: МИЭМ НИУ ВШЭ, 2018. С. 20–21.
В данной работе рассмотрены алгоритмы ближайшего соседа решения обобщенной задачи коммивояжера в качестве начальной инициализации для алгоритма LKH. Проведено экспериментальное исследование алгоритма LKH с целью сравнительной оценки рациональности полученных решений при различных начальных инициализациях. ...
Added: June 5, 2018
Belov A. V., Slastnikov S., Lobachevskii Journal of Mathematics 2017 Vol. 38 No. 5 P. 884–887
The paper is devoted to modeling multi depot vehicle routing problem (VRP) with capacity constraints for petroleum products delivery. Applying efficient metaheuristics algorithms combined with local search procedures, we present how to get suboptimal solutions for this NP-hard problem in an acceptable time. Some parallel computing techniques are also used to reduce the execution time. ...
Added: October 11, 2017
Alexey A. Lifshits, Avdoshin S. M., , in: Emerging Trends in Information Systems: Recent Innovations, Result and Experiences.: Netherlands: Springer, 2016. Ch. 6 P. 65–77.
The companies that are IT-industry leaders perform from several tens to several hundreds of projects simultaneously. The main problem is to decide whether the project is acceptable to the current strategic goals and resource limits of a company or not. This leads firms to an issue of a project portfolio selection; therefore, the challenge is ...
Added: March 15, 2016
Belov A. V., Slastnikov S., Journal of Physics: Conference Series 2016 Vol. vol 692 No. 1 P. 012050
Paper is devoted constructing efficient metaheuristics algorithms for discrete optimization problems. Particularly, we consider vehicle routing problem applying original ant colony optimization method to solve it. Besides, some parts of algorithm are separated for parallel computing. Some experimental results are performed to compare the efficiency of these methods. ...
Added: February 21, 2016
Wang L., Ni H., Yang R. et al., Engineering Applications of Artificial Intelligence 2015 Vol. 46 No. A P. 1–9
Virtual Reference Feedback Tuning (VRFT) is a data-driven one-shot control method which is very attractive for engineering applications. However, it cannot design controllers with the optimal control performance based on the standard VRFT approach as performance indices are not explicitly represented in its objective function. To deal with this problem, this paper presents a novel ...
Added: September 28, 2015
Slastnikov S., Экономика и математические методы 2014 № 1 С. 117–126
Статья посвящена исследованию современных метаэвристик для задач маршрутизации транспорта. Приведен краткий обзор основных метаэвристических алгоритмов, подробно описан алгоритм муравьиных колоний. Предлагается модификация алгоритма муравьиных колоний, эффективность которой подтверждена результатами вычислительного эксперимента. ...
Added: March 4, 2015
Slastnikov S., В кн.: Научно-техническая конференция студентов, аспирантов и молодых специалистов МИЭМ НИУ ВШЭ. Тезисы докладов.: М.: МИЭМ НИУ ВШЭ, 2013. С. 62–63.
В работе рассматривается задача маршрутизации транспорта с ограничениями грузоподъемности. Описана ее математическая модель. К решению данной задачи применен алгоритм муравьиных колоний, проведены вычислительные эксперименты. ...
Added: March 4, 2015