# Application of Modified NSGA-II to the Transit Network Design Problem

Authors: Jie Yang; Yangsheng Jiang
Journal: Journal of Advanced Transportation
 (2020)

---

## Abstract

The transit network design problem involves determining a certain number of routes to operate in an urban area to balance the costs of the passengers and the operator. In this paper, we simultaneously determine the route structure of each route and the number of routes in the final solution. A novel initial route set generation algorithm and a route set size alternating heuristic are embedded into a nondominated sorting genetic algorithm-II- (NSGA-II-) based solution framework to produce the approximate Pareto front. The initial route set generation algorithm aims to generate high-quality initial solutions for succeeding optimization procedures. To explore the solution space and to have solutions with a different number of routes, a route set size alternating heuristic is developed to change the number of routes in a solution by adding or deleting one route. Experiments were performed on Mandl’s network and four larger Mumford’s networks. Compared with a fixed route set size approach, the proposed NSGA-II-based solution method can produce an approximate Pareto front with much higher solution quality as well as improved computation efficiency.


---

## Body

## 1. Introduction

Followed by frequency setting, timetable development, bus scheduling, and driver scheduling, the transit network design problem (TNDP) [1] aims to determine a set of routes to operate in an urban area to balance the costs of the passengers and the operator. The performance of the succeeding four stages highly depends on the quality of the results of the transit network design. Thus, the TNDP has been continuously studied during the last five decades. Known as a NP-hard problem, the TNDP is a difficult combinatorial optimization problem, and its optimal solution is difficult to find even by using supercomputers.Despite the attention given TNDP, the determination of a suitable number of routes (or a range) for a speciﬁc network has received little attention. The route set size is an important parameter in the transit network design because of the following reasons. First, the route set size implicitly reﬂects the total route length, which directly affects the fuel costs, the mileage of the public transport, and other operation costs. Second, there is a trade-off between the route set size and the average travel time, which is an important indicator of the transit network performance. A larger route set size usually indicates more direct services for the passengers. Optimizing the route set size can lead to solutions with a wide range of trade-off levels between the operator cost and the passenger cost.Pattnaik et al. [2] proposed a variable string length coding method in which the route set size is determined along with the route set. Similarly, Tom and Mohan [3] incorporated the variation for the route set size in the coding to address the transit network routing and frequency setting problem. However, the mentioned research studies imply two limitations: (i) the optimal route set is only the subset of a large set of candidate routes generated by a candidate route generation algorithm. This method is not practical for large networks as the candidate route set scales exponentially with the network size. (ii) The resultant model can only give one answer per run. To address these issues, in this work, we consider the number of routes as an endogenous variable and vary it during the search for the approximate Pareto front. In other words, a route set size alternating heuristic is used together with the NSGA-II for solving simultaneously the TNDP and the route set size determination problem.With respect to objective functions, most previous studies [2–9] have adopted the weighted sum approach to achieve different objectives (i.e., the weighted sum of the operator cost and the passenger cost). This method can achieve a relatively good balance between the passenger cost and the operator cost. However, the determination of a suitable set of weights usually requires many experiments, which is time consuming, and the suitability of the weights obtained may vary from network to network. Besides, some researchers [10–18] approached the TNDP by considering the operator cost or the passenger cost as the only objective to be optimized. As a result, given the conﬂicting nature of the objectives, the optimal solution obtained might not be practical from the viewpoint of the other stakeholder. Therefore, in this work, we try to produce an approximate Pareto front from which the desired solution can be selected by the decision maker.The main contributions of this research are threefold: (a) the development of an initial route set generation algorithm to produce high-quality initial solutions for the TNDP; (b) the proposal of a route set size alternating heuristic to alternate the number of routes in a solution during the optimization procedure; and (c) the illustration of the applicability of the proposed solution method in ﬁve networks with different scales.The remainder of this paper is organized as follows. In Section2, we review existing works on route set initialization and optimization methods. The transit network design problem is described in Section 3. Section 4 elaborates the proposed initial route set generation algorithm and route set size alternating heuristic. Section 5 presents numerical results, and we conclude in Section 6.


## 2. Literature Review

The typical solution method for TNDP comprises two parts: an initialization procedure and an optimization algorithm. In this section, we systematically review related works from these two perspectives.


### 2.1. Initialization Procedure

Most initialization procedures can be classiﬁed into two categories: initial route set generation and candidate route set generation. One route set consists of a predeﬁned number of stop sequences which can be used to deﬁne a transit network. As our work is focusing on the transit routing problem, interesting readers for other transit network planning problems can refer to Guihaire and Hao [19], Kepaptsoglou and Karlaftis [20], Farahani et al. [21], Abedin et al. [22], and Liu and Ceder [23].Lampkin and Saalmans [24] ﬁrst designed a heuristic algorithm to generate route set. They produced a skeleton route of four nodes and inserted acceptable nodes one by one into the skeleton route according to a predeﬁned criterion until a complete route is obtained. After each insertion, demand satisﬁed by the formed route will be eliminated in order to guide the process. This framework of constructing route was adopted to develop initial route generation algorithm by Baaj and Mahmassani [5]. Mandl [25] approached urban transit routing problem with two steps: first all the shortest paths connecting every origin-destination pair were found to generate feasible initial route set, and then used heuristics to improve the quality of initial route set. With the consideration of transit demand, Baaj and Mahmassani [5] designed a route generation algorithm (RGA) to generate initial route set. Speciﬁcally, high demand node pairs are selected to deﬁne the initial skeletons with the help of a designer. Once the skeletons were speciﬁed, they were expanded into routes with a node selection or insertion strategy. The algorithm can also generate different sets of routes with different trade-offs between passengers and operator costs. Inspired by RGA [5], Mauttone and Urquhart [26] proposed another route generation algorithm called pair insertion algorithm. They used a novel strategy of inserting pairs of nodes, instead of the original expansion of routes by inserting single vertices. Experimental results reported by them evidenced that pair insertion algorithm can produce better solutions from the operator viewpoint with similar quality from the passengers’ viewpoint.To avoid deﬁning a skeleton ﬁrst, Chakroborty and Wivedi [12] determined each route by ﬁrst selecting the starting node and then adding adjacent nodes to the former node until some termination criteria are satisﬁed. The probability of selecting a node i is determined by its activity level which is calculated based on the number of trips originating from node i and starting from node i. Similarly, Mumford [27] constructed the ﬁrst route by adding adjacent nodes to a randomly selected start node and initiated other routes in the same way with a start node used in previously generated routes. Kechagiopoulos and Beligiannis [13] and Owais and Osman [28] proposed a similar procedure for initial route set generation. Instead of selecting nodes randomly, Nikolic and Teodorovic [16] developed a deterministic procedure for initial route set generation. They generated the initial solution by always selecting the shortest path with the largest number of passengers that enjoy the direct service till the number of routes generated equals a predeﬁned number. Most recently, Kilic and Gok [14] formulated an initial route set procedure based on the edge usage statistics. The statistics was obtained by computing all the shortest paths in the graph and then calculating the edge usage score based on the total traffic passing over a single edge. Each edge score was weighted by the inverse length of the edge and normalized. The normalized value is set as the discrete probability for the edge. Each route is then expanded by selecting adjacent edges with predeﬁned probabilities. Their method improves upon published results for Mumford’s larger networks.In an initial route set generation procedure, multiple initial route sets are required for population-based optimization methods. Candidate route set generation methods generate a set of candidate routes. Fan and Machemehl [7] and Fan and Machemehl [29] modiﬁed Yen’s k-shortest path algorithm [30] to generate all feasible routes whose distances satisfy the minimum and maximum length constraints for all nonzero demand origin-destination pairs. Similarly, Arbex and Cunha [31] generated a route database: for each origin-destination pair with nonzero travel demand, the associated OD path that corresponds to the ideal shortest direct travel time is added to the database as a bus route, along with those routes whose travel time does not exceed the fastest time by a maximum route detour factor speciﬁed by the planner. In addition, Cipriani et al. [6] developed a heuristic algorithm to generate three different and complementary sets of rational and realistic routes. A set of candidate routes is formed by using Newton gravity theory and a special shortest path procedure [10]. In Afandizadeh et al. [4], paths with lengths within a desirable limit (i.e., travel time up to 1.2 shortest path travel time) are selected as initial paths. The best subset of the large candidate route set is selected by an optimization procedure.


### 2.2. Optimization Algorithm

After the generation of an initial route set, heuristics- or metaheuristics-based optimization algorithms are utilized to improve solution quality, e.g., genetic algorithm (GA), simulated annealing, bee colony algorithm, artificial bee colony, particle swarm optimization, nondominated sorting genetic algorithm-II, tabu search, memetic algorithm, differential evolution, and selection hyperheuristics. For candidate route set approaches, the most commonly used algorithm is GA.A GA with seven proposed genetic operators is designed to facilitate the search within a reasonable amount of time [8]. The model designs the bus routes in two phases: the route improvement algorithm using genetic operators and coordination of headways to improve the eﬃciency of the network. The results showed that the proposed model is more eﬃcient than the binary-coded genetic algorithm benchmark. Fan and Machemehl [7] developed a GA to select an optimal set of routes from the candidate route set solution space. Numerical results showed that genetic algorithms outperform local search methods with multiple starting points and provide no worse solution quality than either simulated annealing or tabu search. Cipriani et al. [6] proposed a parallel GA for ﬁnding a suboptimal set of routes with the associated frequencies. Numerical experiments carried out on network of the city of Rome showed that transit demand can be served effectively by a bus network composed of a lower number of lines. Chew et al. [32] developed a GA to address the biobjective transit routing problem. The computational results for Mandl’s network showed that the proposed algorithm performs better than the previous best published results in most cases. Afandizadeh et al. [4] applied GA to the city of Mashhad and the results indicated highly effective improvement in terms of travel time and ﬂeet size. Nayeem et al. [15] developed a GA with elitism to optimize the size of satisﬁed passengers, the overall travel time of served passengers, and the total number of transfers. Owais and Osman [28] proposed a GA to tackle the multiobjective transit network design problem by optimizing average travel time and the required bus ﬂeet.Besides, Fan and Machemehl [29] used a simulated annealing algorithm for the ﬁrst time to solve the optimal bus transit route network design problem at the distribution node level. Zhao [33] proposed a stochastic local search method based on simulated annealing and fast descent search. Numerical experiments showed that the proposed method is capable of tackling large-scale transit network design optimization problems and producing results in a reasonable amount of time. Later, Zhao and Zeng [18] developed a metaheuristic search scheme that combines simulated annealing, tabu, and greedy search methods to optimize transit route network structure, vehicle headways, and timetables. Kilic and Gok [14] applied hill climbing algorithm and tabu search algorithm, respectively, on the transit network design problem. The experiment results for Mumford’s four larger networks showed improvements over results in Mumford [27].In the last decade, Nikolic and Teodorovic [16] designed a bee colony optimization algorithm for transit network design. This algorithm uses a similarity among the way in which bees in nature look for food and the way in which optimization algorithms search for an optimum of a combinatorial optimization problem. The numerical experiments performed on Mandl’s network and a larger instance showed that BCO algorithm is competitive with other approaches in the literature, and it can generate high-quality solutions. Szeto and Jiang [34] developed a hybrid artiﬁcial bee colony algorithm to solve the transit route and frequency design problem. The memetic algorithm (MA) is one of the recent growing evolutionary computation algorithms. Zhao et al. [35] developed a MA algorithm to design both optimal route conﬁguration and service frequency for the urban transit network. Compared with traditional algorithms, the results obtained by MA demonstrates that the proposed algorithm could improve the computational performance. Kechagiopoulos and Beligiannis [13] developed an optimization algorithm based on particle swarm optimization.Most recently, Buba and Lee [36] applied differential evolution algorithm and a repair mechanism for the multiobjective transit routing problem. Numerical experiments are performed on Mandl’s network and four larger networks of Mumford [27]. Buba and Lee [37] proposed a hybrid differential evolution with particle swarm optimization to design the transit network structure and associated frequencies. The computational results showed improvements over results in most of the previous studies. Ahmed et al. [38] evaluated the performance of a set of selection hyperheuristics on the route design problem of bus networks, with the goal of minimizing the passengers’ travel time and the operator’s costs.


## 2.1. Initialization Procedure

Most initialization procedures can be classiﬁed into two categories: initial route set generation and candidate route set generation. One route set consists of a predeﬁned number of stop sequences which can be used to deﬁne a transit network. As our work is focusing on the transit routing problem, interesting readers for other transit network planning problems can refer to Guihaire and Hao [19], Kepaptsoglou and Karlaftis [20], Farahani et al. [21], Abedin et al. [22], and Liu and Ceder [23].Lampkin and Saalmans [24] ﬁrst designed a heuristic algorithm to generate route set. They produced a skeleton route of four nodes and inserted acceptable nodes one by one into the skeleton route according to a predeﬁned criterion until a complete route is obtained. After each insertion, demand satisﬁed by the formed route will be eliminated in order to guide the process. This framework of constructing route was adopted to develop initial route generation algorithm by Baaj and Mahmassani [5]. Mandl [25] approached urban transit routing problem with two steps: first all the shortest paths connecting every origin-destination pair were found to generate feasible initial route set, and then used heuristics to improve the quality of initial route set. With the consideration of transit demand, Baaj and Mahmassani [5] designed a route generation algorithm (RGA) to generate initial route set. Speciﬁcally, high demand node pairs are selected to deﬁne the initial skeletons with the help of a designer. Once the skeletons were speciﬁed, they were expanded into routes with a node selection or insertion strategy. The algorithm can also generate different sets of routes with different trade-offs between passengers and operator costs. Inspired by RGA [5], Mauttone and Urquhart [26] proposed another route generation algorithm called pair insertion algorithm. They used a novel strategy of inserting pairs of nodes, instead of the original expansion of routes by inserting single vertices. Experimental results reported by them evidenced that pair insertion algorithm can produce better solutions from the operator viewpoint with similar quality from the passengers’ viewpoint.To avoid deﬁning a skeleton ﬁrst, Chakroborty and Wivedi [12] determined each route by ﬁrst selecting the starting node and then adding adjacent nodes to the former node until some termination criteria are satisﬁed. The probability of selecting a node i is determined by its activity level which is calculated based on the number of trips originating from node i and starting from node i. Similarly, Mumford [27] constructed the ﬁrst route by adding adjacent nodes to a randomly selected start node and initiated other routes in the same way with a start node used in previously generated routes. Kechagiopoulos and Beligiannis [13] and Owais and Osman [28] proposed a similar procedure for initial route set generation. Instead of selecting nodes randomly, Nikolic and Teodorovic [16] developed a deterministic procedure for initial route set generation. They generated the initial solution by always selecting the shortest path with the largest number of passengers that enjoy the direct service till the number of routes generated equals a predeﬁned number. Most recently, Kilic and Gok [14] formulated an initial route set procedure based on the edge usage statistics. The statistics was obtained by computing all the shortest paths in the graph and then calculating the edge usage score based on the total traffic passing over a single edge. Each edge score was weighted by the inverse length of the edge and normalized. The normalized value is set as the discrete probability for the edge. Each route is then expanded by selecting adjacent edges with predeﬁned probabilities. Their method improves upon published results for Mumford’s larger networks.In an initial route set generation procedure, multiple initial route sets are required for population-based optimization methods. Candidate route set generation methods generate a set of candidate routes. Fan and Machemehl [7] and Fan and Machemehl [29] modiﬁed Yen’s k-shortest path algorithm [30] to generate all feasible routes whose distances satisfy the minimum and maximum length constraints for all nonzero demand origin-destination pairs. Similarly, Arbex and Cunha [31] generated a route database: for each origin-destination pair with nonzero travel demand, the associated OD path that corresponds to the ideal shortest direct travel time is added to the database as a bus route, along with those routes whose travel time does not exceed the fastest time by a maximum route detour factor speciﬁed by the planner. In addition, Cipriani et al. [6] developed a heuristic algorithm to generate three different and complementary sets of rational and realistic routes. A set of candidate routes is formed by using Newton gravity theory and a special shortest path procedure [10]. In Afandizadeh et al. [4], paths with lengths within a desirable limit (i.e., travel time up to 1.2 shortest path travel time) are selected as initial paths. The best subset of the large candidate route set is selected by an optimization procedure.


## 2.2. Optimization Algorithm

