Related papers: Probing spin glasses with heuristic optimization a…
Anytime heuristic search algorithms try to find a (potentially suboptimal) solution as quickly as possible and then work to find better and better solutions until an optimal solution is obtained or time is exhausted. The most widely-known…
In these lectures I will review the approach to glasses based on the replica formalism. Many of the physical ideas are very similar to those of older approaches. The replica approach has the advantage of describing in an unified setting…
In this work we propose a heuristic algorithm for the layout optimization for disks installed in a rotating circular container. This is a unequal circle packing problem with additional balance constraints. It proved to be an NP-hard…
We present GLASSES: Global optimisation with Look-Ahead through Stochastic Simulation and Expected-loss Search. The majority of global optimisation approaches in use are myopic, in only considering the impact of the next function value; the…
This thesis introduces stochastic generalized routing problem model and proposes exact and heuristic algorithms to solve it efficiently, in a wide range of problem sizes. At first, the classic routing problem with its common variations in…
We review the approach to glasses based on the replica formalism. The replica approach presented here is a first principle's approach which aims at deriving the main glass properties from the microscopic Hamiltonian. In contrast to the old…
A spin glass is a diluted magnetic material in which the magnetic moments are randomly interacting, with a huge number of metastable states which prevent reaching equilibrium. Spin-glass models are conceptually simple, but require very…
Many problems in science and engineering are optimization problems, which may require sophisticated optimization techniques to solve. Nature-inspired algorithms are a class of metaheuristic algorithms for optimization, and some algorithms…
This first chapter intends to review and analyze the powerful new Harmony Search (HS) algorithm in the context of metaheuristic algorithms. I will first outline the fundamental steps of Harmony Search, and how it works. I then try to…
While most heuristics studied in heuristic search depend only on the state, some accumulate information during search and thus also depend on the search history. Various existing approaches use such dynamic heuristics in $\mathrm{A}^*$-like…
This paper gives an introduction to some of the statistical physics problems which appear in the study of structural glasses. It is a shortened and updated version of a more detailed review paper which has appeared in cond-mat/0005173.
Algorithms for continuous optimization problems have a rich history of design and innovation over the past several decades, in which mathematical analysis of their convergence and complexity properties plays a central role. Besides their…
The scheduling problem is a key class of optimization problems and has various kinds of applications both in practical and theoretical scenarios. In the scheduling problem, probabilistic analysis is a basic tool for investigating…
In this talk we review our theoretical understanding of spin glasses paying a particular attention to the basic physical ideas. We introduce the replica method and we describe its probabilistic consequences (we stress the recently…
In Changjun Fan et al. [Nature Communications https://doi.org/10.1038/s41467-023-36363-w (2023)], the authors present a deep reinforced learning approach to augment combinatorial optimization heuristics. In particular, they present results…
The physics of glasses can be studied from many viewpoints, from material scientists interested in the development of new materials to statistical physicists inventing new theoretical tools to deal with disordered systems. In these lectures…
Some questions concerning the calculation of the number of ``physical'' (metastable) states or complexity of the spherical $p$-spin spin glass model are reviewed and examined further. Particular attention is focused on the general…
A version of the extremal optimization (EO) algorithm introduced by Boettcher and Percus is tested on 2D and 3D spin glasses with Gaussian disorder. EO preferentially flips spins that are locally ``unfit''; the variant introduced here…
Probabilistic Logic Programming is an effective formalism for encoding problems characterized by uncertainty. Some of these problems may require the optimization of probability values subject to constraints among probability distributions…
The ongoing rapid expansion of the Internet greatly increases the necessity of effective recommender systems for filtering the abundant information. Extensive research for recommender systems is conducted by a broad range of communities…