書誌事項
- タイトル別名
-
- MaxSAT Application for Vertical Transport Machine's Scheduling
抄録
<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>
収録刊行物
-
- 人工知能学会論文誌
-
人工知能学会論文誌 39 (2), B-N64_1-10, 2024-03-01
一般社団法人 人工知能学会
- Tweet
詳細情報 詳細情報について
-
- CRID
- 1390299318868317184
-
- ISSN
- 13468030
- 13460714
-
- 本文言語コード
- ja
-
- データソース種別
-
- JaLC
- Crossref
-
- 抄録ライセンスフラグ
- 使用不可