# Integrated Optimization of Tram Schedule and Signal Priority at Intersections to Minimize Person Delay

Authors: Wen Zhou; Yun Bai; Jiajie Li; Yuhe Zhou; Tang Li
Journal: Journal of Advanced Transportation
 (2019)

---

## Abstract

Modern trams, as a rapidly developed high-volume transport model, have strict requirements on schedule, because the delay will reduce the attractiveness of public transportation to passengers. To improve punctuality and reliability, Transit Signal Priority (TSP) has been employed at intersections, which can extend or insert green phase to trams. However, extending or inserting the green phase for every tram might lead to heavy delays to crossing vehicles. To address this problem, this study developed an integrated optimization model on tram schedule and signal priority which can balance the delay between trams and other vehicles to minimize person delay. Three conditional strategies named early green, green extension, and phase insertion are proposed for the signal priority. Simultaneously, arrival time, departure time of trams at stations, and stop line are optimized as well. The proposed model is tested with a numerical case and a real-world case at Ningbo tramline in China. The results indicate that the integrated optimization can reduce the average delay of all passengers on trams and other vehicles, compared to timetable optimization only and TSP only. It is also found that the proposed model is able to adapt to the fluctuation in the ratio of tram passenger to auto vehicle user, compared with only minimizing tram passenger delay or auto vehicle user delay.


---

## Body

## 1. Introduction

Modern trams have been developed rapidly in many cities across the world. In China, for example, tram services were provided in 14 cities by the end of 2017, which is 7 times that in 2010. In most cities, Semi-exclusive rights-of-way (ROW) have been adopted where trams have an exclusive lane in the road section and share ROW with other vehicles at the intersection. Apparently, trams might be interrupted by other vehicles or by a red signal at intersections.To reduce the stop of trams at intersections, Transit Signal Priority (TSP) has been applied, which allows preferential treatment of transit vehicles at signalized intersections. In general, TSP can be divided into two main types: passive priority and active priority. Passive priority is to create a green wave band for transit vehicles by adjusting the sequence and shift of signaling phases among successive intersections. Ideally, trams travelling at the recommended speed can pass through all intersections without a stop. However, the practical performance of passive priority might deteriorate due to interruptions at stations and intersections. For example, longer boarding time than the scheduled one will cause the pre-set green wave to fail, which means that the tram might hit a red signal if it still travels at the recommended speed.Different from the passive priority, active priority can detect trams and give green phase to trams whenever they are approaching the intersection. This makes the active priority less sensitive to the disturbance of tram service. The strategies of active TSP can be further classified into unconditional and conditional. Unconditional active TSP, which gives an absolute priority to trams at intersections, is able to minimize tram travel time at the expense of imposing heavy delays to non-priority vehicles at intersections. Although unconditional TSP always provides transit vehicles with green, it inevitably causes disturbances to non-priority vehicles. On the opposite, conditional active TSP only grants priority based on a set of conditions and rules, such as whether or not the disturbance to non-priority vehicles exceeds the threshold value and the transit vehicle is already delayed. In other words, conditional active TSP considers the trade-off between trams and other vehicles. It has been proposed to minimize the average travel time of each person on trams and other vehicles at intersections. Compared to unconditional active TSP, conditional active TSP only has minor impacts on other vehicles.In addition to TSP, tram timetable optimization is another way to reduce the potential stop of trams at intersections. By adjusting timetable, e.g., the run-time on inter-station section and the dwell time at stations, trams can be scheduled to arrive at intersections during a green time. However, in practice the adjustment range on the timetable is limited. This is because the minimal run-times and dwell times of trams are constrained by the speed limits and the numbers of boarding and alighting passengers. The maximum run-times and dwell times are also specified to keep a reasonable service level. Therefore, tram timetable optimization is unable to ensure all the trams meeting green signal at intersections. Compared with only optimizing tram timetable or sole TSP, the integrated optimization on tram timetable and conditional active TSP might further reduce the average travel time of passengers on both trams and other vehicles. Figure1 demonstrates the possible benefits of integrated optimization. Without TSP, as shown in Figure 1(a), the tram, operating with original timetable, meets red signals at intersectionsI andII, which prolongs tram travel time.Figure 1
Benefits of integrating conditional active TSP strategy and tram schedule adjustment.With conditional active TSP, as shown in Figure1(b), early green and green extension are employed at intersectionsI andII respectively, to allow tram meeting green signals at these two intersections where the traffic volumes of non-priority vehicles are relatively lower. At intersectionIII, the active TSP strategy would not be triggered due to the higher traffic volume of non-priority vehicles, which indicates that the tram with original timetable might hit red signals. Compared to the case (a) with no TSP, the average travel time of passengers on both trams and other vehicles could be reduced in case (b) where the conditional active TSP is applied.With integrated optimization on conditional active TSP strategy and tram timetable, only early green is activated at intersectionII as shown in Figure 1(c). By prolonging travel time during station 1 and intersectionI, the tram can avoid red signal at intersectionI without TSP, which means that other non-priority vehicles will not be interrupted. Meanwhile, the tram does not experience red signal at intersectionIII, which is the combined effect of prolonging the travel time during station 1 and station 2 and extending dwell time at station 2. In other words, the duration time of tram waiting at a red light at intersectionIII is transferred to the prolonged time during section and the extended dwell time at station 2. Thus no TSP strategy is required to activate at intersectionIII. Therefore, the delays imposed on non-priority vehicles are smaller than those in case (b) while the tram travel time remains, which indicates less average travel time of passengers on both trams and other vehicles.As discussed above, this integrated optimization model of conditional active TSP and tram schedule can further reduce tram stops at intersections than previous studies which only focus on TSP or tram timetabling. At the same time, interruptions to other non-priority vehicles can be reduced, which means that all passengers on trams and auto vehicles are considered in the proposed optimization model to achieve higher operational efficiency of the whole system.The remainder of this paper is organized as follows. The literature review of the problem is elaborated in Section2. Then the problem has been described in Section 3, which is followed by the formulation of the integrated optimization model on conditional active TSP and tram timetable in Section 4. The methodology to solve the proposed model is developed in Section 5. Case studies are conducted to investigate the performance of the proposed method in Section 6 followed by summarizing the conclusions of this study in Section 7.


## 2. Literature Review

TSP allows preferential treatment of transit vehicles at signalized intersections. It gives transit vehicles a little extra green time or a little less red time at traffic signals to reduce the time wasted on stop or deceleration [1]. The implementation of TSP strategies can contribute to lower delays for priority transit vehicles and auto vehicles that travel in the same directions [2, 3]. Other potential benefits include improved transit schedule reliability, increased passenger comfort and ultimately increased the attractiveness of the transit service [4–6].Passive priority strategy and active priority are the two main types of the TSP strategies [7]. Passive priority is to create a green wave band for transit vehicles along their trips by adjusting the sequence and shift of signaling phases among different intersections [8]. MAXBAND, MULTIBAND and AM-BAND are the three classical models for signal control with passive priority. MAXBAND aims to find the optimal signaling parameters and to maximize the bandwidth of green wave [9–11]. MULTIBAND is able to expand the bandwidth of green wave attained by MAXBAND, by relaxing the constraint of equal width on green wave band at different sections [12–14]. AM-BAND further releases the symmetrical constraint on green wave band, which improves the utilization of green time and decreases stops and delays of vehicles at intersections [15]. The practical performance of passive priority might be deteriorated due to disturbance of tram service, which is not uncommon in practice.Different from passive priority, active priority is widely used because of its flexibility. Active priority strategy grants green signal to trams by adjusting the start time and/or end time of the stage or phase giving transit vehicles right away in each signal cycle [16, 17]. The common strategies to carry out the active TSP include green extension, early green and phase insertion [18–20]. Green extension prolongs the green time when a tram arrives at intersections just behind the end of a green phase. Early green shortens the time of the phase ahead of green when a tram arrives at intersections just before the start of a green phase. Phase insertion denotes that a special green phase is inserted within the red phase. The phase insertion is generally adopted when a tram arrives at intersections at the middle of the red phase [21, 22].The active priority can be further classified into unconditional and conditional [23]. Unconditional priority strategies grant an absolute priority to transit vehicles once they are detected at the upstream of the intersections. There are no differential treatments between the type of transit vehicle and the state of non-priority vehicles [24–27]. Although unconditional TSP always provides transit vehicles with green phase and speeds up transit vehicles by guaranteeing no red signals at intersections, it inevitably causes disturbances to non-priority vehicles, particularly when the volume of non-priority vehicles is high [28–30]. Wahlstedt [31] indicated that TSP results in shorter travel times for buses and longer travel times for crossing traffic and traffic following the prioritized buses in one direction. Skabardonis and Christofa [32] confirmed that, under high traffic volume conditions, the provision of transit signal priority could deteriorate the Level of Service (LOS) on cross-streets by up to two levels.The conditional priority strategies based on a set of conditions and rules have also been developed to reduce disturbances to non-priority vehicles [23]. Conditional TSP balances the benefits to trams and the disruptions to non-priority traffic and is only granted for trams if the disruption is beyond a certain range. Altun and Furth [33] indicated that, compared to unconditional active TSP, conditional active TSP resulted in only minor impacts on non-priority traffic. Furth and Muller [34] proposed a conditional priority method for buses and the results show that, compared to no priority, absolute priority caused severe increases in delay, while conditional priority had almost no impact. Similarly, Kenny and Amer [35] showed that the proposed conditional control policy could effectively reduce the transit headway deviation and causes smaller disturbance to cross street traffic compared with the existing unconditional transit signal priority algorithm.Additionally, tram schedule optimization can also decrease stops of trams at intersections. The traditional scheduling problem is to define a series of trips with prescribed starting and ending times, with the objective of minimizing costs, including capital costs for required buses and operating costs based on traveling distance and idle time [36]. The majority of existing studies focus on railway and subway system, while scheduling problems in the tram system are quite limited in the literature. Nachtigall and Voget [37] developed a timetabling model for the railway system, which is to minimize the passenger waiting time at stations. Wong and Ho [38] presented the application of a dynamic programming approach, with the aid of an event-based model, to devise an optimal set of dwell times and run times for trains under given operational constraints over a regional level. Niu and Zhou [39] applied a timetable optimization approach for the urban rail system. The objective was to minimize passengers’ waiting time at stops and also reduce the waiting time passengers who were not able to board their desired service suffered because of congestions. Robenek et al. [40] highlighted the consideration of passenger satisfaction in the design of train timetables. Zhou et al. [41] developed an integrated optimization model on train control and timetable to minimize the net energy consumption. However, tram scheduling problems cannot be solved by these present models. The reason is that the operating environment of the tram is different from that of the railway and subway system. Train operation would not be influenced by other traffic along its rail track, while trams share intersections with other traffic and tram operations are inevitably affected at the intersection.Conditional active TSP and tram schedule adjustments still have their limitations when they are applied separately. Therefore by integrating conditional active TSP and tram schedule adjustment, fewer stops of tram at intersections than they are applied separately. Recently, Shi et al. [42] have explored at the planning level the benefits of coordinating tram movements and signal timings at controlled intersections. Its objective is to minimize the weighted sum of the total tram travel time and TSP’S negative impacts on other traffic. However, Shi et al. [42] applied unconditional TSP and give trams absolute priority, which means that the negative impacts on other traffic are not the minimum. The disturbances to other traffic can be reduced without sacrificing the total tram travel time if conditional TSP is applied. Moreover, Shi et al. [42] only considered tram operations and ignored the operations of auto vehicles, which cannot maximize the operational efficiency of the whole intersections.This paper aims to propose an integrated optimization model on conditional active TSP and tram schedule adjustments to minimize person delay of the whole system referring to all trams and non-priority vehicles along intersections. By applying conditional active TSP, minor impacts are imposed on other traffic compared to the unconditional one. Considering each person on trams and auto vehicles rather than only one transportation mode can contribute to the higher operational efficiency of the whole intersections. TSP disturbance is measured as auto vehicle delay caused by TSP activation, which is more adaptable to changes in signal timing and traffic volume.