After the generation of an initial route set, heuristics- or metaheuristics-based optimization algorithms are utilized to improve solution quality, e.g., genetic algorithm (GA), simulated annealing, bee colony algorithm, artificial bee colony, particle swarm optimization, nondominated sorting genetic algorithm-II, tabu search, memetic algorithm, differential evolution, and selection hyperheuristics. For candidate route set approaches, the most commonly used algorithm is GA.A GA with seven proposed genetic operators is designed to facilitate the search within a reasonable amount of time [8]. The model designs the bus routes in two phases: the route improvement algorithm using genetic operators and coordination of headways to improve the eﬃciency of the network. The results showed that the proposed model is more eﬃcient than the binary-coded genetic algorithm benchmark. Fan and Machemehl [7] developed a GA to select an optimal set of routes from the candidate route set solution space. Numerical results showed that genetic algorithms outperform local search methods with multiple starting points and provide no worse solution quality than either simulated annealing or tabu search. Cipriani et al. [6] proposed a parallel GA for ﬁnding a suboptimal set of routes with the associated frequencies. Numerical experiments carried out on network of the city of Rome showed that transit demand can be served effectively by a bus network composed of a lower number of lines. Chew et al. [32] developed a GA to address the biobjective transit routing problem. The computational results for Mandl’s network showed that the proposed algorithm performs better than the previous best published results in most cases. Afandizadeh et al. [4] applied GA to the city of Mashhad and the results indicated highly effective improvement in terms of travel time and ﬂeet size. Nayeem et al. [15] developed a GA with elitism to optimize the size of satisﬁed passengers, the overall travel time of served passengers, and the total number of transfers. Owais and Osman [28] proposed a GA to tackle the multiobjective transit network design problem by optimizing average travel time and the required bus ﬂeet.Besides, Fan and Machemehl [29] used a simulated annealing algorithm for the ﬁrst time to solve the optimal bus transit route network design problem at the distribution node level. Zhao [33] proposed a stochastic local search method based on simulated annealing and fast descent search. Numerical experiments showed that the proposed method is capable of tackling large-scale transit network design optimization problems and producing results in a reasonable amount of time. Later, Zhao and Zeng [18] developed a metaheuristic search scheme that combines simulated annealing, tabu, and greedy search methods to optimize transit route network structure, vehicle headways, and timetables. Kilic and Gok [14] applied hill climbing algorithm and tabu search algorithm, respectively, on the transit network design problem. The experiment results for Mumford’s four larger networks showed improvements over results in Mumford [27].In the last decade, Nikolic and Teodorovic [16] designed a bee colony optimization algorithm for transit network design. This algorithm uses a similarity among the way in which bees in nature look for food and the way in which optimization algorithms search for an optimum of a combinatorial optimization problem. The numerical experiments performed on Mandl’s network and a larger instance showed that BCO algorithm is competitive with other approaches in the literature, and it can generate high-quality solutions. Szeto and Jiang [34] developed a hybrid artiﬁcial bee colony algorithm to solve the transit route and frequency design problem. The memetic algorithm (MA) is one of the recent growing evolutionary computation algorithms. Zhao et al. [35] developed a MA algorithm to design both optimal route conﬁguration and service frequency for the urban transit network. Compared with traditional algorithms, the results obtained by MA demonstrates that the proposed algorithm could improve the computational performance. Kechagiopoulos and Beligiannis [13] developed an optimization algorithm based on particle swarm optimization.Most recently, Buba and Lee [36] applied differential evolution algorithm and a repair mechanism for the multiobjective transit routing problem. Numerical experiments are performed on Mandl’s network and four larger networks of Mumford [27]. Buba and Lee [37] proposed a hybrid differential evolution with particle swarm optimization to design the transit network structure and associated frequencies. The computational results showed improvements over results in most of the previous studies. Ahmed et al. [38] evaluated the performance of a set of selection hyperheuristics on the route design problem of bus networks, with the goal of minimizing the passengers’ travel time and the operator’s costs.


## 3. Problem Definition

The transit network design problem (TNDP) can be deﬁned by an undirected graphG=V,E and a travel demand matrix D. V is the set of vertices v1,v2,…,vn representing predeﬁned pick-up/drop-off points. E is the set of edges e1,e2,…,em standing for direct transport edges between vertices. Each edge e=i,j∈E is associated with a travel time li,j denoting the necessary time for a vehicle to travel from vertex i to vertex j. (li,j=∞, if ei,j∄). Travel demand matrix D=dij,i,j∈V is given to present the travel demand between every pair of vertices; dij denotes the number of trips per time unit from vertex i to vertex j. A route r can be expressed as a sequence of adjacent vertices v1,v2,…,vq. A solution set consists of a set of routes R=r1,r2,…,rK. Let GR=VR,ER be the subgraph corresponding to route set R, where VR=∪​r∈RVr=∪​r∈R∪​i=1rvi is the set of vertices of route set R (|r| is the number of vertices in node sequence r). Erk=erki,rk,i+1:i=1,…,rk−1 denotes the set of edges of route rk and ER=∪​r∈REr. To compare our outcomes with existing results, this study mainly focuses on the generation of route sets and leaves the frequency setting problem for future studies.From the viewpoint of passengers, the travel time and number of transfers are the major concerns. The average travel timeATT (including in-vehicle travel time and a transfer penalty) is selected as the indicator of the service level to depict the passenger cost. Since the average travel time includes the transfer cost, the number of transfers is implicitly included in the ATT. The objective function from the passengers’ viewpoint is deﬁned as follows:(1)minATTR,p=∑i,j∈V2dijtijR,p∑i,j∈V2dij,where dij denotes the number of trips per time unit from vertex i to vertex j. p is the transfer cost representing the inconvenience of moving from one vehicle to another, and tijR,p represents the shortest travel time from vertex i to vertex j by using route set R. To be consistent with former research studies, the transfer cost p is set as 5 minutes [4, 6, 16, 27, 32]. To compare our results with existing published results, we assume that passengers always choose the shortest path to reach their destinations.From the operator’s perspective, the sum of the lengths of all routes in a route set is directly proportional to the ﬂeet size, which is an important component in the operator cost [26]. Thus, the total route length (TRL) of a route set is taken as a proxy. The objective function from the operator’s viewpoint is given as follows:(2)minTRLR=∑r∈RLr,where Lr=∑i=2rlri−1,ri represents the length of route r.Mathematically, this optimization problem can be stated as(3)minATTR,p=∑i,j∈V2dijtijR,p∑i,j∈V2dij,(4)minTRLR=∑r∈RLr,(5)s.t.Nmin≤r≤Nmax,∀r∈R,(6)∪​r∈RVr=V,(7)GR=∪​r∈RVr,∪​r∈REris connected,(8)Vr=qr,∀r∈R,(9)∑i=2rlri−1,ri≠∞,∀r∈R.Constraint (5) limits the number of vertices of each route. Constraint (6) ensures that all vertices in V can be found in at least one route. Constraint (7) ensures that every vertex is reachable from other vertices in the subgraph deﬁned by R [36]. Constraint (8) ensures that each node can only be visited by a route at most once. Recall that route rk is described as a node sequence vk1,vk2,…,vkq, where q denotes the number of nodes in node sequence rk. Constraint (9) ensures that all consecutive vertices are connected by an existing edge (li,j≠∞). The uniqueness of route r in R is ensured through the deﬁnition of route set R.


## 4. Solution Method

### 4.1. Overall Solution Framework

In the developed solution method, a novel initial route set generation algorithm is constructed to produce high-quality initial route sets, while a route set size alternating heuristic is developed to switch the route set size of a solution by adding or deleting an entire route. These two algorithms are embedded into the framework of NSGA-II to search for the approximate Pareto front in terms of the operator cost (i.e., the total route length,TRL) and the passenger cost (i.e., the average travel time, ATT).Multiple high-quality initial solutions are firstly produced by the initial route set generation algorithm. Figure1 presents the flowchart of the proposed initial route set algorithm. Two objective values are then calculated for each initial solution to evaluate the ﬁtness of initial solutions. And all initial solutions are regarded as parents and used to generate the offspring through genetic operators (i.e., selection, crossover, and mutation operators). In this work, the application of crossover operator generates only one offspring. Therefore, the number of solutions in the offspring remains the same as the parents. After the mutation, the route set size alternating heuristic is applied to the offspring to change the number of routes in an offspring by adding/deleting if its solution quality has not been improved for a predeﬁned number of generations. In order to select the individuals of the next generation, the NSGA-II is subsequently applied to the parents and the offspring. For extensive surveys on NSGA-II, readers are referred to Deb et al. [39]. This process is repeated until the stopping criteria are satisﬁed.Figure 1
Initial route set generation procedure.The following three datasets are needed to perform route combination algorithm (RCA): (i) initial candidate route set (containing all the shortest paths) denoted byP; (ii) transit demand served by each candidate route and denoted by Pv; and (iii) the origin-destination pairs served by each candidate route and denoted by Pd. Note that due to the symmetry of demand and travel time, only triangular elements are used.


### 4.2. Initial Route Set Generation Algorithm

The proposed initial route set generation algorithm is based on the observation that maximizing the travel demand that can be satisﬁed directly (without transfers) is a key component in the generation of an initial route set. This algorithm consists of two procedures: absorption and combination. As the algorithm is based on the combination of routes, it is called RCA. These procedures generate an initial route set based on the following parameters:SP, D, and G. SP contains all the shortest paths connecting every origin-destination pair. G is the undirected graph. An example in which a graph and a matrix D is used to illustrate the initial route set generation algorithm is shown in Figure 2. The numbers adjacent to the links represent the travel times in minutes.Figure 2
Illustrative example.Table1 gives the dataset structure that is needed to generate an initial route set. The second column gives all the shortest paths between the vertices in the example graph. OD pairs served by the shortest paths are shown in the third column. And the last column contains the travel demands served directly by each shortest path. For example, for the second route in Table 1, the shortest path (1, 2, 3) starts from vertex 1, goes through vertex 2, and terminates at vertex 3. This path serves the travel demand of one OD pair (1-3).Table 1
Dataset structure of the example.
#RouteODDemand11, 21-2221, 2, 31-3631, 41-4041, 4, 51-5452, 32-3462, 3, 42-4672, 3, 52-5283, 43-4693, 53-58104, 54-54


#### 4.2.1. Absorption Procedure

If a route is completely included in another route, we consider that this route can be absorbed by another route. The basic principle of absorption is to eliminate routes which are completely included in another route. By doing this, the number of routes inR and the total route length can be efectively decreased. The absorption procedure is composed of four steps:Step 1. Sort the routes in R in the order of the number of vertices of each route. The routes that serve no demand are eliminated. Let M be the total number of routes in R and set m = 1. For example, the routes in Table 1 are sorted and given in Figure 3(a). Particularly, the third route (1, 4) in Table 1 is eliminated since it serves no demand.Step 2. Find all the routes (except route m) that can absorb route m. Let Q be the set of routes that can absorb route m. If m = M, stop; otherwise, go to Step 3.Step 3. If Q is empty, set m = m + 1, and return to Step 2; otherwise, based on the travel demands served by routes in Q, a probability pq is appointed to each route q and reﬂects the probability of each route to be selected as the route to absorb route m. The probability of selecting route q is calculated by(10)pq=Dq∑i∈QDi.Step 4. Use the roulette wheel selection method to select a route from Q based on the values of probabilities pq. As soon as a route is selected to absorb route m, the ODs and demands served by route m are assigned to route q. Then, we need to delete route m from R and return to Step 2.Figure 3
Illustration of the absorption procedure. (a) Route 1⟶6. (b) Route 2⟶6/8/9. (c) Route 3⟶8. (d) Route 4⟶9. (e) Route 5⟶7. (f) None.
(a)(b)(c)(d)(e)(f)An example for the absorption procedure is shown in Figure3. In Figure 3(a), the ﬁrst route (1, 2) is completely included in route 6 (1, 2, 3), namely, the ﬁrst route is absorbed by route 6 and the travel demand of the ﬁrst route can be served by route 6. Therefore, we need to erase the ﬁrst route from R.In Figure3(b), the second route (2, 3) can be absorbed by three routes (routes 6, 8, and 9). According to equation (10), the probabilities of selecting the three routes 6, 8, and 9 are 0.5, 0.375, and 0.125, respectively. Assume that route 6 is selected. Then, the ODs (2-3) and demands (4) served by route 2 are assigned to route 6. As presented in Figure 3(c), route 6 serves three ODs (1-2, 1-3, 2-3), and the total demand is 12. In the following steps, routes 3, 4, and 5 are absorbed by routes 8, 9, and 7, separately.From Figure3, it can be seen that the number of routes in R is decreased from 9 to 4, but the travel demand served by each route is increased. After the absorption procedure, 3∗Nrou routes with high demands are selected as the input datasets for the following procedure, where Nrou is the number of routes in a solution set (predeﬁned according to Table 2).Table 2
Properties of ﬁve networks.
NetworkLocationVerticesEdgesNumber of routesVertices’ routeLBATT (min)MandlSwitzerland15214-82-810.0058Mumford0—3090122-1513.0121Mumford1Yubei702101510-3019.2695Mumford2Brighton1103855610-2222.1689Mumford3Cardiff1274256012-2524.7453


#### 4.2.2. Combination Procedure

The combination procedure aims to construct new routes with pairs of routes inR. The basic principle of the combination procedure is to combine pairs of routes with high demands. In this way, we can simultaneously decrease the number of routes and increase the travel demands served by one route. Before constructing new routes, pairs of routes are selected. The selection of one pair of routes relies on the relationship between two routes. In the light of the positions of vertices shared by two routes, the relationships between two routes can be classified into six types. Figure 4 shows the six types and their combined results.Figure 4
Six kinds of route relationships and their corresponding combined results.If two routes fall into types of 1, 2, 3, or 5, then these two routes can be combined. The combination procedure is composed of five steps:Step 1. Sort the routes in R in descending order based on the transit demand of each route. Let M be the total number of routes in R and set m = 1. For example, the routes in Figure 3 are sorted and given in Figure 5(a).Step 2. Find all the routes (except route m) that can combine with route m. Let Z be the set of routes that can combine with route m. If m = M, go to Step 5; otherwise, go to Step 3.Step 3. If Z is empty, set m = m + 1, and return to Step 2; otherwise, according to the travel demands served by routes in Z, a probability pz is distributed to each route z and depicts the probability of each route to be selected as the route to combine with route m. The probability of selecting route z is computed by(11)pz=Dz+Dm∑i∈Zi+Dm.Step 4. Use the roulette wheel selection method to choose a route from Z based on the values of probabilities pz. As soon as a route z is selected, route m and route z are combined into a new route according to Figure 4. The new route serves the travel demands and ODs of both routes. Then, we should delete routes m and z from R and return to Step 2.Step 5. Sort routes again in R in descending order by the transit demand of each route. The initial route set is formed of the ﬁrst Nrou (the number of routes in a route set) feasible routes in R. Check the feasibility of the initial route set by using feasibility checks described in Section 4.3.Figure 5
Illustration of combination procedure. (a) Route 1 + 6. (b) New route 1 + 2. (c) None.
(a)(b)(c)An example for the combination procedure using the output of the absorption example is shown in Figure5. First, the routes are sorted in descending order based on the travel demand served directly by each route. The relationship between the ﬁrst route and other routes are determined, that is, routes 1 and 2 fall into type 1, routes 1 and 3 belong to type 1, and routes 1 and 4 are in type 2. With the aid of equation (11), the probabilities of selecting these three routes are 0.36, 0.33, and 0.30. We assume that route 2 is chosen to combine with route 1, and the new route is constructed according to Figure 4. It should be noted that the demand covered by the new route is doubled. The total route length of R is also decreased from 36 minutes to 34 minutes. The number of routes also decreases from 4 to 3, as shown in Figure 5(b). Similarly, in Figure 5(b), routes 1 and 2 are combined.From Figure5, it is not uncommon that not only the number of routes in R is decreased from 4 to 2, but also the travel demand served by each route is increased. Hence, the result of the combination procedure can be used as an initial route set for optimization algorithms.


### 4.3. Feasibility Checks

The TNDP is a multiconstrained problem, and the feasibility of the solutions should be checked carefully. Inspired by [27, 31], our proposed feasibility checks are detailed as follows:(1)
Route feasibility check: check if every route is feasible, that is, no repeated vertices appear in a route, and the number of vertices in a route must be within a predeﬁned range.(2)
Route uniqueness check: if one route is the same as a segment of another route or another entire route, we regard this route as nonunique. As a result, this route is directly eliminated.(3)
Area coverage check: check if all the vertices appear in the solution set at least once. This process constructs an appeared-vertex list by searching all the routes and checks if every vertex appears in the list.(4)
Network connectivity check: the purpose of this procedure is to determine whether a route is connected to the transit network.After feasibility checks, a repair mechanism is applied to repair infeasible solutions. It should be noted that the generated initial solutions are always feasible for the ﬁrst two feasibility checks. Only infeasible initial solutions which fail area coverage check are repaired. Other infeasible solutions (network connectivity check) are simply discarded during initial solution generation and the initial route set generation algorithm is called again. The repair mechanism for initial solutions is described as follows.The repair mechanism randomly selects a route from the solution and then applies insert operation. The insert operation constructs a list of candidate nodes by searching all positions and checking the existence of the edges (in the origin graph) between the used and unused nodes of the modiﬁed route, and then it randomly selects one of the candidate nodes and inserts it into the route. The above procedure is repeated until all nodes can be found in the route set. If there are nodes that cannot be inserted into the initial route set, this solution is discarded. Note that this procedure is also applied to the output solutions of route set size alternating heuristic.


### 4.4. Route Operators

Due to the complex structure of the route set, one crossover and three mutation operators are designed to facilitate the generation of offspring.The route crossover operator is developed to exchange two routes between two individuals. Each individual of the current generation is selected in turn as the ﬁrst parent. The second parent is randomly determined. Then, two routes from each parent are randomly determined and exchanged.Three mutation operators, namely, the sequence, insert, and delete mutation operators, are proposed in this study to mutate the route structure of an individual. Speciﬁcally, the sequence mutation operator is developed to replace a random sequence of a route with ak-th shortest path. For the inserted mutation operator, all the positions in the route will be checked to determine whether there exists a vertex that can be connected to two adjacent vertices in the route with only two edges. Then, a suitable vertex will be randomly selected and inserted into the route. Comparatively, the delete mutation operator constructs a candidate list of vertices and randomly deletes a vertex.Before a crossover/mutation operation is made, the result of crossover/mutation will be checked for route feasibility and route uniqueness. If these checks return true, the crossover/mutation is made. The solutions are feasible for the ﬁrst two checks all the time. After all solutions go through crossover and mutations, the last two feasibility checks are performed for child solutions.If the area coverage constraint is not satisﬁed, a route in the child solution is selected from the solution and then insert operation is applied. The insert operation constructs a list of candidate nodes by searching all positions and checking the existence of the edges (in the origin graph) between the used and unused nodes of the modiﬁed route, and then it randomly selects one of the candidate nodes and inserts it into the route. The above procedure is repeated until all unused nodes are inserted. If there are nodes that cannot be inserted into the child solution, the child solution is replaced by its parent.If the subgraph deﬁned by a child solution is not connected, the child solution is substituted by its parent.


