“…where R: number of possible routes (tours) in the bus system; r: Node sequence (or tour), an ordered set of the nodes visited by a bus, from the start node until the end node; N: total number of nodes in the system; Q: total number of links with traffic counts in the system; t r : number of bus journeys (tour flow) following node sequence (or tour) r (a listing of the nodes visited), i.e., the number of buses that travel along the same tour; Or 1 i , Or 2 i , Or 3 i : triangular parameters for bus tour production; Cr 1 , Cr 2 , Cr 3 : triangular parameters for total cost in the transit system; Vr 1 a , Vr 2 a , Vr 3 a : triangular parameters for bus traffic counts (volume); C r : Cost of tour r, associated with travel on the tour; δ ri : a binary parameter equal to 1 if node i is in tour r, equal to 0 otherwise; δ ra : a binary parameter equal to 1 if the tour r uses link a, equal to 0 otherwise. The model above, presented in Equation (29) to Equation (32), has been rewritten in Equation (33) to Equation (40). The constraints are represented in the Equation (30) to Equation (32).…”