## 3. Problem Description

With semi-exclusive ROW, trams will not be disturbed at any road section between successive intersections. They only stop at the station for passenger boarding and alighting or stop at intersection stop line to wait for a red signal. Therefore, stop lines at intersections and stations along the tramline are considered as the critical nodes (1… e) for TSP strategy and timetable optimization, as shown in Figure 2. This paper integrally optimizes TSP strategy at each intersection and tram schedule along the tramline to minimize average person delay. The conditional active TSP strategies at intersections, the signal offsets among different intersections, and tram schedule are the decision variables to be optimized in the discussed problem.Figure 2
Integrated optimization on signal priority and tram scheme.The proposed conditional active TSP strategies consist of three parts: (1) whether TSP measures are activated for the incoming tram, (2) which specific TSP measure is applied for the tram, and (3) how long the TSP measure will continue. These three parts are defined by three variables which areμsk, μskw and tskNjw. The first part is to estimate whether the arrival time of the tram is during green phase. If tram arrives at intersections during green phase, no TSP is activated. Otherwise, TSP is activated depending on the efficiency of the whole system. In other words, no TSP is activated even trams hit red phase at intersections if the activation causes too much delay to auto vehicles and results in lower efficiency of the whole system. The second part is to decide whether to implement green extension, phase insertion, or early green. The decision is made according to the arrival time of the tram at intersection. If the tram will arrive at intersection during the beginning of the red phase, green extension is applied. If the tram will arrive during the end of the red phase, early green is applied. If the tram will arrive at the middle of red phase, phase insertion is applied. In the third part, the duration of the specific TSP measure is specified based on the minimal person delay.The decision variables with respect to tram schedules could be denoted by tram arrival and departure time at each node denoted astmeA and tmeD. If a tram arrives at an intersection during a green phase or TSP measures are activated when a tram hits the red signal at intersections, the arrival time is equal to the departure time. As for tram 1 in Figure 2, its arrival time is equal to departure time at node 2 and nodee-1. If trams arrive at intersections during red phase with no TSP measure activation, trams depart from intersections at the beginning of the next green phase.The average person delay of the whole system involves both auto vehicle user delay and tram passenger delay. Auto vehicle delay is calculated based on a classical vehicle delay model proposed by the Australian Road Research Board (ARRB) [43]. The ARRB model is applicable to both under-saturated and over-saturated conditions [44]. Tram delay is defined as the difference between the actual travel time and the minimum travel time, which is the time that trams run at the highest speed and do not experience any red phase at intersections.In order to formulate the integrated optimization of signal priority and tram schedule, the following assumptions are made throughout this paper. Tram is the only public transit mode along the road. All intersections are equipped with TSP control devices. Similar to the metro timetable optimization in Niu et al. [39] and Yang et al. [45], only schedules for trams heading in one direction are considered. For tramlines, tram headway is rather long and there is little chance that two trams may meet at the same intersections. Thus trams in the other direction can be optimized in the same way.


## 4. Mathematical Model

### 4.1. Notations

See Tables1 and 2.Table 1
Decision variables.
tmeA Arrival time of tramm at node e tmeD Departure time of tramm from node e tikGS The original green start of lane groupj during phasen in cycle k at intersection i tikGE The original green end of lane groupj during phasen in cycle k at intersection i μikT 1, if a TSP measure is taken in cyclek at intersection i; 0, otherwise μikW 1, if green extension/phase insertion/early green is taken in cyclek at intersection i; 0, otherwise tikW Extra green time for a TSP action in cyclek at intersection i tikαE The end time of green extensionα in cycle k at intersection i tikβS The start time of phase insertionβ in cycle k at intersection i tikβE The end time of phase insertionβ in cycle k at intersection i tikγS The start time of early greenγ in cycle k at intersection iTable 2
Notations and parameters.
General notations e Index of nodes, including stations and intersections i Index of intersections s Index of stations m Index of trams w Index of TSP actions, where green extension, phase insertion and early green are denoted asα, β, γ respectively j Index of approach lane direction, where through, left-turning and right-turning are denoted asz, l,r, respectively.  Tram parameters  tmeA′ Arrival time of tramm at node e based on the minimal travel time schedule tmeD′ Departure time of tramm from node e based on the minimal travel time schedule ρe,e+1min Minimum running time for each tram from nodee to node e+1 ρe,e+1max Maximum running time for each tram from nodee to node e+1 θsmin Minimum dwell time for each tram at stations θsmax Maximum dwell time for each tram at station s ha Minimum headway between two consecutive trams arrivals at the same station hd Minimum headway between two consecutive trams departures at the same station had Minimum headway between a tram departure and another tram arrival at the same station σs,s+1m Load factor of tramm between two consecutive stations σ-i Average load factor of tramm along the tramline ξm Fixed passenger occupancy of tramm η Weight factor determining tradeoff of person delay between tram and auto vehicles  Signal parameters  k Index of signal cycle at intersectioni n Index of phase in cyclek for intersection i N The phase serving tram, which is also called critical phase τn=N 1, if phasen is the critical phase N; 0, otherwise τn=N-1 1, if phasen is the previous phase before critical phase N; 0, otherwise Cik′ The unadjusted cycle length in cyclek at intersection i giknj′ The unadjusted green duration of lane groupj during phasen in cycle k at intersection i λiknjW Green ratio of lane groupj during phasen in cycle k at intersection i δminW Minimum green duration for TSP actions δmaxW Maximum green duration for TSP actions φmin Minimum red time between two green phases in a signal cycle μik 1, if a TSP action is taken in cyclek at intersection i; 0, otherwise  Traffic parameters  Diknj Average vehicle delay of lane groupj during phasen in cycle k at intersection i D¯ik Average vehicle delay in cyclek at intersection i qiknj′ Original traffic volume of lane groupj during phasen in cycle k at intersection i ΔqiknjW Variation of traffic volume caused by applying TSP strategy xiknj Saturation of lane groupj during phasen in cycle k at intersection i Fiknj Saturation volume of lane groupj during phasen in cycle k at intersection i ciknj Capacity of lane groupj during phasen in cycle k at intersection i ωiknjmA 1, if tramm arrives at intersection i during phasen in cycle k; 0, otherwise Qik Auto traffic volume of intersectioni in cycle k ξa Passenger occupancy of an auto vehicle


### 4.2. Objective Function

To improve punctuality and reliability of trams, TSP strategies have been employed at intersections, which might lead to heavy delays to auto vehicles. To address this problem, tram schedules and TSP strategies are integrally optimized to balance the delay between trams and other vehicles. The proposed model aims to increase the efficiency of the whole system considering both tram passengers and auto vehicle users. Therefore, the weighted average delay of both auto vehicle users and tram passengers is chosen as the objective of the proposed model to be minimized, as shown in Eq. (1). In this study, a higher weight is assigned to tram passengers. The reason is that public transit should be granted more priorities to increase the attractiveness to passengers, thereby reducing traffic congestion.(1)min∑i,kξaQiD¯iknj+η·∑i,sξtσs,s+1mtmiA-tmiA′∑i,kξaQi+∑m,sξtσ-mThe weighted factorη decides the degree of priority assigned to tram passengers, which should be greater than one.


### 4.3. Auto Vehicle Delay

Auto vehicle delay model is the primary tool to analyze vehicle delay for signalized intersections. Four auto vehicle delay models are widely used to analyze vehicle delay for signalized intersections, including the Webster model, the ARRB model, the HCM1985 model, and the HCM2000 model. Yao et al. [46] analyze the applicability of four vehicle delay models for signalized intersections and design experimental environments on the basis of certain traffic demands and signal control. The results shown that, for isolated signalized intersections, the ARRB model displays the best performance in vehicle delay estimation. Thus the ARRB model is applied to calculate auto vehicle delay in this paper.The ARRB model is formulated from Eq. (2) to Eq. (4). Eq. (2) defines auto vehicle delay of a lane or a lane group. Eq. (3) specifies that flow ratio is calculated based on traffic volume and saturation flow. Eq. (4) describes the saturation calculation when average overflow queue is approximately zero.(2)Diknj=Ck1-λiknj221-yiknj+ciknjxiknjT4qiknjxiknj-1+xiknj-12+12xiknj-x0iknjciknjT,xiknj>x0iknjCik1-λiknj221-yiknj,xiknj≤x0iknj(3)yiknj=qiknjFiknj(4)x0iknj=0.67+Fiknjgiknj600Vehicle delay at one intersection can be calculated by the aggregated vehicle delay in each lane or lane group, as shown in Eq. (5).(5)D¯iknj=∑n,jDiknjqiknj∑n.jqiknjGreen ratio, capacity, and saturation are all calculated from green duration, cycle length, traffic volume, and saturation flow. Especially, the value of saturation flow only depends on intersection infrastructure, which means that the value of saturation flow in one specific lane is constant. Therefore, the ARRB model depends on three variables, which are green duration, cycle length, and traffic volume. Thus auto vehicle delay of an intersection is simplified as Eq. (6).(6)D-iknj=dargiknj,Cik,qiknjWith given green duration, cycle length, and traffic volume at different intersections, auto vehicle delay of each intersection can be calculated.Scenario 1: Green Extension Activation. Eq. (7) to Eq. (10) describe the change of green duration, cycle length, and traffic volume when the green extension is activated. Each lane groupj during phasen in cyclek at intersectioni is the calculation object in this paper. The phase served tram is considered as critical phase, which is denoted asN. Green extension strategy is applied only when the tram arrives at intersections during phaseN+1, which is the next phase after the critical phaseN. (7)τn=N=1,ifn=N0,otherwise(8)gsknj=gsknj′+τn=1tskNjα(9)Csk=Csk′+tskNjα(10)qsknj=qsknj′+τn=1ΔqskNjαEq. (7) identifies whether the current phase is in the critical phaseN or not.Eq. (8) describes the change of green duration when the green extension is activated. Once the green extension strategy is activated, green duration of the critical phaseN is extended by tskNjα and green duration of other phases is still the same.Eq. (9) describes the change of cycle length when the green extension is activated. Because the green duration of critical phaseN is increased by tskNjα and other phases keep the same, the cycle length of cyclek is increased by tskNjα as well.Eq. (10) describes the change of traffic volume when the green extension is activated. Green extension strategy leads to the green duration of phaseN increasing. Meanwhile, traffic volume increases by ΔqskNjα.Above all, auto vehicle delay of one intersection when the green extension is activated is simplified as Eq. (13).(11)D¯sknjα=dargsknj′+τn=1tskNjα,Csk′+tskNjα,qsknj′+τn=1ΔqskNjαScenario 2: Early Green Activation. Eq. (12) to Eq. (15) describe the change of green duration, cycle length, and traffic volume when the early green strategy is activated. Early green strategy is applied only when the tram arrives at intersections during phaseN-1, which is the last phase before the critical phaseN.(12)τn=N-1=1,ifn=N-10,otherwise(13)gsknj=gsknj′+τn=N-τn=N-1tskNjγ(14)Csk=Csk′(15)qsknj=qsknj′+τn=N-τn=N-1Δqsknj′Eq. (12) identifies whether the current phase is in the phaseN-1 or not.Eq. (13) describes the change of green duration when the early green strategy is activated. Early green is also called red truncation, which means the red phase is reduced. Once the early green strategy is activated, the green duration of phaseN-1 is shortened by tskNjγ and green duration of other phases is still the same.Eq. (14) describes that cycle length does not change when the early green strategy is activated. The extra green duration for phase N is at the cost of reducing the green duration of phase N-1. Thus the cycle length is the same as the original one.Eq. (15) describes the change of traffic volume when the green extension is activated. The green duration of phase N-1 is shortened by tskNjγ and traffic volume is reduced by Δqsk,N-1,jγ. In terms of the residual phases, traffic volume is kept the same.Above all, auto vehicle delay of one intersection when the early green is activated is simplified as Eq. (16).(16)D¯sknjγ=dargsknj′+τn=N-τn=N-1tskNjγ,Csk′,qsknj′+τn=N-τn=N-1ΔqsknjγScenario 3: Phase Insertion Activation. Eq. (17) to Eq. (25) describe the change of green duration, cycle length, and traffic volume when the phase insertion strategy is activated. Once phase insertion is active, an extra phase in granted for trams denoted as N1. The extra phase N1 is inserted to another phase nT according to tram arrival time at intersections. Phase nT is interrupted and thus divided into two phases n1 and n2. The residual phases do not get any influence which are denoted as n0.(17)τn=n0=1,ifn=n00,otherwise(18)τn=N1=1,ifn=N10,otherwise(19)τn=n1=1,ifn=n10,otherwise(20)τn=n2=1,ifn=n20,otherwise(21)gsknj=τn=n0gskn0j′+τn=N1tskNjβ+τn=n1tsknjGE-tskNjβS+τn=n2tsknjGE-tskNjβS(22)Csk=Csk′+tskNjβ(23)qsknj=τn=n0qskn0j′+τn=N1ΔqskN1jβ+τn=n1qskn1jβ+τn=n2qskn2jβ(24)qskn1jβ+qskn2jβ<qsknj′Eq. (17) - (19) identify the category of the current phase.Eq. (20) describes the change of green duration when the phase insertion strategy is activated. For unaffected phases, the green duration is the same as the original ones. For the extra phase N1, the starting time and the end time are denoted as tskNjβS and tskNjβE. Obviously tskNjβ=tskNjβE-tskNjβS is the green duration of the extra phase N1. For the two divided phases, the total green duration of the two phases is still the same.Eq. (21) describes the change of cycle length when the phase insertion strategy is activated. The cycle length is increased by the green duration of the extra phase N1, which is tskNjβ.Eq. (22) describes the change of traffic volume when green extension is activated. For unaffected phases, the traffic volume is the same as the original one. For extra phase N1, the traffic volume is based on the green duration of phase N1. The traffic volume during phase N1 is denoted as ΔqskN1jβ. For the two divided phases n1 and n2, traffic volume is not the same as before.As described in Eq. (24), the sum of traffic volume during phases n1 and n2 is smaller than the traffic volume during the former intact phase nT. Because the continuous traffic flow is disrupted by the inserted phase, traffic flow is shortened.Above all, auto vehicle delay of one intersection when the phase insertion strategy is activated is simplified as Eq. (25).(25)D¯sknjβ=dargsknj,Csk,qsknj