### 4.5. Route Set Size Alternating Heuristic

As mentioned before, the route set size is regarded as an endogenous variable. Therefore, for every individual that survives into the next generation, a descent route set size alternating heuristic is employed to change the route set size. To ensure eﬃciency and secure potential individuals, only individuals who have not been improved for a predeﬁned number of generations (set as 5 in this article) will go through this heuristic. The proposed route set size alternating heuristic comprises two procedures: route addition and route deletion. For each selected route set, either route addition or route deletion is randomly selected with the same probability. Solutions going through this heuristic are checked for area coverage constraint and repaired when necessary using the repair mechanism described in Section4.3. If the solution is not feasible after repair, the changes made by route set size alternating heuristic are undone. The process of this heuristic is detailed as follows.


#### 4.5.1. Route Addition

For each route setR, a deviation ratio is calculated for every nonzero transit demand to estimate the quality of their trips. Then, the OD pairs with a low service quality are selected. Finally, the greedy algorithm proposed by Nikolic and Teodorovic [16] is used to determine the most suitable route to add into the route set R.The quality indicator for passengers between verticesi and j is deﬁned as follows:(12)ΔijR=tijRtijG.Using routes ofR, this represents a deviation ratio of the minimum travel time from the theoretical best value (which only depends on the road network G). tijR is computed by using an all-or-nothing assignment approach, and tijG is the in-vehicle travel time of the shortest path in G between vertices i and j. According to this formulation, lower values of ΔijR are desired. Then, the OD pairs with a high value of ΔijR are considered as not well served. The set of these OD pairs can be derived as follows:(13)S=i,jΔijR≥threshold.The OD pair that has the highest value ofdsi,j is used to generate the most suitable route. This route is obtained by connecting this OD pair with the shortest path. By inserting this route into R, we can increase the percentage of the satisﬁed travel demand with zero transfer.


#### 4.5.2. Route Deletion

The route deletion procedure is proposed to delete one route from the route setR. This procedure is based on the analysis of the allocation of each travel demand. The route deletion procedure works in the following way. For each route set R that is selected to perform the route deletion procedure, the route whose removal from the route set has the least inﬂuence on the quality of the current route set is determined. Then, this route should be deleted from the route set R. Based on the analysis of the allocation of each transit demand, every route rk is assigned a weight wk, which reﬂects the importance of each route. And this weight is calculated as follows:(14)wk=∑i,j∈V2tijrkdijTk,where Tk is the round-trip time of route rk. dij is the transit demand per unit time from vertex i to vertex j. tijrk represents the in-vehicle travel time on route rk for passengers traveling between vertices i and j. The value of tijrk is obtained as follows:(1)
If there is a direct service between verticesi and j using route rk, the tijrk value is the in-vehicle travel time.(2)
If the passengers between verticesi and j cannot complete their trips with only route rk, the tijrk value is the in-vehicle travel time from the boarding/alighting stop to the transfer stop on route rk.(3)
If the passengers between verticesi and j can complete their trips without route rk, the tijrk value is 0.This deﬁnition has signiﬁcant implications: (i) more passengers and longer in-vehicle travel time spent on routerk mean more contribution to the weight wk; (ii) the weight of route rk rapidly diminishes when the length route rk increases. After the weight calculation procedure, the least important route is determined and removed from the route set R.


## 4.1. Overall Solution Framework

In the developed solution method, a novel initial route set generation algorithm is constructed to produce high-quality initial route sets, while a route set size alternating heuristic is developed to switch the route set size of a solution by adding or deleting an entire route. These two algorithms are embedded into the framework of NSGA-II to search for the approximate Pareto front in terms of the operator cost (i.e., the total route length,TRL) and the passenger cost (i.e., the average travel time, ATT).Multiple high-quality initial solutions are firstly produced by the initial route set generation algorithm. Figure1 presents the flowchart of the proposed initial route set algorithm. Two objective values are then calculated for each initial solution to evaluate the ﬁtness of initial solutions. And all initial solutions are regarded as parents and used to generate the offspring through genetic operators (i.e., selection, crossover, and mutation operators). In this work, the application of crossover operator generates only one offspring. Therefore, the number of solutions in the offspring remains the same as the parents. After the mutation, the route set size alternating heuristic is applied to the offspring to change the number of routes in an offspring by adding/deleting if its solution quality has not been improved for a predeﬁned number of generations. In order to select the individuals of the next generation, the NSGA-II is subsequently applied to the parents and the offspring. For extensive surveys on NSGA-II, readers are referred to Deb et al. [39]. This process is repeated until the stopping criteria are satisﬁed.Figure 1
Initial route set generation procedure.The following three datasets are needed to perform route combination algorithm (RCA): (i) initial candidate route set (containing all the shortest paths) denoted byP; (ii) transit demand served by each candidate route and denoted by Pv; and (iii) the origin-destination pairs served by each candidate route and denoted by Pd. Note that due to the symmetry of demand and travel time, only triangular elements are used.


## 4.2. Initial Route Set Generation Algorithm

The proposed initial route set generation algorithm is based on the observation that maximizing the travel demand that can be satisﬁed directly (without transfers) is a key component in the generation of an initial route set. This algorithm consists of two procedures: absorption and combination. As the algorithm is based on the combination of routes, it is called RCA. These procedures generate an initial route set based on the following parameters:SP, D, and G. SP contains all the shortest paths connecting every origin-destination pair. G is the undirected graph. An example in which a graph and a matrix D is used to illustrate the initial route set generation algorithm is shown in Figure 2. The numbers adjacent to the links represent the travel times in minutes.Figure 2
Illustrative example.Table1 gives the dataset structure that is needed to generate an initial route set. The second column gives all the shortest paths between the vertices in the example graph. OD pairs served by the shortest paths are shown in the third column. And the last column contains the travel demands served directly by each shortest path. For example, for the second route in Table 1, the shortest path (1, 2, 3) starts from vertex 1, goes through vertex 2, and terminates at vertex 3. This path serves the travel demand of one OD pair (1-3).Table 1
Dataset structure of the example.
#RouteODDemand11, 21-2221, 2, 31-3631, 41-4041, 4, 51-5452, 32-3462, 3, 42-4672, 3, 52-5283, 43-4693, 53-58104, 54-54


### 4.2.1. Absorption Procedure

If a route is completely included in another route, we consider that this route can be absorbed by another route. The basic principle of absorption is to eliminate routes which are completely included in another route. By doing this, the number of routes inR and the total route length can be efectively decreased. The absorption procedure is composed of four steps:Step 1. Sort the routes in R in the order of the number of vertices of each route. The routes that serve no demand are eliminated. Let M be the total number of routes in R and set m = 1. For example, the routes in Table 1 are sorted and given in Figure 3(a). Particularly, the third route (1, 4) in Table 1 is eliminated since it serves no demand.Step 2. Find all the routes (except route m) that can absorb route m. Let Q be the set of routes that can absorb route m. If m = M, stop; otherwise, go to Step 3.Step 3. If Q is empty, set m = m + 1, and return to Step 2; otherwise, based on the travel demands served by routes in Q, a probability pq is appointed to each route q and reﬂects the probability of each route to be selected as the route to absorb route m. The probability of selecting route q is calculated by(10)pq=Dq∑i∈QDi.Step 4. Use the roulette wheel selection method to select a route from Q based on the values of probabilities pq. As soon as a route is selected to absorb route m, the ODs and demands served by route m are assigned to route q. Then, we need to delete route m from R and return to Step 2.Figure 3
Illustration of the absorption procedure. (a) Route 1⟶6. (b) Route 2⟶6/8/9. (c) Route 3⟶8. (d) Route 4⟶9. (e) Route 5⟶7. (f) None.
(a)(b)(c)(d)(e)(f)An example for the absorption procedure is shown in Figure3. In Figure 3(a), the ﬁrst route (1, 2) is completely included in route 6 (1, 2, 3), namely, the ﬁrst route is absorbed by route 6 and the travel demand of the ﬁrst route can be served by route 6. Therefore, we need to erase the ﬁrst route from R.In Figure3(b), the second route (2, 3) can be absorbed by three routes (routes 6, 8, and 9). According to equation (10), the probabilities of selecting the three routes 6, 8, and 9 are 0.5, 0.375, and 0.125, respectively. Assume that route 6 is selected. Then, the ODs (2-3) and demands (4) served by route 2 are assigned to route 6. As presented in Figure 3(c), route 6 serves three ODs (1-2, 1-3, 2-3), and the total demand is 12. In the following steps, routes 3, 4, and 5 are absorbed by routes 8, 9, and 7, separately.From Figure3, it can be seen that the number of routes in R is decreased from 9 to 4, but the travel demand served by each route is increased. After the absorption procedure, 3∗Nrou routes with high demands are selected as the input datasets for the following procedure, where Nrou is the number of routes in a solution set (predeﬁned according to Table 2).Table 2
Properties of ﬁve networks.
NetworkLocationVerticesEdgesNumber of routesVertices’ routeLBATT (min)MandlSwitzerland15214-82-810.0058Mumford0—3090122-1513.0121Mumford1Yubei702101510-3019.2695Mumford2Brighton1103855610-2222.1689Mumford3Cardiff1274256012-2524.7453


### 4.2.2. Combination Procedure

The combination procedure aims to construct new routes with pairs of routes inR. The basic principle of the combination procedure is to combine pairs of routes with high demands. In this way, we can simultaneously decrease the number of routes and increase the travel demands served by one route. Before constructing new routes, pairs of routes are selected. The selection of one pair of routes relies on the relationship between two routes. In the light of the positions of vertices shared by two routes, the relationships between two routes can be classified into six types. Figure 4 shows the six types and their combined results.Figure 4
Six kinds of route relationships and their corresponding combined results.If two routes fall into types of 1, 2, 3, or 5, then these two routes can be combined. The combination procedure is composed of five steps:Step 1. Sort the routes in R in descending order based on the transit demand of each route. Let M be the total number of routes in R and set m = 1. For example, the routes in Figure 3 are sorted and given in Figure 5(a).Step 2. Find all the routes (except route m) that can combine with route m. Let Z be the set of routes that can combine with route m. If m = M, go to Step 5; otherwise, go to Step 3.Step 3. If Z is empty, set m = m + 1, and return to Step 2; otherwise, according to the travel demands served by routes in Z, a probability pz is distributed to each route z and depicts the probability of each route to be selected as the route to combine with route m. The probability of selecting route z is computed by(11)pz=Dz+Dm∑i∈Zi+Dm.Step 4. Use the roulette wheel selection method to choose a route from Z based on the values of probabilities pz. As soon as a route z is selected, route m and route z are combined into a new route according to Figure 4. The new route serves the travel demands and ODs of both routes. Then, we should delete routes m and z from R and return to Step 2.Step 5. Sort routes again in R in descending order by the transit demand of each route. The initial route set is formed of the ﬁrst Nrou (the number of routes in a route set) feasible routes in R. Check the feasibility of the initial route set by using feasibility checks described in Section 4.3.Figure 5
Illustration of combination procedure. (a) Route 1 + 6. (b) New route 1 + 2. (c) None.
(a)(b)(c)An example for the combination procedure using the output of the absorption example is shown in Figure5. First, the routes are sorted in descending order based on the travel demand served directly by each route. The relationship between the ﬁrst route and other routes are determined, that is, routes 1 and 2 fall into type 1, routes 1 and 3 belong to type 1, and routes 1 and 4 are in type 2. With the aid of equation (11), the probabilities of selecting these three routes are 0.36, 0.33, and 0.30. We assume that route 2 is chosen to combine with route 1, and the new route is constructed according to Figure 4. It should be noted that the demand covered by the new route is doubled. The total route length of R is also decreased from 36 minutes to 34 minutes. The number of routes also decreases from 4 to 3, as shown in Figure 5(b). Similarly, in Figure 5(b), routes 1 and 2 are combined.From Figure5, it is not uncommon that not only the number of routes in R is decreased from 4 to 2, but also the travel demand served by each route is increased. Hence, the result of the combination procedure can be used as an initial route set for optimization algorithms.


## 4.2.1. Absorption Procedure

If a route is completely included in another route, we consider that this route can be absorbed by another route. The basic principle of absorption is to eliminate routes which are completely included in another route. By doing this, the number of routes inR and the total route length can be efectively decreased. The absorption procedure is composed of four steps:Step 1. Sort the routes in R in the order of the number of vertices of each route. The routes that serve no demand are eliminated. Let M be the total number of routes in R and set m = 1. For example, the routes in Table 1 are sorted and given in Figure 3(a). Particularly, the third route (1, 4) in Table 1 is eliminated since it serves no demand.Step 2. Find all the routes (except route m) that can absorb route m. Let Q be the set of routes that can absorb route m. If m = M, stop; otherwise, go to Step 3.Step 3. If Q is empty, set m = m + 1, and return to Step 2; otherwise, based on the travel demands served by routes in Q, a probability pq is appointed to each route q and reﬂects the probability of each route to be selected as the route to absorb route m. The probability of selecting route q is calculated by(10)pq=Dq∑i∈QDi.Step 4. Use the roulette wheel selection method to select a route from Q based on the values of probabilities pq. As soon as a route is selected to absorb route m, the ODs and demands served by route m are assigned to route q. Then, we need to delete route m from R and return to Step 2.Figure 3
Illustration of the absorption procedure. (a) Route 1⟶6. (b) Route 2⟶6/8/9. (c) Route 3⟶8. (d) Route 4⟶9. (e) Route 5⟶7. (f) None.
(a)(b)(c)(d)(e)(f)An example for the absorption procedure is shown in Figure3. In Figure 3(a), the ﬁrst route (1, 2) is completely included in route 6 (1, 2, 3), namely, the ﬁrst route is absorbed by route 6 and the travel demand of the ﬁrst route can be served by route 6. Therefore, we need to erase the ﬁrst route from R.In Figure3(b), the second route (2, 3) can be absorbed by three routes (routes 6, 8, and 9). According to equation (10), the probabilities of selecting the three routes 6, 8, and 9 are 0.5, 0.375, and 0.125, respectively. Assume that route 6 is selected. Then, the ODs (2-3) and demands (4) served by route 2 are assigned to route 6. As presented in Figure 3(c), route 6 serves three ODs (1-2, 1-3, 2-3), and the total demand is 12. In the following steps, routes 3, 4, and 5 are absorbed by routes 8, 9, and 7, separately.From Figure3, it can be seen that the number of routes in R is decreased from 9 to 4, but the travel demand served by each route is increased. After the absorption procedure, 3∗Nrou routes with high demands are selected as the input datasets for the following procedure, where Nrou is the number of routes in a solution set (predeﬁned according to Table 2).Table 2
Properties of ﬁve networks.
NetworkLocationVerticesEdgesNumber of routesVertices’ routeLBATT (min)MandlSwitzerland15214-82-810.0058Mumford0—3090122-1513.0121Mumford1Yubei702101510-3019.2695Mumford2Brighton1103855610-2222.1689Mumford3Cardiff1274256012-2524.7453


## 4.2.2. Combination Procedure

The combination procedure aims to construct new routes with pairs of routes inR. The basic principle of the combination procedure is to combine pairs of routes with high demands. In this way, we can simultaneously decrease the number of routes and increase the travel demands served by one route. Before constructing new routes, pairs of routes are selected. The selection of one pair of routes relies on the relationship between two routes. In the light of the positions of vertices shared by two routes, the relationships between two routes can be classified into six types. Figure 4 shows the six types and their combined results.Figure 4
Six kinds of route relationships and their corresponding combined results.If two routes fall into types of 1, 2, 3, or 5, then these two routes can be combined. The combination procedure is composed of five steps:Step 1. Sort the routes in R in descending order based on the transit demand of each route. Let M be the total number of routes in R and set m = 1. For example, the routes in Figure 3 are sorted and given in Figure 5(a).Step 2. Find all the routes (except route m) that can combine with route m. Let Z be the set of routes that can combine with route m. If m = M, go to Step 5; otherwise, go to Step 3.Step 3. If Z is empty, set m = m + 1, and return to Step 2; otherwise, according to the travel demands served by routes in Z, a probability pz is distributed to each route z and depicts the probability of each route to be selected as the route to combine with route m. The probability of selecting route z is computed by(11)pz=Dz+Dm∑i∈Zi+Dm.Step 4. Use the roulette wheel selection method to choose a route from Z based on the values of probabilities pz. As soon as a route z is selected, route m and route z are combined into a new route according to Figure 4. The new route serves the travel demands and ODs of both routes. Then, we should delete routes m and z from R and return to Step 2.Step 5. Sort routes again in R in descending order by the transit demand of each route. The initial route set is formed of the ﬁrst Nrou (the number of routes in a route set) feasible routes in R. Check the feasibility of the initial route set by using feasibility checks described in Section 4.3.Figure 5
Illustration of combination procedure. (a) Route 1 + 6. (b) New route 1 + 2. (c) None.
(a)(b)(c)An example for the combination procedure using the output of the absorption example is shown in Figure5. First, the routes are sorted in descending order based on the travel demand served directly by each route. The relationship between the ﬁrst route and other routes are determined, that is, routes 1 and 2 fall into type 1, routes 1 and 3 belong to type 1, and routes 1 and 4 are in type 2. With the aid of equation (11), the probabilities of selecting these three routes are 0.36, 0.33, and 0.30. We assume that route 2 is chosen to combine with route 1, and the new route is constructed according to Figure 4. It should be noted that the demand covered by the new route is doubled. The total route length of R is also decreased from 36 minutes to 34 minutes. The number of routes also decreases from 4 to 3, as shown in Figure 5(b). Similarly, in Figure 5(b), routes 1 and 2 are combined.From Figure5, it is not uncommon that not only the number of routes in R is decreased from 4 to 2, but also the travel demand served by each route is increased. Hence, the result of the combination procedure can be used as an initial route set for optimization algorithms.


