# Optimal Design of the Feeder-Bus Network Based on the Transfer System

Authors: Lianbo Deng; Wei Gao; Yanbing Fu; Wenliang Zhou
Journal: Discrete Dynamics in Nature and Society
 (2013)

---

## Abstract

This paper studied the classic feeder-bus network design problem (FBNDP), which can be described as follows: for the passenger travel demand between rail stations and bus stops on a given urban transit network, it designs the optimal feeder bus routes and frequencies so as to minimize the passengers’ travel expense and the operator’s cost. We extended the demand pattern of M-to-1 in most existing researches to M-to-M. We comprehensively considered the passenger travel cost, which includes the waiting and riding cost on the bus, riding cost on rail, and transfer cost between these two transportation modes, and presented a new genetic algorithm that determines the optimal feeder-bus operating frequencies under strict constraint conditions. The numerical examples under different demand patterns have been experienced and analysed, which showed the robustness and efficiency of the presented algorithm. We also found that the distribution pattern of the travel demand has a significant influence on the feeder-bus network construction.


---

## Body

## 1. Introduction

As the two main transport modes in an urban transit system, the rail line usually plays the role of the transport trunk, while the feeder-bus network services act as a branch of and a supplement to the former. The integration and coordination of urban rail transit and the bus network can effectively promote the service efficiency and simultaneously improve the financial status of the system [1]. Stanger and Vuchic [2] pointed out that coordinative schedule optimization of the two modes could lead to operating cost savings. Some cities, such as Atlanta, Miami, and Washington, DC, gave top priority to the bus/rail coordination during the development process of the transportation systems. Dunn Jr. [3] showed that the coordination and integration of transport services have been a precondition for improving public transportation.A good feeder-bus network significantly improves the public transport system’s service level, operation efficiency, and market competitiveness. The feeder-bus network transports transfer passengers who come from the urban perimeter zone and will arrive at their final business or work destination by rail. Each bus line in the feeder-bus system usually connects to a special railway station and serves a sequence of bus stops with a certain frequency. Thus, the feeder-bus network design problem (FBNDP) can be described as follows: for a given urban rail line, the stop locations and the passenger travel demand between bus stops and railway stations, the optimal feeder bus routes, and their frequencies are determined so as to minimize the passenger travel cost and the bus operation cost [4–6].


## 2. Literature Review

The existing research on the FBNDP mainly follows two approaches, that is, the analytic approach and network programming (also known as mathematical programming). Most early research used analytic approaches to deduce the optimal route spacing, operating headway, and stop spacing based on assumptions regarding the shape of the street geometry and the spatial distribution of the passenger demand. According to the assumption of the early research, the demand is distributed in a rectangular region in which an existing rail line is serviced (accessed) by some parallel bus routes perpendicular to the rail line. Byrne and Vuchic [4] studied the optimal location and headway of parallel bus lines and presented a method to determine the optimal number of bus lines. On the basis of [4], Byrne [7] determined the lengths, positions, and headways of bus lines that could minimize the user travel time and operating costs in response to a general population density function with differing line speeds. Hurdle [8] studied the optimal location and schedule of parallel feeder lines with variable passenger density with different trip origins and times. Wirasinghe et al. [9] put forward optimization formulations for the optimal railway interstation spacing, feeder-bus zone boundary, and train headways mainly by the use of basic calculus in conjunction with continuum approximations of certain discrete parameters. Wirasinghe [10] researched a feeder-bus system with a demand pattern of M-to-1 (i.e., multiple bus stops and a single station). An approximate analytical model and corresponding solution algorithm were successfully applied to the Calgary (South Corridor) LRT system. Kuah and Perl [5] optimized the route spacing, operating headway, and stop spacing simultaneously, and analysed the influencing factors of bus stop spacing in three different cases. Supposing that the location of the rail line was predetermined, Chien and Schonfeld [11] cut the urban corridor into several traffic zones with different lengths but the same width and jointly optimized the rail line length, railway station spacing, bus headways, bus stop spacing, and bus route spacing under the conditions that the passenger flow density in each traffic zone was the same and that only one feeder-bus line connected to the same railway station. Chien and Yang [12] developed a model for finding the optimal bus route location and its operating headway in a heterogeneous service area while considering intersection delays. In these models, irregular and discrete M-to-1 demand distributions were considered. A heuristic algorithm [12] and later a genetic algorithm [13] were designed to solve the above model.In recent decades, the network programming approach has been introduced to deal with the FBNDP. In this approach, the urban transport network is usually represented by a graphic framework, in which nodes denote bus stops or railway stations and links denote route segments between the two successive nodes. For simplicity, it takes bus stops as the origin and the rail station as the destination of the travel demand. Kuah and Perl [6] developed a mathematical programming model for the FBNDP under the M-to-1 demand pattern and designed a heuristic algorithm based on the savings approach. The demand pattern of M-to-M (i.e., the demand pattern in which multiple stations are the destinations) was transformed and generalized to M-to-1 by separating the bus stops into dummy child nodes with the same number of railway stations. Furthermore, the sensitivity of the model was analysed for changes in the design objective, passenger demand variability, vehicle capacity, labour and fuel costs, and rail line. Martins and Pato [14] further presented two strategies to generate the initial solution (i.e., the continuous construction method and the two-phase method) and designed a local search as well as tabu search heuristics with diversification and intensification strategies. Shrivastav and Dhingra [15] discussed the FBNDP for the operational integration of the suburban railway and bus transit system and developed a heuristic algorithm using different node selection and insertion strategies. Kuan et al. mainly focused on the application of metaheuristic algorithms to the FBNDP, such as simulated annealing and tabu search [16], genetic algorithm, and ant colony optimization [17] and analysed and compared the optimal results obtained by these algorithms.More recently, Ciaffi et al. [18] dealt with the FBNDP using a two-phase method. In the first phase, a heuristic algorithm was used to generate two different and complementary sets of feasible routes, in order to provide a proper balance between the maximization of the service coverage area and the minimization of the overall travel time. In the second phase, the sets generated in the first phase were used as input data and a GA was designed to find a suboptimal set of routes with the associated frequencies.Almost all the existing research assumed that the travel demand starts from multiple bus stops but ends at one particular railway station near the central business district (i.e., the demand pattern of M-to-1). In this paper, this drawback is modified to adapt well to the realistic passenger distribution. We consider that origin-destination (OD) pairs may exist between any bus stop and any railway station (M-to-M). After computing the passenger travel cost from the view of the whole feeder-bus network, we present a network optimization model with the objective of minimizing the passenger travel cost and the bus operation cost. Furthermore, a new generation algorithm (GA) is developed and the optimal results under different passenger patterns are analysed and compared.


## 3. Problem Description