### 4.4. Constraints

#### 4.4.1. Signal Constraints

Signal constraints deal with signal variables to address the TSP strategy and the signal timing of each intersection.(1) Constraint of Green Extension. Once the green extension action is activated in cyclek at intersections, the extended green time is between δminα and δmaxα.(26)μikαδminα≤tikNjα≤μikαδmaxαGreen extension action is applied only when trams arrive during phaseN+1.(27)μikNjα=μikNj·ωik,N+1,jmA(2) Constraint of Phase Insertion. Once the phase insertion action is applied in cyclek at intersections, the green duration of the insertion phase is between δminβ and δmaxβ.(28)μikβδminβ≤tikNjβ≤μikβδmaxβ(3) Constraint of Early Green. Once early green action is activated in cyclek at intersections, the advanced green time is between δminγ and δmaxγ.(29)μikγδminγ≤tikNjγ≤μikγδmaxγEarly green action is applied only when trams arrive during phaseN-1.(30)μikNjγ=μikNj·ωik,N-1,jmA(4) The Minimum Time Gap between Two Green Phases. The starting time of the inserted phase β is at least φmin later than the ending of the previous green phase.(31)tikNjβS-tikNjGE≥φminThe end time of the inserted phaseβ is at least φmin earlier than the start of the next green phase.(32)tikNjβE-tik+1,NjGS≥φmin(5) Activate a TSP Action One Time in a Cycle. The following relation holds in practice, which means no more than one TSP action can be applied in one signal cycle at an intersection.(33)∑wμikw≤1


#### 4.4.2. Tram Schedule Constraints

Tram schedule constraints deal with tram variables to address the arrival and departure time of tram at each station.(1) Dwell Time. A feasible range for dwell time is enforced as follows:(34)θsmin≤tmsD-tmsA≤θsmax(2) Link Travel Time. The travel time between two nodes is also adjustable:(35)ρe,e+1max≤tm,e+1A-tmeD≤ρe,e+1min(3) Headway. The minimum headway between arrivals of tramsm andm+1 at stations is described as follows.(36)tm+1,sA-tmsA≥haThe minimum headway between departures of tramsm andm+1 at stations is described as follows.(37)tm+1,sD-tmsD≥hdThe minimum headway between the departure of tramsm and the arrival of tramm+1is described as follows.(38)tm+1,eA-tmeD≥had


## 4.1. Notations

See Tables1 and 2.Table 1
Decision variables.
tmeA Arrival time of tramm at node e tmeD Departure time of tramm from node e tikGS The original green start of lane groupj during phasen in cycle k at intersection i tikGE The original green end of lane groupj during phasen in cycle k at intersection i μikT 1, if a TSP measure is taken in cyclek at intersection i; 0, otherwise μikW 1, if green extension/phase insertion/early green is taken in cyclek at intersection i; 0, otherwise tikW Extra green time for a TSP action in cyclek at intersection i tikαE The end time of green extensionα in cycle k at intersection i tikβS The start time of phase insertionβ in cycle k at intersection i tikβE The end time of phase insertionβ in cycle k at intersection i tikγS The start time of early greenγ in cycle k at intersection iTable 2
Notations and parameters.
General notations e Index of nodes, including stations and intersections i Index of intersections s Index of stations m Index of trams w Index of TSP actions, where green extension, phase insertion and early green are denoted asα, β, γ respectively j Index of approach lane direction, where through, left-turning and right-turning are denoted asz, l,r, respectively.  Tram parameters  tmeA′ Arrival time of tramm at node e based on the minimal travel time schedule tmeD′ Departure time of tramm from node e based on the minimal travel time schedule ρe,e+1min Minimum running time for each tram from nodee to node e+1 ρe,e+1max Maximum running time for each tram from nodee to node e+1 θsmin Minimum dwell time for each tram at stations θsmax Maximum dwell time for each tram at station s ha Minimum headway between two consecutive trams arrivals at the same station hd Minimum headway between two consecutive trams departures at the same station had Minimum headway between a tram departure and another tram arrival at the same station σs,s+1m Load factor of tramm between two consecutive stations σ-i Average load factor of tramm along the tramline ξm Fixed passenger occupancy of tramm η Weight factor determining tradeoff of person delay between tram and auto vehicles  Signal parameters  k Index of signal cycle at intersectioni n Index of phase in cyclek for intersection i N The phase serving tram, which is also called critical phase τn=N 1, if phasen is the critical phase N; 0, otherwise τn=N-1 1, if phasen is the previous phase before critical phase N; 0, otherwise Cik′ The unadjusted cycle length in cyclek at intersection i giknj′ The unadjusted green duration of lane groupj during phasen in cycle k at intersection i λiknjW Green ratio of lane groupj during phasen in cycle k at intersection i δminW Minimum green duration for TSP actions δmaxW Maximum green duration for TSP actions φmin Minimum red time between two green phases in a signal cycle μik 1, if a TSP action is taken in cyclek at intersection i; 0, otherwise  Traffic parameters  Diknj Average vehicle delay of lane groupj during phasen in cycle k at intersection i D¯ik Average vehicle delay in cyclek at intersection i qiknj′ Original traffic volume of lane groupj during phasen in cycle k at intersection i ΔqiknjW Variation of traffic volume caused by applying TSP strategy xiknj Saturation of lane groupj during phasen in cycle k at intersection i Fiknj Saturation volume of lane groupj during phasen in cycle k at intersection i ciknj Capacity of lane groupj during phasen in cycle k at intersection i ωiknjmA 1, if tramm arrives at intersection i during phasen in cycle k; 0, otherwise Qik Auto traffic volume of intersectioni in cycle k ξa Passenger occupancy of an auto vehicle


## 4.2. Objective Function

To improve punctuality and reliability of trams, TSP strategies have been employed at intersections, which might lead to heavy delays to auto vehicles. To address this problem, tram schedules and TSP strategies are integrally optimized to balance the delay between trams and other vehicles. The proposed model aims to increase the efficiency of the whole system considering both tram passengers and auto vehicle users. Therefore, the weighted average delay of both auto vehicle users and tram passengers is chosen as the objective of the proposed model to be minimized, as shown in Eq. (1). In this study, a higher weight is assigned to tram passengers. The reason is that public transit should be granted more priorities to increase the attractiveness to passengers, thereby reducing traffic congestion.(1)min∑i,kξaQiD¯iknj+η·∑i,sξtσs,s+1mtmiA-tmiA′∑i,kξaQi+∑m,sξtσ-mThe weighted factorη decides the degree of priority assigned to tram passengers, which should be greater than one.


## 4.3. Auto Vehicle Delay

