We formulate a two-stage stochastic integer programming model. The first-stage decisions include a binary variable x, where x = 1 denotes partnering with third-party platforms and x = 0 otherwise, and a non-negative integer variable y denoting the number of drivers that will be hired during the targeted periods. For every hired driver, the restaurant needs to pay a fixed base salary cv per day. The driver will also receive an additional stipend, proportional to the travel time and distance of each delivery, at unit cost rates
cτ and cd, respectively. Each driver can deliver at most
Δ number of orders per day. We consider a finite number of scenarios, generated by Monte Carlo sampling approach. For each order, the correspondent decision variable u=1 means the order is delivered by drivers hired by the restaurant and v=1 means the order is delivered by the platform.