TY - JOUR
T1 - MaxSAT Application for Vertical Transport Machine's Scheduling
AU - Okamoto, Kazuya
AU - Koide, Yukikazu
AU - Koshimura, Miyuki
AU - Noda, Itsuki
N1 - Publisher Copyright:
© 2024, Japanese Society for Artificial Intelligence. All rights reserved.
PY - 2024
Y1 - 2024
N2 - 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.
AB - 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.
UR - http://www.scopus.com/inward/record.url?scp=85186567176&partnerID=8YFLogxK
UR - http://www.scopus.com/inward/citedby.url?scp=85186567176&partnerID=8YFLogxK
U2 - 10.1527/tjsai.39-2_B-N64
DO - 10.1527/tjsai.39-2_B-N64
M3 - Article
AN - SCOPUS:85186567176
SN - 1346-0714
VL - 39
JO - Transactions of the Japanese Society for Artificial Intelligence
JF - Transactions of the Japanese Society for Artificial Intelligence
IS - 2
M1 - B-N64_1-10
ER -