Auto vehicle delay model is the primary tool to analyze vehicle delay for signalized intersections. Four auto vehicle delay models are widely used to analyze vehicle delay for signalized intersections, including the Webster model, the ARRB model, the HCM1985 model, and the HCM2000 model. Yao et al. [46] analyze the applicability of four vehicle delay models for signalized intersections and design experimental environments on the basis of certain traffic demands and signal control. The results shown that, for isolated signalized intersections, the ARRB model displays the best performance in vehicle delay estimation. Thus the ARRB model is applied to calculate auto vehicle delay in this paper.The ARRB model is formulated from Eq. (2) to Eq. (4). Eq. (2) defines auto vehicle delay of a lane or a lane group. Eq. (3) specifies that flow ratio is calculated based on traffic volume and saturation flow. Eq. (4) describes the saturation calculation when average overflow queue is approximately zero.(2)Diknj=Ck1-λiknj221-yiknj+ciknjxiknjT4qiknjxiknj-1+xiknj-12+12xiknj-x0iknjciknjT,xiknj>x0iknjCik1-λiknj221-yiknj,xiknj≤x0iknj(3)yiknj=qiknjFiknj(4)x0iknj=0.67+Fiknjgiknj600Vehicle delay at one intersection can be calculated by the aggregated vehicle delay in each lane or lane group, as shown in Eq. (5).(5)D¯iknj=∑n,jDiknjqiknj∑n.jqiknjGreen ratio, capacity, and saturation are all calculated from green duration, cycle length, traffic volume, and saturation flow. Especially, the value of saturation flow only depends on intersection infrastructure, which means that the value of saturation flow in one specific lane is constant. Therefore, the ARRB model depends on three variables, which are green duration, cycle length, and traffic volume. Thus auto vehicle delay of an intersection is simplified as Eq. (6).(6)D-iknj=dargiknj,Cik,qiknjWith given green duration, cycle length, and traffic volume at different intersections, auto vehicle delay of each intersection can be calculated.Scenario 1: Green Extension Activation. Eq. (7) to Eq. (10) describe the change of green duration, cycle length, and traffic volume when the green extension is activated. Each lane groupj during phasen in cyclek at intersectioni is the calculation object in this paper. The phase served tram is considered as critical phase, which is denoted asN. Green extension strategy is applied only when the tram arrives at intersections during phaseN+1, which is the next phase after the critical phaseN. (7)τn=N=1,ifn=N0,otherwise(8)gsknj=gsknj′+τn=1tskNjα(9)Csk=Csk′+tskNjα(10)qsknj=qsknj′+τn=1ΔqskNjαEq. (7) identifies whether the current phase is in the critical phaseN or not.Eq. (8) describes the change of green duration when the green extension is activated. Once the green extension strategy is activated, green duration of the critical phaseN is extended by tskNjα and green duration of other phases is still the same.Eq. (9) describes the change of cycle length when the green extension is activated. Because the green duration of critical phaseN is increased by tskNjα and other phases keep the same, the cycle length of cyclek is increased by tskNjα as well.Eq. (10) describes the change of traffic volume when the green extension is activated. Green extension strategy leads to the green duration of phaseN increasing. Meanwhile, traffic volume increases by ΔqskNjα.Above all, auto vehicle delay of one intersection when the green extension is activated is simplified as Eq. (13).(11)D¯sknjα=dargsknj′+τn=1tskNjα,Csk′+tskNjα,qsknj′+τn=1ΔqskNjαScenario 2: Early Green Activation. Eq. (12) to Eq. (15) describe the change of green duration, cycle length, and traffic volume when the early green strategy is activated. Early green strategy is applied only when the tram arrives at intersections during phaseN-1, which is the last phase before the critical phaseN.(12)τn=N-1=1,ifn=N-10,otherwise(13)gsknj=gsknj′+τn=N-τn=N-1tskNjγ(14)Csk=Csk′(15)qsknj=qsknj′+τn=N-τn=N-1Δqsknj′Eq. (12) identifies whether the current phase is in the phaseN-1 or not.Eq. (13) describes the change of green duration when the early green strategy is activated. Early green is also called red truncation, which means the red phase is reduced. Once the early green strategy is activated, the green duration of phaseN-1 is shortened by tskNjγ and green duration of other phases is still the same.Eq. (14) describes that cycle length does not change when the early green strategy is activated. The extra green duration for phase N is at the cost of reducing the green duration of phase N-1. Thus the cycle length is the same as the original one.Eq. (15) describes the change of traffic volume when the green extension is activated. The green duration of phase N-1 is shortened by tskNjγ and traffic volume is reduced by Δqsk,N-1,jγ. In terms of the residual phases, traffic volume is kept the same.Above all, auto vehicle delay of one intersection when the early green is activated is simplified as Eq. (16).(16)D¯sknjγ=dargsknj′+τn=N-τn=N-1tskNjγ,Csk′,qsknj′+τn=N-τn=N-1ΔqsknjγScenario 3: Phase Insertion Activation. Eq. (17) to Eq. (25) describe the change of green duration, cycle length, and traffic volume when the phase insertion strategy is activated. Once phase insertion is active, an extra phase in granted for trams denoted as N1. The extra phase N1 is inserted to another phase nT according to tram arrival time at intersections. Phase nT is interrupted and thus divided into two phases n1 and n2. The residual phases do not get any influence which are denoted as n0.(17)τn=n0=1,ifn=n00,otherwise(18)τn=N1=1,ifn=N10,otherwise(19)τn=n1=1,ifn=n10,otherwise(20)τn=n2=1,ifn=n20,otherwise(21)gsknj=τn=n0gskn0j′+τn=N1tskNjβ+τn=n1tsknjGE-tskNjβS+τn=n2tsknjGE-tskNjβS(22)Csk=Csk′+tskNjβ(23)qsknj=τn=n0qskn0j′+τn=N1ΔqskN1jβ+τn=n1qskn1jβ+τn=n2qskn2jβ(24)qskn1jβ+qskn2jβ<qsknj′Eq. (17) - (19) identify the category of the current phase.Eq. (20) describes the change of green duration when the phase insertion strategy is activated. For unaffected phases, the green duration is the same as the original ones. For the extra phase N1, the starting time and the end time are denoted as tskNjβS and tskNjβE. Obviously tskNjβ=tskNjβE-tskNjβS is the green duration of the extra phase N1. For the two divided phases, the total green duration of the two phases is still the same.Eq. (21) describes the change of cycle length when the phase insertion strategy is activated. The cycle length is increased by the green duration of the extra phase N1, which is tskNjβ.Eq. (22) describes the change of traffic volume when green extension is activated. For unaffected phases, the traffic volume is the same as the original one. For extra phase N1, the traffic volume is based on the green duration of phase N1. The traffic volume during phase N1 is denoted as ΔqskN1jβ. For the two divided phases n1 and n2, traffic volume is not the same as before.As described in Eq. (24), the sum of traffic volume during phases n1 and n2 is smaller than the traffic volume during the former intact phase nT. Because the continuous traffic flow is disrupted by the inserted phase, traffic flow is shortened.Above all, auto vehicle delay of one intersection when the phase insertion strategy is activated is simplified as Eq. (25).(25)D¯sknjβ=dargsknj,Csk,qsknj


## 4.4. Constraints

### 4.4.1. Signal Constraints

Signal constraints deal with signal variables to address the TSP strategy and the signal timing of each intersection.(1) Constraint of Green Extension. Once the green extension action is activated in cyclek at intersections, the extended green time is between δminα and δmaxα.(26)μikαδminα≤tikNjα≤μikαδmaxαGreen extension action is applied only when trams arrive during phaseN+1.(27)μikNjα=μikNj·ωik,N+1,jmA(2) Constraint of Phase Insertion. Once the phase insertion action is applied in cyclek at intersections, the green duration of the insertion phase is between δminβ and δmaxβ.(28)μikβδminβ≤tikNjβ≤μikβδmaxβ(3) Constraint of Early Green. Once early green action is activated in cyclek at intersections, the advanced green time is between δminγ and δmaxγ.(29)μikγδminγ≤tikNjγ≤μikγδmaxγEarly green action is applied only when trams arrive during phaseN-1.(30)μikNjγ=μikNj·ωik,N-1,jmA(4) The Minimum Time Gap between Two Green Phases. The starting time of the inserted phase β is at least φmin later than the ending of the previous green phase.(31)tikNjβS-tikNjGE≥φminThe end time of the inserted phaseβ is at least φmin earlier than the start of the next green phase.(32)tikNjβE-tik+1,NjGS≥φmin(5) Activate a TSP Action One Time in a Cycle. The following relation holds in practice, which means no more than one TSP action can be applied in one signal cycle at an intersection.(33)∑wμikw≤1


### 4.4.2. Tram Schedule Constraints

Tram schedule constraints deal with tram variables to address the arrival and departure time of tram at each station.(1) Dwell Time. A feasible range for dwell time is enforced as follows:(34)θsmin≤tmsD-tmsA≤θsmax(2) Link Travel Time. The travel time between two nodes is also adjustable:(35)ρe,e+1max≤tm,e+1A-tmeD≤ρe,e+1min(3) Headway. The minimum headway between arrivals of tramsm andm+1 at stations is described as follows.(36)tm+1,sA-tmsA≥haThe minimum headway between departures of tramsm andm+1 at stations is described as follows.(37)tm+1,sD-tmsD≥hdThe minimum headway between the departure of tramsm and the arrival of tramm+1is described as follows.(38)tm+1,eA-tmeD≥had


## 4.4.1. Signal Constraints

Signal constraints deal with signal variables to address the TSP strategy and the signal timing of each intersection.(1) Constraint of Green Extension. Once the green extension action is activated in cyclek at intersections, the extended green time is between δminα and δmaxα.(26)μikαδminα≤tikNjα≤μikαδmaxαGreen extension action is applied only when trams arrive during phaseN+1.(27)μikNjα=μikNj·ωik,N+1,jmA(2) Constraint of Phase Insertion. Once the phase insertion action is applied in cyclek at intersections, the green duration of the insertion phase is between δminβ and δmaxβ.(28)μikβδminβ≤tikNjβ≤μikβδmaxβ(3) Constraint of Early Green. Once early green action is activated in cyclek at intersections, the advanced green time is between δminγ and δmaxγ.(29)μikγδminγ≤tikNjγ≤μikγδmaxγEarly green action is applied only when trams arrive during phaseN-1.(30)μikNjγ=μikNj·ωik,N-1,jmA(4) The Minimum Time Gap between Two Green Phases. The starting time of the inserted phase β is at least φmin later than the ending of the previous green phase.(31)tikNjβS-tikNjGE≥φminThe end time of the inserted phaseβ is at least φmin earlier than the start of the next green phase.(32)tikNjβE-tik+1,NjGS≥φmin(5) Activate a TSP Action One Time in a Cycle. The following relation holds in practice, which means no more than one TSP action can be applied in one signal cycle at an intersection.(33)∑wμikw≤1


## 4.4.2. Tram Schedule Constraints

Tram schedule constraints deal with tram variables to address the arrival and departure time of tram at each station.(1) Dwell Time. A feasible range for dwell time is enforced as follows:(34)θsmin≤tmsD-tmsA≤θsmax(2) Link Travel Time. The travel time between two nodes is also adjustable:(35)ρe,e+1max≤tm,e+1A-tmeD≤ρe,e+1min(3) Headway. The minimum headway between arrivals of tramsm andm+1 at stations is described as follows.(36)tm+1,sA-tmsA≥haThe minimum headway between departures of tramsm andm+1 at stations is described as follows.(37)tm+1,sD-tmsD≥hdThe minimum headway between the departure of tramsm and the arrival of tramm+1is described as follows.(38)tm+1,eA-tmeD≥had


## 5. Methodology

### 5.1. Complexity of Formulation

According to the optimization model formulated in Section4, all the variables can be classified into two types. The first type refers to continuous decision variables including arrival time and departure time of trams, the duration of TSP strategies, and the signal offsets among different intersections. The second type is binary decision variables including whether or not TSP measures are activated for the incoming tram and which specific TSP measure is applied for the tram. It is obvious that the formulated model in Section 4 is a non-linear programming model. The numbers of variables and critical constraints of the problem are given in Table 3.Table 3
Numbers of variables and constraints in the model.
Type Name Theoretical dimension Continuous variable t m e A, tmeD M ⋅ E t i k W W ⋅ I ⋅ K t i k G S, tikGE I ⋅ K t i k α E, tikβS, tikβE, tikγS I ⋅ K Binary variable μ i k T, μikW W ⋅ I ⋅ K Constraints Constraint (26)-(33) I ⋅ K Constraint (34) M ⋅ S Constraint (35) M ⋅ E - 1 Constraint (36)-(38) M - 1 ⋅ EThe complexity of the formulated model is mainly affected by the number of trams |M|, the number of intersections |I|, and the number of stations |S|. According to Table 3, the quantity of model variables is 89 when one tram passes by one intersection and one station. However, the total number of variables becomes 892 when another intersection and another station are taken into account. As the quantity of variables exponentially increases with the scale of tramlines, enumeration solution might be unable to find the optimal solution within limited computing time. Therefore, GA is adopted to solve the proposed model for its high efficiency, because the formulated problem turns out to be a large scale problem in practice.


