?
Применение алгоритма муравьиной колонии для решения задачи маршрутизации транспорта
С. 62–63.
In book
М.: МИЭМ НИУ ВШЭ, 2013.
Torres-Pérez I., Rosete A., Sosa Gómez G. et al., IFAC-PapersOnLine 2022 Vol. 55 No. 10 P. 2228–2233
Added: September 18, 2026
Gorodilov A., Сидоренко Д. О., Вестник Пермского университета. Серия: Математика. Механика. Информатика 2021 № 4(55) С. 43–48
В статье описан подход к решению задачи маршрутизации транспорта на основе подвижного генетического алгоритма. Подвижные генетические алгоритмы отличаются от классических более гибкой схемой кодирования решений, что актуально для задач со сложной структурой решения. В статье приведена математическая постановка задачи. Авторами предложено два варианта кодирования особей, а также алгоритм пересчета вероятностей, формирующих хромосому в подвижном генетическом ...
Added: November 20, 2025
Dybskaya V., Sergeyev V., Sergeev I., Логистика 2024 № 5 С. 12–18
В статье рассмотрена проблематика квантовой логистики. Показано, что сущность квантовой логистики состоит в цифровизации и оперативной реагировании на возможные сбои логистических бизнес-процессов в цепях поставок. Рассмотрено применение квантовых алгоритмов и вычислений для оптимизации различных логистических задач: маршрутизации транспорта, операционной логистики, управления запасами, планировании и управлении логистическими рисками в цепях поставок. ...
Added: September 17, 2024
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
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 С. 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. ...
Added: March 4, 2015
Slastnikov S., Экономика и математические методы 2014 № 1 С. 117–126
Статья посвящена исследованию современных метаэвристик для задач маршрутизации транспорта. Приведен краткий обзор основных метаэвристических алгоритмов, подробно описан алгоритм муравьиных колоний. Предлагается модификация алгоритма муравьиных колоний, эффективность которой подтверждена результатами вычислительного эксперимента. ...
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