Solvers for General Costs

In this tutorial, we will see how to configure solvers for more general costs than w + dp.IntExpr.state_cost() using the minimization of open stacks problem (MOSP) as an example.

MOSP

In MOSP, we are given a set of customers \(C = \{ 0, ..., n-1 \}\) and a set of products \(P = \{ 0, ..., m-1 \}\). Each customer \(c \in C\) requests a subset of products \(P_c \subseteq P\). We want to decide the order to produce the products. Once we produced a product \(p \in P_c\), we need to open a stack for customer \(c\) to store the product. When we produced all products in \(P_c\), we can close the stack for \(c\). We want to minimize the maximum number of open stacks at a time.

DP Formulation

The DP formulation is based on Chu and Stuckey [4]. The approach is to find the order of customers to close stacks instead of the order of products to produce. Once the order of customers is determined, for each customer, products requested by the customer that are not produced yet are consecutively produced in an arbitrary order. Chu and Stuckey [4] proved that this approach finds an optimal solution.

When we close the stack for customer \(c\), we need to produce all products in \(P_c\). If another customer \(c'\) requests a product in \(P_c\) and its stack is not opened yet, we need to open the stack for \(c'\). In a sense, we can say that \(c'\) is a neighbor of \(c\). Let \(N_c \subseteq C\) be the set of neighbors including \(c\), i.e.,

\[N_c = \{ c' \in C \mid P_{c'} \cap P_c \neq \emptyset \}.\]

Let \(O\) be the set of customers whose stacks have been opened. When we are producing the products requested by \(c\), we need to open new stacks for customers \(N_c \setminus O\). Let \(R\) be the set of customers whose stacks are not closed yet. Because the set of customers whose stacks have been opened and not closed is \(O \cap R\), the number of open stacks when producing the products for \(c\) is

\[|(O \cap R) \cup (N_c \setminus O)|\]

When we close the stack for \(c\), the set of customers whose stacks are not closed becomes \(R \setminus \{ c \}\), and the set of customers whose stacks have been opened becomes \(O \cup N_c\). Let \(V(R, O)\) be the minimum of the maximum number of open stacks at a time to close the stacks for customers in \(R\) when the stacks for customers in \(O\) have been opened. Then, the DP formulation is

\[\begin{split}\text{compute } & V(C, \emptyset) \\ & V(R, O) = \begin{cases} \min\limits_{c \in R} \max\left\{ |(O \cap R) \cup (N_c \setminus O)|, V(R \setminus \{ c \}, O \cup N_c) \right\} & \text{if } R \neq \emptyset \\ 0 & \text{if } R = \emptyset \end{cases} \\ & V(R, O) \geq 0.\end{split}\]

Modeling in DIDPPy

Modeling the above DP formulation in DIDPPy is not difficult though it may look complicated. Assume that the data is preprocessed, and we are given \(N_c\) for each \(c \in C\) instead of \(P_c\).

import didppy as dp

# Number of customers
n = 4
# Neighbors
neighbors = [[0, 1], [0, 1, 3], [2], [1,    3]]

model = dp.Model()

customer = model.add_object_type(number=n)

# R
remaining = model.add_set_var(object_type=customer, target=list(range(n)))
# O
opened = model.add_set_var(object_type=customer, target=[])

neighbor_table = model.add_set_table(neighbors, object_type=customer)

for c in range(n):
    close = dp.Transition(
        name="close {}".format(c),
        cost=dp.max(
            ((opened & remaining) | (neighbor_table[c] - opened)).len(),
            dp.IntExpr.state_cost(),
        ),
        effects=[
            (remaining, remaining.remove(c)),
            (opened, opened | neighbor_table[c]),
        ],
        preconditions=[remaining.contains(c)],
    )
    model.add_transition(close)

model.add_base_case([remaining.is_empty()])

model.add_dual_bound(0)

We can take the cardinality of SetVar and SetExpr as IntExpr using len(). Now, cost is the maximum of an IntExpr and state_cost(). Note that here, state_cost() is didppy.IntExpr.state_cost(), so it is an IntExpr. The function didppy.max() takes the maximum of two IntExpr and returns an IntExpr.

Configuring Solvers for General Costs

In the above model, the form of cost is different from what we observed in the previous models: it takes the maximum of an IntExpr and state_cost() instead of addition. Still, we can use path-finding based solvers such as CABS as long as the IntExpr is independent of state_cost() if we tell the cost form to the solver.

solver = dp.CABS(model, f_operator=dp.FOperator.Max)
solution = solver.search()

The argument f_operator takes an instance of FOperator to specify the form of the cost expression. Because we take the maximum, we use Max. The default value is Plus, which means that the cost expression is in the form of the addition.

CABS and other path-finding based solvers can handle the product and minimum as well if we use Product and Min for f_operator, respectively.

If we use the most generic (but potentially inefficient) solver, ForwardRecursion, we do not need such a configuration.

solver = dp.ForwardRecursion(model)
solution = solver.search()