### 5.2. The Solution Method

As stated above, the formulated problem turns out to be a large scale problem that the enumeration solution cannot address it effectively [47]. Therefore an intelligent search algorithm, Genetic Algorithm (GA), is applied to solve the model. The GA is a powerful multi-objective evolutionary algorithm which is competent to quickly find satisfied solutions of large scale problems. Figure 3 gives the flowchart of employing the GA to solve the formulated model.Figure 3
Flowchart of GA algorithm.The pseudocode of the GA is presented in Algorithm1. The inputs include the number of nodes, the distance between each node and constraints. The output is the solution to the proposed problem, which consists of arrival and departure time of trams, unadjusted signal timing, and TSP strategies. The first step of the proposed GA is chromosome encoding, as shown in Figure 4. Real-number encoding is used to represent the chromosomes. The second step is to initialize populations. Random initialization within a certain range has been applied, where each chromosome is initialized based on the constraints of the proposed model to make sure it is a feasible solution. Thirdly, taking person delay as an objective, the delay of each chromosome will be calculated. Then the chromosome with the minimal person delay is selected into the new population directly, which is called the elite-preservation strategy. After that, the remaining chromosomes are input to the process of crossover and mutation. Each individual is checked again whether they are satisfied with constraints after crossover and mutation. The individual with the minimal average person delay is the last generation and is the attained solution of the proposed model. The evolution of GA populations stops when the pre-determined maximum generation is reached.Algorithm 1:A Genetic Algorithm to solve the proposed model.
(1)  Input:Tramline Distance (TD) (2)  Quantity of Trams, Intersections and Stations (QM, QI, QS) (3)  Quantity of Tram Passengers and Auto Vehicle Users (QTP, QAV) (4)  Constraints (C) (5)  Output: Tram Arrival Time (AT) (6)  Tram Departure Time (DT) (7)  Unadjusted Signal Timings (ST) (8)  TSP strategies (TSP) (3)  initialPopulation←Initialization (TD, QM, QI, QS, QTP, QAV, C) (4)  newPopulation←∅ (5)  repeat (6)  for each individual∈initialPopulationdo (7)   iffitnessCalculation (individual)=minimum person delay; (8)     newPopulation←newPopulation∪individual; (9)    else (10)     currentPopulation←initialPopulation; (11)    end (12)   end (13)   selectedCouples←selection (currentPopulation); (15)   crossedCouples←crossover (selectedCouples); (17)   offspring←mutation (crossedCouples) (18)   newPopulation←newPopulation∪offspring; (19) untiltermination criterionFigure 4
Chromosome encoding.


#### 5.2.1. Chromosome Encoding and Initialization

At the beginning stage of GA, an initial parent population is generated based on the practical timetable configurations. Real number coding method is adopted to represent the chromosomes of individuals. The tramline coversI intersections and S stations, which involves E critical nodes. There are M trams scheduled in the given time K. Each chromosome can be mainly divided into two parts: tram schedule and signal timing, as shown in Figure 4. The length of each gene part is equal to the quantity of its corresponding variables.


#### 5.2.2. Selection, Crossover, and Mutation

Selection, crossover, and mutation are the main genetic operators to generate offspring. In this study, the solutions in the parent population are selected by spinning the roulette wheel to produce offspring. The crossover operator employed in this study only occurs amongst the same group of genes as illustrated by the Figure5. The mutation operator modifies the value of a randomly designated gene in a chromosome with a predetermined probability.Figure 5
Crossover.


## 5.1. Complexity of Formulation

According to the optimization model formulated in Section4, all the variables can be classified into two types. The first type refers to continuous decision variables including arrival time and departure time of trams, the duration of TSP strategies, and the signal offsets among different intersections. The second type is binary decision variables including whether or not TSP measures are activated for the incoming tram and which specific TSP measure is applied for the tram. It is obvious that the formulated model in Section 4 is a non-linear programming model. The numbers of variables and critical constraints of the problem are given in Table 3.Table 3
Numbers of variables and constraints in the model.
Type Name Theoretical dimension Continuous variable t m e A, tmeD M ⋅ E t i k W W ⋅ I ⋅ K t i k G S, tikGE I ⋅ K t i k α E, tikβS, tikβE, tikγS I ⋅ K Binary variable μ i k T, μikW W ⋅ I ⋅ K Constraints Constraint (26)-(33) I ⋅ K Constraint (34) M ⋅ S Constraint (35) M ⋅ E - 1 Constraint (36)-(38) M - 1 ⋅ EThe complexity of the formulated model is mainly affected by the number of trams |M|, the number of intersections |I|, and the number of stations |S|. According to Table 3, the quantity of model variables is 89 when one tram passes by one intersection and one station. However, the total number of variables becomes 892 when another intersection and another station are taken into account. As the quantity of variables exponentially increases with the scale of tramlines, enumeration solution might be unable to find the optimal solution within limited computing time. Therefore, GA is adopted to solve the proposed model for its high efficiency, because the formulated problem turns out to be a large scale problem in practice.


## 5.2. The Solution Method

As stated above, the formulated problem turns out to be a large scale problem that the enumeration solution cannot address it effectively [47]. Therefore an intelligent search algorithm, Genetic Algorithm (GA), is applied to solve the model. The GA is a powerful multi-objective evolutionary algorithm which is competent to quickly find satisfied solutions of large scale problems. Figure 3 gives the flowchart of employing the GA to solve the formulated model.Figure 3
Flowchart of GA algorithm.The pseudocode of the GA is presented in Algorithm1. The inputs include the number of nodes, the distance between each node and constraints. The output is the solution to the proposed problem, which consists of arrival and departure time of trams, unadjusted signal timing, and TSP strategies. The first step of the proposed GA is chromosome encoding, as shown in Figure 4. Real-number encoding is used to represent the chromosomes. The second step is to initialize populations. Random initialization within a certain range has been applied, where each chromosome is initialized based on the constraints of the proposed model to make sure it is a feasible solution. Thirdly, taking person delay as an objective, the delay of each chromosome will be calculated. Then the chromosome with the minimal person delay is selected into the new population directly, which is called the elite-preservation strategy. After that, the remaining chromosomes are input to the process of crossover and mutation. Each individual is checked again whether they are satisfied with constraints after crossover and mutation. The individual with the minimal average person delay is the last generation and is the attained solution of the proposed model. The evolution of GA populations stops when the pre-determined maximum generation is reached.Algorithm 1:A Genetic Algorithm to solve the proposed model.
(1)  Input:Tramline Distance (TD) (2)  Quantity of Trams, Intersections and Stations (QM, QI, QS) (3)  Quantity of Tram Passengers and Auto Vehicle Users (QTP, QAV) (4)  Constraints (C) (5)  Output: Tram Arrival Time (AT) (6)  Tram Departure Time (DT) (7)  Unadjusted Signal Timings (ST) (8)  TSP strategies (TSP) (3)  initialPopulation←Initialization (TD, QM, QI, QS, QTP, QAV, C) (4)  newPopulation←∅ (5)  repeat (6)  for each individual∈initialPopulationdo (7)   iffitnessCalculation (individual)=minimum person delay; (8)     newPopulation←newPopulation∪individual; (9)    else (10)     currentPopulation←initialPopulation; (11)    end (12)   end (13)   selectedCouples←selection (currentPopulation); (15)   crossedCouples←crossover (selectedCouples); (17)   offspring←mutation (crossedCouples) (18)   newPopulation←newPopulation∪offspring; (19) untiltermination criterionFigure 4
Chromosome encoding.


### 5.2.1. Chromosome Encoding and Initialization

At the beginning stage of GA, an initial parent population is generated based on the practical timetable configurations. Real number coding method is adopted to represent the chromosomes of individuals. The tramline coversI intersections and S stations, which involves E critical nodes. There are M trams scheduled in the given time K. Each chromosome can be mainly divided into two parts: tram schedule and signal timing, as shown in Figure 4. The length of each gene part is equal to the quantity of its corresponding variables.


### 5.2.2. Selection, Crossover, and Mutation

Selection, crossover, and mutation are the main genetic operators to generate offspring. In this study, the solutions in the parent population are selected by spinning the roulette wheel to produce offspring. The crossover operator employed in this study only occurs amongst the same group of genes as illustrated by the Figure5. The mutation operator modifies the value of a randomly designated gene in a chromosome with a predetermined probability.Figure 5
Crossover.


## 5.2.1. Chromosome Encoding and Initialization

At the beginning stage of GA, an initial parent population is generated based on the practical timetable configurations. Real number coding method is adopted to represent the chromosomes of individuals. The tramline coversI intersections and S stations, which involves E critical nodes. There are M trams scheduled in the given time K. Each chromosome can be mainly divided into two parts: tram schedule and signal timing, as shown in Figure 4. The length of each gene part is equal to the quantity of its corresponding variables.


## 5.2.2. Selection, Crossover, and Mutation

Selection, crossover, and mutation are the main genetic operators to generate offspring. In this study, the solutions in the parent population are selected by spinning the roulette wheel to produce offspring. The crossover operator employed in this study only occurs amongst the same group of genes as illustrated by the Figure5. The mutation operator modifies the value of a randomly designated gene in a chromosome with a predetermined probability.Figure 5
Crossover.


## 6. Case Study

### 6.1. Numerical Case

Four trams running on a tramline covering two stations and two intersections, as shown in Figure6, are employed here to demonstrate the performance of the proposed approach. Traffic volume, signal timings, lane direction, and the number of the lanes of the two intersections are specified in Table 4.Table 4
Traffic volume and signal timings.
Intersection Traffic flow(Number of Lane) Split(Cycle 180 sec) Intersection Traffic flow(Number of Lane) Split(Cycle 180 sec) Left Through Right Left Through Left Through Right Left Through S1 South 152(1) 1020(2) 88(1) 25 90 S2 South 148(1) 1084(2) 96(1) 22 90 North 147(1) 1016(2) 44(1) 25 90 North 153(1) 1096(2) 2(1) 22 90 East 144(1) 512(2) 372(2) 23 42 East 148(1) 527(2) 212(2) 23 45 West 142(1) 492(2) 16(1) 23 42 West 146(1) 518(2) 16(1) 23 45Figure 6
The layout of the tramline in the numerical case.


#### 6.1.1. Performance Comparison with and without Integration

