In this project, we will explore how the problem of the Multiple Couriers Planning (MCP) is modeled and discuss various approaches to address it: Constraint Programming (CP), Satisfiability Modulo Theories (SMT) and Mixed-Integer Linear Programming (MIP).