垂直搬送機のスケジューリング問題に対するMaxSAT の適用

DOI Web Site オープンアクセス

書誌事項

タイトル別名
  • MaxSAT Application for Vertical Transport Machine's Scheduling
公開日
2024-03-01
DOI
  • 10.1527/tjsai.39-2_b-n64
公開者
一般社団法人 人工知能学会

この論文をさがす

説明

<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>

収録刊行物

キーワード

詳細情報 詳細情報について

問題の指摘

ページトップへ