Figure7 shows the schedules of four trams during one hour in detail. When the second tram arrives at intersectionI, green extension strategy is triggered to grant the tram with green signal. Shown by the third and fourth trams, trams can arrive at the intersection during green signal, by increasing the travel time between the stations and the intersections. Thus it reduces the possibility of triggering TSP strategy, which causes delay to auto vehicles.Figure 7
Tram schedule of four trams.In order to further demonstrate the performance of the integrated model, the computational results with and without the integration of conditional active TSP and tram schedule are compared. In detail, without integration can be divided into only optimizing tram schedule and only applying TSP strategy which is subdivided into unconditional TSP and conditional TSP.Compared with the integrated model, as shown in Table5, only optimizing tram schedule leads to higher tram passenger delay and person delay. Auto vehicle user delay is reduced because no TSP is activated. The reduction of auto vehicle user delay is at the cost of increasing tram passenger delay. Due to travel time limits between each link, only adjusting tram schedule is not able to reduce delay for tram passengers and each person of the whole system.Table 5
Performance comparison with and without the integration of the numerical case.
Delay/s (Variation rate/%) Schedule only TSP only Integrated model unconditional conditional Tram passenger 60.9 (+95.34%) 0 39.2(+25.58%) 31.2 Auto vehicle user 39.1 (-8.45%) 89.2 (+108.45%) 48.2 (+12.68%) 42.8 Average person 40.7 (+6.25%) 61.1 (+59.38%) 43.7 (+14.06%) 38.3 Weighted average person 45.3 (+28.57%) 59.7 (+69.64%) 39.0 (+10.71%) 35.2When unconditional TSP is applied, tram passenger delay is zero. Although tram passengers do not suffer from any delay, auto vehicle user delay is extremely high, which due to unconditional TSP does not take into account the operation of auto vehicles. When the number of auto vehicles is larger than that of tram passenger at intersection, higher auto vehicle user delay will lead to higher person delay of the whole system.When only conditional TSP is applied, in order to trade off auto vehicle user and tram passengers, trams are not always granted priority to pass intersections without stops. As a result, tram passenger delay increases. The integrated model can further reduce auto vehicle user delay than conditional TSP because tram can be scheduled to arrive at intersections during green signals. Thus no TSP is required to activate and no delay is imposed to auto vehicle. Compared with unconditional TSP, conditional TSP can greatly reduce person delay of the whole system, although it increases tram passenger delay. Thus, conditional active priority is more suitable for system optimization.


#### 6.1.2. Comparison between the Enumeration Solution and GA Solution

In this paper, genetic algorithm (GA) is adopted to solve the problem. Since GA is an intelligent search algorithm, the global optimal solution cannot be achieved. In order to testify the accuracy of the proposed GA, compared the proposed GA with enumeration solution. The pseudocode of the enumeration procedure is presented in Algorithm2.Algorithm 2:The enumeration procedure for the numerical case.
(1)  Input:Quantity of trams (m) (2)      Nodes / Intersection / Station (N / I / S) (3)      Arrival / Departure time constraints (AT / DT constraint) (4)      Dwell / Link travel time constraints (DT / LT constraint) (5)      Signal timing constraint (ST constraint) (6)      TSP strategy constraint (TSP constraint) (7)   Output: Solutions; The best solution (8)   repeat (9)     for each intersectiondo (10)    Unadjusted signal timing← Initialization (ST constraint) (11)   end (12)   for each unadjusted signal timingdo (13)    foreach tramdo (14)     Arrival time← Initialization (AT constraint) (15)     for each node Ndo (16)      ifnode N∈Station (17)        Departure time← Initialization (DT constraint) (18)      else (19)       ifArrival timeduring Green phase (20)         Departure time = Arrival time (21)       else (22)        TSP strategy← Initialization (TSP constraint) (23)        for each TSP strategydo (24)         ifTSP  measure is activated (25)           Departure time = Arrival time (26)         else (27)           Departure time = Arrival time + Waiting time (28)         end (29)        end (30)       end (31)      end (32)     end (33)    end (34)   end (35)   Solutions←Unadjusted  signal timing; Arrival time; Departure time; TSPstrategy (36)   Person delay← Calculation (Solutions) (37)   The best solution← Minimum (Person delay) (38) untilfindingThe best solutionIn the enumeration procedure, all possible combinations of decision variables of the proposed model are listed and evaluated first, followed by choosing the group of decision variables which leads to the minimal average person delay as the optimal solution. In the resubmitted manuscript, the pseudocode of the enumeration procedure has been supplemented to explain how it finds the global optimal solution. In this study, the decision variables of the proposed model include the signal offsets among all intersections, tram schedules and TSP strategies. The outer layer of the enumeration procedure lists all signal offsets among different intersections without changing the signal cycle length and green duration. The inner layer of the enumeration procedure then lists all possible groups of tram schedules and TSP strategies for each signal offset produced in the first step.It should be noted that TSP strategies might affect the departure time of trams at intersections, which is a component of tram scheme. As a result, within the inner layer of the enumeration procedure, the departure time of the first tram from the first station is enumerated at first, followed by attaining all possible groups of arrival and departure time of the first tram at the other stations, considering each possible TSP strategy at each intersection, each possible inter-station run-time and station dwell time in their valid ranges. Once all possible schedules of the first tram are attained, the possible schedules of the other trams are enumerated one by one taking into account the valid ranges of tram headways, inter-station run-time and station dwell time, as well as the TSP strategies.As shown in Table6, when the problem is getting large, the enumeration is not capable of finding the optimal solution in a given time. The minor gap between enumeration solution and GA shows that the proposed GA has a high accuracy. In the case of 5 nodes including 2 intersections and 3 stations with 4 trams scheduled, the CPU time of enumeration and GA both is acceptable, and the gap is 1.4%. When the quantity of nodes and trams becomes larger, especially in the case of 17 nodes including 8 intersections and 9 stations with 8 trams to schedule, enumeration solution cannot find the global optimal solution in 6 hours. Obviously the length of CPU time depends on the combinations of the quantity of trams and the quantity of nodes. Thus either the quantity of trams or the quantity of nodes becomes larger and the CPU time prolongs.Table 6
Performance comparison of GA and enumeration.
Quantity of trams Quantity of nodes Method CPU time (sec) Objectives (sec) Gap (%) Intersections Stations 4 2 3 Enumeration 3954 34.7 -- GA 2361 35.2 1.4% 4 5 Enumeration 12814 42.3 -- GA 1600 43.0 1.6% 8 5 7 Enumeration >21600 54.8∗ -- GA 2473 54.6 -0.4% 8 9 Enumeration >21600 70.9∗ -- GA 3521 70.3 -0.8% 12 10 11 Enumeration >21600 82.1∗ -- GA 3864 80.4 -2.1% 12 13 Enumeration >21600 89.6∗ -- GA 4057 88.5 -1.2% (The value with∗ is the current optimal solution in a given CPU time)


### 6.2. Case Study in Ningbo Tramline

A section of a tramline in Ningbo, a city of China, is employed to evaluate the proposed model. The tramline section consists of 5 stations and 7 intersections. The layout of intersections and stations is given in Figure8. The maximum carrying capacity on one tram is 368 passengers. Taking peak-hours, for example, traffic volume, original signal timings at different intersections where the cycle time is 180 s, are presented in Table 7. The range of dwell time at different stations and the range of travel time as well as the loading factor of each link are specified in Table 8.Table 7
Traffic volume and signal timings at intersections along the Ningbo tramline.
Intersection Traffic flow(Number of Lane) Split(Cycle 180 sec) Intersection Traffic flow(Number of Lane) Split(Cycle 180 sec) Left Through Right Left Through Left Through Right Left Through S1 South 152(1) 1020(2) 88(1) 25 90 S5 South 140(1) 1008(2) 60(1) 27 90 North 147(1) 1016(2) 44(1) 25 90 North 142(1) 1024(3) 168(2) 27 90 East 144(1) 512(2) 372(2) 23 42  East 157(1) 470(2) 214(2) 23 40 West 142(1) 492(2) 16(1) 23 42 West 212(2) 468(2) 74(1) 23 40 S2 South 148(1) 1084(2) 96(1) 22 90 S6 South 144(1) 1178(2) 362(2) 25 86 North 153(1) 1096(2) 2(1) 22 90 North 137(1) 1032(2) 58(2) 25 86 East 148(1) 527(2) 212(2) 23 45 East 240(2) 408(2) 410(2) 34 35 West 146(1) 518(2) 16(1) 23 45 West 144(1) 412(3) 72(1) 34 35 S3 South 134(1) 1064(2) 24(1) 27 90 S7 South 146(1) 1052(2) 258(1) 26 77 North 146(1) 1004(2) 20(1) 27 90 North 141(1) 1003(2) 82(1) 26 77 East 132(1) 510(2) 120(2) 23 40 East 142(1) 522(2) 120(1) 36 41 West 138(1) 512(2) 108(1) 23 40 West 137(1) 514(2) 132(1) 36 41 S4 South 148(1) 1056(2) 60(1) 21 90 North 139(1) 1096(2) 176(1) 21 90 East 148(1) 482(2) 132(1) 26 43 West 144(1) 512(2) 80(1) 26 43Table 8
Tram timetable formulation parameters and loading factors.
Station Range of dwell time [sec] Link Range of travel time [sec] Loading factor NBSY (10,20) NBSY- YZGY (105,125) 0.7 YZGY (15,25) YZGY- YXDD (101,121) 0.9 YXDD (20,30) YXDD- WDGC (85,105) 0.8 WDGC (20,30) WDGC- NNLJ (99,119) 0.6 NNLJ (10,20)Figure 8
Layout of the Ningbo tramline.


#### 6.2.1. Performance Comparison by Different Objectives

The objective of the proposed model is to minimize person delay of the whole system including tram passengers and auto vehicle users. In order to further demonstrate the benefit of minimizing person delay, the computational results of three different objectives are compared. Beside the proposed objective, other two objectives are to minimize tram passenger delay and to minimize auto vehicle user delay.Compared with the proposed objective, as shown in Table9, only minimizing tram passenger delay reduces tram passenger delay to zero and results in a significant increase in auto vehicle user delay. When the number of auto vehicles is larger than that of trams at intersections, auto vehicle user delay has significant influence on person delay of the whole system. This leads to person delay of the whole system which is relatively high due to the high auto vehicle user delay. When only minimizing auto vehicle user delay, the interests of auto vehicle passengers will be ensured by less TSP activated for trams. Thus trams passenger delay increase, which reduced the attraction of public transportation. Considering optimizing tram passengers and auto vehicle users that separately reduced the efficiency of the whole system, these two stakeholders should be optimized simultaneously.Table 9
Performance comparison by different objectives.
Delay/s (Variation rate/%) Minimizing tram passenger delay Minimizing auto vehicle user delay The proposed model Tram passenger 0 83 (+93.02%) 43 Auto vehicle user 148 (+108.45%) 48 (-32.39%) 71 Average person 102 (+59.38%) 67 (+4.69%) 64 Weighted average person 95 (+69.64%) 75 (+33.39%) 56


#### 6.2.2. Performance on Different Ratio of Tram Passenger to Auto Vehicle User

Figure9 shows the changes in different ratio of tram passengers to auto vehicle users with different objectives. When the ratio varies, weighted person delay fluctuates greatly with the objectives of only minimizing tram passengers or only minimizing auto vehicle passengers. Neither of them can adapt to the situation when the ratio changes. However, by taking tram passengers and auto vehicle users as a whole, it can stabilize the weighted person delay and adapt to changes in different ratio.Figure 9
Performance on different ratio of tram passenger to auto vehicle user with different objectives.In practice, the ratio of tram passenger to auto vehicle user varies from day to day, especially the changes between weekdays and weekends, peak hour and non-peak hour. For example, the number of auto vehicles is larger than that of trams on weekdays and the number of trams becomes larger on weekends. If a single type of person is considered for optimization, such a change cannot be adapted. Therefore, the proposed model has better applicability.


## 6.1. Numerical Case

Four trams running on a tramline covering two stations and two intersections, as shown in Figure6, are employed here to demonstrate the performance of the proposed approach. Traffic volume, signal timings, lane direction, and the number of the lanes of the two intersections are specified in Table 4.Table 4
Traffic volume and signal timings.
Intersection Traffic flow(Number of Lane) Split(Cycle 180 sec) Intersection Traffic flow(Number of Lane) Split(Cycle 180 sec) Left Through Right Left Through Left Through Right Left Through S1 South 152(1) 1020(2) 88(1) 25 90 S2 South 148(1) 1084(2) 96(1) 22 90 North 147(1) 1016(2) 44(1) 25 90 North 153(1) 1096(2) 2(1) 22 90 East 144(1) 512(2) 372(2) 23 42 East 148(1) 527(2) 212(2) 23 45 West 142(1) 492(2) 16(1) 23 42 West 146(1) 518(2) 16(1) 23 45Figure 6
The layout of the tramline in the numerical case.


