-
- Okamoto Kazuya
- National Institute of Advanced Industrial Science and Technology
-
- Koide Yukikazu
- National Institute of Advanced Industrial Science and Technology
-
- Koshimura Miyuki
- Kyushu University
-
- Noda Itsuki
- Hokkaido University
Bibliographic Information
- Other Title
-
- 垂直搬送機のスケジューリング問題に対するMaxSAT の適用
Abstract
<p>This paper considers optimal scheduling for a vertical transport machine. We propose a scheduling method with MaxSAT which is an optimal version of Boolean satisfiability problem (SAT). The movement of the luggage in the machine is described as a set of Boolean formulas, and those costs are represented by a set of weighted Boolean formulas. The MaxSAT solver finds out an optimal scheduling as a model satisfying the formulas with the minimum cost. Experimental results show that the proposed method can solve the practical problems in reasonable time. We succeeded to improve transport capacity by constructing the optimal table with MaxSAT.</p>
Journal
-
- Transactions of the Japanese Society for Artificial Intelligence
-
Transactions of the Japanese Society for Artificial Intelligence 39 (2), B-N64_1-10, 2024-03-01
The Japanese Society for Artificial Intelligence
- Tweet
Keywords
Details 詳細情報について
-
- CRID
- 1390299318868317184
-
- ISSN
- 13468030
- 13460714
-
- Text Lang
- ja
-
- Data Source
-
- JaLC
- Crossref
-
- Abstract License Flag
- Disallowed