?
Решение задач маршрутизации транспорта методом муравьиных колоний
Мехатроника, автоматизация, управление. 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.
Piontkovski D., / Series arXiv "math". 2026.
A noncommutative projective variety is defined, following Artin and Zhang, by a graded coherent algebra 𝐴. The category of coherent sheaves is then the quotient qgr(𝐴) of the category of finitely presented graded modules by the subcategory of torsion modules. We consider the categorical and polynomial entropies of the Serre twist, that is, of the ...
Added: June 23, 2026
Piontkovski D., / Series arXiv "math". 2025.
If a symmetric multilinear algebra is weakly nil, then it is Engel. This result may be regarded as an infinite-dimensional analogue of the well-known Jacobian theorem, which states that if a polynomial mapping has a polynomial inverse, then its Jacobian matrix is invertible. This refines a theorem of Gerstenhaber and partially answers a question posed ...
Added: June 23, 2026
Shipilov F., Barnyakov A., Ivanov A. et al., / Series Physics "arxiv.org". 2026.
A fast simulation of the detector response is a vital task in high-energy physics (HEP). Traditional Monte-Carlo methods form the backbone of modern particle physics simulation software but are computationally expensive. We present a machine-learning-based approach to fast simulation of the Focusing Aerogel Ring Imaging Cherenkov (FARICH) detector response. Given a particle track and momentum, ...
Added: May 19, 2026
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
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
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
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
Bochkarev A. A., Вестник ИНЖЭКОНа. Серия: Экономика 2013 № 2 (61) С. 149–155
The article presents a review of the Russian market of the information systems intendend for automation of planning of motor transportation delivery of freights, and the corporative analysis of sush systems has been carried out. ...
Added: March 2, 2015
Belov A. V., Slastnikov S., , in: Procedia Computer Science. 2nd International Conference on Information Technology and Quantitative Management, ITQM 2014. National Research University Higher School of Economics (HSE) in Moscow (Russia) on June 3-5, 2014Vol. 31.: Amsterdam: Elsevier, 2014. P. 143–150.
Motor fuel distribution problem is considered. Accepting some assumptions it can be reduced to a well-known vechicle routing problem with capacity constraints. Ant colony optimization approach is suggested for solving CVRP. Modified ant algorithms are performed. Computational results for some benchmarks are given in compare with classical ant algorithms. ...
Added: February 2, 2015
Li J., Pardalos P. M., Sun H. et al., Expert Systems with Applications 2015 Vol. 42 No. 7 P. 3551–3561
Although the multi-depot vehicle routing problem with simultaneous deliveries and pickups (MDVRPSDP) is often encountered in real-life scenarios of transportation logistics, it has received little attention so far. Particularly, no papers have ever used metaheuristics to solve it. In this paper a metaheuristic based on iterated local search is developed for MDVRPSDP. In order to ...
Added: January 23, 2015
Avdoshin S. M., Lifshits A. A., Бизнес-информатика 2014 № 1(27) С. 14–22
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 formation; therefore, the challenge is ...
Added: October 15, 2014
Slastnikov S., Belov A. V., В кн.: Инновации на основе информационных и коммуникационных технологий: материалы международной научно-технической конференции (2012).: М.: МИЭМ НИУ ВШЭ, 2012. С. 222–226.
The problem of automatic vehicle routing for oil products transportation from storage depots to filling stations is considered. An overview of existing software solutions and their limitations are shown. Metaheuristic algorithm for solving this problem is described, software architecture of the system is proposed. ...
Added: February 25, 2014