Given a text T and a pattern P, the order-preserving pattern matching problem is to find all substrings in T which have the same relative orders as P. The order-preserving pattern matching problem has been studied in terms of finding some patterns affected by relative orders, not by their absolute values. Given a text T and a pattern set , the order-preserving multiple pattern matching problem is to find all substrings in T which have the same relative orders as any pattern in . In this paper, we present a hashing-based algorithm for the order-preserving multiple pattern matching problem.