The feeder-bus network mainly transports transfer passengers between the bus and the railway system. We regard the nodes, including bus stops and rail stations, as traffic points of passenger collection and distribution. In the classical FBNDP, all passengers are supposed to have a certain railway station as their destination. We widen this assumption to the M-to-M pattern; that is, the passenger demand is distributed between any bus stop and any railway station. Under this demand pattern, the feeder-bus routes obey the following assumptions in most previous studies.(1)
Each bus stop is served by one feeder-bus route only.(2)
Each bus route does not cross its feeder railway station but terminates at the station.(3)
All bus routes have a uniform capacity and operating speed, and the volume of transport passengers should not exceed their capacity.(4)
Each bus must halt at all the stops along its route and the skip-stop running strategy is not considered.When the feeder-bus network obeys the above assumptions, there is an M-to-1 connection relationship between bus stops and railway stations. However, the route structure and the feeder station are influenced by the demand distribution of the M-to-M demand pattern, and the operating frequency can be obtained through the optimal cost of the transit operator and transfer passengers.Considering an urban public transit network composed ofI bus stops and J railway stations, we denote the set of bus stops by B={1,…,I}, the set of railway stations by T={I+1,…,I+J}, and the set of network nodes by N=B∪T. We also let the distance of a section between two adjacent nodes i,j be Lij, i,j∈N, the bus operating speed vB, and the train speed vT.Due to the time fluctuation of the urban passenger demand, we can determine the bus schedule for each planning period (such as one hour in the morning peak). In the given period, the demand betweeni and d can be expressed as Pid, for i∈B, d∈T.Supposing the feeder-bus networkΩ consists of K feeder-bus routes, the path structure of bus route k(k=1,…,K) is denoted by ωk={n1k,n2k…,nPk-1k,nPk}, in which nPk∈T is the feeder railway station and n1k,n2k,…,nPk-1k∈B are bus stops along the route. The operating frequency of route k is denoted by fk.


## 4. Model Construction

The constraints of the feeder-bus network can be obtained according to the above assumptions and the transit operating requirement. Compared with the demand pattern of M-to-1, the network construction constraints under the M-to-M pattern are completely uniform. However, the generalized travel cost of transfer passengers under the demand pattern of M-to-M will have a more complex influence on their choice of feeder station in the railway line, thus affecting the feeder-bus route structure and further the network construction.


### 4.1. Constraints Analysis