## 4.3. Feasibility Checks

The TNDP is a multiconstrained problem, and the feasibility of the solutions should be checked carefully. Inspired by [27, 31], our proposed feasibility checks are detailed as follows:(1)
Route feasibility check: check if every route is feasible, that is, no repeated vertices appear in a route, and the number of vertices in a route must be within a predeﬁned range.(2)
Route uniqueness check: if one route is the same as a segment of another route or another entire route, we regard this route as nonunique. As a result, this route is directly eliminated.(3)
Area coverage check: check if all the vertices appear in the solution set at least once. This process constructs an appeared-vertex list by searching all the routes and checks if every vertex appears in the list.(4)
Network connectivity check: the purpose of this procedure is to determine whether a route is connected to the transit network.After feasibility checks, a repair mechanism is applied to repair infeasible solutions. It should be noted that the generated initial solutions are always feasible for the ﬁrst two feasibility checks. Only infeasible initial solutions which fail area coverage check are repaired. Other infeasible solutions (network connectivity check) are simply discarded during initial solution generation and the initial route set generation algorithm is called again. The repair mechanism for initial solutions is described as follows.The repair mechanism randomly selects a route from the solution and then applies insert operation. The insert operation constructs a list of candidate nodes by searching all positions and checking the existence of the edges (in the origin graph) between the used and unused nodes of the modiﬁed route, and then it randomly selects one of the candidate nodes and inserts it into the route. The above procedure is repeated until all nodes can be found in the route set. If there are nodes that cannot be inserted into the initial route set, this solution is discarded. Note that this procedure is also applied to the output solutions of route set size alternating heuristic.


## 4.4. Route Operators

Due to the complex structure of the route set, one crossover and three mutation operators are designed to facilitate the generation of offspring.The route crossover operator is developed to exchange two routes between two individuals. Each individual of the current generation is selected in turn as the ﬁrst parent. The second parent is randomly determined. Then, two routes from each parent are randomly determined and exchanged.Three mutation operators, namely, the sequence, insert, and delete mutation operators, are proposed in this study to mutate the route structure of an individual. Speciﬁcally, the sequence mutation operator is developed to replace a random sequence of a route with ak-th shortest path. For the inserted mutation operator, all the positions in the route will be checked to determine whether there exists a vertex that can be connected to two adjacent vertices in the route with only two edges. Then, a suitable vertex will be randomly selected and inserted into the route. Comparatively, the delete mutation operator constructs a candidate list of vertices and randomly deletes a vertex.Before a crossover/mutation operation is made, the result of crossover/mutation will be checked for route feasibility and route uniqueness. If these checks return true, the crossover/mutation is made. The solutions are feasible for the ﬁrst two checks all the time. After all solutions go through crossover and mutations, the last two feasibility checks are performed for child solutions.If the area coverage constraint is not satisﬁed, a route in the child solution is selected from the solution and then insert operation is applied. The insert operation constructs a list of candidate nodes by searching all positions and checking the existence of the edges (in the origin graph) between the used and unused nodes of the modiﬁed route, and then it randomly selects one of the candidate nodes and inserts it into the route. The above procedure is repeated until all unused nodes are inserted. If there are nodes that cannot be inserted into the child solution, the child solution is replaced by its parent.If the subgraph deﬁned by a child solution is not connected, the child solution is substituted by its parent.


## 4.5. Route Set Size Alternating Heuristic

As mentioned before, the route set size is regarded as an endogenous variable. Therefore, for every individual that survives into the next generation, a descent route set size alternating heuristic is employed to change the route set size. To ensure eﬃciency and secure potential individuals, only individuals who have not been improved for a predeﬁned number of generations (set as 5 in this article) will go through this heuristic. The proposed route set size alternating heuristic comprises two procedures: route addition and route deletion. For each selected route set, either route addition or route deletion is randomly selected with the same probability. Solutions going through this heuristic are checked for area coverage constraint and repaired when necessary using the repair mechanism described in Section4.3. If the solution is not feasible after repair, the changes made by route set size alternating heuristic are undone. The process of this heuristic is detailed as follows.


### 4.5.1. Route Addition

For each route setR, a deviation ratio is calculated for every nonzero transit demand to estimate the quality of their trips. Then, the OD pairs with a low service quality are selected. Finally, the greedy algorithm proposed by Nikolic and Teodorovic [16] is used to determine the most suitable route to add into the route set R.The quality indicator for passengers between verticesi and j is deﬁned as follows:(12)ΔijR=tijRtijG.Using routes ofR, this represents a deviation ratio of the minimum travel time from the theoretical best value (which only depends on the road network G). tijR is computed by using an all-or-nothing assignment approach, and tijG is the in-vehicle travel time of the shortest path in G between vertices i and j. According to this formulation, lower values of ΔijR are desired. Then, the OD pairs with a high value of ΔijR are considered as not well served. The set of these OD pairs can be derived as follows:(13)S=i,jΔijR≥threshold.The OD pair that has the highest value ofdsi,j is used to generate the most suitable route. This route is obtained by connecting this OD pair with the shortest path. By inserting this route into R, we can increase the percentage of the satisﬁed travel demand with zero transfer.


### 4.5.2. Route Deletion

The route deletion procedure is proposed to delete one route from the route setR. This procedure is based on the analysis of the allocation of each travel demand. The route deletion procedure works in the following way. For each route set R that is selected to perform the route deletion procedure, the route whose removal from the route set has the least inﬂuence on the quality of the current route set is determined. Then, this route should be deleted from the route set R. Based on the analysis of the allocation of each transit demand, every route rk is assigned a weight wk, which reﬂects the importance of each route. And this weight is calculated as follows:(14)wk=∑i,j∈V2tijrkdijTk,where Tk is the round-trip time of route rk. dij is the transit demand per unit time from vertex i to vertex j. tijrk represents the in-vehicle travel time on route rk for passengers traveling between vertices i and j. The value of tijrk is obtained as follows:(1)
If there is a direct service between verticesi and j using route rk, the tijrk value is the in-vehicle travel time.(2)
If the passengers between verticesi and j cannot complete their trips with only route rk, the tijrk value is the in-vehicle travel time from the boarding/alighting stop to the transfer stop on route rk.(3)
If the passengers between verticesi and j can complete their trips without route rk, the tijrk value is 0.This deﬁnition has signiﬁcant implications: (i) more passengers and longer in-vehicle travel time spent on routerk mean more contribution to the weight wk; (ii) the weight of route rk rapidly diminishes when the length route rk increases. After the weight calculation procedure, the least important route is determined and removed from the route set R.


## 4.5.1. Route Addition

For each route setR, a deviation ratio is calculated for every nonzero transit demand to estimate the quality of their trips. Then, the OD pairs with a low service quality are selected. Finally, the greedy algorithm proposed by Nikolic and Teodorovic [16] is used to determine the most suitable route to add into the route set R.The quality indicator for passengers between verticesi and j is deﬁned as follows:(12)ΔijR=tijRtijG.Using routes ofR, this represents a deviation ratio of the minimum travel time from the theoretical best value (which only depends on the road network G). tijR is computed by using an all-or-nothing assignment approach, and tijG is the in-vehicle travel time of the shortest path in G between vertices i and j. According to this formulation, lower values of ΔijR are desired. Then, the OD pairs with a high value of ΔijR are considered as not well served. The set of these OD pairs can be derived as follows:(13)S=i,jΔijR≥threshold.The OD pair that has the highest value ofdsi,j is used to generate the most suitable route. This route is obtained by connecting this OD pair with the shortest path. By inserting this route into R, we can increase the percentage of the satisﬁed travel demand with zero transfer.


## 4.5.2. Route Deletion

The route deletion procedure is proposed to delete one route from the route setR. This procedure is based on the analysis of the allocation of each travel demand. The route deletion procedure works in the following way. For each route set R that is selected to perform the route deletion procedure, the route whose removal from the route set has the least inﬂuence on the quality of the current route set is determined. Then, this route should be deleted from the route set R. Based on the analysis of the allocation of each transit demand, every route rk is assigned a weight wk, which reﬂects the importance of each route. And this weight is calculated as follows:(14)wk=∑i,j∈V2tijrkdijTk,where Tk is the round-trip time of route rk. dij is the transit demand per unit time from vertex i to vertex j. tijrk represents the in-vehicle travel time on route rk for passengers traveling between vertices i and j. The value of tijrk is obtained as follows:(1)
If there is a direct service between verticesi and j using route rk, the tijrk value is the in-vehicle travel time.(2)
If the passengers between verticesi and j cannot complete their trips with only route rk, the tijrk value is the in-vehicle travel time from the boarding/alighting stop to the transfer stop on route rk.(3)
If the passengers between verticesi and j can complete their trips without route rk, the tijrk value is 0.This deﬁnition has signiﬁcant implications: (i) more passengers and longer in-vehicle travel time spent on routerk mean more contribution to the weight wk; (ii) the weight of route rk rapidly diminishes when the length route rk increases. After the weight calculation procedure, the least important route is determined and removed from the route set R.


## 5. Experimental Results

To illustrate the effectiveness of the proposed initial route set generation algorithm and demonstrate the effectiveness of the route set size alternating heuristic on solution quality, in this section, various experiments have been conducted and these solutions are systematically compared with existing published results. The proposed algorithms are tested on Mandl’s benchmark network [25] and four larger instances in Mumford [27]. Table 2 gives a brief description of these ﬁve networks. The solutions are evaluated by the percentages of satisﬁed demand with 0, 1, and 2 transfers (d0, d1, d2), the percentages of unsatisﬁed demand (dun), and the average travel time (ATT), as well as the total route length (TRL). All the experiments are performed on a standard PC that has an Intel Core i5-3470 chip with 3.20 GHz and 8 GB RAM.The number of individuals in a generation is set to 20. The probabilities of all four route operators are set to 1/|R|, 1/|R|, 0.005, and 0.005. NSGA-II terminates when the approximate Pareto fronts are not improved for 100 generations.


### 5.1. Effect of the Proposed Initial Route Set Generation Algorithm

To illustrate the effectiveness of the proposed initial route set generation algorithm, we compare our initial solutions with reported initial solutions for Mandl’s network [25] and Mumford’s large networks [27].


#### 5.1.1. Mandl’s Network

In this section, we compare our initial solutions with reported initial solutions in Nikolic and Teodorovic [14, 16] for Mandl’s network. Initial route sets that contain 4, 6, 7, and 8 routes for Mandl’s network were obtained. Other initialization procedures mentioned in the literature review are not compared, since the initial solutions produced by their methods are not reported in their works. The solutions are plotted on the two-dimensional space deﬁned by the objectives (ATT and TRL). Note that the 4-route solution in Nikolic and Teodorovic [16] is not plotted as it is not feasible.In Figure6, it can be seen that the initial solutions obtained by the proposed algorithm have small values of ATT, while other solutions have small values of TRL. The results from greedy algorithm have a better trade-off in terms of both objective function values. However, the greedy algorithm can only produce one speciﬁc solution for a network and |R| since it contains no randomization. Greedy algorithm may not be suitable for population-based optimization algorithms which require multiple different initial solutions.Figure 6
Comparisons of the initial solutions for Mandl’s network. (a) |R| = 4. (b) |R| = 6. (c) |R| = 7. (d) |R| = 8.
(a)(b)(c)(d)Table3 compares our initial solutions for Mandl’s network with other approaches in terms of six parameters (i.e., d0, d1, d2, dun, ATT, and TRL). It can be seen that the initial solutions obtained by RCA have better values of ATT than the ones in Nikolic and Teodorovic [16] and Kilic and Gok [14]. 4-route solution in Nikolic and Teodorovic [16] has a smaller ATT. However, 6.96% demand are unsatisﬁed in that solution. On the other hand, the initial solutions of Nikolic and Teodorovic [16] and Kilic and Gok [14] have lower values of TRL. For the initial route sets, the increase of the number of routes |R| has a direct impact on the values of ATT and TRL. For example, when |R| increases from 4 to 8, the value of ATT of the solutions acquired by RCA gradually decreases from 11.01 to 10.12, while the TRL value increases from 116 to 259. It should be noted that the values of d2 and dun in all the initial solutions acquired by RCA are zero. This indicates that all the passengers can reach their destination with at most one transfer.Table 3
Initial solutions for Mandl’s network compared to other approaches.
|R|ParametersNikolic and Teodorovic [16]Kilic and Gok [14]RCA4d0 (%)80.4777.7191.71d1 (%)12.3320.38.29d2 (%)0.511.990dun (%)6.6900ATT10.2212.5711.01TRL991141166d0 (%)87.7383.7595.57d1 (%)11.7515.224.43d2 (%)0.511.030dun (%)0.0000ATT11.0311.6510.27TRL1351351727d0 (%)90.6275.4797.5d1 (%)8.8621.512.5d2 (%)0.513.020dun (%)0.0000ATT10.5711.8910.16TRL1521512068d0 (%)91.9185.3698.46d1 (%)7.5814.191.54d2 (%)0.510.450dun (%)0.0000ATT10.4710.910.12TRL166195259


#### 5.1.2. Mumford’s Networks

In this section, we further compare our initial solutions for Mumford’s large networks with existing initial solutions [14]. Other initialization procedures are not compared, since the initial solutions of their methods are not reported in their works. We also plot the ﬁnal solutions in Mumford [27] and Kilic and Gok [14] for four larger networks.In Figure7, the initial solutions generated by the proposed algorithm outperform other initial solutions in terms of both objectives. The initial solutions generated by the proposed algorithm have similar TRL values, and the ATT values of our results are generally smaller than the initial solutions in Kilic and Gok [14]. Note that for network Mumford2 and network Mumford3, the initial solutions produced by the proposed algorithm are even better than the ﬁnal solutions in Mumford [27] and Kilic and Gok [14], which implies that the proposed initial route set generation algorithm can produce high-quality initial solutions for large networks. For network Mumford3, some initial solutions produced by Kilic and Gok [14] are also dominating the ﬁnal solution produced by Mumford [27]. The initial solutions used in Mumford [27] are randomly generated to encourage coverage and connectivity of the route network. The importance of the initial route set generation algorithm may be overlooked.Figure 7
Comparisons of the initial solutions for Mumford’s networks. (a) Mumford0 (|R| = 12). (b) Mumford1 (|R| = 15). (c) Mumford2 (|R| = 56). (d) Mumford3 (|R| = 60).
(a)(b)(c)(d)We further compare the initial solutions in Kilic and Gok [14] and ours for Mumford’s networks in terms of six parameters (i.e., d0, d1, d2, dun, ATT, and TRL). The results are integrated and presented in Table 4. The number of routes in a solution is set as the recommended value in Table 2.Table 4
Initial solutions for Mumford’s networks compared to Kilic and Gok [14].
ParametersMumford0Mumford1Mumford2Mumford3Kilic and Gok [14]RCAKilic and Gok [14]RCAKilic and Gok [14]RCAKilic and Gok [14]RCAd0 (%)45.857.7230.6835.127.3339.5925.1838.28d1 (%)49.1237.9747.4853.8356.1857.1151.2356.14d2 (%)5.084.3119.4310.2315.763.2920.515.58dun (%)002.410.840.7303.080.01ATT18.2316.7327.6525.4128.2726.4431.0729.24TRL535498136310354482421056685151From the results in Table4, it can be seen that the solutions obtained by RCA are better than the ones obtained by Kilic and Gok [14] in terms of both objectives (i.e., ATT and TRL). Compared to the solutions in Kilic and Gok [14], the solutions obtained by RCA for the four networks can reduce the ATT by 8.23%, 8.10%, 6.46%, and 5.88%, respectively, and reduce the TRL by 6.92%, 24.06%, 6.07%, and 9.12%, separately. These results demonstrate that the RCA can signiﬁcantly improve the quality of the initial solutions for large networks when compared with the initial procedure proposed by Kilic and Gok [14]. Therefore, the RCA is used in the following experiments to generate high-quality initial solutions for the optimization procedure.We also compare the computation time reported in Kilic and Gok [40] and ours to further display the superiority of the proposed algorithm. The corresponding outcomes are depicted in Table 5. Notwithstanding the difference of data structure and subroutines, it can be seen that RCA is very eﬃcient, as it takes only 3 seconds to generate an initial solution for the largest network (i.e., Mumford3). On the contrary, the computation time for network Mumford3 in Kilic and Gok [14] is 8 hours. The computation resource needed for RCA is negligible.Table 5
Comparison of computation time of initialization procedures.
NetworkMandl-8Mumford0Mumford1Mumford2Mumford3Kilic and Gok [14] (minutes)0.010.6930.82253.48484.83RCA (seconds)0.0650.030.482.23.07


### 5.2. Effect of the Route Set Size Alternating Heuristic

This experiment compares the approximate Pareto fronts obtained from the NSGA-II with and without a route set size alternating heuristic. To make the comparison as fair as possible, the NSGA-II with variable |R| starts with the same initial solutions for the NSGA-II with ﬁxed |R| in Table 2 (for Mandl’s network, |R| = 6).


#### 5.2.1. Mandl’s Network