### 6.1.1. Performance Comparison with and without Integration

Figure7 shows the schedules of four trams during one hour in detail. When the second tram arrives at intersectionI, green extension strategy is triggered to grant the tram with green signal. Shown by the third and fourth trams, trams can arrive at the intersection during green signal, by increasing the travel time between the stations and the intersections. Thus it reduces the possibility of triggering TSP strategy, which causes delay to auto vehicles.Figure 7
Tram schedule of four trams.In order to further demonstrate the performance of the integrated model, the computational results with and without the integration of conditional active TSP and tram schedule are compared. In detail, without integration can be divided into only optimizing tram schedule and only applying TSP strategy which is subdivided into unconditional TSP and conditional TSP.Compared with the integrated model, as shown in Table5, only optimizing tram schedule leads to higher tram passenger delay and person delay. Auto vehicle user delay is reduced because no TSP is activated. The reduction of auto vehicle user delay is at the cost of increasing tram passenger delay. Due to travel time limits between each link, only adjusting tram schedule is not able to reduce delay for tram passengers and each person of the whole system.Table 5
Performance comparison with and without the integration of the numerical case.
Delay/s (Variation rate/%) Schedule only TSP only Integrated model unconditional conditional Tram passenger 60.9 (+95.34%) 0 39.2(+25.58%) 31.2 Auto vehicle user 39.1 (-8.45%) 89.2 (+108.45%) 48.2 (+12.68%) 42.8 Average person 40.7 (+6.25%) 61.1 (+59.38%) 43.7 (+14.06%) 38.3 Weighted average person 45.3 (+28.57%) 59.7 (+69.64%) 39.0 (+10.71%) 35.2When unconditional TSP is applied, tram passenger delay is zero. Although tram passengers do not suffer from any delay, auto vehicle user delay is extremely high, which due to unconditional TSP does not take into account the operation of auto vehicles. When the number of auto vehicles is larger than that of tram passenger at intersection, higher auto vehicle user delay will lead to higher person delay of the whole system.When only conditional TSP is applied, in order to trade off auto vehicle user and tram passengers, trams are not always granted priority to pass intersections without stops. As a result, tram passenger delay increases. The integrated model can further reduce auto vehicle user delay than conditional TSP because tram can be scheduled to arrive at intersections during green signals. Thus no TSP is required to activate and no delay is imposed to auto vehicle. Compared with unconditional TSP, conditional TSP can greatly reduce person delay of the whole system, although it increases tram passenger delay. Thus, conditional active priority is more suitable for system optimization.


### 6.1.2. Comparison between the Enumeration Solution and GA Solution

In this paper, genetic algorithm (GA) is adopted to solve the problem. Since GA is an intelligent search algorithm, the global optimal solution cannot be achieved. In order to testify the accuracy of the proposed GA, compared the proposed GA with enumeration solution. The pseudocode of the enumeration procedure is presented in Algorithm2.Algorithm 2:The enumeration procedure for the numerical case.
(1)  Input:Quantity of trams (m) (2)      Nodes / Intersection / Station (N / I / S) (3)      Arrival / Departure time constraints (AT / DT constraint) (4)      Dwell / Link travel time constraints (DT / LT constraint) (5)      Signal timing constraint (ST constraint) (6)      TSP strategy constraint (TSP constraint) (7)   Output: Solutions; The best solution (8)   repeat (9)     for each intersectiondo (10)    Unadjusted signal timing← Initialization (ST constraint) (11)   end (12)   for each unadjusted signal timingdo (13)    foreach tramdo (14)     Arrival time← Initialization (AT constraint) (15)     for each node Ndo (16)      ifnode N∈Station (17)        Departure time← Initialization (DT constraint) (18)      else (19)       ifArrival timeduring Green phase (20)         Departure time = Arrival time (21)       else (22)        TSP strategy← Initialization (TSP constraint) (23)        for each TSP strategydo (24)         ifTSP  measure is activated (25)           Departure time = Arrival time (26)         else (27)           Departure time = Arrival time + Waiting time (28)         end (29)        end (30)       end (31)      end (32)     end (33)    end (34)   end (35)   Solutions←Unadjusted  signal timing; Arrival time; Departure time; TSPstrategy (36)   Person delay← Calculation (Solutions) (37)   The best solution← Minimum (Person delay) (38) untilfindingThe best solutionIn the enumeration procedure, all possible combinations of decision variables of the proposed model are listed and evaluated first, followed by choosing the group of decision variables which leads to the minimal average person delay as the optimal solution. In the resubmitted manuscript, the pseudocode of the enumeration procedure has been supplemented to explain how it finds the global optimal solution. In this study, the decision variables of the proposed model include the signal offsets among all intersections, tram schedules and TSP strategies. The outer layer of the enumeration procedure lists all signal offsets among different intersections without changing the signal cycle length and green duration. The inner layer of the enumeration procedure then lists all possible groups of tram schedules and TSP strategies for each signal offset produced in the first step.It should be noted that TSP strategies might affect the departure time of trams at intersections, which is a component of tram scheme. As a result, within the inner layer of the enumeration procedure, the departure time of the first tram from the first station is enumerated at first, followed by attaining all possible groups of arrival and departure time of the first tram at the other stations, considering each possible TSP strategy at each intersection, each possible inter-station run-time and station dwell time in their valid ranges. Once all possible schedules of the first tram are attained, the possible schedules of the other trams are enumerated one by one taking into account the valid ranges of tram headways, inter-station run-time and station dwell time, as well as the TSP strategies.As shown in Table6, when the problem is getting large, the enumeration is not capable of finding the optimal solution in a given time. The minor gap between enumeration solution and GA shows that the proposed GA has a high accuracy. In the case of 5 nodes including 2 intersections and 3 stations with 4 trams scheduled, the CPU time of enumeration and GA both is acceptable, and the gap is 1.4%. When the quantity of nodes and trams becomes larger, especially in the case of 17 nodes including 8 intersections and 9 stations with 8 trams to schedule, enumeration solution cannot find the global optimal solution in 6 hours. Obviously the length of CPU time depends on the combinations of the quantity of trams and the quantity of nodes. Thus either the quantity of trams or the quantity of nodes becomes larger and the CPU time prolongs.Table 6
Performance comparison of GA and enumeration.
Quantity of trams Quantity of nodes Method CPU time (sec) Objectives (sec) Gap (%) Intersections Stations 4 2 3 Enumeration 3954 34.7 -- GA 2361 35.2 1.4% 4 5 Enumeration 12814 42.3 -- GA 1600 43.0 1.6% 8 5 7 Enumeration >21600 54.8∗ -- GA 2473 54.6 -0.4% 8 9 Enumeration >21600 70.9∗ -- GA 3521 70.3 -0.8% 12 10 11 Enumeration >21600 82.1∗ -- GA 3864 80.4 -2.1% 12 13 Enumeration >21600 89.6∗ -- GA 4057 88.5 -1.2% (The value with∗ is the current optimal solution in a given CPU time)


## 6.1.1. Performance Comparison with and without Integration

Figure7 shows the schedules of four trams during one hour in detail. When the second tram arrives at intersectionI, green extension strategy is triggered to grant the tram with green signal. Shown by the third and fourth trams, trams can arrive at the intersection during green signal, by increasing the travel time between the stations and the intersections. Thus it reduces the possibility of triggering TSP strategy, which causes delay to auto vehicles.Figure 7
Tram schedule of four trams.In order to further demonstrate the performance of the integrated model, the computational results with and without the integration of conditional active TSP and tram schedule are compared. In detail, without integration can be divided into only optimizing tram schedule and only applying TSP strategy which is subdivided into unconditional TSP and conditional TSP.Compared with the integrated model, as shown in Table5, only optimizing tram schedule leads to higher tram passenger delay and person delay. Auto vehicle user delay is reduced because no TSP is activated. The reduction of auto vehicle user delay is at the cost of increasing tram passenger delay. Due to travel time limits between each link, only adjusting tram schedule is not able to reduce delay for tram passengers and each person of the whole system.Table 5
Performance comparison with and without the integration of the numerical case.
Delay/s (Variation rate/%) Schedule only TSP only Integrated model unconditional conditional Tram passenger 60.9 (+95.34%) 0 39.2(+25.58%) 31.2 Auto vehicle user 39.1 (-8.45%) 89.2 (+108.45%) 48.2 (+12.68%) 42.8 Average person 40.7 (+6.25%) 61.1 (+59.38%) 43.7 (+14.06%) 38.3 Weighted average person 45.3 (+28.57%) 59.7 (+69.64%) 39.0 (+10.71%) 35.2When unconditional TSP is applied, tram passenger delay is zero. Although tram passengers do not suffer from any delay, auto vehicle user delay is extremely high, which due to unconditional TSP does not take into account the operation of auto vehicles. When the number of auto vehicles is larger than that of tram passenger at intersection, higher auto vehicle user delay will lead to higher person delay of the whole system.When only conditional TSP is applied, in order to trade off auto vehicle user and tram passengers, trams are not always granted priority to pass intersections without stops. As a result, tram passenger delay increases. The integrated model can further reduce auto vehicle user delay than conditional TSP because tram can be scheduled to arrive at intersections during green signals. Thus no TSP is required to activate and no delay is imposed to auto vehicle. Compared with unconditional TSP, conditional TSP can greatly reduce person delay of the whole system, although it increases tram passenger delay. Thus, conditional active priority is more suitable for system optimization.


## 6.1.2. Comparison between the Enumeration Solution and GA Solution