To represent the feeder-bus network constraints,Yij and Xihk are defined to denote the relationship between nodes and routes:
(1)Yij={1,ifbusnodeiisassignedtorailnodej0,otherwise,∀i=1,…,I;j=I+1,…,I+J,Xihk={1,ifnodeiprecedesnodehonbusroutek0,otherwise,∀i,h=1,…,I+J;k=1,…,K.All the constraints that need to be satisfied by the feeder-bus network are as follows.(1)
Connectedness constraint of the feeder-bus network:in the feeder-bus network, any subset of bus stops must link to feeder stations directly or via other bus stops, that is, the following connectedness constraint:(2)∑i∉H∑h∈H∑k=1KXihk≥1,∀H,whereH is a set containing all the rail stations and some bus stops. Obviously, it is also a subset of N.(2)
Integrity constraints of the feeder-bus route:each bus route must link to a single railway station:(3)∑i=1I∑j=I+1I+JXijk=1,k=1,…,K.A route terminates at a certain feeder stationd∈T to which the route passengers are transported,
(4)∑i=I+1I+J∑j=1I+JXijk=0,k=1,…,K.In addition, a feeder-bus route should include at least one stop and one feeder station, that is, the following nonempty constraint:(5)∑i=1I∑j=1I+JXijk≥1,k=1,…,K.(3)
Relationship constraints between routes and nodes:feeder-bus routek must halt at stop i only once, i should be served only by route k when i∈ωk, and route k should be acyclic:
(6)∑k=1K∑h=1I+JXihk=1,i=1,…,I,∑k=1K∑p=1IXpik≤1,i=1,…,I,∑h=1I+JXihk-∑p=1IXpik≥0,i=1,…,I;k=1,…,K.In addition, relationship variableYij between route k and nodes i,j satisfies the following constraint:
(7)∑h=1I+JXihk+∑p=1IXpjk-Yij≤1,i=1,…,I;j=I+1,…,I+J;k=1,…,K.(4)
Capacity constraints of the feeder-bus route and network:for routek, operating frequency fk should meet the passenger transport capacity; that is,
(8)∑i=1I∑d=I+1I+JPid∑h=1I+JXihk≤fkCρ,k=1,…,K,whereC is the bus capacity and ρ is the load factor.Meanwhile, the route operating frequencies are restricted by the total running mileage of bus vehicles in the planning period; that is,(9)∑k=1Kfk∑i=1I∑h=1I+JLihXihk≤12NvB(T-t),
wheretis the average servicing and turn-around time of every bus vehicle in period T and N is the number of vehicles that can be used in T.


### 4.2. Cost Analysis

In order to ensure the good market competitiveness and operation effect, the feeder-bus network needs to consider the benefits both of passengers and of operators. For passengers, this refers to their generalized travel cost, which can be divided into three parts: the waiting and riding cost on the bus, the riding cost on the rail line, and the transfer cost between these two modes. Compared with [6, 14], the transfer cost is taken into account in this paper and the contents of the passenger travel cost are closer to a realistic situation.In the passenger travel cost, the bus waiting and bus riding costs areλw∑k=1K(1/2fk)∑d=I+1I+J∑i=1I∑h=1I+JPidXihk and ∑k=1K{Lk∑d=I+1I+JPn1kd+(Lk-Ln1kn2k)∑d=I+1I+JPn2kd+⋯+LnPk-1knPk∑d=I+1I+JPnPk-1kd}λr/vB, respectively, where λw and λr are the corresponding monetary cost conversion coefficients, Pk and Lk are the total passenger demand and length of route k; the transfer cost at the feeder station is closely related to the transfer facilities and train operating density, so the transfer cost for every passenger at station j(j=I+1,…,I+J) can be expressed as λj, and the total rail riding cost is (λT/vT)(∑d=I+1I+J∑j=I+1I+J∑i=1IPidYijLjd), where λT is the corresponding monetary cost conversion coefficient.For the bus operator, the operating cost of feeder-bus routes mainly relates to operating mileages and frequencies, which are denoted as2λb∑k=1Kfk∑h=1I+J∑i=1ILihXihk, where λb is the cost per carriage per mile.


### 4.3. Optimization Model

Considering the benefits of both the passengers and the operator, the objective function of feeder-bus network programming is to minimize the passengers’ generalized travel cost and the operator’s cost:(10)minZ=λTvT(∑d=I+1I+J∑j=I+1I+J∑i=1IPidYijLjd)+λw∑k=1K12fk∑d=I+1I+J∑i=1I∑h=1I+JPidXihk+(∑k=1K{Lk∑d=I+1I+JPn1kd+(Lk-Ln1kn2k)∑d=I+1I+JPn2kd+⋯+LnPk-1knPk∑d=I+1I+JPnPk-1kd}λr)×(vB)-1+∑j=I+1I+Jλj(∑d=I+1I+J∑i=1IPidYij-Pij)+2λb∑k=1Kfk∑h=1I+J∑i=1ILihXihk.Objective function (10) and constraints (2)~(9) constitute the optimization model of the FBNDP. The optimization model has the following main characteristics.(1)
The transfer cost is included in the passenger travel cost, so the travel cost on the transfer network can be calculated overall.(2)
The optimal objective is to minimize the passenger travel cost and transit operating cost, so benefits to users and operators in the public transit system are both considered.(3)
The demands are not limited to a single destination (M-to-1) and are extended to the distribution between every origin and destination (M-to-M), so the model accords well with a realistic demand distribution.


## 4.1. Constraints Analysis

To represent the feeder-bus network constraints,Yij and Xihk are defined to denote the relationship between nodes and routes:
(1)Yij={1,ifbusnodeiisassignedtorailnodej0,otherwise,∀i=1,…,I;j=I+1,…,I+J,Xihk={1,ifnodeiprecedesnodehonbusroutek0,otherwise,∀i,h=1,…,I+J;k=1,…,K.All the constraints that need to be satisfied by the feeder-bus network are as follows.(1)
Connectedness constraint of the feeder-bus network:in the feeder-bus network, any subset of bus stops must link to feeder stations directly or via other bus stops, that is, the following connectedness constraint:(2)∑i∉H∑h∈H∑k=1KXihk≥1,∀H,whereH is a set containing all the rail stations and some bus stops. Obviously, it is also a subset of N.(2)
Integrity constraints of the feeder-bus route:each bus route must link to a single railway station:(3)∑i=1I∑j=I+1I+JXijk=1,k=1,…,K.A route terminates at a certain feeder stationd∈T to which the route passengers are transported,
(4)∑i=I+1I+J∑j=1I+JXijk=0,k=1,…,K.In addition, a feeder-bus route should include at least one stop and one feeder station, that is, the following nonempty constraint:(5)∑i=1I∑j=1I+JXijk≥1,k=1,…,K.(3)
Relationship constraints between routes and nodes:feeder-bus routek must halt at stop i only once, i should be served only by route k when i∈ωk, and route k should be acyclic:
(6)∑k=1K∑h=1I+JXihk=1,i=1,…,I,∑k=1K∑p=1IXpik≤1,i=1,…,I,∑h=1I+JXihk-∑p=1IXpik≥0,i=1,…,I;k=1,…,K.In addition, relationship variableYij between route k and nodes i,j satisfies the following constraint:
(7)∑h=1I+JXihk+∑p=1IXpjk-Yij≤1,i=1,…,I;j=I+1,…,I+J;k=1,…,K.(4)
Capacity constraints of the feeder-bus route and network:for routek, operating frequency fk should meet the passenger transport capacity; that is,
(8)∑i=1I∑d=I+1I+JPid∑h=1I+JXihk≤fkCρ,k=1,…,K,whereC is the bus capacity and ρ is the load factor.Meanwhile, the route operating frequencies are restricted by the total running mileage of bus vehicles in the planning period; that is,(9)∑k=1Kfk∑i=1I∑h=1I+JLihXihk≤12NvB(T-t),
wheretis the average servicing and turn-around time of every bus vehicle in period T and N is the number of vehicles that can be used in T.


## 4.2. Cost Analysis

In order to ensure the good market competitiveness and operation effect, the feeder-bus network needs to consider the benefits both of passengers and of operators. For passengers, this refers to their generalized travel cost, which can be divided into three parts: the waiting and riding cost on the bus, the riding cost on the rail line, and the transfer cost between these two modes. Compared with [6, 14], the transfer cost is taken into account in this paper and the contents of the passenger travel cost are closer to a realistic situation.In the passenger travel cost, the bus waiting and bus riding costs areλw∑k=1K(1/2fk)∑d=I+1I+J∑i=1I∑h=1I+JPidXihk and ∑k=1K{Lk∑d=I+1I+JPn1kd+(Lk-Ln1kn2k)∑d=I+1I+JPn2kd+⋯+LnPk-1knPk∑d=I+1I+JPnPk-1kd}λr/vB, respectively, where λw and λr are the corresponding monetary cost conversion coefficients, Pk and Lk are the total passenger demand and length of route k; the transfer cost at the feeder station is closely related to the transfer facilities and train operating density, so the transfer cost for every passenger at station j(j=I+1,…,I+J) can be expressed as λj, and the total rail riding cost is (λT/vT)(∑d=I+1I+J∑j=I+1I+J∑i=1IPidYijLjd), where λT is the corresponding monetary cost conversion coefficient.For the bus operator, the operating cost of feeder-bus routes mainly relates to operating mileages and frequencies, which are denoted as2λb∑k=1Kfk∑h=1I+J∑i=1ILihXihk, where λb is the cost per carriage per mile.


## 4.3. Optimization Model

Considering the benefits of both the passengers and the operator, the objective function of feeder-bus network programming is to minimize the passengers’ generalized travel cost and the operator’s cost:(10)minZ=λTvT(∑d=I+1I+J∑j=I+1I+J∑i=1IPidYijLjd)+λw∑k=1K12fk∑d=I+1I+J∑i=1I∑h=1I+JPidXihk+(∑k=1K{Lk∑d=I+1I+JPn1kd+(Lk-Ln1kn2k)∑d=I+1I+JPn2kd+⋯+LnPk-1knPk∑d=I+1I+JPnPk-1kd}λr)×(vB)-1+∑j=I+1I+Jλj(∑d=I+1I+J∑i=1IPidYij-Pij)+2λb∑k=1Kfk∑h=1I+J∑i=1ILihXihk.Objective function (10) and constraints (2)~(9) constitute the optimization model of the FBNDP. The optimization model has the following main characteristics.(1)
The transfer cost is included in the passenger travel cost, so the travel cost on the transfer network can be calculated overall.(2)
The optimal objective is to minimize the passenger travel cost and transit operating cost, so benefits to users and operators in the public transit system are both considered.(3)
The demands are not limited to a single destination (M-to-1) and are extended to the distribution between every origin and destination (M-to-M), so the model accords well with a realistic demand distribution.


## 5. Model Solution

The optimization model of the feeder-bus network, with many 0-1 variables and many constraints, is NP hard [14]. It is essentially a route optimization problem in the field of operations research, which is appropriate for solving by some intelligent heuristic algorithms. Thus, in this paper, we present a genetic algorithm for the model. In the generation process of initial solution individuals and new population individuals, we use the following strategy for constructing routes: it firstly generates the connection relations of stops and stations, then finally optimizes the routing path structure and determines the operating frequency. In the process of generating feeder-bus routes, feeder relations and the path of each bus route are determined according to the cost of candidate routes.


### 5.1. Optimal Frequency for Each Route

In feeder-bus networkΩ, the path structure and cost of a feeder-bus route are not correlated with the other routes; therefore, the operating frequency of each route can be set independently. For feeder-bus route ωk, according to the objective function (10), its cost is
(11)Ck=λTvT(∑i=n1knPk-1k∑d=I+1I+JPidLnPkd)+λwPk2fk+λnPk(Pk-∑i=n1knPk-1kPinPk)+2λbfkLk+(λr{Lk∑d=I+1I+JPn1kd+(Lk-Ln1kn2k)×∑d=I+1I+JPn2kd+⋯+LnPk-1knPk∑d=I+1I+JPnPk-1kd})×(vB)-1.
In order to minimize Ck, the optimal operating frequency without any constraint can be obtained by the first-order optimality condition of Ck with respect to fk in (11) as follows:
(12)fk*=12λwPkλbLk.
Then, the optimal operating frequency of ωk under constraint (8) is
(13)f-k*=max{12λwPkλbLk,Pk(Cρ)}.
Under the optimal frequencyf-k*, the minimum route cost of ωk is
(14)Ck*=λTvT(∑i=n1knPk-1k∑d=I+1I+JPidLnPkd)+λwPk2f-k*+λnPk(Pk-∑i=n1knPk-1kPinPk)+2λbf-k*Lk+(λr{Lk∑d=I+1I+JPn1kd+(Lk-Ln1kn2k)×∑d=I+1I+JPn2kd+⋯+LnPk-1knPk∑d=I+1I+JPnPk-1kd})×(vB)-1.
Thus, the total operating cost of Ω is
(15)Z(Ω)=∑k=1KCk*.
Particularly, the optimal operating frequency f-ij* of direct-link route ωij, which directly links stop i∈B and station j∈T, ismax{(1/2)λw∑d=I+1I+JPid/λbLij,∑d=I+1I+JPid/(Cρ)}. Then, accordingly, the total operating cost DCij of ωij is
(16)DCij=λTvT(∑d=I+1I+JPidLjd)+λw∑d=I+1I+JPid2f-ij*+λrLij∑d=I+1I+JPidvB+λj(∑d=I+1I+JPid-Pij)+2λbf-ij*Lij.


### 5.2. Optimization Strategy for the Route Structure

In the process of the GA, all routesωk in the population individuals need to optimize the path structures when the nodes in the routes are changed or the generation is updated. When the stops served by route ωk and the end (feeder station) of ωk are determined, the path structure optimization of ωk can come down to an open vehicle routing problem with one depot (i.e., the feeder station). Thus, we adopt 2pk iterations of the 2-opt strategy to optimize the route structure, where pk is the number of nodes on the route. Because of the high probability that some elite gene segments of the offspring can be inherited from the parents, the fixed iterations of the route structure optimization for every individual of each generation can improve the population quality.


### 5.3. Genetic Coding

In this paper, we use an intuitional style to code the feeder-bus plan. Thus, every node in the network is expressed by a natural number; we also identify the bus stops or railway stations with different number sets. Then, a feeder-bus route would be a number substring ending at a railway station, and the whole coding scheme of the network would be the sequential connection of these route substrings. Note that the coding length of the network plan depends on the total route number designed in the transit system and it is not fixed.For example, whenB={1,2,3,4,5,6,7,8,9,10} and T={11,12,13}, a sample feeder-bus network can be expressed as 1 2 311 4 6 12 5 712 8 9 10 13; substrings 1 2 3 11, 4 6 12, 5 7 12, and 8 9 10 13stand for 4 feeder-bus routes, respectively, in which the boldface numbers stand for the feeder stations.Based on objective function (10) and considering the feasibility of constraint (9) simultaneously, the fitness function of individual Ω is constructed as follows:
(17)F(Ω)=1λZ(Ω)+λ[12NvB(T-t)-∑k=1Kfk∑i=1I∑h=1I+JLihXihk],
where λ is a penalty factor.


### 5.4. Initial Population

Each feeder-bus network in the initial population is generated one route by one route. Due to that, all the routes end at railway stations, so a feeder-bus stationj∈T can be selected first; then we choose a bus stop i∈B with a choice probability, insert this stop into an existing route that terminates at node j, or link it directly with node j to generate a new route. In this way, the generation of a network is finished when all the bus stops have been selected.In order to improve the individual quality of the initial population, we construct a function to evaluate the connecting relationship between a bus stop and a railway station so that the roulette selection method is utilized to compute the selection probability. LetDCij*=maxi∈BDCij+mini∈BDCij; then, the evaluation function between stopiand stationjis
(18)Fij=DCij*-DCij.
For station j, the selection probability of stop i is Fij/∑i=1IFij.The construction algorithm of a feeder-bus network of the initial population is as follows.Algorithm 1.
(
1
)Let B′=B, where B′ stands for the set of stops that could be selected to construct the current feeder-bus route. Ω=∅ is a feeder-bus network and k=0 is the number of routes that have been generated.
(
2
)If B′=ϕ, the algorithm terminates. Otherwise, randomly select a stationjfromTwith equal probability.
(
3
)A random number R∈(0,1) is created according to uniform distribution. Take a stopifromB′, which satisfies∑i=1i-1Fij/∑i=1IFij≤R<∑i=1iFij/∑i=1IFij.
(
4
)Letωijbe the direct route from i tojand M the number of routes ending atjinΩ. IfM=0, setΩ=Ω∪{ωij},B′=B′∖i, k=k+1; go to(2). Otherwise, form=1,…,M, insertiinto themth route that ends atjinΩ, form the corresponding networkΩmand letΩM+1=Ω∪{ωij}; letΩ′=argmin{Z(Ωm)∣m=1,…,M+1}; ifΩ′=ΩM+1,k=k+1;Ω=Ω′,B′=B′∖i; go to(2).Letnbe the size of the initial population, which could be reasonably determined according to the values of I and J. The initial population is constructed by calling Algorithm 1  ntimes.


### 5.5. Genetic Operators

(1)  Selection and Replication Operator. To strengthen the searching ability of the GA, competition and intrusion mechanisms are introduced to construct the parent population. The former is that the population withnindividuals is replicated to form a new population with 2n individuals firstly; then these2nindividuals are divided intonpairs arbitrarily and the better individuals are preserved by comparing the fitness of each pair. The latter means that αn new individuals by Algorithm 1 are introduced to replace theαnworst ones of the current population, whereαis an intrusion ratio. The value ofαis dynamically controlled in the range of[α_,α-]. Setα=min(2*α,α-)when the best solution has not been improved in Tα times generations; setα=α_when the best solution is improved.(2)  Crossover Operator. Here, we take two parents to generate two offspring with crossover probabilityPc. In order to ensure that offspring individuals can inherit the elite gene from the parents, gene segments of routes of which the average cost per passenger is lower are chosen and inserted into the offspring individuals. In individualΩl, let the node of locus i beVli, let the number of routes nl, and let the average cost per passenger ofωk be ACk.Choose the two parentsΩl1andΩl2and generate offspringΩlbased onΩl1. Firstly, compare the average travel cost per passenger of the two gene segments that start the nodeVl11, the first locus ofΩl1, inΩl1andΩl2. The better option is to chooseΩland deleteVl11from the two parents. Then, make the comparison of the gene segments that start the last node inΩlin the two parents untilΩlterminates at a railway station and a route inΩlis generated. Then, delete the routes that cannot satisfy constraint (5) or combine the two shortest routes in each parent. With the above method, gene segments of the parents are selected to join the offspring constantly, and the routes of the offspring are constructed one by one until the whole offspring feeder-bus network is formed. The detailed algorithm is described as follows.Algorithm 2.
(
1
)Take the parentsΩl1andΩl2, and the generated offspringΩl. Set Ωl1′=Ωl1, Ωl2′=Ωl2, andi=1.
(
2
)Ifnl1′=0, go to(7); otherwise, select the locusi′=1and the corresponding route isωk1inΩl1′. SetVli=Vl1i′.
(
3
)Find locusj′fromΩl2′, satisfyingVl2j′=Vl1i′, and the corresponding route isωk2; go to(5).
(
4
)Find locusi′fromΩl1′, satisfyingVl2j′=Vl1i′, and the corresponding route isωk1; go to(5).
(
5
)WhenACk1≤ACk2, setVli+1=Vl1i′+1, Ωl2′=Ωl2′∖Vl2j′, Ωl2′=Ωl2′∖Vl2j′, i=i+1, and ifVli+1is not a railway station, go to(3); otherwise,nl=nl+1; go to(6).
WhenACk1>ACk2, setVli+1=Vl2j′+1, Ωl1′=Ωl1′∖Vl1i′, Ωl2′=Ωl2′∖Vl2j′, i=i+1, and ifVli+1is not a railway station, go to(4); otherwise,nl=nl+1; go to(6).
(
6
)Delete those routes in Ωl1 and Ωl2 that do not satisfy constraint (5). If all the routes satisfy constraint (5) in Ωl1′ orΩl2′, combine the two shortest routes in the corresponding parent; go to (2).
(7) Optimize the path structure ofnlroutes inΩl, respectively.
Based onΩl2, another offspring can be generated in the same way.Taking the following parents, the crossover operator that generates offspring 1 based on parent 1 is shown as follows:Parent 1: 1 2 3 11 4 6 12 5 7 12 8 9 10 13Parent 2: 4 8 12 5 2 11 1 9 3 12 10 6 7 13.First, node 1 at the first locus in parent 1 is used as the node of offspring 1 at locus 1. Then, gene segments 1-2 in parent 1 and 1–9 in parent 2 are compared; 1-2 are supposed to join offspring 1. Subsequently, 2-3 and 2–11 are compared. Offspring 1 is as below:Offspring 1 : 1 2 11⋯(3)  Mutation Operator. A mutation operator with mutation probabilityPcis used to strengthen the global optimization ability of the GA. According to the types of genes randomly selected from one individual, exchange or insertion mutations are made: if the selected gene is a bus stop, it will be randomly inserted into another locus (insertion mutation); if the selected gene is a station, it will be randomly replaced by another station (exchange mutation). To guarantee the quality of the mutation, the acceptance probability of a mutation solution is
(19)p={1,ΔZ<0,e(-ΔZ/Z0),ΔZ≥0,
whereZ0is the fitness of the best individual so far andΔZis the objective difference of the solution mutation before and after.(4)  Elite Preservation Strategy and Algorithm Termination Rules. To preserve the elite individuals of parent populations, the worst 4% of offspring individuals are replaced by the same proportion of the best ones. The termination rules of the GA make use of the maximum generationsTmaxor the maximum generationsT0without improving the best solution so far.


## 5.1. Optimal Frequency for Each Route

In feeder-bus networkΩ, the path structure and cost of a feeder-bus route are not correlated with the other routes; therefore, the operating frequency of each route can be set independently. For feeder-bus route ωk, according to the objective function (10), its cost is
(11)Ck=λTvT(∑i=n1knPk-1k∑d=I+1I+JPidLnPkd)+λwPk2fk+λnPk(Pk-∑i=n1knPk-1kPinPk)+2λbfkLk+(λr{Lk∑d=I+1I+JPn1kd+(Lk-Ln1kn2k)×∑d=I+1I+JPn2kd+⋯+LnPk-1knPk∑d=I+1I+JPnPk-1kd})×(vB)-1.
In order to minimize Ck, the optimal operating frequency without any constraint can be obtained by the first-order optimality condition of Ck with respect to fk in (11) as follows:
(12)fk*=12λwPkλbLk.
Then, the optimal operating frequency of ωk under constraint (8) is
(13)f-k*=max{12λwPkλbLk,Pk(Cρ)}.
Under the optimal frequencyf-k*, the minimum route cost of ωk is
(14)Ck*=λTvT(∑i=n1knPk-1k∑d=I+1I+JPidLnPkd)+λwPk2f-k*+λnPk(Pk-∑i=n1knPk-1kPinPk)+2λbf-k*Lk+(λr{Lk∑d=I+1I+JPn1kd+(Lk-Ln1kn2k)×∑d=I+1I+JPn2kd+⋯+LnPk-1knPk∑d=I+1I+JPnPk-1kd})×(vB)-1.
Thus, the total operating cost of Ω is
(15)Z(Ω)=∑k=1KCk*.
Particularly, the optimal operating frequency f-ij* of direct-link route ωij, which directly links stop i∈B and station j∈T, ismax{(1/2)λw∑d=I+1I+JPid/λbLij,∑d=I+1I+JPid/(Cρ)}. Then, accordingly, the total operating cost DCij of ωij is
(16)DCij=λTvT(∑d=I+1I+JPidLjd)+λw∑d=I+1I+JPid2f-ij*+λrLij∑d=I+1I+JPidvB+λj(∑d=I+1I+JPid-Pij)+2λbf-ij*Lij.


## 5.2. Optimization Strategy for the Route Structure

In the process of the GA, all routesωk in the population individuals need to optimize the path structures when the nodes in the routes are changed or the generation is updated. When the stops served by route ωk and the end (feeder station) of ωk are determined, the path structure optimization of ωk can come down to an open vehicle routing problem with one depot (i.e., the feeder station). Thus, we adopt 2pk iterations of the 2-opt strategy to optimize the route structure, where pk is the number of nodes on the route. Because of the high probability that some elite gene segments of the offspring can be inherited from the parents, the fixed iterations of the route structure optimization for every individual of each generation can improve the population quality.


## 5.3. Genetic Coding

In this paper, we use an intuitional style to code the feeder-bus plan. Thus, every node in the network is expressed by a natural number; we also identify the bus stops or railway stations with different number sets. Then, a feeder-bus route would be a number substring ending at a railway station, and the whole coding scheme of the network would be the sequential connection of these route substrings. Note that the coding length of the network plan depends on the total route number designed in the transit system and it is not fixed.For example, whenB={1,2,3,4,5,6,7,8,9,10} and T={11,12,13}, a sample feeder-bus network can be expressed as 1 2 311 4 6 12 5 712 8 9 10 13; substrings 1 2 3 11, 4 6 12, 5 7 12, and 8 9 10 13stand for 4 feeder-bus routes, respectively, in which the boldface numbers stand for the feeder stations.Based on objective function (10) and considering the feasibility of constraint (9) simultaneously, the fitness function of individual Ω is constructed as follows:
(17)F(Ω)=1λZ(Ω)+λ[12NvB(T-t)-∑k=1Kfk∑i=1I∑h=1I+JLihXihk],
where λ is a penalty factor.


## 5.4. Initial Population

Each feeder-bus network in the initial population is generated one route by one route. Due to that, all the routes end at railway stations, so a feeder-bus stationj∈T can be selected first; then we choose a bus stop i∈B with a choice probability, insert this stop into an existing route that terminates at node j, or link it directly with node j to generate a new route. In this way, the generation of a network is finished when all the bus stops have been selected.In order to improve the individual quality of the initial population, we construct a function to evaluate the connecting relationship between a bus stop and a railway station so that the roulette selection method is utilized to compute the selection probability. LetDCij*=maxi∈BDCij+mini∈BDCij; then, the evaluation function between stopiand stationjis
(18)Fij=DCij*-DCij.
For station j, the selection probability of stop i is Fij/∑i=1IFij.The construction algorithm of a feeder-bus network of the initial population is as follows.Algorithm 1.
(
1
)Let B′=B, where B′ stands for the set of stops that could be selected to construct the current feeder-bus route. Ω=∅ is a feeder-bus network and k=0 is the number of routes that have been generated.
(
2
)If B′=ϕ, the algorithm terminates. Otherwise, randomly select a stationjfromTwith equal probability.
(
3
)A random number R∈(0,1) is created according to uniform distribution. Take a stopifromB′, which satisfies∑i=1i-1Fij/∑i=1IFij≤R<∑i=1iFij/∑i=1IFij.
(
4
)Letωijbe the direct route from i tojand M the number of routes ending atjinΩ. IfM=0, setΩ=Ω∪{ωij},B′=B′∖i, k=k+1; go to(2). Otherwise, form=1,…,M, insertiinto themth route that ends atjinΩ, form the corresponding networkΩmand letΩM+1=Ω∪{ωij}; letΩ′=argmin{Z(Ωm)∣m=1,…,M+1}; ifΩ′=ΩM+1,k=k+1;Ω=Ω′,B′=B′∖i; go to(2).Letnbe the size of the initial population, which could be reasonably determined according to the values of I and J. The initial population is constructed by calling Algorithm 1  ntimes.


## 5.5. Genetic Operators

(1)  Selection and Replication Operator. To strengthen the searching ability of the GA, competition and intrusion mechanisms are introduced to construct the parent population. The former is that the population withnindividuals is replicated to form a new population with 2n individuals firstly; then these2nindividuals are divided intonpairs arbitrarily and the better individuals are preserved by comparing the fitness of each pair. The latter means that αn new individuals by Algorithm 1 are introduced to replace theαnworst ones of the current population, whereαis an intrusion ratio. The value ofαis dynamically controlled in the range of[α_,α-]. Setα=min(2*α,α-)when the best solution has not been improved in Tα times generations; setα=α_when the best solution is improved.(2)  Crossover Operator. Here, we take two parents to generate two offspring with crossover probabilityPc. In order to ensure that offspring individuals can inherit the elite gene from the parents, gene segments of routes of which the average cost per passenger is lower are chosen and inserted into the offspring individuals. In individualΩl, let the node of locus i beVli, let the number of routes nl, and let the average cost per passenger ofωk be ACk.Choose the two parentsΩl1andΩl2and generate offspringΩlbased onΩl1. Firstly, compare the average travel cost per passenger of the two gene segments that start the nodeVl11, the first locus ofΩl1, inΩl1andΩl2. The better option is to chooseΩland deleteVl11from the two parents. Then, make the comparison of the gene segments that start the last node inΩlin the two parents untilΩlterminates at a railway station and a route inΩlis generated. Then, delete the routes that cannot satisfy constraint (5) or combine the two shortest routes in each parent. With the above method, gene segments of the parents are selected to join the offspring constantly, and the routes of the offspring are constructed one by one until the whole offspring feeder-bus network is formed. The detailed algorithm is described as follows.Algorithm 2.
(
1
)Take the parentsΩl1andΩl2, and the generated offspringΩl. Set Ωl1′=Ωl1, Ωl2′=Ωl2, andi=1.
(
2
)Ifnl1′=0, go to(7); otherwise, select the locusi′=1and the corresponding route isωk1inΩl1′. SetVli=Vl1i′.
(
3
)Find locusj′fromΩl2′, satisfyingVl2j′=Vl1i′, and the corresponding route isωk2; go to(5).
(
4
)Find locusi′fromΩl1′, satisfyingVl2j′=Vl1i′, and the corresponding route isωk1; go to(5).
(
5
)WhenACk1≤ACk2, setVli+1=Vl1i′+1, Ωl2′=Ωl2′∖Vl2j′, Ωl2′=Ωl2′∖Vl2j′, i=i+1, and ifVli+1is not a railway station, go to(3); otherwise,nl=nl+1; go to(6).
WhenACk1>ACk2, setVli+1=Vl2j′+1, Ωl1′=Ωl1′∖Vl1i′, Ωl2′=Ωl2′∖Vl2j′, i=i+1, and ifVli+1is not a railway station, go to(4); otherwise,nl=nl+1; go to(6).
(
6
)Delete those routes in Ωl1 and Ωl2 that do not satisfy constraint (5). If all the routes satisfy constraint (5) in Ωl1′ orΩl2′, combine the two shortest routes in the corresponding parent; go to (2).
(7) Optimize the path structure ofnlroutes inΩl, respectively.
Based onΩl2, another offspring can be generated in the same way.Taking the following parents, the crossover operator that generates offspring 1 based on parent 1 is shown as follows:Parent 1: 1 2 3 11 4 6 12 5 7 12 8 9 10 13Parent 2: 4 8 12 5 2 11 1 9 3 12 10 6 7 13.First, node 1 at the first locus in parent 1 is used as the node of offspring 1 at locus 1. Then, gene segments 1-2 in parent 1 and 1–9 in parent 2 are compared; 1-2 are supposed to join offspring 1. Subsequently, 2-3 and 2–11 are compared. Offspring 1 is as below:Offspring 1 : 1 2 11⋯(3)  Mutation Operator. A mutation operator with mutation probabilityPcis used to strengthen the global optimization ability of the GA. According to the types of genes randomly selected from one individual, exchange or insertion mutations are made: if the selected gene is a bus stop, it will be randomly inserted into another locus (insertion mutation); if the selected gene is a station, it will be randomly replaced by another station (exchange mutation). To guarantee the quality of the mutation, the acceptance probability of a mutation solution is
(19)p={1,ΔZ<0,e(-ΔZ/Z0),ΔZ≥0,
whereZ0is the fitness of the best individual so far andΔZis the objective difference of the solution mutation before and after.(4)  Elite Preservation Strategy and Algorithm Termination Rules. To preserve the elite individuals of parent populations, the worst 4% of offspring individuals are replaced by the same proportion of the best ones. The termination rules of the GA make use of the maximum generationsTmaxor the maximum generationsT0without improving the best solution so far.


## 6. Numerical Examples

The benchmark problem is taken from [6]. The network includes 55 bus stops and 4 railway stations, serving 2 * 2.5 square miles. The demand density of each stop per period (one hour) is 200 passengers. The values of the model parameters are shown in Table 1. The GA is designed based on the C# language. In the GA, we taken=120,Pc=0.8,Pm=0.08,Tmax=1200, T0=100,α_=0.05, α-=0.30, and Tα=20.Table 1
Model parameters.
Parameter
Unit
Value
C
Seat
50
ρ
1.2
t
Hour
0.16
N
Vehicle
110
λ
w
$/passenger-hour
8
λ
r
$/passenger-hour
4
λ
T
$/passenger-hour
4.5
λ
i
$/passenger
0.03
λ
b
$/vehicle-mile
3
V
B
Mile/hour
20
V
T
Mile/hour
30
λ
0.0001


### 6.1. M-to-1 Demand Pattern

Railway station 56 is regarded as the central business district of the service area and the destination of all the passengers, so the demand is a distribution pattern between multiple stops and one station. The best feeder-bus network is shown in Figure1 and Table 2.Table 2
Solution indicators under M-to-1.
Total cost ($)
6474
Number of routes
15
Average length per route (miles)
1.02
Average frequency per route (trips/hour)
22.12Figure 1
Optimal network under M-to-1.Figure2 shows a change in the objective function when the number of generations increases in the solving process. It illustrates that the GA presented in this paper performs a fast convergence speed.Figure 2
Convergence efficiency of GA under M-to-1.


### 6.2. Comparison of Best Solutions

To compare the optimal solutions with other approaches, we neglect the transfer cost (i.e.,λj=0) and make the total cost of this paper accord with other methods, including saving heuristics [6], displacement heuristics, basic TS [14], and TS with intensification [16]. However, the bus riding-time cost is roughly approximated by estimating the total passenger-miles in these studies and there are some differences in constraints (8) and (9) in the models of [6, 16]. Table 3 gives the best solutions of these studies.Table 3
Comparison of the best solutions.
Solution approaches
Total cost ($)
Route no.
Average length per route (miles)
Average frequency per route (trips/hour)
Average computational time (seconds)
Saving heuristics [6]
6824
16
1.05
21.06
—
Displacement heuristics [14]
6363
18
0.84
22.54
—
Basic TS [14]
6355
18
0.85
22.18
—
TS with intensification [16]
6371
19
0.80
22.76
13.8
GA (in this paper)
6281
15
1.01
22.01
21.6The results show that the total cost of the GA saves 8.0%, 1.3%, 1.2%, and 1.4% compared to the other approaches [6, 14, 16], respectively. Because the length of each route is not arbitrarily limited in our paper compared with the other studies, a better solution is obtained and the number of routes decreases. In the best solution of the GA, the number of routes and average route length are similar to those in the saving heuristics, while the total cost is lower.


### 6.3. M-to-M Demand Patterns

To study the change in the optimal network under various demand distributions, the patterns of passenger demand between each stop and 4 railway stations are generated by an arithmetic progression, the first term of which isaand the common difference is q. For example, when a=20 and q=20, the number of passengers from each stop to stations 56–59 is 20, 40, 60 and 80, respectively. Obviously, the imbalance of the demand distribution increases when a decreases from 50 to 0. The results under different values of a are shown in Table 4 and Figure 3 shows the optimal feeder-bus network under the uniform distribution demand between the 4 railway stations (q=0).Table 4
Indicators of optimal solutions under various demand distributions.
a
System cost ($)
Station’s transfer passengers
Number of routes
Average route length
Average route frequency
Average travel time (bus : train)
Nonlinear coefficient
56
57
58
59
50
6515
1600
3800
4600
1000
19
0.79
21.88
0.51 : 0.53
1.28
40
6511
1400
3600
5000
1000
19
0.80
21.93
0.51 : 0.51
1.27
30
6505
800
3800
4600
1800
18
0.84
22.06
0.50 : 0.48
1.27
20
6494
1000
3000
5200
1800
18
0.84
21.99
0.50 : 0.48
1.25
10
6476
800
2800
5600
1800
16
0.93
22.21
0.47 : 0.41
1.25
0
6437
800
2800
4800
2600
17
0.89
22.04
0.50 : 0.42
1.22Figure 3
Optimal feeder-bus network underq=0.Figure4 shows a change in the objective function under the demand pattern of M-to-M andq=0. It shows that the convergence speed of GA under M-to-M is satisfactory as well as M-to-1. From Table 4, the following observations regarding the demand distributions effect on the optimal feeder-bus networks can be found.(1)
For a given railway station, with the increase in passengers who terminate at a station, the number of passengers who choose to feed into this station increases grossly, as seen in Figure5.(2)
The demand distribution has an obvious effect on the average riding time by bus and train, as shown in Figure6. With the increase in the demand imbalance between the stations, the difference in the average travel time in the two traffic modes becomes gradually more significant and the total travel time on the integrated transport network decreases simultaneously because the feeder station and route structure are influenced by major passengers.(3)
As Figure7 shows, with the increase in the demand imbalance between stations, namely, the concentration of demand destinations, passengers’ non-linear coefficient falls and the system total cost also decreases remarkably. The reason is that the concentration of demand destinations makes most passengers obtain a better service, which causes a decline in the system’s total cost.Figure 4
Convergence efficiency of GA under M-to-M.Figure 5
Effect of termination passengers on feeder passengers at stations.Figure 6
Effect of demand distribution on passengers’ travel time.Figure 7
Relation between demand distribution and system cost or nonlinear coefficient.According to the above analysis and the difference between Figures1 and 3, we can draw the conclusion that the demand distribution has a great effect on the volume of passengers choosing given feeder-bus stations and the path structure of feeder routes, which will further influence the total cost of the whole feeder system.


## 6.1. M-to-1 Demand Pattern

Railway station 56 is regarded as the central business district of the service area and the destination of all the passengers, so the demand is a distribution pattern between multiple stops and one station. The best feeder-bus network is shown in Figure1 and Table 2.Table 2
Solution indicators under M-to-1.
Total cost ($)
6474
Number of routes
15
Average length per route (miles)
1.02
Average frequency per route (trips/hour)
22.12Figure 1
Optimal network under M-to-1.Figure2 shows a change in the objective function when the number of generations increases in the solving process. It illustrates that the GA presented in this paper performs a fast convergence speed.Figure 2
Convergence efficiency of GA under M-to-1.


## 6.2. Comparison of Best Solutions

To compare the optimal solutions with other approaches, we neglect the transfer cost (i.e.,λj=0) and make the total cost of this paper accord with other methods, including saving heuristics [6], displacement heuristics, basic TS [14], and TS with intensification [16]. However, the bus riding-time cost is roughly approximated by estimating the total passenger-miles in these studies and there are some differences in constraints (8) and (9) in the models of [6, 16]. Table 3 gives the best solutions of these studies.Table 3
Comparison of the best solutions.
Solution approaches
Total cost ($)
Route no.
Average length per route (miles)
Average frequency per route (trips/hour)
Average computational time (seconds)
Saving heuristics [6]
6824
16
1.05
21.06
—
Displacement heuristics [14]
6363
18
0.84
22.54
—
Basic TS [14]
6355
18
0.85
22.18
—
TS with intensification [16]
6371
19
0.80
22.76
13.8
GA (in this paper)
6281
15
1.01
22.01
21.6The results show that the total cost of the GA saves 8.0%, 1.3%, 1.2%, and 1.4% compared to the other approaches [6, 14, 16], respectively. Because the length of each route is not arbitrarily limited in our paper compared with the other studies, a better solution is obtained and the number of routes decreases. In the best solution of the GA, the number of routes and average route length are similar to those in the saving heuristics, while the total cost is lower.


## 6.3. M-to-M Demand Patterns

To study the change in the optimal network under various demand distributions, the patterns of passenger demand between each stop and 4 railway stations are generated by an arithmetic progression, the first term of which isaand the common difference is q. For example, when a=20 and q=20, the number of passengers from each stop to stations 56–59 is 20, 40, 60 and 80, respectively. Obviously, the imbalance of the demand distribution increases when a decreases from 50 to 0. The results under different values of a are shown in Table 4 and Figure 3 shows the optimal feeder-bus network under the uniform distribution demand between the 4 railway stations (q=0).Table 4
Indicators of optimal solutions under various demand distributions.
a
System cost ($)
Station’s transfer passengers
Number of routes
Average route length
Average route frequency
Average travel time (bus : train)
Nonlinear coefficient
56
57
58
59
50
6515
1600
3800
4600
1000
19
0.79
21.88
0.51 : 0.53
1.28
40
6511
1400
3600
5000
1000
19
0.80
21.93
0.51 : 0.51
1.27
30
6505
800
3800
4600
1800
18
0.84
22.06
0.50 : 0.48
1.27
20
6494
1000
3000
5200
1800
18
0.84
21.99
0.50 : 0.48
1.25
10
6476
800
2800
5600
1800
16
0.93
22.21
0.47 : 0.41
1.25
0
6437
800
2800
4800
2600
17
0.89
22.04
0.50 : 0.42
1.22Figure 3
Optimal feeder-bus network underq=0.Figure4 shows a change in the objective function under the demand pattern of M-to-M andq=0. It shows that the convergence speed of GA under M-to-M is satisfactory as well as M-to-1. From Table 4, the following observations regarding the demand distributions effect on the optimal feeder-bus networks can be found.(1)
For a given railway station, with the increase in passengers who terminate at a station, the number of passengers who choose to feed into this station increases grossly, as seen in Figure5.(2)
The demand distribution has an obvious effect on the average riding time by bus and train, as shown in Figure6. With the increase in the demand imbalance between the stations, the difference in the average travel time in the two traffic modes becomes gradually more significant and the total travel time on the integrated transport network decreases simultaneously because the feeder station and route structure are influenced by major passengers.(3)
As Figure7 shows, with the increase in the demand imbalance between stations, namely, the concentration of demand destinations, passengers’ non-linear coefficient falls and the system total cost also decreases remarkably. The reason is that the concentration of demand destinations makes most passengers obtain a better service, which causes a decline in the system’s total cost.Figure 4
Convergence efficiency of GA under M-to-M.Figure 5
Effect of termination passengers on feeder passengers at stations.Figure 6
Effect of demand distribution on passengers’ travel time.Figure 7
Relation between demand distribution and system cost or nonlinear coefficient.According to the above analysis and the difference between Figures1 and 3, we can draw the conclusion that the demand distribution has a great effect on the volume of passengers choosing given feeder-bus stations and the path structure of feeder routes, which will further influence the total cost of the whole feeder system.


## 7. Conclusions

This paper studies the optimal design problem of a feeder-bus network under the demand pattern of M-to-M. The drawback in most existing related research, that only a single destination exists (M-to-1 demand pattern), is modified to the M-to-M pattern for better accordance with the realistic demand distribution. In order to minimize the passenger travel cost and transit operating cost, an integrated public transport system of a feeder-bus network and railway is regarded as a whole to calculate the passenger travel cost overall. The results show that passenger demand distributions have a significant influence on feeder-bus network construction, especially on the feeder stations, the paths and frequencies, of feeder bus routes. Therefore, demand distributions should be considered when designing a feeder-bus network.Usually public transportation network planning has symmetry, though differences in two directions are not considered in this paper. If the demand on a feeder-bus network has an obvious tidal phenomenon with time distribution, and the operating frequencies in different directions differ greatly, a directed feeder-bus network should be designed according to the directional demand.One prerequisite of the FBNDP in this paper is that the station layout has to be determined. In our work, the optimal frequencies of feeder bus routes are determined according to the feeder passenger between rail and bus transit system. If one feeder-bus route only services few passengers, it could be removed from the feeder-bus network.



---

*Source: 483682-2013-12-04.xml*