Figures8(a)–8(e) compare the results of the NSGA-II with variable |R| and ﬁxed |R|. An immediate observation is that the approximate Pareto fronts are very close. When |R| increases, the best ATT value decreases as expected, while the corresponding TRL value increases. For the NSGA-II with variable |R|, the theoretical best value of ATT (10.0058) is reached when |R| = 19, and all passengers can travel with the shortest path. This is the ﬁrst time a transit network with theoretical ATT is presented for Mandl’s network.Figure 8
Approximate Pareto fronts generated by the NSGA-II with variable and ﬁxed |R| for Mandl’s network. (a) Fixed |R| = 4. (b) Fixed |R| = 5. (c) Fixed |R| = 6. (d) Fixed |R| = 7. (e) Fixed |R| = 8. (f) Fixed |R| = 4 − 8.
(a)(b)(c)(d)(e)(f)In addition, Figure8(f) compares the approximate Pareto front obtained from the NSGA-II with and without a route set size alternating heuristic. The approximate Pareto front with ﬁxed |R| is obtained by comparing all the approximate Pareto fronts with |R| = 4 to |R| = 8. It can be seen that the NSGA-II with variable |R| performs as well as the NSGA-II with ﬁxed |R|. This shows that the NSGA-II with variable |R| leads to the same solution quality of the solutions obtained with ﬁxed |R|. Moreover, the NSGA-II with variable |R| can produce an approximate Pareto front with a wider range of trade-offs between the two objectives.Table6 summarizes the computation time of each NSGA-II. Note that the computation time is measured by the number of generations generated by each NSGA-II. As shown in Table 6, the computation time of NSGA-II with variable |R| is relatively close to that of the NSGA-II with ﬁxed |R|. However, to obtain the approximate Pareto fronts with different values of |R|, the NSGA-II with ﬁxed |R| must be performed many times with different values of |R|. As a result, for ﬁxed |R| approaches, the total computation time grows as the number of possible values of |R| increases. This suggests that the route set size alternating heuristic can save a large amount of computation time without deteriorating the quality of the approximate Pareto front obtained.Table 6
Computation time of the optimization procedure.
Computation timeAverageMinimumMaximumStd. dev.NSGA-II with variable |R|3244.916264500834.67NSGA-II with |R| = 41777.27642910745.49NSGA-II with |R| = 53317.8161758451407.82NSGA-II with |R| = 63762.2214158181386.76NSGA-II with |R| = 7290116904255941.41NSGA-II with |R| = 83113.5199656961246.36


#### 5.2.2. Mumford’s Networks

To assess the merits of our route set size alternation heuristic, we run the optimization algorithm for Mumford’s four networks with the same initial solutions. To make a fair comparison, each NSGA-II was terminated when 3000 generations were produced. The fixed value of |R| is set to the recommended value in Mumford [27]. The results are plotted on the two-dimensional space defined by both objectives in Figure 9.Figure 9
Approximate Pareto fronts generated by the NSGA-II with variable and fixed |R| for Mumford’s networks. (a) Mumford0. (b) Mumford1. (c) Mumford2. (d) Mumford3.
(a)(b)(c)(d)In Figure9, the first observation is that two curves contact at some points. The joint points represent the best solutions from the passenger’s perspective with predeﬁned |R|. The operator’s best solutions with fixed |R| are dominated by the results with variable |R| except the solution for Mumford0. Specifically, for network Mumford0 (i.e., Figure 9(a)), the solutions with fixed |R| coincide with the lower part of the other curve; for network Mumford1 (i.e., Figure 9(b)), the approximate Pareto front of ﬁxed |R| is overlapped with the one with variable |R| on the upper part. As shown in Figure 9(c), the overlapped solutions are few. One interesting observation in Figures 9(c) and 9(d) is that the overlapped solutions locate on the upper part of the curve, rather than on the middle area. This is result of a larger |R|, which also reinforces the idea that it is difficult to select a suitable |R| for the best solution to TNDP.Generally, the NSGA-II with fixed |R| can produce high-quality solutions, but most of these solutions are dominated by solutions with a small |R|. As a result, the NSGA-II with ﬁxed |R| needs to be executed many times with different values of |R| to produce the same approximate Pareto front generated by the NSGA-II with variable |R|. However, when the network grows in size, the evaluation of one solution will take a great deal of time, and there are more values of |R| to be searched. As a result, a decision maker is forced to compromise on solution quality and computation resource. Note that all the results are produced by a single run of the NSGA-II.Table7 further presents the computation time for Mumford’s networks. The computation times with variable |R| are generally larger than the ones with ﬁxed |R| because NSGA-II with variable |R| has to search solution space with larger |R| values than the recommended value. To produce the same Pareto front, NSGA-II with fixed |R| has to be run many times with different input values for |R|. The total computation time scales with the range of |R|. In practice, the NSGA-II with variable |R| is easier to implement.Table 7
Computation time of optimization procedure for Mumford’s networks.
NetworkMumford0Mumford1Mumford2Mumford3NSGA-II with fixed |R| (h)0.2621.841818.634282.0615NSGA-II with variable |R| (h)1.7822.241167.3288179.038


### 5.3. Comparison with Existing Published Results

To further demonstrate the feasibility and effectiveness of the proposed algorithms, we systematically compare final solutions with existing published results for Mandl’s network and Mumford’s large networks.


#### 5.3.1. Mandl’s Network

In Figure10, we compare the ﬁnal solutions for Mandl’s network with the previously published results in Fan and Mumford [41], Mumford [27], Chew et al. [32], Nikolic and Teodorovic [16], Kilic and Gok [40], Kilic and Gok [14], Kilic [42], John et al. [43], Kechagiopoulos and Beligiannis [13], Ahmed et al. [38], Buba and Lee [36], and Buba and Lee [37]. The approximate Pareto fronts of Kilic [42] and John et al. [43] plotted in Figure 10 are obtained via private communication.Figure 10
Comparison with previously published results for Mandl’s network.From Figure10, it can be seen that our results determined by varying the value of |R| are competitive with other results. In general, our results are quite similar to the combined approximate Pareto front in Kilic [42] and the results in John et al. [43]. The ATT of our best 8-route solution is 10.09, which is almost the same as the ATT values in Nikolic and Teodorovic [16] (i.e., 10.09) and Ahmed et al. [38] (i.e., 10.08). However, their TRL values are, respectively, 288 and 272 minutes, which are much larger than ours (i.e., 233 minutes). Tables 8 and 9 separately compare the detailed performance indicators of the solutions in Figure 10 from the perspectives of passenger and operator.Table 8
Passenger perspective results compared to other approaches for Mandl’s networks.
|R|IndicatorsFan and Mumford [41]Mumford [27]Chew et al. [32]Kılıç and Gök [40]Kılıç and Gök [14]Nikolić and Teodorović [16]Kechagiopoulos and Beligiannis [13]John et al. [43]Kılıç [42]Ahmed and Lee [36]Ahmed and Lee [37]Ahmed et al. [38]NSGA-II with variable |R|4d0 (%)93.2690.4391.8491.8491.3392.191.84—91.291.4692.2391.8491.07d1 (%)6.749.578.168.168.167.197.64—8.88.547.718.158.22d2 (%)00000.510.710.51—000.0600.71dun (%)0000000—00000ATT11.3710.5710.510.7110.5610.5110.64—10.510.810.8410.4810.56TRL147149150129137146a150b—1401331511481246d0 (%)91.5295.3896.7992.8195.595.6396.21—96.497.2494.9397.1796.92d1 (%)8.484.563.216.874.54.373.47—3.62.765.072.823.08d2 (%)00.0600.32000.32—00000dun (%)0000000—00000ATT10.4810.2710.2110.4510.2910.2310.2310.2210.2510.1610.510.1810.19TRL215221224190216224a203b2111802232322121957d0 (%)93.3296.4798.0194.3597.0498.5297.17—96.6697.3791.8498.8497.43d1 (%)6.363.341.995.142.831.482.83—3.342.638.161.152.57d2 (%)0.320.1900.510.1300—00000dun (%)0000000—00000ATT10.4210.2210.1610.3610.2310.1510.16—10.210.2110.6210.110.15TRL231264239223274247a234b—2292352372502098d0 (%)94.5497.5699.0495.1298.4698.9797.75—98.5298.294.5499.1698.59d1 (%)5.462.310.964.561.541.032.25—1.481.85.460.831.41d2 (%)00.1300.32000—00000dun (%)0000000—00000ATT10.3610.1710.1110.9610.1910.0910.13—10.110.3110.3210.0810.09TRL283291256217263288a283b—234244251272233Table 9
Operator perspective results compared to other approaches for Mandl’s network.
|R|IndicatorsMumford [27]Chew et al. [32]John et al. [43]Kılıç [42]Ahmed and Lee [36]Ahmed et al. [38]NSGA-II with fixed |R|NSGA-II with variable |R|4d0 (%)61.0861.08—48.8161.08—56.6547.40d1 (%)36.6136.61—45.5436.61—41.5546.05d2 (%)2.312.31—5.332.31—1.806.55dun (%)00—0.320—00.00ATT13.8813.88—14.6713.88—13.2915.49TRL6363—6363—6865.006d0 (%)70.9170.91—70.9170.4662.2363.84|R| = 3d1 (%)25.525.5—25.524.3427.1627.62d2 (%)2.952.95—2.955.29.578.09dun (%)0.640.64—0.6401.030.45ATT13.4813.4813.4813.4812.614.2814.19TRL636363636363697d0 (%)65.1370.65—70.6568.96—57.55d1 (%)22.9321.13—21.1326.29—33.27d2 (%)10.347.13—7.133.92—8.73dun (%)1.611.09—1.090.83—0.45ATT14.2513.76—13.7613.46—13.92TRL6363—6363—718d0 (%)57.9361.91—43.9360.76—36.48d1 (%)31.9229.67—21.5225.63—44.32d2 (%)9.76.87—14.9610.34—11.11dun (%)0.451.54—19.593.26—8.09ATT14.4514.22—17.9514.78—15.76TRL6363—6363—70In Table8, we compare our results with former research studies in terms of d0, d1, d2, dun, ATT, and TRL. The presented solutions of our work are selected from the obtained approximate Pareto front generated by NSGA-II with variable |R|. The TRL values of Nikolic and Teodorovic [16] and Kechagiopoulos and Beligiannis [13] are obtained through our evaluation functions since they did not report these values.From Table8, the proposed solution method outperforms most of the former results. The ATT values of our method are very close to the smallest ATT values in four cases. For 4-route solutions, the best ATT (obtained by Ahmed et al. [38]) is 10.48 which is slightly smaller than ours (i.e., 10.56). However, our solution does have a much smaller TRL value (i.e., 124) when compared with the result (i.e., 148) in Ahmed et al. [38]. For 6-route solutions, the best ATT (obtained by Buba and Lee [36]) is 10.16, which is slightly smaller than ours (i.e., 10.19). The difference is less than 1%. On the contrary, the TRL of our solution is 195 (i.e., 12% less than 223). From the passenger’s perspective, our solution method is competitive with other approaches in the literature.Among 12 existing research studies mentioned above, only Mumford [27], Chew et al. [32], John et al. [43], Kilic and Gok [14], Buba and Lee [36], and Ahmed et al. [38] reported best solutions from the operator’s perspective. Hence, to enhance the compatibility, we compare our results with existing literature [14, 27, 32, 36, 38, 43] in Table 9. Recall that the |R| value is not predefined. As a result, there is only one best solution from the operator’s perspective (in the last column in Table 9). So, we supplement the best solutions from NSGA-II with ﬁxed |R| in Figure 8.The results of the proposed NSGA-II with ﬁxed |R| are less impressive than other literature. Our operator’s costs are close to the lower bound of TRL. This is because the objective of our search algorithm is to search for the approximate Pareto front, instead of optimizing the passenger and/or operator cost. Generally, the best TRL values of our results are slightly larger than the lower bound of TRL (i.e., 12%). The best result for operator obtained from NSGA-II with variable |R| contains only 3 routes.


#### 5.3.2. Mumford’s Networks

Figure11 compares the obtained approximate Pareto front with recently published results for Mumford’s larger networks in Mumford [27], Kilic and Gok [14], Kilic [42], John et al. [43], Buba and Lee [36], Nayeem et al. [15], and Ahmed et al. [38]. The approximate fronts obtained by John et al. [43] and Kilic [42] are obtained via private communication. Note that the results of Nayeem et al. [15] are obtained by evaluating the reported ﬁnal solution in their work (the only feasible route set is for network Mumford1).Figure 11
Comparison with previously published results for Mumford’s networks. (a) Mumford0. (b) Mumford1. (c) Mumford2. (d) Mumford3.
(a)(b)(c)(d)From Figure11, it can be seen that for network Mumford0, the obtained front has a large duplication with former results. When network size grows, the gap between the obtained front and former results gets larger. This implies that our method has an advantage over large networks. The approximate Pareto fronts acquired by our method cover a larger area than other results because the |R| value is not predeﬁned. Tables 10 and 11 summarize the detailed performance indicators of the best solutions from the perspectives of both the passenger and the operator in Figure 11.Table 10
Passenger perspective results compared to other approaches for Mumford’s networks.
NetworkParametersMumford [27]Nayeem et al. [15]Kılıç and Gök [14]John et al. [43]Kılıç [42]Ahmed and Lee [36]Ahmed et al. [38]NSGA-II with variable |R|Mumford0d0 (%)63.2—69.73—66.8865.4188.7498.77d1 (%)35.82—30.03—32.7634.2411.251.23d2 (%)0.98—0.24—0.370.3500dun (%)0—0—0000ATT16.05—14.9914.9915.4315.2714.0913.19TRL759—7076965876737222212Mumford1d0 (%)36.638.7745.1—40.838.7765.7571.04d1 (%)52.4255.4549.08—52.4654.2334.1828.96d2 (%)10.715.795.76—6.745.120.070dun (%)0.2600.06—01.8800ATT24.7923.7523.3322.9723.8223.1621.6921.19TRL20381301194419251659195519563315Mumford2d0 (%)30.92—33.88—29.1431.4756.6853.74d1 (%)51.29—57.18—60.2158.2343.2646.24d2 (%)16.36—8.77—10.489.60.050.02dun (%)1.44—0.17—0.170.700ATT28.65—26.8226.2127.6727.2825.1924.88TRL5632—502753263957526852575783Mumford3d0 (%)27.46—27.56—26.1728.1250.4156.32d1 (%)50.97—53.25—56.7854.3548.8143.48d2 (%)18.76—17.51—16.3716.840.770.2dun (%)2.81—1.68—0.680.6900ATT31.44—30.4128.7630.8730.1628.0527.27TRL6665—583464004373654761198668Table 11
Operator perspective results compared to other approaches for Mumford’s networks.
NetworkParametersMumford [27]John et al. [43]Kılıç [42]Ahmed and Lee [36]Ahmed et al. [38]NSGA-II with variable |R|Mumford0D0 (%)18.42—25.5116.9914.6139.96D1 (%)23.4—16.5530.7231.5946.8d2 (%)20.78—21.3828.9236.4113.23dun (%)37.4—36.5523.3817.370ATT32.430.0640.833.4126.3225.23TRL111951121079495Mumford1d0 (%)16.35—19.722.3918.0229.08d1 (%)29.06—32.2940.5729.8842.01d2 (%)29.93—30.0134.3331.923.57dun (%)24.66—182.7120.195.34ATT34.6947.1441.6731.1539.4546.75TRL568448572567408276Mumford2d0 (%)13.76—15.6215.3213.6316.06d1 (%)27.69—38.0729.3123.5841.25d2 (%)29.53—33.731.0823.9432.39dun (%)29.09—12.6224.2938.8210.29ATT36.5435.0835.8734.5246.8643.67TRL22441691207823051330497Mumford3d0 (%)16.71—14.2425.4216.2817.44d1 (%)33.69—33.4441.2624.8744.22d2 (%)29.18—34.124.9126.3431.19dun (%)20.42—18.228.4132.447.16ATT36.9246.5839.4234.8146.0545.11TRL28302030278227321746663In Table10, we compare our results from the passenger’s perspective with other methods for Mumford’s four larger networks. Note that the results of Nayeem et al. [15] are obtained by evaluating the reported ﬁnal solution in their work (the only feasible route set is for network Mumford1).From Table10, it can be seen that our proposed method with variable |R| outperforms the methods in Mumford [27], Nayeem et al. [15], Kilic and Gok [14], John et al. [43], Kilic [42], Buba and Lee [36], and Ahmed et al. [38] in terms of the ATT. The proposed solution method also found the best d0 in all instances except network Mumford2. The percentages of demand satisﬁed with at most one transfer (d0 + d1) are over 99% for all instances. Although the TRL values of our approach are generally larger than other approaches, a solution that dominates the results of existing methods in terms of both objectives can be found in Figure 11.Besides, Table11 compares our results from the operator’s perspective for Mumford’s four larger networks with recently published results in Mumford [27], John et al. [43], Kilic [42], Buba and Lee [36], and Ahmed et al. [38]. Our approach found the best results in networks Mumford1, Mumford2, and Mumford3 in terms of TRL. This is not unexpected, since the number of routes in our approach can be alternated by the route set size alternating heuristic as long as the solution is feasible. The best solution for network Mumford0 is obtained by Ahmed et al. [38]. The TRL of their result is one minute less than ours (i.e., 95 minutes). On the contrary, the ATT of our result is smaller than theirs, and all demands can be satisﬁed with our route set. Generally, the proposed solution method is competitive with existing approaches in terms of both objectives for larger instances.


### 5.4. Recommended Value of |R|

In the TNDP, it is difficult to state a suitable number of routes for the best solution [44]. By embedding a route set generation heuristic in a biobjective optimization framework, we try to find the approximate Pareto front without presetting |R|. The aim of this section is to demonstrate the efect of |R| on both objective values in the approximate Pareto fronts.Figure12 shows the |R| values of the approximate Pareto front solutions for ﬁve networks. As expected, both objectives are generally conﬂicting. With |R| increasing, the ATT decreases and the TRL increases at the same time. When |R| is reaching the theoretical largest value, the ATT will converge to the theoretical lowest value (shown in Table 2). When |R| is larger than the theoretical largest value, the increase of |R| will only lead to larger TRL but no decrease in the ATT. The ﬁgures reveal that when |R| reaches a certain value, a further increase in the |R| value can barely lead to decreasing of ATT. For example, for network Mumford3, the ATT decreases from 27.54 minutes to 27.29 minutes when |R| increases from 80 to 100, while the TRL increases from 6894 to 8688. This demonstrates that a large |R| is not always beneﬁcial to both the passenger and the operator.Figure 12
Effect of |R| on both objective functions in ﬁve networks. (a) Mandl’s network. (b) Mumford0. (c) Mumford1. (d) Mumford2. (e) Mumford3.
(a)(b)(c)(d)(e)From Figure12, it can be seen that the number of solutions with speciﬁc |R| in the approximate Pareto fronts is fairly small for four larger networks. This indicates that the best solutions with predeﬁned |R| are only a small part of the approximate Pareto front. The proposed approach with variable |R| is more practical and eﬃcient for large networks as the search process for large networks is computationally time consuming.Based on the observation of Figure12, we present a recommended range of the |R| value for each instance in Table 12. It should be noted that the recommended values are only meant for future researchers to limit the number of routes to avoid wasting computation resources on solutions with extreme trade-off level.Table 12
Recommended |R| values.
NetworkMandlMumford0Mumford1Mumford2Mumford3Recommended |R| range[3, 12][8, 30][4, 25][8, 42][10, 47]


