Solving Constrained Slot Placement Problems Using an Ising Machine and Its Evaluations


IEICE TRANSACTIONS on Information and Systems   Vol.E104-D    No.2    pp.226-236
Publication Date: 2021/02/01
Publicized: 2020/11/09
Online ISSN: 1745-1361
DOI: 10.1587/transinf.2019EDP7254
Type of Manuscript: PAPER
Category: Fundamentals of Information Systems
Ising machine,  Ising model,  slot-placement problem,  quadratic assignment problem,  quadratic unconstrained binary optimization,  

Full Text: PDF>>
Buy this Article

Ising machines have attracted attention, which is expected to obtain better solutions of various combinatorial optimization problems at high speed by mapping the problems to natural phenomena. A slot-placement problem is one of the combinatorial optimization problems, regarded as a quadratic assignment problem, which relates to the optimal logic-block placement in a digital circuit as well as optimal delivery planning. Here, we propose a mapping to the Ising model for solving a slot-placement problem with additional constraints, called a constrained slot-placement problem, where several item pairs must be placed within a given distance. Since the behavior of Ising machines is stochastic and we map the problem to the Ising model which uses the penalty method, the obtained solution does not always satisfy the slot-placement constraint, which is different from the conventional methods such as the conventional simulated annealing. To resolve the problem, we propose an interpretation method in which a feasible solution is generated by post-processing procedures. We measured the execution time of an Ising machine and compared the execution time of the simulated annealing in which solutions with almost the same accuracy are obtained. As a result, we found that the Ising machine is faster than the simulated annealing that we implemented.