Email this article Monte Carlo solution of combinatorial optimization problems
- Authors: Rashkovskiy S.A.1
-
Affiliations:
- Ishlinskii Institute for Problems in Mechanics
- Issue: Vol 94, No 3 (2016)
- Pages: 720-724
- Section: Control Theory
- URL: https://journal-vniispk.ru/1064-5624/article/view/224670
- DOI: https://doi.org/10.1134/S106456241606020X
- ID: 224670
Cite item
Open Access
Access granted
Subscription Access
Abstract
A general method for solving combinatorial optimization problems based on the Metropolis algorithm is developed. The method is easy to implement, efficient, and universal. It can be applied to a broad class of poorly formalizable logical problems. An example is given of solving the problem of creating a class schedule by applying the Monte Carlo method.
About the authors
S. A. Rashkovskiy
Ishlinskii Institute for Problems in Mechanics
Author for correspondence.
Email: rash@ipmnet.ru
Russian Federation, Moscow, 119526
Supplementary files