## 5.1. Effect of the Proposed Initial Route Set Generation Algorithm

To illustrate the effectiveness of the proposed initial route set generation algorithm, we compare our initial solutions with reported initial solutions for Mandl’s network [25] and Mumford’s large networks [27].


### 5.1.1. Mandl’s Network

In this section, we compare our initial solutions with reported initial solutions in Nikolic and Teodorovic [14, 16] for Mandl’s network. Initial route sets that contain 4, 6, 7, and 8 routes for Mandl’s network were obtained. Other initialization procedures mentioned in the literature review are not compared, since the initial solutions produced by their methods are not reported in their works. The solutions are plotted on the two-dimensional space deﬁned by the objectives (ATT and TRL). Note that the 4-route solution in Nikolic and Teodorovic [16] is not plotted as it is not feasible.In Figure6, it can be seen that the initial solutions obtained by the proposed algorithm have small values of ATT, while other solutions have small values of TRL. The results from greedy algorithm have a better trade-off in terms of both objective function values. However, the greedy algorithm can only produce one speciﬁc solution for a network and |R| since it contains no randomization. Greedy algorithm may not be suitable for population-based optimization algorithms which require multiple different initial solutions.Figure 6
Comparisons of the initial solutions for Mandl’s network. (a) |R| = 4. (b) |R| = 6. (c) |R| = 7. (d) |R| = 8.
(a)(b)(c)(d)Table3 compares our initial solutions for Mandl’s network with other approaches in terms of six parameters (i.e., d0, d1, d2, dun, ATT, and TRL). It can be seen that the initial solutions obtained by RCA have better values of ATT than the ones in Nikolic and Teodorovic [16] and Kilic and Gok [14]. 4-route solution in Nikolic and Teodorovic [16] has a smaller ATT. However, 6.96% demand are unsatisﬁed in that solution. On the other hand, the initial solutions of Nikolic and Teodorovic [16] and Kilic and Gok [14] have lower values of TRL. For the initial route sets, the increase of the number of routes |R| has a direct impact on the values of ATT and TRL. For example, when |R| increases from 4 to 8, the value of ATT of the solutions acquired by RCA gradually decreases from 11.01 to 10.12, while the TRL value increases from 116 to 259. It should be noted that the values of d2 and dun in all the initial solutions acquired by RCA are zero. This indicates that all the passengers can reach their destination with at most one transfer.Table 3
Initial solutions for Mandl’s network compared to other approaches.
|R|ParametersNikolic and Teodorovic [16]Kilic and Gok [14]RCA4d0 (%)80.4777.7191.71d1 (%)12.3320.38.29d2 (%)0.511.990dun (%)6.6900ATT10.2212.5711.01TRL991141166d0 (%)87.7383.7595.57d1 (%)11.7515.224.43d2 (%)0.511.030dun (%)0.0000ATT11.0311.6510.27TRL1351351727d0 (%)90.6275.4797.5d1 (%)8.8621.512.5d2 (%)0.513.020dun (%)0.0000ATT10.5711.8910.16TRL1521512068d0 (%)91.9185.3698.46d1 (%)7.5814.191.54d2 (%)0.510.450dun (%)0.0000ATT10.4710.910.12TRL166195259


### 5.1.2. Mumford’s Networks

In this section, we further compare our initial solutions for Mumford’s large networks with existing initial solutions [14]. Other initialization procedures are not compared, since the initial solutions of their methods are not reported in their works. We also plot the ﬁnal solutions in Mumford [27] and Kilic and Gok [14] for four larger networks.In Figure7, the initial solutions generated by the proposed algorithm outperform other initial solutions in terms of both objectives. The initial solutions generated by the proposed algorithm have similar TRL values, and the ATT values of our results are generally smaller than the initial solutions in Kilic and Gok [14]. Note that for network Mumford2 and network Mumford3, the initial solutions produced by the proposed algorithm are even better than the ﬁnal solutions in Mumford [27] and Kilic and Gok [14], which implies that the proposed initial route set generation algorithm can produce high-quality initial solutions for large networks. For network Mumford3, some initial solutions produced by Kilic and Gok [14] are also dominating the ﬁnal solution produced by Mumford [27]. The initial solutions used in Mumford [27] are randomly generated to encourage coverage and connectivity of the route network. The importance of the initial route set generation algorithm may be overlooked.Figure 7
Comparisons of the initial solutions for Mumford’s networks. (a) Mumford0 (|R| = 12). (b) Mumford1 (|R| = 15). (c) Mumford2 (|R| = 56). (d) Mumford3 (|R| = 60).
(a)(b)(c)(d)We further compare the initial solutions in Kilic and Gok [14] and ours for Mumford’s networks in terms of six parameters (i.e., d0, d1, d2, dun, ATT, and TRL). The results are integrated and presented in Table 4. The number of routes in a solution is set as the recommended value in Table 2.Table 4
Initial solutions for Mumford’s networks compared to Kilic and Gok [14].
ParametersMumford0Mumford1Mumford2Mumford3Kilic and Gok [14]RCAKilic and Gok [14]RCAKilic and Gok [14]RCAKilic and Gok [14]RCAd0 (%)45.857.7230.6835.127.3339.5925.1838.28d1 (%)49.1237.9747.4853.8356.1857.1151.2356.14d2 (%)5.084.3119.4310.2315.763.2920.515.58dun (%)002.410.840.7303.080.01ATT18.2316.7327.6525.4128.2726.4431.0729.24TRL535498136310354482421056685151From the results in Table4, it can be seen that the solutions obtained by RCA are better than the ones obtained by Kilic and Gok [14] in terms of both objectives (i.e., ATT and TRL). Compared to the solutions in Kilic and Gok [14], the solutions obtained by RCA for the four networks can reduce the ATT by 8.23%, 8.10%, 6.46%, and 5.88%, respectively, and reduce the TRL by 6.92%, 24.06%, 6.07%, and 9.12%, separately. These results demonstrate that the RCA can signiﬁcantly improve the quality of the initial solutions for large networks when compared with the initial procedure proposed by Kilic and Gok [14]. Therefore, the RCA is used in the following experiments to generate high-quality initial solutions for the optimization procedure.We also compare the computation time reported in Kilic and Gok [40] and ours to further display the superiority of the proposed algorithm. The corresponding outcomes are depicted in Table 5. Notwithstanding the difference of data structure and subroutines, it can be seen that RCA is very eﬃcient, as it takes only 3 seconds to generate an initial solution for the largest network (i.e., Mumford3). On the contrary, the computation time for network Mumford3 in Kilic and Gok [14] is 8 hours. The computation resource needed for RCA is negligible.Table 5
Comparison of computation time of initialization procedures.
NetworkMandl-8Mumford0Mumford1Mumford2Mumford3Kilic and Gok [14] (minutes)0.010.6930.82253.48484.83RCA (seconds)0.0650.030.482.23.07


## 5.1.1. Mandl’s Network

In this section, we compare our initial solutions with reported initial solutions in Nikolic and Teodorovic [14, 16] for Mandl’s network. Initial route sets that contain 4, 6, 7, and 8 routes for Mandl’s network were obtained. Other initialization procedures mentioned in the literature review are not compared, since the initial solutions produced by their methods are not reported in their works. The solutions are plotted on the two-dimensional space deﬁned by the objectives (ATT and TRL). Note that the 4-route solution in Nikolic and Teodorovic [16] is not plotted as it is not feasible.In Figure6, it can be seen that the initial solutions obtained by the proposed algorithm have small values of ATT, while other solutions have small values of TRL. The results from greedy algorithm have a better trade-off in terms of both objective function values. However, the greedy algorithm can only produce one speciﬁc solution for a network and |R| since it contains no randomization. Greedy algorithm may not be suitable for population-based optimization algorithms which require multiple different initial solutions.Figure 6
Comparisons of the initial solutions for Mandl’s network. (a) |R| = 4. (b) |R| = 6. (c) |R| = 7. (d) |R| = 8.
(a)(b)(c)(d)Table3 compares our initial solutions for Mandl’s network with other approaches in terms of six parameters (i.e., d0, d1, d2, dun, ATT, and TRL). It can be seen that the initial solutions obtained by RCA have better values of ATT than the ones in Nikolic and Teodorovic [16] and Kilic and Gok [14]. 4-route solution in Nikolic and Teodorovic [16] has a smaller ATT. However, 6.96% demand are unsatisﬁed in that solution. On the other hand, the initial solutions of Nikolic and Teodorovic [16] and Kilic and Gok [14] have lower values of TRL. For the initial route sets, the increase of the number of routes |R| has a direct impact on the values of ATT and TRL. For example, when |R| increases from 4 to 8, the value of ATT of the solutions acquired by RCA gradually decreases from 11.01 to 10.12, while the TRL value increases from 116 to 259. It should be noted that the values of d2 and dun in all the initial solutions acquired by RCA are zero. This indicates that all the passengers can reach their destination with at most one transfer.Table 3
Initial solutions for Mandl’s network compared to other approaches.
|R|ParametersNikolic and Teodorovic [16]Kilic and Gok [14]RCA4d0 (%)80.4777.7191.71d1 (%)12.3320.38.29d2 (%)0.511.990dun (%)6.6900ATT10.2212.5711.01TRL991141166d0 (%)87.7383.7595.57d1 (%)11.7515.224.43d2 (%)0.511.030dun (%)0.0000ATT11.0311.6510.27TRL1351351727d0 (%)90.6275.4797.5d1 (%)8.8621.512.5d2 (%)0.513.020dun (%)0.0000ATT10.5711.8910.16TRL1521512068d0 (%)91.9185.3698.46d1 (%)7.5814.191.54d2 (%)0.510.450dun (%)0.0000ATT10.4710.910.12TRL166195259


## 5.1.2. Mumford’s Networks

In this section, we further compare our initial solutions for Mumford’s large networks with existing initial solutions [14]. Other initialization procedures are not compared, since the initial solutions of their methods are not reported in their works. We also plot the ﬁnal solutions in Mumford [27] and Kilic and Gok [14] for four larger networks.In Figure7, the initial solutions generated by the proposed algorithm outperform other initial solutions in terms of both objectives. The initial solutions generated by the proposed algorithm have similar TRL values, and the ATT values of our results are generally smaller than the initial solutions in Kilic and Gok [14]. Note that for network Mumford2 and network Mumford3, the initial solutions produced by the proposed algorithm are even better than the ﬁnal solutions in Mumford [27] and Kilic and Gok [14], which implies that the proposed initial route set generation algorithm can produce high-quality initial solutions for large networks. For network Mumford3, some initial solutions produced by Kilic and Gok [14] are also dominating the ﬁnal solution produced by Mumford [27]. The initial solutions used in Mumford [27] are randomly generated to encourage coverage and connectivity of the route network. The importance of the initial route set generation algorithm may be overlooked.Figure 7
Comparisons of the initial solutions for Mumford’s networks. (a) Mumford0 (|R| = 12). (b) Mumford1 (|R| = 15). (c) Mumford2 (|R| = 56). (d) Mumford3 (|R| = 60).
(a)(b)(c)(d)We further compare the initial solutions in Kilic and Gok [14] and ours for Mumford’s networks in terms of six parameters (i.e., d0, d1, d2, dun, ATT, and TRL). The results are integrated and presented in Table 4. The number of routes in a solution is set as the recommended value in Table 2.Table 4
Initial solutions for Mumford’s networks compared to Kilic and Gok [14].
ParametersMumford0Mumford1Mumford2Mumford3Kilic and Gok [14]RCAKilic and Gok [14]RCAKilic and Gok [14]RCAKilic and Gok [14]RCAd0 (%)45.857.7230.6835.127.3339.5925.1838.28d1 (%)49.1237.9747.4853.8356.1857.1151.2356.14d2 (%)5.084.3119.4310.2315.763.2920.515.58dun (%)002.410.840.7303.080.01ATT18.2316.7327.6525.4128.2726.4431.0729.24TRL535498136310354482421056685151From the results in Table4, it can be seen that the solutions obtained by RCA are better than the ones obtained by Kilic and Gok [14] in terms of both objectives (i.e., ATT and TRL). Compared to the solutions in Kilic and Gok [14], the solutions obtained by RCA for the four networks can reduce the ATT by 8.23%, 8.10%, 6.46%, and 5.88%, respectively, and reduce the TRL by 6.92%, 24.06%, 6.07%, and 9.12%, separately. These results demonstrate that the RCA can signiﬁcantly improve the quality of the initial solutions for large networks when compared with the initial procedure proposed by Kilic and Gok [14]. Therefore, the RCA is used in the following experiments to generate high-quality initial solutions for the optimization procedure.We also compare the computation time reported in Kilic and Gok [40] and ours to further display the superiority of the proposed algorithm. The corresponding outcomes are depicted in Table 5. Notwithstanding the difference of data structure and subroutines, it can be seen that RCA is very eﬃcient, as it takes only 3 seconds to generate an initial solution for the largest network (i.e., Mumford3). On the contrary, the computation time for network Mumford3 in Kilic and Gok [14] is 8 hours. The computation resource needed for RCA is negligible.Table 5
Comparison of computation time of initialization procedures.
NetworkMandl-8Mumford0Mumford1Mumford2Mumford3Kilic and Gok [14] (minutes)0.010.6930.82253.48484.83RCA (seconds)0.0650.030.482.23.07


## 5.2. Effect of the Route Set Size Alternating Heuristic

This experiment compares the approximate Pareto fronts obtained from the NSGA-II with and without a route set size alternating heuristic. To make the comparison as fair as possible, the NSGA-II with variable |R| starts with the same initial solutions for the NSGA-II with ﬁxed |R| in Table 2 (for Mandl’s network, |R| = 6).


### 5.2.1. Mandl’s Network

Figures8(a)–8(e) compare the results of the NSGA-II with variable |R| and ﬁxed |R|. An immediate observation is that the approximate Pareto fronts are very close. When |R| increases, the best ATT value decreases as expected, while the corresponding TRL value increases. For the NSGA-II with variable |R|, the theoretical best value of ATT (10.0058) is reached when |R| = 19, and all passengers can travel with the shortest path. This is the ﬁrst time a transit network with theoretical ATT is presented for Mandl’s network.Figure 8
Approximate Pareto fronts generated by the NSGA-II with variable and ﬁxed |R| for Mandl’s network. (a) Fixed |R| = 4. (b) Fixed |R| = 5. (c) Fixed |R| = 6. (d) Fixed |R| = 7. (e) Fixed |R| = 8. (f) Fixed |R| = 4 − 8.
(a)(b)(c)(d)(e)(f)In addition, Figure8(f) compares the approximate Pareto front obtained from the NSGA-II with and without a route set size alternating heuristic. The approximate Pareto front with ﬁxed |R| is obtained by comparing all the approximate Pareto fronts with |R| = 4 to |R| = 8. It can be seen that the NSGA-II with variable |R| performs as well as the NSGA-II with ﬁxed |R|. This shows that the NSGA-II with variable |R| leads to the same solution quality of the solutions obtained with ﬁxed |R|. Moreover, the NSGA-II with variable |R| can produce an approximate Pareto front with a wider range of trade-offs between the two objectives.Table6 summarizes the computation time of each NSGA-II. Note that the computation time is measured by the number of generations generated by each NSGA-II. As shown in Table 6, the computation time of NSGA-II with variable |R| is relatively close to that of the NSGA-II with ﬁxed |R|. However, to obtain the approximate Pareto fronts with different values of |R|, the NSGA-II with ﬁxed |R| must be performed many times with different values of |R|. As a result, for ﬁxed |R| approaches, the total computation time grows as the number of possible values of |R| increases. This suggests that the route set size alternating heuristic can save a large amount of computation time without deteriorating the quality of the approximate Pareto front obtained.Table 6
Computation time of the optimization procedure.
Computation timeAverageMinimumMaximumStd. dev.NSGA-II with variable |R|3244.916264500834.67NSGA-II with |R| = 41777.27642910745.49NSGA-II with |R| = 53317.8161758451407.82NSGA-II with |R| = 63762.2214158181386.76NSGA-II with |R| = 7290116904255941.41NSGA-II with |R| = 83113.5199656961246.36


### 5.2.2. Mumford’s Networks

