This paper presents a binary integer linear programming model based on a dual station at an intersection to make BRT (Bus Rapid Transit) go through the intersection without stopping. This paper first gives the setting of the BRT dual station at the intersection and compares the average BRT delay of the single and dual station at the intersection. Through comparison, it is found that dual station can optimize BRT operations, but there is still room for further optimization. Therefore, this paper establishes a 01 linear programming model based on a dual station. The model takes the shortest travel time of BRT as the optimization objective, and takes the selection of the dual station, green light time of the intersection and cycle time as optimization variables. The case analysis and results show that, compared with the current situation, the average intersection delay of signal priority method, simple dual station method and method proposed in this paper are reduced by 3.51 s (8.6%), 17.27 s (42.17%) and 35.99 s (87.89%); compared with the current situation, the average stopping times at intersection of the signal priority method, simple dual station method and the method proposed in this paper are reduced by −3 (−9.4%), 2 (6.2%) and 23 (71.8%), respectively. Under the control of the method proposed in this paper, the average intersection delay is 4.96 s, and the average stopping times at the intersection is 0.18. This shows that the optimization model proposed in this paper can greatly reduce BRT delay and parking times. The setting of dual station makes the two stations symmetrical to each other, which conforms to the name of the journal. This paper belongs to the field of Symmetry and other scientific disciplines and engineering.