In this study, Split Delivery Simultaneous Pickup and Delivery Vehicle Routing Problem (SDSPDVRP) is considered which is a generalized version of the Simultaneous Pickup And Delivery Vehicle Routing Problem (SPDVRP) and Split Delivery Vehicle Routing Problem (SDVRP). Unlike the SPDVRP, in the SDSPDVRP, each customer can be visited more than once, and the demand of each customer can be greater than the capacity of the vehicles. According to the authors' knowledge, a general model for the SDSPDVRP are presented in literature for the first time in this study. In the study, two mathematical models presented for the defined BTETDARP. Computational results on a set of instances, generated from literature, are presented and the performance of the models compared and evaluated. Proposals have been made for the solution of medium and large scale problems. All performance criteria for the proposed second model has been shown to outperform.