On-demand food delivery is currently the fastest- growing and most time-sensitive form of logistics in all logistics industry. As the demographic dividend gradually diminishes, an increasing number of platforms are adopting crowdsourced delivery. However, individual crowdsourced riders consider opportunity costs when accepting orders, which determines their decision to make deliveries. Frequent order rejections lead to orders not being finished within the appointed time, and the imbalance in workload among riders also contributes to a high rider attrition rate. In this paper, we propose a stable dispatching algorithm based on bilateral stable matching between orders and riders. This algorithm considers multiple objectives such as system efficiency, service quality, rider experience, and workload balance to address the instability in the dispatching process. Additionally, we design a method to calculate the target dispatching order quantity by fitting the order density function using dispatching order quantity from different time periods. Finally, we demonstrate the effectiveness of the proposed dispatching method through a comparative analysis of experimental results.