To assess the merits of our route set size alternation heuristic, we run the optimization algorithm for Mumford’s four networks with the same initial solutions. To make a fair comparison, each NSGA-II was terminated when 3000 generations were produced. The fixed value of |R| is set to the recommended value in Mumford [27]. The results are plotted on the two-dimensional space defined by both objectives in Figure 9.Figure 9
Approximate Pareto fronts generated by the NSGA-II with variable and fixed |R| for Mumford’s networks. (a) Mumford0. (b) Mumford1. (c) Mumford2. (d) Mumford3.
(a)(b)(c)(d)In Figure9, the first observation is that two curves contact at some points. The joint points represent the best solutions from the passenger’s perspective with predeﬁned |R|. The operator’s best solutions with fixed |R| are dominated by the results with variable |R| except the solution for Mumford0. Specifically, for network Mumford0 (i.e., Figure 9(a)), the solutions with fixed |R| coincide with the lower part of the other curve; for network Mumford1 (i.e., Figure 9(b)), the approximate Pareto front of ﬁxed |R| is overlapped with the one with variable |R| on the upper part. As shown in Figure 9(c), the overlapped solutions are few. One interesting observation in Figures 9(c) and 9(d) is that the overlapped solutions locate on the upper part of the curve, rather than on the middle area. This is result of a larger |R|, which also reinforces the idea that it is difficult to select a suitable |R| for the best solution to TNDP.Generally, the NSGA-II with fixed |R| can produce high-quality solutions, but most of these solutions are dominated by solutions with a small |R|. As a result, the NSGA-II with ﬁxed |R| needs to be executed many times with different values of |R| to produce the same approximate Pareto front generated by the NSGA-II with variable |R|. However, when the network grows in size, the evaluation of one solution will take a great deal of time, and there are more values of |R| to be searched. As a result, a decision maker is forced to compromise on solution quality and computation resource. Note that all the results are produced by a single run of the NSGA-II.Table7 further presents the computation time for Mumford’s networks. The computation times with variable |R| are generally larger than the ones with ﬁxed |R| because NSGA-II with variable |R| has to search solution space with larger |R| values than the recommended value. To produce the same Pareto front, NSGA-II with fixed |R| has to be run many times with different input values for |R|. The total computation time scales with the range of |R|. In practice, the NSGA-II with variable |R| is easier to implement.Table 7
Computation time of optimization procedure for Mumford’s networks.
NetworkMumford0Mumford1Mumford2Mumford3NSGA-II with fixed |R| (h)0.2621.841818.634282.0615NSGA-II with variable |R| (h)1.7822.241167.3288179.038


## 5.2.1. Mandl’s Network

Figures8(a)–8(e) compare the results of the NSGA-II with variable |R| and ﬁxed |R|. An immediate observation is that the approximate Pareto fronts are very close. When |R| increases, the best ATT value decreases as expected, while the corresponding TRL value increases. For the NSGA-II with variable |R|, the theoretical best value of ATT (10.0058) is reached when |R| = 19, and all passengers can travel with the shortest path. This is the ﬁrst time a transit network with theoretical ATT is presented for Mandl’s network.Figure 8
Approximate Pareto fronts generated by the NSGA-II with variable and ﬁxed |R| for Mandl’s network. (a) Fixed |R| = 4. (b) Fixed |R| = 5. (c) Fixed |R| = 6. (d) Fixed |R| = 7. (e) Fixed |R| = 8. (f) Fixed |R| = 4 − 8.
(a)(b)(c)(d)(e)(f)In addition, Figure8(f) compares the approximate Pareto front obtained from the NSGA-II with and without a route set size alternating heuristic. The approximate Pareto front with ﬁxed |R| is obtained by comparing all the approximate Pareto fronts with |R| = 4 to |R| = 8. It can be seen that the NSGA-II with variable |R| performs as well as the NSGA-II with ﬁxed |R|. This shows that the NSGA-II with variable |R| leads to the same solution quality of the solutions obtained with ﬁxed |R|. Moreover, the NSGA-II with variable |R| can produce an approximate Pareto front with a wider range of trade-offs between the two objectives.Table6 summarizes the computation time of each NSGA-II. Note that the computation time is measured by the number of generations generated by each NSGA-II. As shown in Table 6, the computation time of NSGA-II with variable |R| is relatively close to that of the NSGA-II with ﬁxed |R|. However, to obtain the approximate Pareto fronts with different values of |R|, the NSGA-II with ﬁxed |R| must be performed many times with different values of |R|. As a result, for ﬁxed |R| approaches, the total computation time grows as the number of possible values of |R| increases. This suggests that the route set size alternating heuristic can save a large amount of computation time without deteriorating the quality of the approximate Pareto front obtained.Table 6
Computation time of the optimization procedure.
Computation timeAverageMinimumMaximumStd. dev.NSGA-II with variable |R|3244.916264500834.67NSGA-II with |R| = 41777.27642910745.49NSGA-II with |R| = 53317.8161758451407.82NSGA-II with |R| = 63762.2214158181386.76NSGA-II with |R| = 7290116904255941.41NSGA-II with |R| = 83113.5199656961246.36


## 5.2.2. Mumford’s Networks

To assess the merits of our route set size alternation heuristic, we run the optimization algorithm for Mumford’s four networks with the same initial solutions. To make a fair comparison, each NSGA-II was terminated when 3000 generations were produced. The fixed value of |R| is set to the recommended value in Mumford [27]. The results are plotted on the two-dimensional space defined by both objectives in Figure 9.Figure 9
Approximate Pareto fronts generated by the NSGA-II with variable and fixed |R| for Mumford’s networks. (a) Mumford0. (b) Mumford1. (c) Mumford2. (d) Mumford3.
(a)(b)(c)(d)In Figure9, the first observation is that two curves contact at some points. The joint points represent the best solutions from the passenger’s perspective with predeﬁned |R|. The operator’s best solutions with fixed |R| are dominated by the results with variable |R| except the solution for Mumford0. Specifically, for network Mumford0 (i.e., Figure 9(a)), the solutions with fixed |R| coincide with the lower part of the other curve; for network Mumford1 (i.e., Figure 9(b)), the approximate Pareto front of ﬁxed |R| is overlapped with the one with variable |R| on the upper part. As shown in Figure 9(c), the overlapped solutions are few. One interesting observation in Figures 9(c) and 9(d) is that the overlapped solutions locate on the upper part of the curve, rather than on the middle area. This is result of a larger |R|, which also reinforces the idea that it is difficult to select a suitable |R| for the best solution to TNDP.Generally, the NSGA-II with fixed |R| can produce high-quality solutions, but most of these solutions are dominated by solutions with a small |R|. As a result, the NSGA-II with ﬁxed |R| needs to be executed many times with different values of |R| to produce the same approximate Pareto front generated by the NSGA-II with variable |R|. However, when the network grows in size, the evaluation of one solution will take a great deal of time, and there are more values of |R| to be searched. As a result, a decision maker is forced to compromise on solution quality and computation resource. Note that all the results are produced by a single run of the NSGA-II.Table7 further presents the computation time for Mumford’s networks. The computation times with variable |R| are generally larger than the ones with ﬁxed |R| because NSGA-II with variable |R| has to search solution space with larger |R| values than the recommended value. To produce the same Pareto front, NSGA-II with fixed |R| has to be run many times with different input values for |R|. The total computation time scales with the range of |R|. In practice, the NSGA-II with variable |R| is easier to implement.Table 7
Computation time of optimization procedure for Mumford’s networks.
NetworkMumford0Mumford1Mumford2Mumford3NSGA-II with fixed |R| (h)0.2621.841818.634282.0615NSGA-II with variable |R| (h)1.7822.241167.3288179.038


## 5.3. Comparison with Existing Published Results

To further demonstrate the feasibility and effectiveness of the proposed algorithms, we systematically compare final solutions with existing published results for Mandl’s network and Mumford’s large networks.


### 5.3.1. Mandl’s Network

In Figure10, we compare the ﬁnal solutions for Mandl’s network with the previously published results in Fan and Mumford [41], Mumford [27], Chew et al. [32], Nikolic and Teodorovic [16], Kilic and Gok [40], Kilic and Gok [14], Kilic [42], John et al. [43], Kechagiopoulos and Beligiannis [13], Ahmed et al. [38], Buba and Lee [36], and Buba and Lee [37]. The approximate Pareto fronts of Kilic [42] and John et al. [43] plotted in Figure 10 are obtained via private communication.Figure 10
Comparison with previously published results for Mandl’s network.From Figure10, it can be seen that our results determined by varying the value of |R| are competitive with other results. In general, our results are quite similar to the combined approximate Pareto front in Kilic [42] and the results in John et al. [43]. The ATT of our best 8-route solution is 10.09, which is almost the same as the ATT values in Nikolic and Teodorovic [16] (i.e., 10.09) and Ahmed et al. [38] (i.e., 10.08). However, their TRL values are, respectively, 288 and 272 minutes, which are much larger than ours (i.e., 233 minutes). Tables 8 and 9 separately compare the detailed performance indicators of the solutions in Figure 10 from the perspectives of passenger and operator.Table 8
Passenger perspective results compared to other approaches for Mandl’s networks.
|R|IndicatorsFan and Mumford [41]Mumford [27]Chew et al. [32]Kılıç and Gök [40]Kılıç and Gök [14]Nikolić and Teodorović [16]Kechagiopoulos and Beligiannis [13]John et al. [43]Kılıç [42]Ahmed and Lee [36]Ahmed and Lee [37]Ahmed et al. [38]NSGA-II with variable |R|4d0 (%)93.2690.4391.8491.8491.3392.191.84—91.291.4692.2391.8491.07d1 (%)6.749.578.168.168.167.197.64—8.88.547.718.158.22d2 (%)00000.510.710.51—000.0600.71dun (%)0000000—00000ATT11.3710.5710.510.7110.5610.5110.64—10.510.810.8410.4810.56TRL147149150129137146a150b—1401331511481246d0 (%)91.5295.3896.7992.8195.595.6396.21—96.497.2494.9397.1796.92d1 (%)8.484.563.216.874.54.373.47—3.62.765.072.823.08d2 (%)00.0600.32000.32—00000dun (%)0000000—00000ATT10.4810.2710.2110.4510.2910.2310.2310.2210.2510.1610.510.1810.19TRL215221224190216224a203b2111802232322121957d0 (%)93.3296.4798.0194.3597.0498.5297.17—96.6697.3791.8498.8497.43d1 (%)6.363.341.995.142.831.482.83—3.342.638.161.152.57d2 (%)0.320.1900.510.1300—00000dun (%)0000000—00000ATT10.4210.2210.1610.3610.2310.1510.16—10.210.2110.6210.110.15TRL231264239223274247a234b—2292352372502098d0 (%)94.5497.5699.0495.1298.4698.9797.75—98.5298.294.5499.1698.59d1 (%)5.462.310.964.561.541.032.25—1.481.85.460.831.41d2 (%)00.1300.32000—00000dun (%)0000000—00000ATT10.3610.1710.1110.9610.1910.0910.13—10.110.3110.3210.0810.09TRL283291256217263288a283b—234244251272233Table 9
Operator perspective results compared to other approaches for Mandl’s network.
|R|IndicatorsMumford [27]Chew et al. [32]John et al. [43]Kılıç [42]Ahmed and Lee [36]Ahmed et al. [38]NSGA-II with fixed |R|NSGA-II with variable |R|4d0 (%)61.0861.08—48.8161.08—56.6547.40d1 (%)36.6136.61—45.5436.61—41.5546.05d2 (%)2.312.31—5.332.31—1.806.55dun (%)00—0.320—00.00ATT13.8813.88—14.6713.88—13.2915.49TRL6363—6363—6865.006d0 (%)70.9170.91—70.9170.4662.2363.84|R| = 3d1 (%)25.525.5—25.524.3427.1627.62d2 (%)2.952.95—2.955.29.578.09dun (%)0.640.64—0.6401.030.45ATT13.4813.4813.4813.4812.614.2814.19TRL636363636363697d0 (%)65.1370.65—70.6568.96—57.55d1 (%)22.9321.13—21.1326.29—33.27d2 (%)10.347.13—7.133.92—8.73dun (%)1.611.09—1.090.83—0.45ATT14.2513.76—13.7613.46—13.92TRL6363—6363—718d0 (%)57.9361.91—43.9360.76—36.48d1 (%)31.9229.67—21.5225.63—44.32d2 (%)9.76.87—14.9610.34—11.11dun (%)0.451.54—19.593.26—8.09ATT14.4514.22—17.9514.78—15.76TRL6363—6363—70In Table8, we compare our results with former research studies in terms of d0, d1, d2, dun, ATT, and TRL. The presented solutions of our work are selected from the obtained approximate Pareto front generated by NSGA-II with variable |R|. The TRL values of Nikolic and Teodorovic [16] and Kechagiopoulos and Beligiannis [13] are obtained through our evaluation functions since they did not report these values.From Table8, the proposed solution method outperforms most of the former results. The ATT values of our method are very close to the smallest ATT values in four cases. For 4-route solutions, the best ATT (obtained by Ahmed et al. [38]) is 10.48 which is slightly smaller than ours (i.e., 10.56). However, our solution does have a much smaller TRL value (i.e., 124) when compared with the result (i.e., 148) in Ahmed et al. [38]. For 6-route solutions, the best ATT (obtained by Buba and Lee [36]) is 10.16, which is slightly smaller than ours (i.e., 10.19). The difference is less than 1%. On the contrary, the TRL of our solution is 195 (i.e., 12% less than 223). From the passenger’s perspective, our solution method is competitive with other approaches in the literature.Among 12 existing research studies mentioned above, only Mumford [27], Chew et al. [32], John et al. [43], Kilic and Gok [14], Buba and Lee [36], and Ahmed et al. [38] reported best solutions from the operator’s perspective. Hence, to enhance the compatibility, we compare our results with existing literature [14, 27, 32, 36, 38, 43] in Table 9. Recall that the |R| value is not predefined. As a result, there is only one best solution from the operator’s perspective (in the last column in Table 9). So, we supplement the best solutions from NSGA-II with ﬁxed |R| in Figure 8.The results of the proposed NSGA-II with ﬁxed |R| are less impressive than other literature. Our operator’s costs are close to the lower bound of TRL. This is because the objective of our search algorithm is to search for the approximate Pareto front, instead of optimizing the passenger and/or operator cost. Generally, the best TRL values of our results are slightly larger than the lower bound of TRL (i.e., 12%). The best result for operator obtained from NSGA-II with variable |R| contains only 3 routes.


### 5.3.2. Mumford’s Networks

Figure11 compares the obtained approximate Pareto front with recently published results for Mumford’s larger networks in Mumford [27], Kilic and Gok [14], Kilic [42], John et al. [43], Buba and Lee [36], Nayeem et al. [15], and Ahmed et al. [38]. The approximate fronts obtained by John et al. [43] and Kilic [42] are obtained via private communication. Note that the results of Nayeem et al. [15] are obtained by evaluating the reported ﬁnal solution in their work (the only feasible route set is for network Mumford1).Figure 11
Comparison with previously published results for Mumford’s networks. (a) Mumford0. (b) Mumford1. (c) Mumford2. (d) Mumford3.
(a)(b)(c)(d)From Figure11, it can be seen that for network Mumford0, the obtained front has a large duplication with former results. When network size grows, the gap between the obtained front and former results gets larger. This implies that our method has an advantage over large networks. The approximate Pareto fronts acquired by our method cover a larger area than other results because the |R| value is not predeﬁned. Tables 10 and 11 summarize the detailed performance indicators of the best solutions from the perspectives of both the passenger and the operator in Figure 11.Table 10
Passenger perspective results compared to other approaches for Mumford’s networks.
NetworkParametersMumford [27]Nayeem et al. [15]Kılıç and Gök [14]John et al. [43]Kılıç [42]Ahmed and Lee [36]Ahmed et al. [38]NSGA-II with variable |R|Mumford0d0 (%)63.2—69.73—66.8865.4188.7498.77d1 (%)35.82—30.03—32.7634.2411.251.23d2 (%)0.98—0.24—0.370.3500dun (%)0—0—0000ATT16.05—14.9914.9915.4315.2714.0913.19TRL759—7076965876737222212Mumford1d0 (%)36.638.7745.1—40.838.7765.7571.04d1 (%)52.4255.4549.08—52.4654.2334.1828.96d2 (%)10.715.795.76—6.745.120.070dun (%)0.2600.06—01.8800ATT24.7923.7523.3322.9723.8223.1621.6921.19TRL20381301194419251659195519563315Mumford2d0 (%)30.92—33.88—29.1431.4756.6853.74d1 (%)51.29—57.18—60.2158.2343.2646.24d2 (%)16.36—8.77—10.489.60.050.02dun (%)1.44—0.17—0.170.700ATT28.65—26.8226.2127.6727.2825.1924.88TRL5632—502753263957526852575783Mumford3d0 (%)27.46—27.56—26.1728.1250.4156.32d1 (%)50.97—53.25—56.7854.3548.8143.48d2 (%)18.76—17.51—16.3716.840.770.2dun (%)2.81—1.68—0.680.6900ATT31.44—30.4128.7630.8730.1628.0527.27TRL6665—583464004373654761198668Table 11
Operator perspective results compared to other approaches for Mumford’s networks.
NetworkParametersMumford [27]John et al. [43]Kılıç [42]Ahmed and Lee [36]Ahmed et al. [38]NSGA-II with variable |R|Mumford0D0 (%)18.42—25.5116.9914.6139.96D1 (%)23.4—16.5530.7231.5946.8d2 (%)20.78—21.3828.9236.4113.23dun (%)37.4—36.5523.3817.370ATT32.430.0640.833.4126.3225.23TRL111951121079495Mumford1d0 (%)16.35—19.722.3918.0229.08d1 (%)29.06—32.2940.5729.8842.01d2 (%)29.93—30.0134.3331.923.57dun (%)24.66—182.7120.195.34ATT34.6947.1441.6731.1539.4546.75TRL568448572567408276Mumford2d0 (%)13.76—15.6215.3213.6316.06d1 (%)27.69—38.0729.3123.5841.25d2 (%)29.53—33.731.0823.9432.39dun (%)29.09—12.6224.2938.8210.29ATT36.5435.0835.8734.5246.8643.67TRL22441691207823051330497Mumford3d0 (%)16.71—14.2425.4216.2817.44d1 (%)33.69—33.4441.2624.8744.22d2 (%)29.18—34.124.9126.3431.19dun (%)20.42—18.228.4132.447.16ATT36.9246.5839.4234.8146.0545.11TRL28302030278227321746663In Table10, we compare our results from the passenger’s perspective with other methods for Mumford’s four larger networks. Note that the results of Nayeem et al. [15] are obtained by evaluating the reported ﬁnal solution in their work (the only feasible route set is for network Mumford1).From Table10, it can be seen that our proposed method with variable |R| outperforms the methods in Mumford [27], Nayeem et al. [15], Kilic and Gok [14], John et al. [43], Kilic [42], Buba and Lee [36], and Ahmed et al. [38] in terms of the ATT. The proposed solution method also found the best d0 in all instances except network Mumford2. The percentages of demand satisﬁed with at most one transfer (d0 + d1) are over 99% for all instances. Although the TRL values of our approach are generally larger than other approaches, a solution that dominates the results of existing methods in terms of both objectives can be found in Figure 11.Besides, Table11 compares our results from the operator’s perspective for Mumford’s four larger networks with recently published results in Mumford [27], John et al. [43], Kilic [42], Buba and Lee [36], and Ahmed et al. [38]. Our approach found the best results in networks Mumford1, Mumford2, and Mumford3 in terms of TRL. This is not unexpected, since the number of routes in our approach can be alternated by the route set size alternating heuristic as long as the solution is feasible. The best solution for network Mumford0 is obtained by Ahmed et al. [38]. The TRL of their result is one minute less than ours (i.e., 95 minutes). On the contrary, the ATT of our result is smaller than theirs, and all demands can be satisﬁed with our route set. Generally, the proposed solution method is competitive with existing approaches in terms of both objectives for larger instances.