In this paper, genetic algorithm (GA) is adopted to solve the problem. Since GA is an intelligent search algorithm, the global optimal solution cannot be achieved. In order to testify the accuracy of the proposed GA, compared the proposed GA with enumeration solution. The pseudocode of the enumeration procedure is presented in Algorithm2.Algorithm 2:The enumeration procedure for the numerical case.
(1)  Input:Quantity of trams (m) (2)      Nodes / Intersection / Station (N / I / S) (3)      Arrival / Departure time constraints (AT / DT constraint) (4)      Dwell / Link travel time constraints (DT / LT constraint) (5)      Signal timing constraint (ST constraint) (6)      TSP strategy constraint (TSP constraint) (7)   Output: Solutions; The best solution (8)   repeat (9)     for each intersectiondo (10)    Unadjusted signal timing← Initialization (ST constraint) (11)   end (12)   for each unadjusted signal timingdo (13)    foreach tramdo (14)     Arrival time← Initialization (AT constraint) (15)     for each node Ndo (16)      ifnode N∈Station (17)        Departure time← Initialization (DT constraint) (18)      else (19)       ifArrival timeduring Green phase (20)         Departure time = Arrival time (21)       else (22)        TSP strategy← Initialization (TSP constraint) (23)        for each TSP strategydo (24)         ifTSP  measure is activated (25)           Departure time = Arrival time (26)         else (27)           Departure time = Arrival time + Waiting time (28)         end (29)        end (30)       end (31)      end (32)     end (33)    end (34)   end (35)   Solutions←Unadjusted  signal timing; Arrival time; Departure time; TSPstrategy (36)   Person delay← Calculation (Solutions) (37)   The best solution← Minimum (Person delay) (38) untilfindingThe best solutionIn the enumeration procedure, all possible combinations of decision variables of the proposed model are listed and evaluated first, followed by choosing the group of decision variables which leads to the minimal average person delay as the optimal solution. In the resubmitted manuscript, the pseudocode of the enumeration procedure has been supplemented to explain how it finds the global optimal solution. In this study, the decision variables of the proposed model include the signal offsets among all intersections, tram schedules and TSP strategies. The outer layer of the enumeration procedure lists all signal offsets among different intersections without changing the signal cycle length and green duration. The inner layer of the enumeration procedure then lists all possible groups of tram schedules and TSP strategies for each signal offset produced in the first step.It should be noted that TSP strategies might affect the departure time of trams at intersections, which is a component of tram scheme. As a result, within the inner layer of the enumeration procedure, the departure time of the first tram from the first station is enumerated at first, followed by attaining all possible groups of arrival and departure time of the first tram at the other stations, considering each possible TSP strategy at each intersection, each possible inter-station run-time and station dwell time in their valid ranges. Once all possible schedules of the first tram are attained, the possible schedules of the other trams are enumerated one by one taking into account the valid ranges of tram headways, inter-station run-time and station dwell time, as well as the TSP strategies.As shown in Table6, when the problem is getting large, the enumeration is not capable of finding the optimal solution in a given time. The minor gap between enumeration solution and GA shows that the proposed GA has a high accuracy. In the case of 5 nodes including 2 intersections and 3 stations with 4 trams scheduled, the CPU time of enumeration and GA both is acceptable, and the gap is 1.4%. When the quantity of nodes and trams becomes larger, especially in the case of 17 nodes including 8 intersections and 9 stations with 8 trams to schedule, enumeration solution cannot find the global optimal solution in 6 hours. Obviously the length of CPU time depends on the combinations of the quantity of trams and the quantity of nodes. Thus either the quantity of trams or the quantity of nodes becomes larger and the CPU time prolongs.Table 6
Performance comparison of GA and enumeration.
Quantity of trams Quantity of nodes Method CPU time (sec) Objectives (sec) Gap (%) Intersections Stations 4 2 3 Enumeration 3954 34.7 -- GA 2361 35.2 1.4% 4 5 Enumeration 12814 42.3 -- GA 1600 43.0 1.6% 8 5 7 Enumeration >21600 54.8∗ -- GA 2473 54.6 -0.4% 8 9 Enumeration >21600 70.9∗ -- GA 3521 70.3 -0.8% 12 10 11 Enumeration >21600 82.1∗ -- GA 3864 80.4 -2.1% 12 13 Enumeration >21600 89.6∗ -- GA 4057 88.5 -1.2% (The value with∗ is the current optimal solution in a given CPU time)


## 6.2. Case Study in Ningbo Tramline

A section of a tramline in Ningbo, a city of China, is employed to evaluate the proposed model. The tramline section consists of 5 stations and 7 intersections. The layout of intersections and stations is given in Figure8. The maximum carrying capacity on one tram is 368 passengers. Taking peak-hours, for example, traffic volume, original signal timings at different intersections where the cycle time is 180 s, are presented in Table 7. The range of dwell time at different stations and the range of travel time as well as the loading factor of each link are specified in Table 8.Table 7
Traffic volume and signal timings at intersections along the Ningbo tramline.
Intersection Traffic flow(Number of Lane) Split(Cycle 180 sec) Intersection Traffic flow(Number of Lane) Split(Cycle 180 sec) Left Through Right Left Through Left Through Right Left Through S1 South 152(1) 1020(2) 88(1) 25 90 S5 South 140(1) 1008(2) 60(1) 27 90 North 147(1) 1016(2) 44(1) 25 90 North 142(1) 1024(3) 168(2) 27 90 East 144(1) 512(2) 372(2) 23 42  East 157(1) 470(2) 214(2) 23 40 West 142(1) 492(2) 16(1) 23 42 West 212(2) 468(2) 74(1) 23 40 S2 South 148(1) 1084(2) 96(1) 22 90 S6 South 144(1) 1178(2) 362(2) 25 86 North 153(1) 1096(2) 2(1) 22 90 North 137(1) 1032(2) 58(2) 25 86 East 148(1) 527(2) 212(2) 23 45 East 240(2) 408(2) 410(2) 34 35 West 146(1) 518(2) 16(1) 23 45 West 144(1) 412(3) 72(1) 34 35 S3 South 134(1) 1064(2) 24(1) 27 90 S7 South 146(1) 1052(2) 258(1) 26 77 North 146(1) 1004(2) 20(1) 27 90 North 141(1) 1003(2) 82(1) 26 77 East 132(1) 510(2) 120(2) 23 40 East 142(1) 522(2) 120(1) 36 41 West 138(1) 512(2) 108(1) 23 40 West 137(1) 514(2) 132(1) 36 41 S4 South 148(1) 1056(2) 60(1) 21 90 North 139(1) 1096(2) 176(1) 21 90 East 148(1) 482(2) 132(1) 26 43 West 144(1) 512(2) 80(1) 26 43Table 8
Tram timetable formulation parameters and loading factors.
Station Range of dwell time [sec] Link Range of travel time [sec] Loading factor NBSY (10,20) NBSY- YZGY (105,125) 0.7 YZGY (15,25) YZGY- YXDD (101,121) 0.9 YXDD (20,30) YXDD- WDGC (85,105) 0.8 WDGC (20,30) WDGC- NNLJ (99,119) 0.6 NNLJ (10,20)Figure 8
Layout of the Ningbo tramline.


### 6.2.1. Performance Comparison by Different Objectives

The objective of the proposed model is to minimize person delay of the whole system including tram passengers and auto vehicle users. In order to further demonstrate the benefit of minimizing person delay, the computational results of three different objectives are compared. Beside the proposed objective, other two objectives are to minimize tram passenger delay and to minimize auto vehicle user delay.Compared with the proposed objective, as shown in Table9, only minimizing tram passenger delay reduces tram passenger delay to zero and results in a significant increase in auto vehicle user delay. When the number of auto vehicles is larger than that of trams at intersections, auto vehicle user delay has significant influence on person delay of the whole system. This leads to person delay of the whole system which is relatively high due to the high auto vehicle user delay. When only minimizing auto vehicle user delay, the interests of auto vehicle passengers will be ensured by less TSP activated for trams. Thus trams passenger delay increase, which reduced the attraction of public transportation. Considering optimizing tram passengers and auto vehicle users that separately reduced the efficiency of the whole system, these two stakeholders should be optimized simultaneously.Table 9
Performance comparison by different objectives.
Delay/s (Variation rate/%) Minimizing tram passenger delay Minimizing auto vehicle user delay The proposed model Tram passenger 0 83 (+93.02%) 43 Auto vehicle user 148 (+108.45%) 48 (-32.39%) 71 Average person 102 (+59.38%) 67 (+4.69%) 64 Weighted average person 95 (+69.64%) 75 (+33.39%) 56


### 6.2.2. Performance on Different Ratio of Tram Passenger to Auto Vehicle User

Figure9 shows the changes in different ratio of tram passengers to auto vehicle users with different objectives. When the ratio varies, weighted person delay fluctuates greatly with the objectives of only minimizing tram passengers or only minimizing auto vehicle passengers. Neither of them can adapt to the situation when the ratio changes. However, by taking tram passengers and auto vehicle users as a whole, it can stabilize the weighted person delay and adapt to changes in different ratio.Figure 9
Performance on different ratio of tram passenger to auto vehicle user with different objectives.In practice, the ratio of tram passenger to auto vehicle user varies from day to day, especially the changes between weekdays and weekends, peak hour and non-peak hour. For example, the number of auto vehicles is larger than that of trams on weekdays and the number of trams becomes larger on weekends. If a single type of person is considered for optimization, such a change cannot be adapted. Therefore, the proposed model has better applicability.


## 6.2.1. Performance Comparison by Different Objectives

The objective of the proposed model is to minimize person delay of the whole system including tram passengers and auto vehicle users. In order to further demonstrate the benefit of minimizing person delay, the computational results of three different objectives are compared. Beside the proposed objective, other two objectives are to minimize tram passenger delay and to minimize auto vehicle user delay.Compared with the proposed objective, as shown in Table9, only minimizing tram passenger delay reduces tram passenger delay to zero and results in a significant increase in auto vehicle user delay. When the number of auto vehicles is larger than that of trams at intersections, auto vehicle user delay has significant influence on person delay of the whole system. This leads to person delay of the whole system which is relatively high due to the high auto vehicle user delay. When only minimizing auto vehicle user delay, the interests of auto vehicle passengers will be ensured by less TSP activated for trams. Thus trams passenger delay increase, which reduced the attraction of public transportation. Considering optimizing tram passengers and auto vehicle users that separately reduced the efficiency of the whole system, these two stakeholders should be optimized simultaneously.Table 9
Performance comparison by different objectives.
Delay/s (Variation rate/%) Minimizing tram passenger delay Minimizing auto vehicle user delay The proposed model Tram passenger 0 83 (+93.02%) 43 Auto vehicle user 148 (+108.45%) 48 (-32.39%) 71 Average person 102 (+59.38%) 67 (+4.69%) 64 Weighted average person 95 (+69.64%) 75 (+33.39%) 56


## 6.2.2. Performance on Different Ratio of Tram Passenger to Auto Vehicle User

Figure9 shows the changes in different ratio of tram passengers to auto vehicle users with different objectives. When the ratio varies, weighted person delay fluctuates greatly with the objectives of only minimizing tram passengers or only minimizing auto vehicle passengers. Neither of them can adapt to the situation when the ratio changes. However, by taking tram passengers and auto vehicle users as a whole, it can stabilize the weighted person delay and adapt to changes in different ratio.Figure 9
Performance on different ratio of tram passenger to auto vehicle user with different objectives.In practice, the ratio of tram passenger to auto vehicle user varies from day to day, especially the changes between weekdays and weekends, peak hour and non-peak hour. For example, the number of auto vehicles is larger than that of trams on weekdays and the number of trams becomes larger on weekends. If a single type of person is considered for optimization, such a change cannot be adapted. Therefore, the proposed model has better applicability.


## 7. Conclusions

Operating in semi-exclusive ROW, trams may stop at intersections to wait red signals, which results in extra inter-station run-time or even delays. To improve the tram service quality, Transit Signal Priority (TSP) has been applied at intersections by offering extra green phase for trams. However, providing extra green phase for every tram might lead to heavy delays to crossing vehicles. To address this problem, this study developed an integrated optimization model of tram schedule and signal priority which can balance the delay between trams and other vehicles to minimize the average person delay.Due to the complexity of the problem, the GA is employed to solve the proposed model. A numerical case is conducted to testify the computing time and solution optimality of the proposed GA and the enumeration procedure. The results show that the enumeration is unable to find the optimal solution or even a near-optimal solution when the tramline covers several stations and intersections due to the huge solution space, while the GA outperforms the enumeration procedure within the restrained computing time. The case studies on the Ningbo tramline indicate that the integrated optimization reduces the average delay of passengers on both trams and auto vehicles, in comparison with only optimizing tram timetable or only applying TSP. It is also found that minimizing the average person delay of the whole system is able to adapt to the possible fluctuations in the ratio of tram passengers to auto vehicle users, compared with only minimizing tram passenger delay or auto vehicle user delay.



---

*Source: 4802967-2019-07-18.xml*