?
Global Equilibrium Search Algorithms for Combinatorial Optimization Problems
P. 227–286.
Global Equilibrium Search (GES) is a meta-heuristic framework that shares similar ideas with the simulated annealing method. GES accumulates a compact set of information about the search space to generate promising initial solutions for the techniques that require a starting solution, such as the simple local search method. GES has been successful for many classic discrete optimization problems: the unconstrained quadratic programming problem, the maximum satisfiability problem, the max-cut problem, the multidimensional knapsack problem and the job-shop scheduling problem. GES provides state-of-the-art performance on all of these domains when compared to the current best known algorithms from the literature. GES algorithm can be naturally extended for parallel computing as it performs search simultaneously in distinct areas of the solution space. In this talk, we provide an overview of Global Equilibrium Search and discuss some successful applications.
Springer Publishing Company, 2025.
The three-volume set LNCS 14476-14478 constitutes the post conference proceedings of the 4th International Conference on Numerical Computations: Theory and Algorithms, NUMTA 2023, held in Pizzo Calabro, Italy, during June 14–20, 2023.
The 45 full papers presented in this book together with 60 short papers were carefully reviewed and selected from 170 submissions.
The papers focus on ...
Added: November 23, 2025
Кочкаров А. А., Yatskin D., Рахманов О. А., Известия ЮФУ. Технические науки 2016 № 2 С. 158–168
The problem of limited space monitoring is formulated. The connection between the monitoring space and the detection of objects in this space sets up. After introducing some assumptions we conclude the necessity of solving the covering set (connected space) problem. The presence of obstacles in the monitoring area is the characteristic feature of the problem. ...
Added: March 7, 2025
Кочкаров А. А., Yatskin D., В кн.: Труды III Всероссийской научно-технической конференции «РТИ Системы ВКО-2015».: М.: Издательство МГТУ им. Н.Э. Баумана, 2015. С. 694–702.
Формулируется постановка задачи мониторинга ограниченного пространства. После введения некоторых допущений и перехода на математический язык делается вывод о необходимости решения задачу покрытия множества. Задача покрытия дискретизуется, исследуются свойства и признаки разного рода покрытий. Предложен и обоснован алгоритм построения наименьшего покрытия, рассчитывается его сложность. ...
Added: March 7, 2025
Морозов Н. Ю., Гришин Е. М., Правдивец Н. А. et al., Управление большими системами: сборник трудов 2022 № 99 С. 135–156
В связи с ростом объема мультимодальных перевозок ОАО «РЖД» требуется более эффективное использование имеющихся ресурсов. В наши дни наиболее востребованной разновидностью международного грузооборота является доставка морским транспортом с последующей перегрузкой на железную дорогу для доставки до пункта назначения на материке. В настоящей статье предлагается комплексная математическая модель, включающая две подзадачи: задачу назначения причалов (BAP) и ...
Added: December 7, 2022
Grishin E., Pravdivets N., Morozov N. et al., IFAC-PapersOnLine 2022 Vol. 55 No. 10 P. 2557–2562
Sea transport holds the first place in the total number of freight shipments of international transportation. Rail transport takes more than 87% of domestic freight traffic and is increasing annually. In particular, Russian Railways deals with scheduling in international multimodal transport. Sea port-railway transshipment points have a key role in the realization of such transportation. ...
Added: December 7, 2022
Smirnov S., Voloshinov V., O.V. Sukhoroslov, , in: Proceedings of the 9th International Conference "Distributed Computing and Grid Technologies in Science and Education" (GRID'2021), Dubna, Russia, July 5-9, 2021.: CEUR Workshop Proceedings, 2021. P. 413–417.
ParaSCIP is rather advanced open-source solver for discrete and global optimization problems. This solver is distinguished by that it can run on distributed memory systems and use up to 80,000 cores, solving open problems from the MIPLIB test libraries. Earlier, using this solver, we confirmed the conjecture on optimal packing of nine congruent circles on ...
Added: October 30, 2022
Du J., Wen Y., Wang L. et al., Annals of Mathematics and Artificial Intelligence 2023 Vol. 97 P. 117–216
Human Learning Optimization (HLO) is a simple yet efficient binary meta-heuristic, in
which three learning operators, i.e. the random learning operator (RLO), individual
learning operator (ILO) and social learning operator (SLO), are developed to mimic
human learning mechanisms to solve optimization problems. Among these three operators,
RLO directly influences the exploration and exploitation abilities of HLO, and
therefore its control ...
Added: May 26, 2022
Ignatov A., Posypkin M., , in: Optimization and Applications: 12th International Conference, OPTIMA 2021, Petrovac, Montenegro, September 27 – October 1, 2021, Proceedings.: Switzerland: Springer, 2021. P. 336–350.
Restoration of the 3D structure of a protein from the sequence of its amino acids (“folding”) is one of the most important and challenging problems in computational biology. The most accurate methods require enormous computational resources due to the large number of variables determining a protein’s shape. Coarse-grained models combining several protein atoms into one ...
Added: May 20, 2022
Zhang P., Du J., Wang L. et al., Applied Soft Computing Journal 2022 Vol. 122 Article 108816
Human Learning Optimization (HLO) is a simple yet powerful meta-heuristic developed based on a simplified human learning model. Many cognitive activities of humans contain an element of reasoning, and with reasoning, humans can gain deeper information on problems to boost learning performance. Inspired by this fact, this paper proposes a novel human learning optimization algorithm ...
Added: April 11, 2022
Ададуров С. Е., Алексеев А. М., Анисимов В. А. et al., М.: ООО "Издательство "ЛЕМА", 2020.
В коллективной монографии членов и научных партнеров Объединенного ученого совета ОАО «РЖД», объединяющего ведущих представителей отраслевой и фундаментальной российской науки, отражены ключевые вопросы научной поддержки перевозочного процесса и управления товарными потоками на железнодорожном транспорте, повышения эффективности его деятельности на основе клиентоориентированности и логистических принципов.
Рассмотрены системные вопросы развития логистических технологий, научные принципы прогнозирования и планирования железнодорожных ...
Added: February 4, 2022
Gadetsky A., Struminsky K., Robinson C. et al., , in: Thirty-Fourth AAAI Conference on Artificial IntelligenceVol. 34.: AAAI Press, 2020. P. 10126–10135.
Added: October 11, 2020
Cham: Springer, 2020.
This book constitutes the proceedings of the 19th International Conference on Mathematical Optimization Theory and Operations Research, MOTOR 2020, held in Novosibirsk, Russia, in July 2020. The 31 full papers presented in this volume were carefully reviewed and selected from 102 submissions. The papers are grouped in these topical sections: discrete optimization; mathematical programming; game ...
Added: September 2, 2020
Omelchenko A., Malozemov V. N., Journal of Industrial and Management Optimization 2006 Vol. 2 No. 1 P. 55–62
A two-dimensional discrete optimal control problem is considered. In this problem it is required that the first component admits the given value and the second component attains the largest value at the last step. The explicit solution of this problem is obtained under some assumptions. ...
Added: September 11, 2018
Gordenko M., Avdoshin S. M., Proceedings of the Institute for System Programming of the RAS 2018 Vol. 30 No. 3 P. 221–232
In this article, the routing problems are described. It is shown, that almost all routing problem can be transformed into each other. An example of the Mixed Chinese Postman problem is discussed. The article gives an overview of various variants of Chinese Postman Problem. For all problems the mathematical formulation is given. Moreover, the useful ...
Added: September 2, 2018
Kohli P., Osokin A., Jegelka S., , in: Proceedings of the IEEE Conference on Computer Vision and Pattern Recognition (CVPR 2013).: Portland: IEEE, 2013. P. 1971–1978.
We discuss a model for image segmentation that is able to overcome the short-boundary bias observed in standard pairwise random field based approaches. To wit, we show that a random field with multi-layered hidden units can encode boundary preserving higher order potentials such as the ones used in the cooperative cuts model of [11] while ...
Added: October 19, 2017
D. Derkach, N. Kazeev, R Neychev et al., Journal of Physics: Conference Series 2017 Vol. 898 No. 6 P. 1–6
The LHCb experiment stores around 1011 collision events per year. A typical physics analysis deals with a final sample of up to 107 events. Event preselection algorithms (lines) are used for data reduction. Since the data are stored in a format that requires sequential access, the lines are grouped into several output file streams, in ...
Added: October 10, 2017