## 5.3.1. Mandl’s Network

In Figure10, we compare the ﬁnal solutions for Mandl’s network with the previously published results in Fan and Mumford [41], Mumford [27], Chew et al. [32], Nikolic and Teodorovic [16], Kilic and Gok [40], Kilic and Gok [14], Kilic [42], John et al. [43], Kechagiopoulos and Beligiannis [13], Ahmed et al. [38], Buba and Lee [36], and Buba and Lee [37]. The approximate Pareto fronts of Kilic [42] and John et al. [43] plotted in Figure 10 are obtained via private communication.Figure 10
Comparison with previously published results for Mandl’s network.From Figure10, it can be seen that our results determined by varying the value of |R| are competitive with other results. In general, our results are quite similar to the combined approximate Pareto front in Kilic [42] and the results in John et al. [43]. The ATT of our best 8-route solution is 10.09, which is almost the same as the ATT values in Nikolic and Teodorovic [16] (i.e., 10.09) and Ahmed et al. [38] (i.e., 10.08). However, their TRL values are, respectively, 288 and 272 minutes, which are much larger than ours (i.e., 233 minutes). Tables 8 and 9 separately compare the detailed performance indicators of the solutions in Figure 10 from the perspectives of passenger and operator.Table 8
Passenger perspective results compared to other approaches for Mandl’s networks.
|R|IndicatorsFan and Mumford [41]Mumford [27]Chew et al. [32]Kılıç and Gök [40]Kılıç and Gök [14]Nikolić and Teodorović [16]Kechagiopoulos and Beligiannis [13]John et al. [43]Kılıç [42]Ahmed and Lee [36]Ahmed and Lee [37]Ahmed et al. [38]NSGA-II with variable |R|4d0 (%)93.2690.4391.8491.8491.3392.191.84—91.291.4692.2391.8491.07d1 (%)6.749.578.168.168.167.197.64—8.88.547.718.158.22d2 (%)00000.510.710.51—000.0600.71dun (%)0000000—00000ATT11.3710.5710.510.7110.5610.5110.64—10.510.810.8410.4810.56TRL147149150129137146a150b—1401331511481246d0 (%)91.5295.3896.7992.8195.595.6396.21—96.497.2494.9397.1796.92d1 (%)8.484.563.216.874.54.373.47—3.62.765.072.823.08d2 (%)00.0600.32000.32—00000dun (%)0000000—00000ATT10.4810.2710.2110.4510.2910.2310.2310.2210.2510.1610.510.1810.19TRL215221224190216224a203b2111802232322121957d0 (%)93.3296.4798.0194.3597.0498.5297.17—96.6697.3791.8498.8497.43d1 (%)6.363.341.995.142.831.482.83—3.342.638.161.152.57d2 (%)0.320.1900.510.1300—00000dun (%)0000000—00000ATT10.4210.2210.1610.3610.2310.1510.16—10.210.2110.6210.110.15TRL231264239223274247a234b—2292352372502098d0 (%)94.5497.5699.0495.1298.4698.9797.75—98.5298.294.5499.1698.59d1 (%)5.462.310.964.561.541.032.25—1.481.85.460.831.41d2 (%)00.1300.32000—00000dun (%)0000000—00000ATT10.3610.1710.1110.9610.1910.0910.13—10.110.3110.3210.0810.09TRL283291256217263288a283b—234244251272233Table 9
Operator perspective results compared to other approaches for Mandl’s network.
|R|IndicatorsMumford [27]Chew et al. [32]John et al. [43]Kılıç [42]Ahmed and Lee [36]Ahmed et al. [38]NSGA-II with fixed |R|NSGA-II with variable |R|4d0 (%)61.0861.08—48.8161.08—56.6547.40d1 (%)36.6136.61—45.5436.61—41.5546.05d2 (%)2.312.31—5.332.31—1.806.55dun (%)00—0.320—00.00ATT13.8813.88—14.6713.88—13.2915.49TRL6363—6363—6865.006d0 (%)70.9170.91—70.9170.4662.2363.84|R| = 3d1 (%)25.525.5—25.524.3427.1627.62d2 (%)2.952.95—2.955.29.578.09dun (%)0.640.64—0.6401.030.45ATT13.4813.4813.4813.4812.614.2814.19TRL636363636363697d0 (%)65.1370.65—70.6568.96—57.55d1 (%)22.9321.13—21.1326.29—33.27d2 (%)10.347.13—7.133.92—8.73dun (%)1.611.09—1.090.83—0.45ATT14.2513.76—13.7613.46—13.92TRL6363—6363—718d0 (%)57.9361.91—43.9360.76—36.48d1 (%)31.9229.67—21.5225.63—44.32d2 (%)9.76.87—14.9610.34—11.11dun (%)0.451.54—19.593.26—8.09ATT14.4514.22—17.9514.78—15.76TRL6363—6363—70In Table8, we compare our results with former research studies in terms of d0, d1, d2, dun, ATT, and TRL. The presented solutions of our work are selected from the obtained approximate Pareto front generated by NSGA-II with variable |R|. The TRL values of Nikolic and Teodorovic [16] and Kechagiopoulos and Beligiannis [13] are obtained through our evaluation functions since they did not report these values.From Table8, the proposed solution method outperforms most of the former results. The ATT values of our method are very close to the smallest ATT values in four cases. For 4-route solutions, the best ATT (obtained by Ahmed et al. [38]) is 10.48 which is slightly smaller than ours (i.e., 10.56). However, our solution does have a much smaller TRL value (i.e., 124) when compared with the result (i.e., 148) in Ahmed et al. [38]. For 6-route solutions, the best ATT (obtained by Buba and Lee [36]) is 10.16, which is slightly smaller than ours (i.e., 10.19). The difference is less than 1%. On the contrary, the TRL of our solution is 195 (i.e., 12% less than 223). From the passenger’s perspective, our solution method is competitive with other approaches in the literature.Among 12 existing research studies mentioned above, only Mumford [27], Chew et al. [32], John et al. [43], Kilic and Gok [14], Buba and Lee [36], and Ahmed et al. [38] reported best solutions from the operator’s perspective. Hence, to enhance the compatibility, we compare our results with existing literature [14, 27, 32, 36, 38, 43] in Table 9. Recall that the |R| value is not predefined. As a result, there is only one best solution from the operator’s perspective (in the last column in Table 9). So, we supplement the best solutions from NSGA-II with ﬁxed |R| in Figure 8.The results of the proposed NSGA-II with ﬁxed |R| are less impressive than other literature. Our operator’s costs are close to the lower bound of TRL. This is because the objective of our search algorithm is to search for the approximate Pareto front, instead of optimizing the passenger and/or operator cost. Generally, the best TRL values of our results are slightly larger than the lower bound of TRL (i.e., 12%). The best result for operator obtained from NSGA-II with variable |R| contains only 3 routes.


## 5.3.2. Mumford’s Networks

Figure11 compares the obtained approximate Pareto front with recently published results for Mumford’s larger networks in Mumford [27], Kilic and Gok [14], Kilic [42], John et al. [43], Buba and Lee [36], Nayeem et al. [15], and Ahmed et al. [38]. The approximate fronts obtained by John et al. [43] and Kilic [42] are obtained via private communication. Note that the results of Nayeem et al. [15] are obtained by evaluating the reported ﬁnal solution in their work (the only feasible route set is for network Mumford1).Figure 11
Comparison with previously published results for Mumford’s networks. (a) Mumford0. (b) Mumford1. (c) Mumford2. (d) Mumford3.
(a)(b)(c)(d)From Figure11, it can be seen that for network Mumford0, the obtained front has a large duplication with former results. When network size grows, the gap between the obtained front and former results gets larger. This implies that our method has an advantage over large networks. The approximate Pareto fronts acquired by our method cover a larger area than other results because the |R| value is not predeﬁned. Tables 10 and 11 summarize the detailed performance indicators of the best solutions from the perspectives of both the passenger and the operator in Figure 11.Table 10
Passenger perspective results compared to other approaches for Mumford’s networks.
NetworkParametersMumford [27]Nayeem et al. [15]Kılıç and Gök [14]John et al. [43]Kılıç [42]Ahmed and Lee [36]Ahmed et al. [38]NSGA-II with variable |R|Mumford0d0 (%)63.2—69.73—66.8865.4188.7498.77d1 (%)35.82—30.03—32.7634.2411.251.23d2 (%)0.98—0.24—0.370.3500dun (%)0—0—0000ATT16.05—14.9914.9915.4315.2714.0913.19TRL759—7076965876737222212Mumford1d0 (%)36.638.7745.1—40.838.7765.7571.04d1 (%)52.4255.4549.08—52.4654.2334.1828.96d2 (%)10.715.795.76—6.745.120.070dun (%)0.2600.06—01.8800ATT24.7923.7523.3322.9723.8223.1621.6921.19TRL20381301194419251659195519563315Mumford2d0 (%)30.92—33.88—29.1431.4756.6853.74d1 (%)51.29—57.18—60.2158.2343.2646.24d2 (%)16.36—8.77—10.489.60.050.02dun (%)1.44—0.17—0.170.700ATT28.65—26.8226.2127.6727.2825.1924.88TRL5632—502753263957526852575783Mumford3d0 (%)27.46—27.56—26.1728.1250.4156.32d1 (%)50.97—53.25—56.7854.3548.8143.48d2 (%)18.76—17.51—16.3716.840.770.2dun (%)2.81—1.68—0.680.6900ATT31.44—30.4128.7630.8730.1628.0527.27TRL6665—583464004373654761198668Table 11
Operator perspective results compared to other approaches for Mumford’s networks.
NetworkParametersMumford [27]John et al. [43]Kılıç [42]Ahmed and Lee [36]Ahmed et al. [38]NSGA-II with variable |R|Mumford0D0 (%)18.42—25.5116.9914.6139.96D1 (%)23.4—16.5530.7231.5946.8d2 (%)20.78—21.3828.9236.4113.23dun (%)37.4—36.5523.3817.370ATT32.430.0640.833.4126.3225.23TRL111951121079495Mumford1d0 (%)16.35—19.722.3918.0229.08d1 (%)29.06—32.2940.5729.8842.01d2 (%)29.93—30.0134.3331.923.57dun (%)24.66—182.7120.195.34ATT34.6947.1441.6731.1539.4546.75TRL568448572567408276Mumford2d0 (%)13.76—15.6215.3213.6316.06d1 (%)27.69—38.0729.3123.5841.25d2 (%)29.53—33.731.0823.9432.39dun (%)29.09—12.6224.2938.8210.29ATT36.5435.0835.8734.5246.8643.67TRL22441691207823051330497Mumford3d0 (%)16.71—14.2425.4216.2817.44d1 (%)33.69—33.4441.2624.8744.22d2 (%)29.18—34.124.9126.3431.19dun (%)20.42—18.228.4132.447.16ATT36.9246.5839.4234.8146.0545.11TRL28302030278227321746663In Table10, we compare our results from the passenger’s perspective with other methods for Mumford’s four larger networks. Note that the results of Nayeem et al. [15] are obtained by evaluating the reported ﬁnal solution in their work (the only feasible route set is for network Mumford1).From Table10, it can be seen that our proposed method with variable |R| outperforms the methods in Mumford [27], Nayeem et al. [15], Kilic and Gok [14], John et al. [43], Kilic [42], Buba and Lee [36], and Ahmed et al. [38] in terms of the ATT. The proposed solution method also found the best d0 in all instances except network Mumford2. The percentages of demand satisﬁed with at most one transfer (d0 + d1) are over 99% for all instances. Although the TRL values of our approach are generally larger than other approaches, a solution that dominates the results of existing methods in terms of both objectives can be found in Figure 11.Besides, Table11 compares our results from the operator’s perspective for Mumford’s four larger networks with recently published results in Mumford [27], John et al. [43], Kilic [42], Buba and Lee [36], and Ahmed et al. [38]. Our approach found the best results in networks Mumford1, Mumford2, and Mumford3 in terms of TRL. This is not unexpected, since the number of routes in our approach can be alternated by the route set size alternating heuristic as long as the solution is feasible. The best solution for network Mumford0 is obtained by Ahmed et al. [38]. The TRL of their result is one minute less than ours (i.e., 95 minutes). On the contrary, the ATT of our result is smaller than theirs, and all demands can be satisﬁed with our route set. Generally, the proposed solution method is competitive with existing approaches in terms of both objectives for larger instances.


## 5.4. Recommended Value of |R|

In the TNDP, it is difficult to state a suitable number of routes for the best solution [44]. By embedding a route set generation heuristic in a biobjective optimization framework, we try to find the approximate Pareto front without presetting |R|. The aim of this section is to demonstrate the efect of |R| on both objective values in the approximate Pareto fronts.Figure12 shows the |R| values of the approximate Pareto front solutions for ﬁve networks. As expected, both objectives are generally conﬂicting. With |R| increasing, the ATT decreases and the TRL increases at the same time. When |R| is reaching the theoretical largest value, the ATT will converge to the theoretical lowest value (shown in Table 2). When |R| is larger than the theoretical largest value, the increase of |R| will only lead to larger TRL but no decrease in the ATT. The ﬁgures reveal that when |R| reaches a certain value, a further increase in the |R| value can barely lead to decreasing of ATT. For example, for network Mumford3, the ATT decreases from 27.54 minutes to 27.29 minutes when |R| increases from 80 to 100, while the TRL increases from 6894 to 8688. This demonstrates that a large |R| is not always beneﬁcial to both the passenger and the operator.Figure 12
Effect of |R| on both objective functions in ﬁve networks. (a) Mandl’s network. (b) Mumford0. (c) Mumford1. (d) Mumford2. (e) Mumford3.
(a)(b)(c)(d)(e)From Figure12, it can be seen that the number of solutions with speciﬁc |R| in the approximate Pareto fronts is fairly small for four larger networks. This indicates that the best solutions with predeﬁned |R| are only a small part of the approximate Pareto front. The proposed approach with variable |R| is more practical and eﬃcient for large networks as the search process for large networks is computationally time consuming.Based on the observation of Figure12, we present a recommended range of the |R| value for each instance in Table 12. It should be noted that the recommended values are only meant for future researchers to limit the number of routes to avoid wasting computation resources on solutions with extreme trade-off level.Table 12
Recommended |R| values.
NetworkMandlMumford0Mumford1Mumford2Mumford3Recommended |R| range[3, 12][8, 30][4, 25][8, 42][10, 47]


## 6. Conclusions

An integrated solution method is proposed to simultaneously solve the transit network design problem and the route set size determination problem. The solution method includes a novel initial route set generation algorithm that aims to produce high-quality initial solutions for the optimization algorithm and to explore the solution space with a different number of routes, and it also contains a route set size alternating heuristic to alternate the number of routes in a solution. These two algorithms are embedded into NSGA-II-based solution framework to ﬁnd the approximate Pareto front in terms of both objectives (i.e., the average travel time and total route length).The proposed initial route set generation algorithm is based on the intuitive observation that maximizing the travel demand that can be satisﬁed directly (without transfers) is a key component in the generation of an initial route set. The initial solutions produced indicate that the proposed initial route set generation algorithm is capable of producing high-quality initial solutions for large networks. Note that the initial solutions obtained for networks Mumford2 and Mumford3 are dominating ﬁnal solutions generated by some former research studies in terms of both objectives. The comparison of computation time also shows that the proposed algorithm is very efficient, as it only takes three seconds to generate an initial solution for the largest network (i.e., Mumford3).Based on the analysis of the allocation of each travel demand, to improve the local optimal solution and explore a solution space with a different |R| value, a route set size alternating heuristic is developed to switch the number of routes in a solution. The experimental results show that the route set size alternating heuristic can save considerable computation time without deteriorating the quality of the approximate Pareto front obtained. When compared with the ﬁxed route set size approach, the approximate Pareto fronts obtained by varying the number of routes in a solution can lead to a wider range of trade-offs, which enables a decision maker to focus on the trade-offs within this constrained set of approximate Pareto front solutions, rather than needing to concentrate on a ﬁxed number of routes before the generation of a transit network. For future work, the proposed solution method should be extended to include bus headway determination and ﬂeet size constraint, and we will extend our research by extracting dynamic transit demand from available sources.



---

*Source: 3753601-2020-08-01.xml*