29、约束满足问题算法与近场通信旅游应用

约束满足问题算法与近场通信旅游应用

1. AC2001 - OP算法介绍

AC2001 - OP是一种用于约束满足问题（CSP）的弧一致性算法。以下是其具体的算法流程：

Algorithm 4. Procedure AC2001 - OP
Data: A CSP, P = ⟨X, D, R⟩
Result: true and P ′ (which is arc consistent) or false and P ′ (which is arc inconsistent because some domain
remains empty)
begin
    Initialize2001(P, Last)
    1
    for every arc Rij ∈R do
        2
        Append (QS, (Rij, 1)) and Append (QS, (Rij, 2))
    3
    while QS ̸= φ do
        4
        select and delete (Rij, s) from queue Q where s = 1 ∨s = 2
        5
        if Revise2001(Rij , s) = true then
            6
            if Di ̸= φ and Dj ̸= φ then
                7
                if ((opRij =′<′ and s = 1) or (opRij ̸=′<′)) then