# Designing High-Freedom Responsive Feeder Transit System with Multitype Vehicles

Authors: Zhengwu Wang; Jie Yu; Wei Hao; Tao Chen; Yi Wang
Journal: Journal of Advanced Transportation
 (2020)

---

## Abstract

The last mile travelling problem is the most challenging part when using public transit. This study designs a high-freedom responsive feeder transit (HFRFT) system to serve at the transfer station, given vehicle routes, departure time, and service area based on demand. The proposed feeder transit system employs a travelling mode with multitype vehicles. In order to improve the operation of the HFRFT system, the optimization design methods are suggested for vehicle routes, scheduling, and service area. A mixed integer programming model and its hybrid of a metaheuristic algorithm are proposed to efficiently and integrally solve the vehicle routes and scheduling parameters according to the reservation requirements. A heuristic method is proposed to optimize the service area based on the equilibrium of system supply and demand. Case studies show that the mixed running mode of multiple models can significantly improve the seat utilization, which can also significantly reduce the number of departures and the average travel distance per passenger. The proposed service area optimization method is proved to be feasible to improve the last mile travel.


---

## Body

## 1. Introduction

In areas where passenger travel density is low, fixed route transit (FRT) has a low seat utilization rate due to low and scattered passenger flow. The bus company has a low operating efficiency, which is difficult to sustain. With the development of communication technology and automatic control technology, intelligent public transportation has gradually become a major trend in the development of traffic field [1–7]. Consequently, the public transportation field is largely affected by the Internet Plus Era, and passenger information can connect with bus company in real time. Using the Internet-of-things, passengers can indicate their own travel needs through online travel information platforms, and bus companies can also plan bus schedules based on passenger travel information and actual operating conditions in response to the travel demand. In recent years, a new kind of transportation mode called demand-responsive transit (DRT) has emerged. Compared with the conventional FRT, DRT can realize door-to-door service and effectively solve the last mile travelling problem with improved mobility and flexibility. Moreover, DRT is more suitable for low-density residents’ travel areas and disadvantaged people (the elderly, the disabled, etc.) than FRT.Responsive feeder transit (RFT) is a special form of demand-responsive transit (DRT), also known as demand-responsive connector (DRC), which is a flexible transit service because it operates in a demand responsive fashion within a service area and moves customers to/from a transfer point that connects to an RFT network [8]. RFT services have a significant advantage that they can increase the service coverage and accessibility compared with traditional fixed route transit, by offering a capacity with better alignment [9, 10].Most of the current studies on DRT (shown in Table1) focused on the vehicle’s routing model, coordinated application of DRT and FRT, key parameters such as service performance, scheduling parameters including vehicle departure time, total number of vehicles, vehicle type etc., geometric features in the service area, critical demand density, and so on. However, limited studies have been conducted to study the coordination of vehicle routes and schedules.Table 1
A summary of existing studies on DRT.
Research contentPapersVehicle routing modelSaberi and Verbas [11]; Yan et al. [12]; Yao et al. [13]; Ma et al. [2, 3]; Dessouky et al. [14]; Pan et al. [15]; Núñez et al. [16]; Ghannadpour et al. [17]; Schilde et al. [18]; Kirchler and Calvo [19]; Sun et al. [20]; Yu et al. [13]; Tang et al. [21]Coordinated application of DRT and FRTAldaihani et al. [22]; Sheu [23]; Guo et al. [10]; Rahimia et al. [24]; Chen and Nie [25]; Qiu et al [26]Service performanceAlshalalfah and Shalaby [27]; Nourbakhsh and Ouyang [28]; Alshalalfah and Shalaby [29]; Chandra and Quadrifoglio [30, 31]; Edwards and Watkins [32]; Kelly et al. [33]; Engelen et al. [34]; Freia et al [35]; Gschwender et al. [36]; Rahimia et al. [24];Scheduling parametersKikuchiand Donnelly [37]; Hsu [38]; Nair and Miller-Hooks [39]; Lu et al. [40, 41]; Zheng et al. [42]; Rahimi et al. [24]; Tang et al. [43]; Guo et al. [44]; Chandra and Quadrifoglio [45]; Dessouky and Adam [46]; Nourbakhsh and Ouyang [28]; Gschwender et al. [36]Geometric features in the service areaZhao and Dessouky [47]; Li and Quadrifoglio [48]; Errico et al. [49]; Chandra and Quadrifoglio [30, 31]; Li and Quadrifoglio [50];Critical demand densityQuadrifoglio et al. [51–53]; Amiripour et al. [54]; Frei et al. [35]Site selectionPratelli and Schoen [55]; Razi and Muhammad [56]In many cases of DRT, vehicle running mode can involve four types, as shown in Figure1. Type A is the main running mode of mobility allowance shuttle transit (MAST) [51], high-coverage point-to-point transit [57], and demand-responsive feeder transit circulator [13]. Type B is the main running mode of dial-a-ride [18, 19]. Type C and D are both the main running modes of RFT [15, 30].Figure 1
Four types of vehicle running modes (qij(i or j ≠ o) are the demands from stop i to stop j, and qpi and qdi are the number of pick-up or deliver passengers in the stop i, respectively). (a) Type A. (b) Type B. (c) Type C. (d) Type D.
(a)(b)(c)(d)In Figure1, the running route and bus stop of type A are basically fixed with only part of the route being adjusted according to the passengers’ demands, and passengers are allowed to get on and off at the middle stops and the terminal stops. Meanwhile, the running route and service areas of type B are not fixed. After the vehicle completing one journey, it will continue the next journey; both type C and type D operate around the transfer station (the service area is relatively fixed), and the terminal stops are located at the transfer stations. Type C can only pick up passengers from the middle stops to the transfer station or from the transfer station to the middle stops, while type D can pick up passengers from the middle stops to the transfer station and from the transfer station to the middle stops simultaneously.RFT can be divided into two categories based on the freedom of service areas, running route, and bus stops.


### 1.1. Low-Freedom RFT

Low-freedom RFT (LFRFT), whose terminal stops and some sections of the route and middle stops are fixed when others may be limitedly adjusted, can only respond to passengers’ demands to a lower degree. LFRFT is formed by partially adjusting FRT (Nourbakhsh and Ouyang [28], Yu et al. [13], Guo et al. [10], Lu et al. [40, 41], Gschwender et al. [36], Alshalalfah and Shalaby [29], and so on) (shown in Table 2).Table 2
A summary of some existing studies on RFT.
ReferenceResearch objectModel typeVehicle numberArea shapeDeparture timeRunning modeDemand typeCapacity constraintDemand distributionSolution methodNourbakhsh and Ouyang [28]LFRFTPlanning modelMultivehiclesSquareFixedType AReservationyesUniformSteepest decentYu et al. [13]LFRFTPlanning modelMultivehiclesCircularTime windowsType DReservationyesRandomHeuristic methodGuo et al. [10]LFRFTAnalytical modelMultivehiclesRectangleFixedType AStochasticNoRandom-Lu et al. [40, 41]LFRFTPlanning modelOne vehicleRectangleFixedType AReservation limitedNoRandomHeuristic methodGschwende et al. [36]LFRFTAnalytical modelMultivehiclesRectangle—Type ADeterminedNo——Alshalalfah and Shalaby [29]LFRFTPlanning modelMultivehiclesSquareFixedType CDeterminedyes—Heuristic methodLi and Quadrifoglio [8]HFRFTAnalytical modelOne vehicleRectangleCirculationType DReservationNoUniformInsertion algorithmQuadrifoglio and Li [53]HFRFTAnalytical modelTwo vehiclesRectangleCirculationType CReservationNoUniformInsertion algorithmEdwards and Watkins [32]HFRFTAnalytical modelOne vehicleCircularCirculationType DReservationNoUniformInsertion algorithmLi and Quadrifoglio [48]HFRFTAnalytical modelOne vehicle each zoneRectangleCirculationType DReservationNoUniformInsertion algorithmChandra and Quadrifoglio [31]HFRFTAnalytical modelMultivehiclesRectangleFixedType DReservationNoUniformInsertion algorithmChandra and Quadrifoglio [30]HFRFTAnalytical modelOne vehicleRectangleFixedType CReservationNoUniformInsertion algorithmChandra and Quadrifoglio [45]HFRFTAnalytical modelMultivehiclesRectangleFixedType DReservationNoUniformInsertion algorithmLi and Quadrifoglio [50]HFRFTAnalytical model2 vehiclesRectangleFixedType CReservationNoUniformInsertion algorithmSun et al. [20]HFRFTPlanning modelMultivehiclesRectangle—Type CReservationyesUniformHybrid BatChandra et al. [58]HFRFTAnalytical modelMultivehiclesSquareFixedType DReservationNoUniformInsertion algorithmCall-n-RidePlanning model—Type BReservationNoRandomHeuristic methodPan et al. [15]HFRFTPlanning modelMultivehiclesDetermined—Type CReservationyesHeuristic method


### 1.2. High-Freedom RFT

For the high-freedom RFT (HFRFT), the service area and terminal stops are fixed. HFRFT can respond to passengers’ demands to a greater extent. In HFRFT, running route, vehicle departure time, middle stops, stay times, and so on are optimally determined according to passenger demand. HFRFT has attracted the attention of some researchers, such as Li and Quadrifoglio [8], Edwards and Watkins [32], Sun et al. [20], and so on (shown in Table 2).Table2 summarizes previous studies on RFT. One of the remarkable features of RFT is that the analytical model and planning model have been proposed to optimize the RFT service under the reservation demands. For example, Chandra and Quadrifoglio [30], Edwards and Watkins [32], and Nourbakhsh and Ouyang [28] came up with a structured flexible transit system and built the optimization model to seek the optimum network layout, service area of each bus, and bus headway. Pan et al. [15] proposed a mixed integer linear programming model to optimize the service area and transit route planning concurrently, which features a two-level structure with an upper level to maximize the number of served passengers by the feeder transit system and a lower level to minimize the operational cost for transit operators. However, several gaps still remain in previous studies:(i)
Research on optimizing path and scheduling simultaneously is quite limited, although some studies have determined departure time according to the routes required to reservation demands [15, 20, 36].(ii)
Optimization of service areas is rarely involved when the optimization design is carried out under fixed regular service area. In fact, the service area and road network are random because land use and travel demand are not evenly distributed. Optimization of service area can fully improve the system efficiency while system demands are met. At the same time, it can also facilitate to fulfill transfer services by subareas and avoid the crossover of service areas.(iii)
Some assumptions are inconsistent with reality, such as the uniform distribution of passengers, regular service area, only one type of vehicle, and unlimited vehicle capacity. In fact, vehicle capacity has a strong effect to vehicle route and scheduling. Moreover, the impact in the mixed running mode including both pick-up and deliver passengers is even greater because deliveries at each demand point will affect pickups in subsequent and pre-sequent stations, e.g., Kirchler and Wolfler Calvo [19]. As the demand for passengers increases in the service area, it may be necessary to choose larger capacity vehicles and operate multiple vehicles at the same time (Ceder [59], Guedes and Borenstein [60]).In light of the above deficiencies, taking the mixed running mode with capacity constraint as the research object, this study proposes a integration optimization method for multitype vehicle routes and schedule on the basis of reservation requirements. The remainder of the paper is organized as follows. Section2 presents a mixed integer programming (MIP) model and its solution algorithm for multitype vehicle routes and schedule problem. Section 3 puts forward a heuristic method to optimize service area according to the principle of capacity and demand equilibrium. Section 4 displays a case to illustrate the proposed model and algorithm. Some concluding remarks and possible future work are given in Section 5.


## 1.1. Low-Freedom RFT

Low-freedom RFT (LFRFT), whose terminal stops and some sections of the route and middle stops are fixed when others may be limitedly adjusted, can only respond to passengers’ demands to a lower degree. LFRFT is formed by partially adjusting FRT (Nourbakhsh and Ouyang [28], Yu et al. [13], Guo et al. [10], Lu et al. [40, 41], Gschwender et al. [36], Alshalalfah and Shalaby [29], and so on) (shown in Table 2).Table 2
A summary of some existing studies on RFT.
ReferenceResearch objectModel typeVehicle numberArea shapeDeparture timeRunning modeDemand typeCapacity constraintDemand distributionSolution methodNourbakhsh and Ouyang [28]LFRFTPlanning modelMultivehiclesSquareFixedType AReservationyesUniformSteepest decentYu et al. [13]LFRFTPlanning modelMultivehiclesCircularTime windowsType DReservationyesRandomHeuristic methodGuo et al. [10]LFRFTAnalytical modelMultivehiclesRectangleFixedType AStochasticNoRandom-Lu et al. [40, 41]LFRFTPlanning modelOne vehicleRectangleFixedType AReservation limitedNoRandomHeuristic methodGschwende et al. [36]LFRFTAnalytical modelMultivehiclesRectangle—Type ADeterminedNo——Alshalalfah and Shalaby [29]LFRFTPlanning modelMultivehiclesSquareFixedType CDeterminedyes—Heuristic methodLi and Quadrifoglio [8]HFRFTAnalytical modelOne vehicleRectangleCirculationType DReservationNoUniformInsertion algorithmQuadrifoglio and Li [53]HFRFTAnalytical modelTwo vehiclesRectangleCirculationType CReservationNoUniformInsertion algorithmEdwards and Watkins [32]HFRFTAnalytical modelOne vehicleCircularCirculationType DReservationNoUniformInsertion algorithmLi and Quadrifoglio [48]HFRFTAnalytical modelOne vehicle each zoneRectangleCirculationType DReservationNoUniformInsertion algorithmChandra and Quadrifoglio [31]HFRFTAnalytical modelMultivehiclesRectangleFixedType DReservationNoUniformInsertion algorithmChandra and Quadrifoglio [30]HFRFTAnalytical modelOne vehicleRectangleFixedType CReservationNoUniformInsertion algorithmChandra and Quadrifoglio [45]HFRFTAnalytical modelMultivehiclesRectangleFixedType DReservationNoUniformInsertion algorithmLi and Quadrifoglio [50]HFRFTAnalytical model2 vehiclesRectangleFixedType CReservationNoUniformInsertion algorithmSun et al. [20]HFRFTPlanning modelMultivehiclesRectangle—Type CReservationyesUniformHybrid BatChandra et al. [58]HFRFTAnalytical modelMultivehiclesSquareFixedType DReservationNoUniformInsertion algorithmCall-n-RidePlanning model—Type BReservationNoRandomHeuristic methodPan et al. [15]HFRFTPlanning modelMultivehiclesDetermined—Type CReservationyesHeuristic method


## 1.2. High-Freedom RFT

For the high-freedom RFT (HFRFT), the service area and terminal stops are fixed. HFRFT can respond to passengers’ demands to a greater extent. In HFRFT, running route, vehicle departure time, middle stops, stay times, and so on are optimally determined according to passenger demand. HFRFT has attracted the attention of some researchers, such as Li and Quadrifoglio [8], Edwards and Watkins [32], Sun et al. [20], and so on (shown in Table 2).Table2 summarizes previous studies on RFT. One of the remarkable features of RFT is that the analytical model and planning model have been proposed to optimize the RFT service under the reservation demands. For example, Chandra and Quadrifoglio [30], Edwards and Watkins [32], and Nourbakhsh and Ouyang [28] came up with a structured flexible transit system and built the optimization model to seek the optimum network layout, service area of each bus, and bus headway. Pan et al. [15] proposed a mixed integer linear programming model to optimize the service area and transit route planning concurrently, which features a two-level structure with an upper level to maximize the number of served passengers by the feeder transit system and a lower level to minimize the operational cost for transit operators. However, several gaps still remain in previous studies:(i)
Research on optimizing path and scheduling simultaneously is quite limited, although some studies have determined departure time according to the routes required to reservation demands [15, 20, 36].(ii)
Optimization of service areas is rarely involved when the optimization design is carried out under fixed regular service area. In fact, the service area and road network are random because land use and travel demand are not evenly distributed. Optimization of service area can fully improve the system efficiency while system demands are met. At the same time, it can also facilitate to fulfill transfer services by subareas and avoid the crossover of service areas.(iii)
Some assumptions are inconsistent with reality, such as the uniform distribution of passengers, regular service area, only one type of vehicle, and unlimited vehicle capacity. In fact, vehicle capacity has a strong effect to vehicle route and scheduling. Moreover, the impact in the mixed running mode including both pick-up and deliver passengers is even greater because deliveries at each demand point will affect pickups in subsequent and pre-sequent stations, e.g., Kirchler and Wolfler Calvo [19]. As the demand for passengers increases in the service area, it may be necessary to choose larger capacity vehicles and operate multiple vehicles at the same time (Ceder [59], Guedes and Borenstein [60]).In light of the above deficiencies, taking the mixed running mode with capacity constraint as the research object, this study proposes a integration optimization method for multitype vehicle routes and schedule on the basis of reservation requirements. The remainder of the paper is organized as follows. Section2 presents a mixed integer programming (MIP) model and its solution algorithm for multitype vehicle routes and schedule problem. Section 3 puts forward a heuristic method to optimize service area according to the principle of capacity and demand equilibrium. Section 4 displays a case to illustrate the proposed model and algorithm. Some concluding remarks and possible future work are given in Section 5.


## 2. MIP Model and Its Solution Algorithm for Route and Scheduling

### 2.1. Problem Statement

The application scenarios of HFRFT under the mixed running mode, capacity constraint, multi-type vehicle, and reservation requirements are listed as follows.There are a certain number of multitype vehicles. For the actual bus operation, there are usually two passengers’ types in the system, one is passengers from different places to the transfer station and the other is passengers from the transfer station to different places, both of which are limited by the time window. We define these two types of passengers as those who need to be picked up and need to be sent, respectively. According to the different types of passengers, the bus running mode can be divided into alone running mode (only pick-up or deliver) and mixed running mode (both pick-up and deliver), as shown in Figure2. The same shift of the former is only allowed to serve the passengers need to be picked up or sent, while the latter is allowed to serve the passengers need to be picked up and sent at the same time. These passengers can send their own travelling information to the transit companies via customer service, mobile phone, or Internet, and the travelling information includes travel demand, boarding time/get-off time, pick-up location/deliver location, etc. After collecting the travelling information, the transit company arranges a team of vehicles to complete all passengers’ transfer tasks and maximize the system’s total benefit through the adjustment of departure time, vehicle type, and running route of all vehicles under passenger time window and vehicle capacity constraints.Figure 2
The vehicle route of different operation modes. (a) Alone running mode (only pick-up or deliver). (b) Mixed running mode (both pick-up and deliver).
(a)(b)Firstly, aiming at the maximum total benefit of the HFRFT system, the coordinated optimization model of vehicle routing and scheduling is constructed under the constraints of vehicle capacity, passenger time window, and maximum one way running time of vehicle. In the process of model construction, considering the problems of high repetition rate of running path and low average seat utilization rate of vehicles in the alone running mode, the mixed running mode with simultaneous pick up and deliver is proposed. In order to compare the performance of different running modes, it is assumed that there are three types of vehicles in RFT system, i.e., vehicles can only pick up, vehicles can only deliver, and vehicles can pick up and deliver simultaneously. Secondly, combined with the above coordination optimization model, the optimization method of service area is proposed based on the matching of transportation capacity and passenger demand.


### 2.2. Assumptions

The following assumptions are made to ensure that the proposed formulations are tractable and realistically reflect the real-world constraints:(i)
The feeder bus begins and ends each of its trips at the transfer station.(ii)
Pick-up/deliver requests sent by the passengers are collected and responded to before the beginning of each trip.(iii)
Running speed of all type vehicles is the same on all road sections.(iv)
There are enough vehicles to meet all passenger requests. All requests are responded in service area and passengers do not cancel requests.(v)
The pick-up passenger has only time window constraint on the boarding point and the deliver passenger has the drop-off point.


### 2.3. Notations

To facilitate model presentation, key parameter definitions and notations used subsequently are summarized in the notation list (Table3).Table 3
The notation list.
OTransfer stationN = {1,2,…, a}The set of passengers scheduled to go to the transfer pointB = {a + 1,a + 2,…,a + b}The set of passengers scheduled to leave the transfer pointNB = {1, 2,…, a, a + 1, a + b}The set of all passengersm, n ∈ NBThemth and nth passengersVThe type of feeder vehicleM, MvThe set of feeder vehicles and the typev vehicle, respectivelyk ∈ {1, 2, …, K }Thekth shift, and each shift corresponds only to one vehicle typeKThe maximum shifttvkmThe time when thek th shift (belongs to type v vehicle) arrives at demand point of passenger mUTm, LTmTime window upper and lower bounds on the boarding point for pick-up passengerm or on the drop-off point for deliver passenger mCv, GvFixed use cost per shift ($/shift) and travel cost unit mileage ($/mile) of typev, respectivelyQvThe capacity of typev (people)CTicket price ($/people)NvkPassengers’ set of thekth shift (belongs to type v vehicle)Lmn,tmnShortest path distance (miles) and time (hours) from demand point of passengerm to passenger n, respectivelyVVehicle speed (miles/hour)DvkThe number of passengers in the feeder vehicle when thekth shift (belongs to type v vehicle) driving away from the transfer stationTThe maximum running time in one-way (hours)TvkThe departure time of thekth shift (belongs to type v vehicle)DTmThe reservation departure time from the transfer station of passengermxvkmnBinary variablexvkmn=1 if the kth shift (belongs to type v vehicle) is driving from demand point of passenger m to passenger n, otherwise 0xvkBinary variablexvkmn=1 if the kth shift (belongs to type v vehicle) is used, otherwise 0xvkmBinary variablexvkm=1 if the kth shift (belongs to type v vehicle) is passing the demand point of passenger m, otherwise 0θvkmBinary variable.θvkm=1 if passenger m is taking the kth shift (belongs to type v vehicle) to the transfer station, otherwise −1xvkmnBinary variable.xvkmn=1 if the kth shift (belongs to type v vehicle) is driving from demand point of passenger m to passenger n, otherwise 0PEm,PLmPenalty function for early and late arrival at the demand point of passengerm, respectivelyPEvkmEarly arrival time of thekth shift (belongs to type v vehicle) at the demand point of passenger mE1Fare income of all passenger($)E2Vehicle operating cost of all shifts ($)E3,E4,Penalty cost of all vehicles for early arrival and late arrival, respectively($)α,βPenalty parameters for early and late arrival, respectivelyw1,w2,w3,w4,Weight coefficients, respectivelyρ, ζ, ςConnection degree, number of sections, number of nodes for road networkMPMutation probability in GAcr,W0, Wend, and CLCooling rate, initial temperature, end temperature, chain length in SA, respectivelyΖIteration step in service area optimizationZζService area of one block expanded in stepζSζService area in stepζSdζExpansion direction in stepζSDζExpansion direction set in stepζ


### 2.4. Model Formulation

Given the above assumptions and definitions, the problem of deciding vehicle routes and scheduling for a HFRFT system can be formulated with the following MIP model which is similar to Wang et al. [61]. In the MIP model, the vehicle route determined by pick-up or deliver passengers is proposed (shown in Figure 3). This new route representation method can fully reflect the personality of the passenger time window and express accurately the route nonrepeated sections because each passenger can only pick up/deliver once. However, if the vehicle route is usually determined by demand points passed, there may be many demand points repeatedly on the routes and the routes are not easily distinguished.Figure 3
Vehicle route represented by passengers.In the MIP model, the optimization objective is to maximize system total benefitE, expressed as equation (1), which is the difference between operating income and operating costs. The former is fare income, E1, of all passengers, expressed as equation (2), when the latter is made up of E2, E3, and E4, expressed as equations (3)–(5), respectively:(1)E=w1E1−w2E2+w3E3+w4E4,(2)E1=∑v∑kNvk⋅C,(3)E2=∑v∑kCv⋅xvk+∑m∑nLmn⋅xvkmn⋅Gv,(4)E3=∑v∑kPEm⋅Dvk+∑mxvkm⋅θvkm,(5)E4=∑v∑k∑mxvkm⋅PLm,where the RHS in equation (2) is fare income for all passengers when a one-ticket transit system is used. The RHS of equation (3) is vehicle operating cost made up of fixed use cost and travel cost of all shifts. The terms in the right hand side of equations (4) and (5) are the penalty cost of all shifts for early arrival and late arrival, respectively.The proposed model is expressed as a MIP problem, as shown in the following equations:(6)Max  E(7)s.t.Dvk+∑mxvkm⋅θvkm≤Qv,∀m∈NB,(8)Nvk∩Nv′k′=∅,∀k≠k′and∀v≠v′,(9)PEm=0,ifTm≤tvkm≤UTm,αLTm−tvkm,iftvkm≤LTmandθvkm=1,m∈Nvk,0,iftvkm≤LTmandθvkm=−1,(10)PLm=0,ifLTm≤tvkm≤UTm,βtvkm−UTm,iftvkm>UTm,mεNvk,(11)PEvkm=LTm−tvkm,ifθvkm=1,0,ifθvkm=−1,(12)∑m∑ntmn⋅xvkmn+∑mmaxPEvkm,0≤T,m,n∈Nvk,(13)∑nxvkOn=∑mxvkmO=1,m,n∈NB,(14)DTm<Tvk,∀m∈Nvk,(15)∑v∑kxvkm=1,∀m∈NB.In the model, equation (7) considers the vehicle capacity. Equation (8) determines each passenger can only be served by one vehicle. Equation (9) is the early arrival penalty cost only for pick-up passengers while the early arrival penalty cost is zero for deliver passengers because of vehicle waiting at the transfer station. Equations (10) and (11) are the late arrival penalty cost and the early arrival time, respectively. Equation (12) is the maximum run-time constraint. Equation (13) ensures vehicle depart from and return to the transfer station. Equation (14) ensures departure time is earlier than the reservation time for deliver passengers leaving the transfer station. Equation (15) ensures all reservation passengers will be served.


### 2.5. Solution Algorithm

The MIP model, constructed by equations (6)–(15), represents a more complicated vehicle routing problem (VRP) that is solved by heuristic algorithm, such as genetic algorithm (GA) [62–64], hyperheuristic algorithm [65], and hybrid of metaheuristic algorithm [66]. Ho et al. [67] argues that combining metaheuristics with other types of metaheuristics and mathematical programming is a growing trend to solve the DAR problem, and hybrids of metaheuristics usually come into two forms: (i) each metaheuristic is executed sequentially and (ii) a metaheuristic is executed within another metaheuristic. We adopt the second form, where GA is executed within simulated annealing (SA) to solve MIP model’s abovementioned problem (as shown in Figure 4).Figure 4
Flow chart of the hybrid of metaheuristic.In Figure4, firstly, based on GA, vehicle types and routes are optimized when departure intervals are known. Then, departure intervals are adjusted using the SA algorithm. GA is used again to optimize vehicle types and routes. This process is repeated until the ideal solution is obtained.In the hybrid of metaheuristic, multichromosome encoding is used where both passengers and vehicles are encoded based on natural numbers, respectively. In initialization,r chromosomes are generated. Moreover, each chromosome contains a vehicle gene and a passenger gene. The code length of the former and the latter is a+b, and K, in this paper, is the number of reservation passengers and departure vehicles, respectively. When generating the initial populations, considering that the solution quality and efficiency of the heuristic algorithm depend on the quality of the initial solution, the generation of feasible solution itself is a NP-hard problem. Based on the initialization method proposed by Solomon [68], the improved nearest neighbor algorithm based on minimum cost (NNC algorithm) was designed to generate initial feasible populations. The algorithm flow is as follows:Step 1: randomly set the departure time; the feeder bus starts from the transfer station (select the largest capacity vehicle)Step 2: select an unserved passenger closest to the last served passenger; if the constraint conditions are satisfied, insert the passenger into the current running routeStep 3: repeat Step 2; if the capacity limit or maximum travel time limit of the current vehicle has been reached, go to Step 1 until all passengers have been served.The “distance” (i.e., insertion cost)fmn between two passengers in the algorithm flow is defined as follows:(16)fmn=α1tmnvk+α2Emnvk+α3Lmnvk+α4Wmnvk,where tmnvk denotes travel time of kth shift (belongs to type v vehicle); Emnvk is the difference between arrival time and start time, Emnvk=LTn−tvkn; Lmnvk is the difference between the arrival time and the end time; Lmnvk=UTn−tvkn; Wmnvk is the sum of the travel time and the minimum possible waiting time; Wmnvk=tmnvk+max0,LTn−tvkn; αidenotes random parameter; and ∑αi=1.In GA, the fitness is the system total benefit; the selection method is roulette; the selection probability is proportional fitness; inner and interindividual crossovers are both adopted, respectively, for vehicle gene and passenger gene; the mutation probability is set to MP.In SA, some parameters, such as cooling ratecr, initial temperature W0, end temperature Wend, and chain length CL (=K in this paper), are determined; the code method is also a natural number; the new solution is based on the random disturbance and feasibility analysis; the Metropolis guideline is applied to determine whether the new solution is accepted.


## 2.1. Problem Statement

The application scenarios of HFRFT under the mixed running mode, capacity constraint, multi-type vehicle, and reservation requirements are listed as follows.There are a certain number of multitype vehicles. For the actual bus operation, there are usually two passengers’ types in the system, one is passengers from different places to the transfer station and the other is passengers from the transfer station to different places, both of which are limited by the time window. We define these two types of passengers as those who need to be picked up and need to be sent, respectively. According to the different types of passengers, the bus running mode can be divided into alone running mode (only pick-up or deliver) and mixed running mode (both pick-up and deliver), as shown in Figure2. The same shift of the former is only allowed to serve the passengers need to be picked up or sent, while the latter is allowed to serve the passengers need to be picked up and sent at the same time. These passengers can send their own travelling information to the transit companies via customer service, mobile phone, or Internet, and the travelling information includes travel demand, boarding time/get-off time, pick-up location/deliver location, etc. After collecting the travelling information, the transit company arranges a team of vehicles to complete all passengers’ transfer tasks and maximize the system’s total benefit through the adjustment of departure time, vehicle type, and running route of all vehicles under passenger time window and vehicle capacity constraints.Figure 2
The vehicle route of different operation modes. (a) Alone running mode (only pick-up or deliver). (b) Mixed running mode (both pick-up and deliver).
(a)(b)Firstly, aiming at the maximum total benefit of the HFRFT system, the coordinated optimization model of vehicle routing and scheduling is constructed under the constraints of vehicle capacity, passenger time window, and maximum one way running time of vehicle. In the process of model construction, considering the problems of high repetition rate of running path and low average seat utilization rate of vehicles in the alone running mode, the mixed running mode with simultaneous pick up and deliver is proposed. In order to compare the performance of different running modes, it is assumed that there are three types of vehicles in RFT system, i.e., vehicles can only pick up, vehicles can only deliver, and vehicles can pick up and deliver simultaneously. Secondly, combined with the above coordination optimization model, the optimization method of service area is proposed based on the matching of transportation capacity and passenger demand.


## 2.2. Assumptions

The following assumptions are made to ensure that the proposed formulations are tractable and realistically reflect the real-world constraints:(i)
The feeder bus begins and ends each of its trips at the transfer station.(ii)
Pick-up/deliver requests sent by the passengers are collected and responded to before the beginning of each trip.(iii)
Running speed of all type vehicles is the same on all road sections.(iv)
There are enough vehicles to meet all passenger requests. All requests are responded in service area and passengers do not cancel requests.(v)
The pick-up passenger has only time window constraint on the boarding point and the deliver passenger has the drop-off point.


## 2.3. Notations

To facilitate model presentation, key parameter definitions and notations used subsequently are summarized in the notation list (Table3).Table 3
The notation list.
OTransfer stationN = {1,2,…, a}The set of passengers scheduled to go to the transfer pointB = {a + 1,a + 2,…,a + b}The set of passengers scheduled to leave the transfer pointNB = {1, 2,…, a, a + 1, a + b}The set of all passengersm, n ∈ NBThemth and nth passengersVThe type of feeder vehicleM, MvThe set of feeder vehicles and the typev vehicle, respectivelyk ∈ {1, 2, …, K }Thekth shift, and each shift corresponds only to one vehicle typeKThe maximum shifttvkmThe time when thek th shift (belongs to type v vehicle) arrives at demand point of passenger mUTm, LTmTime window upper and lower bounds on the boarding point for pick-up passengerm or on the drop-off point for deliver passenger mCv, GvFixed use cost per shift ($/shift) and travel cost unit mileage ($/mile) of typev, respectivelyQvThe capacity of typev (people)CTicket price ($/people)NvkPassengers’ set of thekth shift (belongs to type v vehicle)Lmn,tmnShortest path distance (miles) and time (hours) from demand point of passengerm to passenger n, respectivelyVVehicle speed (miles/hour)DvkThe number of passengers in the feeder vehicle when thekth shift (belongs to type v vehicle) driving away from the transfer stationTThe maximum running time in one-way (hours)TvkThe departure time of thekth shift (belongs to type v vehicle)DTmThe reservation departure time from the transfer station of passengermxvkmnBinary variablexvkmn=1 if the kth shift (belongs to type v vehicle) is driving from demand point of passenger m to passenger n, otherwise 0xvkBinary variablexvkmn=1 if the kth shift (belongs to type v vehicle) is used, otherwise 0xvkmBinary variablexvkm=1 if the kth shift (belongs to type v vehicle) is passing the demand point of passenger m, otherwise 0θvkmBinary variable.θvkm=1 if passenger m is taking the kth shift (belongs to type v vehicle) to the transfer station, otherwise −1xvkmnBinary variable.xvkmn=1 if the kth shift (belongs to type v vehicle) is driving from demand point of passenger m to passenger n, otherwise 0PEm,PLmPenalty function for early and late arrival at the demand point of passengerm, respectivelyPEvkmEarly arrival time of thekth shift (belongs to type v vehicle) at the demand point of passenger mE1Fare income of all passenger($)E2Vehicle operating cost of all shifts ($)E3,E4,Penalty cost of all vehicles for early arrival and late arrival, respectively($)α,βPenalty parameters for early and late arrival, respectivelyw1,w2,w3,w4,Weight coefficients, respectivelyρ, ζ, ςConnection degree, number of sections, number of nodes for road networkMPMutation probability in GAcr,W0, Wend, and CLCooling rate, initial temperature, end temperature, chain length in SA, respectivelyΖIteration step in service area optimizationZζService area of one block expanded in stepζSζService area in stepζSdζExpansion direction in stepζSDζExpansion direction set in stepζ


## 2.4. Model Formulation

Given the above assumptions and definitions, the problem of deciding vehicle routes and scheduling for a HFRFT system can be formulated with the following MIP model which is similar to Wang et al. [61]. In the MIP model, the vehicle route determined by pick-up or deliver passengers is proposed (shown in Figure 3). This new route representation method can fully reflect the personality of the passenger time window and express accurately the route nonrepeated sections because each passenger can only pick up/deliver once. However, if the vehicle route is usually determined by demand points passed, there may be many demand points repeatedly on the routes and the routes are not easily distinguished.Figure 3
Vehicle route represented by passengers.In the MIP model, the optimization objective is to maximize system total benefitE, expressed as equation (1), which is the difference between operating income and operating costs. The former is fare income, E1, of all passengers, expressed as equation (2), when the latter is made up of E2, E3, and E4, expressed as equations (3)–(5), respectively:(1)E=w1E1−w2E2+w3E3+w4E4,(2)E1=∑v∑kNvk⋅C,(3)E2=∑v∑kCv⋅xvk+∑m∑nLmn⋅xvkmn⋅Gv,(4)E3=∑v∑kPEm⋅Dvk+∑mxvkm⋅θvkm,(5)E4=∑v∑k∑mxvkm⋅PLm,where the RHS in equation (2) is fare income for all passengers when a one-ticket transit system is used. The RHS of equation (3) is vehicle operating cost made up of fixed use cost and travel cost of all shifts. The terms in the right hand side of equations (4) and (5) are the penalty cost of all shifts for early arrival and late arrival, respectively.The proposed model is expressed as a MIP problem, as shown in the following equations:(6)Max  E(7)s.t.Dvk+∑mxvkm⋅θvkm≤Qv,∀m∈NB,(8)Nvk∩Nv′k′=∅,∀k≠k′and∀v≠v′,(9)PEm=0,ifTm≤tvkm≤UTm,αLTm−tvkm,iftvkm≤LTmandθvkm=1,m∈Nvk,0,iftvkm≤LTmandθvkm=−1,(10)PLm=0,ifLTm≤tvkm≤UTm,βtvkm−UTm,iftvkm>UTm,mεNvk,(11)PEvkm=LTm−tvkm,ifθvkm=1,0,ifθvkm=−1,(12)∑m∑ntmn⋅xvkmn+∑mmaxPEvkm,0≤T,m,n∈Nvk,(13)∑nxvkOn=∑mxvkmO=1,m,n∈NB,(14)DTm<Tvk,∀m∈Nvk,(15)∑v∑kxvkm=1,∀m∈NB.In the model, equation (7) considers the vehicle capacity. Equation (8) determines each passenger can only be served by one vehicle. Equation (9) is the early arrival penalty cost only for pick-up passengers while the early arrival penalty cost is zero for deliver passengers because of vehicle waiting at the transfer station. Equations (10) and (11) are the late arrival penalty cost and the early arrival time, respectively. Equation (12) is the maximum run-time constraint. Equation (13) ensures vehicle depart from and return to the transfer station. Equation (14) ensures departure time is earlier than the reservation time for deliver passengers leaving the transfer station. Equation (15) ensures all reservation passengers will be served.


## 2.5. Solution Algorithm

The MIP model, constructed by equations (6)–(15), represents a more complicated vehicle routing problem (VRP) that is solved by heuristic algorithm, such as genetic algorithm (GA) [62–64], hyperheuristic algorithm [65], and hybrid of metaheuristic algorithm [66]. Ho et al. [67] argues that combining metaheuristics with other types of metaheuristics and mathematical programming is a growing trend to solve the DAR problem, and hybrids of metaheuristics usually come into two forms: (i) each metaheuristic is executed sequentially and (ii) a metaheuristic is executed within another metaheuristic. We adopt the second form, where GA is executed within simulated annealing (SA) to solve MIP model’s abovementioned problem (as shown in Figure 4).Figure 4
Flow chart of the hybrid of metaheuristic.In Figure4, firstly, based on GA, vehicle types and routes are optimized when departure intervals are known. Then, departure intervals are adjusted using the SA algorithm. GA is used again to optimize vehicle types and routes. This process is repeated until the ideal solution is obtained.In the hybrid of metaheuristic, multichromosome encoding is used where both passengers and vehicles are encoded based on natural numbers, respectively. In initialization,r chromosomes are generated. Moreover, each chromosome contains a vehicle gene and a passenger gene. The code length of the former and the latter is a+b, and K, in this paper, is the number of reservation passengers and departure vehicles, respectively. When generating the initial populations, considering that the solution quality and efficiency of the heuristic algorithm depend on the quality of the initial solution, the generation of feasible solution itself is a NP-hard problem. Based on the initialization method proposed by Solomon [68], the improved nearest neighbor algorithm based on minimum cost (NNC algorithm) was designed to generate initial feasible populations. The algorithm flow is as follows:Step 1: randomly set the departure time; the feeder bus starts from the transfer station (select the largest capacity vehicle)Step 2: select an unserved passenger closest to the last served passenger; if the constraint conditions are satisfied, insert the passenger into the current running routeStep 3: repeat Step 2; if the capacity limit or maximum travel time limit of the current vehicle has been reached, go to Step 1 until all passengers have been served.The “distance” (i.e., insertion cost)fmn between two passengers in the algorithm flow is defined as follows:(16)fmn=α1tmnvk+α2Emnvk+α3Lmnvk+α4Wmnvk,where tmnvk denotes travel time of kth shift (belongs to type v vehicle); Emnvk is the difference between arrival time and start time, Emnvk=LTn−tvkn; Lmnvk is the difference between the arrival time and the end time; Lmnvk=UTn−tvkn; Wmnvk is the sum of the travel time and the minimum possible waiting time; Wmnvk=tmnvk+max0,LTn−tvkn; αidenotes random parameter; and ∑αi=1.In GA, the fitness is the system total benefit; the selection method is roulette; the selection probability is proportional fitness; inner and interindividual crossovers are both adopted, respectively, for vehicle gene and passenger gene; the mutation probability is set to MP.In SA, some parameters, such as cooling ratecr, initial temperature W0, end temperature Wend, and chain length CL (=K in this paper), are determined; the code method is also a natural number; the new solution is based on the random disturbance and feasibility analysis; the Metropolis guideline is applied to determine whether the new solution is accepted.


## 3. Optimization Method of Service Area

The influence factors of the HFRFT service area include road network characteristics, passenger’s demand distribution, and feeder facility performances. These factors together affect the shape and size.Road network form is the important influence factor of service area. So far, the shape of service area is divided into ideal regularity shape where road network form is assumed to be regular [8, 50] and actual irregularity shape [14, 15]. Moreover, the square road network form is suitable for the rectangular service areas while the radial network shape road network is suitable for the circular service areas. Other characteristics of the road network such as density and connectivity affect the size of service area to a certain extent. The bigger the road network density, the closer the feeder transit can be to the residential point. The higher the road network connectivity, the larger area the feeder system can serve because demand point can be reached more easily.The temporal and spatial distribution characteristics of passenger demands are also the important factors. If other conditions are the same, the feeder transit in the low valley period can serve a larger area than the peak period; the feeder transit in low-density passenger area can serve larger scope than in the high-density passenger area.The mode of route setting, the number and type of vehicles, and the running cycle of feeder facility performance are all important factors. The mode, in which the reference route exists, such as MAST, is generally used in the regular shape service area [51]. However, in HFRFT, whose vehicles have highly running freedom, the shape and size of the service area can be irregular and can be adjusted according to passenger demands. The more the pick-up and deliver capacity, determined by the number of vehicles and vehicle capacity, the larger the service area. At the same time, the longer the running cycle, the farther the feeder vehicle can travel, and the greater the service area can be.The balance principle of capacity and demand is used to optimize service area. When road network and the number and type of vehicles are known, pick-up and deliver capacity can be obtained based on the MIP model. If demand distribution is also known in advance, the largest service area can be determined according to the balance principle. The optimization process is shown in Figure5.Figure 5
The optimization process of service area.When determining the initial smaller service areaS0, S0 should be included by the potential service area of HFRFT, determined by the reasonable attraction radius [69]. S0 should be closed and be much smaller than the potential service area. If the MIP model is not solvable, the current system capacity cannot meet the system demand, that is, the system supply and system demand cannot be balanced.In Figure5, the expansion direction of service area is selected as follows:(i)
The expansion direction should have reservation requirements(ii)
After expanding a block, the service area will still be a closed area surrounded by roads(iii)
When there are multiple directions that can be expanded, the direction of the most demand points increased is preferentially chosen (other choice criteria such as the most passengers increased can also be used)(iv)
If there are multiple directions where demand points increased are the same, the direction of the largest connection degreeρ for road network after expansion is preferentially chosen, where(17)ρ=2ζς.


## 4. Case Study

Shang Shuangtang Station of Changsha Metro Line 1 in Changsha City is selected as the sample. The models developed in this paper are used to obtain the optimal HFRFT system with an irregular area and road network. In the case study, the MIP model to coordinately optimize routes and scheduling is applied for the HFRFT system with the mixed running mode, and the optimization results are compared with the alone pick-up and alone deliver mode.


### 4.1. Basic Conditions

The scheduling cycle is 7 : 00–8 : 00 a.m.; the radius of the circular area is 2.5 miles; the uniform speedVis 21.7 miles/h; the coordinate of the transfer station Ois (0, 0); there are two types of vehicles, M1=M11,M12,M13,M14,M15, M2=M21,M22,M23, Q1=10people,Q2=15people, C1=9.3$/shift,Q2=15.5$/shift, G1=1.9$/mile,G2=2.4$/mile; T is 45 min; C is 2.5 $/people; w1,w2,w3,andw4 are 1.0, 1.0, 2/3, and 2/3 respectively; α,β are 9.3 $/h and 13 $/h, respectively; there are 1 transfer station and 25 demand points (shown in Figure 6 and Table 4) and 124 pick-up passengers to transfer station and 36 deliver passengers leaving the transfer station, whose time windows and locations are shown in Table 5. The distances between demand points are shown in Table 6.Figure 6
Possible service area and demand point distribution.Table 4
Coordinates of demand points (miles).
PointXY00.000.0010.520.3320.66−0.1631.200.0141.410.4551.720.1760.920.7571.261.0081.770.6091.721.04101.980.43111.880.89122.580.41132.250.63142.790.86152.390.93162.081.04172.851.08182.431.12190.991.30200.601.13211.13−0.37221.62−0.22231.13−0.76240.61−0.76250.69−1.44Table 5
Passenger locations and time windows.
Passenger numberPassenger typeDemand pointLTmUTmDTm1Pick-up17 : 027 : 072Pick-up17 : 037 : 083Pick-up17 : 057 : 104Pick-up17 : 077 : 125Pick-up17 : 107 : 156Pick-up17 : 137 : 187Pick-up17 : 157 : 208Pick-up17 : 187 : 239Pick-up17 : 207 : 2510Pick-up17 : 227 : 2711Pick-up17 : 247 : 2912Pick-up17 : 277 : 3213Deliver17 : 307 : 357 : 0814Deliver17 : 407 : 457 : 1215Deliver17 : 457 : 507 : 1816Pick-up17 : 357 : 4017Pick-up17 : 407 : 4518Pick-up27 : 077 : 1219Pick-up27 : 107 : 1520Pick-up27 : 207 : 2521Pick-up27 : 277 : 3222Deliver27 : 337 : 387 : 0823Deliver27 : 407 : 457 : 1024Pick-up37 : 097 : 1425Pick-up37 : 127 : 1726Pick-up37 : 187 : 2327Pick-up37 : 207 : 2528Pick-up37 : 237 : 2829Pick-up37 : 267 : 3130Pick-up37 : 287 : 3331Pick-up37 : 307 : 3532Pick-up37 : 357 : 4033Pick-up37 : 387 : 4234Pick-up37 : 407 : 4535Pick-up37 : 427 : 4736Deliver37 : 307 : 357 : 0537Deliver37 : 407 : 427 : 0838Pick-up47 : 087 : 1339Pick-up47 : 107 : 1540Pick-up47 : 137 : 1841Pick-up47 : 157 : 2042Pick-up47 : 187 : 2343Pick-up47 : 237 : 2844Pick-up47 : 257 : 3045Pick-up47 : 277 : 3246Pick-up47 : 307 : 3547Pick-up47 : 327 : 3748Pick-up47 : 357 : 4049Pick-up47 : 377 : 4250Pick-up47 : 387 : 4351Pick-up47 : 407 : 4552Deliver47 : 457 : 507 : 1253Pick-up57 : 107 : 1554Pick-up57 : 127 : 1755Pick-up57 : 157 : 2056Pick-up57 : 237 : 2857Pick-up57 : 257 : 3058Pick-up57 : 277 : 3259Pick-up57 : 287 : 3360Pick-up57 : 307 : 3561Pick-up57 : 327 : 3762Pick-up57 : 357 : 4063Pick-up57 : 377 : 4264Deliver57 : 357 : 407 : 0565Deliver57 : 387 : 427 : 0566Deliver57 : 427 : 477 : 1267Deliver57 : 507 : 557 : 1568Pick-up67 : 157 : 2069Pick-up67 : 177 : 2270Pick-up67 : 207 : 2571Pick-up67 : 237 : 2872Pick-up67 : 287 : 3373Deliver67 : 307 : 357 : 0074Deliver67 : 357 : 407 : 0075Pick-up77 : 157 : 2076Pick-up77 : 207 : 2577Deliver77 : 357 : 407 : 0078Deliver77 : 407 : 457 : 0579Pick-up87 : 207 : 2580Pick-up87 : 237 : 2881Pick-up87 : 257 : 3082Pick-up97 : 057 : 1083Pick-up97 : 107 : 1584Pick-up97 : 157 : 2085Pick-up107 : 157 : 2086Pick-up107 : 187 : 2387Pick-up107 : 207 : 2588Deliver107 : 257 : 307 : 0089Deliver117 : 457 : 507 : 1090Deliver117 : 457 : 507 : 1091Pick-up127 : 107 : 1592Pick-up127 : 107 : 1593Deliver127 : 357 : 407 : 0594Deliver127 : 357 : 407 : 0595Pick-up137 : 307 : 3596Pick-up137 : 307 : 3597Deliver137 : 357 : 407 : 0598Pick-up147 : 107 : 1599Pick-up147 : 157 : 20100Deliver147 : 357 : 407 : 00101Deliver147 : 357 : 407 : 00102Deliver157 : 407 : 457 : 05103Deliver157 : 407 : 457 : 05104Pick-up167 : 207 : 25105Pick-up167 : 207 : 25106Pick-up177 : 307 : 35107Pick-up177 : 357 : 40108Deliver187 : 357 : 407 : 00109Deliver187 : 407 : 457 : 10110Deliver187 : 407 : 457 : 15111Pick-up197 : 107 : 15112Pick-up197 : 157 : 20113Pick-up197 : 207 : 25114Pick-up197 : 237 : 28115Pick-up197 : 307 : 35116Pick-up197 : 407 : 45117Pick-up207 : 127 : 17118Pick-up207 : 157 : 20119Pick-up207 : 257 : 30120Pick-up207 : 277 : 32121Pick-up207 : 357 : 40122Pick-up207 : 407 : 45123Pick-up217 : 127 : 17124Pick-up217 : 157 : 20125Pick-up217 : 207 : 25126Pick-up217 : 237 : 28127Pick-up217 : 257 : 30128Pick-up217 : 277 : 32129Pick-up217 : 307 : 35130Pick-up217 : 357 : 40131Pick-up217 : 387 : 43132Deliver217 : 357 : 407 : 05133Deliver217 : 407 : 457 : 08134Pick-up227 : 187 : 23135Pick-up227 : 187 : 23136Pick-up227 : 247 : 29137Pick-up227 : 247 : 29138Pick-up227 : 307 : 35139Pick-up237 : 137 : 18140Pick-up237 : 157 : 20141Pick-up237 : 207 : 25142Pick-up237 : 257 : 30143Pick-up237 : 407 : 45144Deliver237 : 357 : 407 : 05145Deliver237 : 407 : 457 : 12146Pick-up247 : 107 : 15147Pick-up247 : 137 : 18148Pick-up247 : 157 : 20149Pick-up247 : 187 : 23150Pick-up247 : 207 : 25151Pick-up247 : 237 : 28152Pick-up247 : 257 : 30153Pick-up247 : 287 : 32154Pick-up247 : 307 : 35155Deliver247 : 357 : 407 : 00156Deliver247 : 427 : 457 : 08157Deliver247 : 457 : 507 : 12158Pick-up257 : 107 : 15159Pick-up257 : 127 : 17160Pick-up257 : 107 : 15Table 6
Distances between demand points (mile).
Point01234567891011121314151617181920212223242500.000.690.871.422.111.981.572.112.602.502.422.572.982.963.423.042.833.633.242.221.741.542.151.631.122.0810.690.000.741.301.691.820.941.482.051.872.031.932.812.682.792.412.203.002.601.591.121.371.982.062.063.0220.870.740.000.550.741.081.681.781.872.171.552.042.071.942.442.312.232.652.502.261.850.631.231.191.312.2831.421.300.550.000.680.531.441.231.311.531.001.461.521.391.891.751.682.101.951.712.180.590.681.151.662.3442.111.690.740.680.000.540.750.550.750.841.010.811.451.081.531.311.111.901.511.021.491.280.701.842.352.6251.981.821.080.530.540.001.291.090.861.290.480.931.000.861.361.311.261.571.431.562.031.120.541.682.192.4661.570.941.681.440.751.290.000.551.110.941.461.001.901.531.851.481.262.051.641.031.502.031.452.592.683.3772.111.481.781.230.551.090.550.000.910.731.250.791.691.321.641.261.051.871.460.480.951.821.242.382.893.1682.602.051.871.310.750.861.110.910.000.430.380.391.040.661.280.910.761.511.101.321.791.901.332.472.983.2492.501.872.171.530.841.290.940.730.430.000.820.321.220.851.180.790.461.140.730.891.362.121.542.683.193.47102.422.031.551.001.010.481.461.250.380.820.000.460.780.521.140.760.681.350.951.662.131.591.012.152.672.93112.571.932.041.460.810.931.000.790.390.320.460.000.900.530.920.550.331.130.711.201.672.051.692.613.123.39122.982.812.071.521.451.001.901.691.041.220.780.900.000.370.600.820.870.811.162.342.812.111.542.673.193.45132.962.681.941.391.080.861.531.320.660.850.520.530.370.000.740.550.430.950.741.772.241.981.402.543.053.32143.422.792.441.891.531.361.851.641.281.181.140.920.600.740.000.380.780.280.632.062.532.451.873.013.523.79153.042.412.311.751.311.311.481.260.910.790.760.550.820.550.380.000.400.590.511.682.152.421.852.993.503.77162.832.202.231.681.111.261.261.050.760.460.680.330.870.430.780.400.000.830.421.281.752.281.702.843.353.62173.633.002.652.101.901.572.051.871.511.141.351.130.810.950.280.590.830.000.411.972.442.692.113.253.764.03183.242.602.501.951.511.431.641.461.100.730.950.711.160.740.630.510.420.410.001.552.022.301.722.863.343.64192.221.592.261.711.021.561.030.481.320.891.661.202.341.772.061.681.281.971.550.000.472.542.193.332.863.83201.741.121.852.181.492.031.500.951.791.362.131.672.812.242.532.151.752.442.020.470.002.492.193.042.723.68211.541.370.630.591.281.122.031.821.902.121.592.052.111.982.452.422.282.692.302.542.490.001.280.561.071.75222.151.981.230.680.700.541.451.241.331.541.011.691.541.401.871.851.702.111.722.192.191.280.001.772.291.92231.632.061.191.151.841.682.592.382.472.682.152.612.672.543.012.992.843.252.863.333.040.561.770.000.511.55241.122.061.311.662.352.192.682.892.983.192.673.123.193.053.523.503.353.763.342.862.721.072.290.510.001.64252.083.022.282.342.622.463.373.163.243.472.933.393.453.323.793.773.624.033.643.833.681.751.921.551.640.00


### 4.2. Route and Scheduling Optimization in Initial Service Area

According to the land use, the light green dotted area, surrounded by Wanjiali Rd.(S.), Furong Rd.(S.), Huanbao Rd.(W.), and Huijin Rd., is set as the initial service area (shown in Figure6). In the initial service area, there are 59 reservation passengers. The computer program of the Figure 5 based on Matlab is operated to optimize routes and scheduling, and the results are shown in Tables 7–9.Table 7
Optimization results under mixed running mode in the initial service area.
Departure timeVehicle numberRouteMileage (miles)Cumulative number of passengers servicedSeat utilizationEnd timeRunning mode7 : 13M210-68-69-1-3-6-9-25-27-38-39-40-43-29-45-19-07.45151007 : 33Alone pick-up7 : 14M110-26-18-5-70-41-44-42-24-46-21-07.37101007 : 36Alone pick-up7 : 30M220-13-11-10-71-72-73-47-30-32-48-49-51-35-05.851386.67 : 47Mixed7 : 35M120-8-4-7-20-22-34-28-31-33-36-50-74-04.99121207 : 49Mixed7 : 45M110-23-52-37-12-14-2-15-16-17-04.289907 : 57MixedTable 8
Optimization results under pick-up and deliver alone in the initial service area.
Departure timeVehicle numberRouteMileage (miles)Cumulative number of passengers servicedSeat utilizationEnd timeRunning mode7 : 03M210-3-9-20-24-25-26-28-39-42-44-19-04.281173.37 : 30Alone pick-up7 : 13M110-1-2-4-5-6-7-53-40-38-18-03.94101007 : 24Alone pick-up7 : 18M120-58-59-13-14-15-22-23-36-37-52-06.58101007 : 37Alone deliver7 : 18M130-54-56-8-10-11-21-41-43-45-27-06.09101007 : 36Alone pick-up7 : 28M140-57-46-47-48-55-12-16-17-04.708807 : 41Alone pick-up7 : 36M110-29-30-31-32-34-49-50-51-33-35-04.21101007 : 48Alone pick-upTable 9
Comparisons of two running modes in the initial service area.
Running modeKNumber of vehicles requiredAverage seat utilization rateVehicle mileage required per passenger(miles)E ($)v = 1v = 2SumAlone641590.76%0.51−59.0Mixed522498.33%0.5114.5Increase rate(%)−16.7——−208.3——If the number of the vehicles is sufficient and other parameters in the initial service area are still used, routes and scheduling optimization under pick-up and deliver alone is performed based on the MIP model changed slightly constraints for the mixed running. The results are shown in Tables8 and 9.From Tables7–9, comparing to the pick-up and deliver mode alone, the advantage of the mixed mode is obvious: the number of departures and vehicles required are reduced by 16.7% and 20%, respectively. Also, average seat utilization rate is increased by 8.3%. System total benefit E becomes positive.


### 4.3. Route and Scheduling Optimization in Optimal Service Area

In Table7, only 4 vehicles are needed, so the service area can be expanded. There are three expandable directions (shown in Figure 7). The number of new demand points is the same when expanding a block in three directions, so road network connectivity in three directions should be compared. Road network connectivity that expanded to the north, to the east, to the south is 2.72, 2.61, and 2.66, respectively. Priority should be given to expanding the service area to the north. Loop this way until the optimal service area is obtained (dark green dotted line as shown in Figure 7).Figure 7
Service area optimization process.In the service area surrounded by the dark green dotted line, all vehicles are used (according to the calculations followed); the number of departures is 9, and the number of passengers served is 105. Based on Figure5, the service area under irregular road network and scope can be optimized.There are 105 reservation passengers in the optimal service area. The computer program of Figure4 is again utilized, and the results are shown in Tables 10–12.Table 10
Optimization results under mixed running in the optimal service area.
Departure timeVehicle numberRouteMileage (miles)Cumulative number of passengers servicedSeat utilizationEnd timeRunning mode7 : 09M110-111-112-76-68-70-41-42-28-124-127-06.81101007 : 32Alone pick-up7 : 10M210-139-140-123-39-20-4-5-128-119-143-141-013.491173.37 : 48Alone pick-up7 : 14M220-113-7-118-75-27-29-12-116-012.17853.37 : 47Alone deliver7 : 16M230-2-3-8-10-146-148-126-26-31-121-16-08.411173.37 : 43Alone pick-up7 : 22M120-1-6-9-11-18-24-25-142-151-153-04.77101007 : 35Alone pick-up7 : 30M130-13-19-38-40-43-44-46-114-115-69-71-05.80111107 : 46Mixed7 : 30M140-30-36-129-45-47-48-49-50-32-33-34-05.39111107 : 45Mixed7 : 40M150-72-73-74-77-78-117-120-122-51-130-131-145-147-150-154-08.03151508 : 02Mixed7 : 45M130-14-15-125-132-133-144-152-155-156-157-149-35-37-52-21-22-23-17-07.66181208 : 07MixedTable 11
Optimization results under pick-up and deliver alone in the optimal service area.
Departure timeVehicle numberRouteMileage (miles)Cumulative number of passengers servicedSeat utilization (%)End timeRunning mode7 : 07M110-19-41-38-39-24-25-95-76-28-21-07.04101007 : 31Alone pick-up7 : 10M120-71-40-77-94-97-99-44-45-46-010.069907 : 38Alone pick-up7 : 10M210-53-60-20-96-98-88-78-90-80-79-101-89-10210.611386.67 : 40Alone deliver7 : 12M130-13-14-85-86-92-93-103-104-105-04.269907 : 24Alone deliver7 : 16M220-64-65-66-67-61-54-55-56-2-3-4-6-12-04.441386.67 : 30Alone pick-up7 : 18M140-58-59-36-37-22-23-52-62-63-15-07.02101007 : 38Alone deliver7 : 18M150-5-7-8-9-26-27-87-70-72-74-07.95101007 : 41Alone pick-up7 : 20M230-1-10-42-73-84-34-43-47-49-91-100-011.101173.37 : 52Alone pick-up7 : 22M160-11-18-29-57-68-16-75-69-50-51-010.75101007 : 52Alone pick-up7 : 30M130-81-82-83-30-31-32-33-48-35-17-05.49101007 : 48Alone pick-upTable 12
Comparisons of two running modes in the optimal service area.
Running modeKNumber of vehicles requiredAverage seat utilization rateVehicle mileage required per passenger(miles)E ($)v = 1v = 2SumAlone1063991.3%0.7523.1Mixed9538100%0.69119.3Increase rate (%)−10.0——−11.19.5−8.0416If the number of the vehicles is sufficient and the other parameters in the optimal service area are still used, routes and scheduling optimization under pick-up and deliver alone is performed based on the MIP model. The results are shown in Tables11 and 12.From Tables10 and 12, comparing to the pick-up and deliver alone modes, the advantage of the mixed mode is also obvious: the number of departures, vehicles required, and vehicle mileage required per passenger is reduced by 10.0%, 11.1%, and 8%, respectively; average seat utilization rate is increased by 9.5%; system total benefit E is increased by more than 3 times. Compared with Tables 9 and 12, the number of passengers served by HFRFT system is increased by optimizing the service area. Therefore, regardless of whether the RFT system adopts the mixed running mode or alone running mode, the average seat utilization rate and the total system benefit E are improved significantly (as shown in Figure 8). Under the condition of certain transportation capacity, the optimization of service area has certain significance to improve vehicle utilization rate and reduce vehicle idle cost.Figure 8
Comparisons of two operation modes before and after optimization. (a) Comparisons of average seat utilization. (b) Comparisons of number of vehicles required.
(a)(b)


## 4.1. Basic Conditions

The scheduling cycle is 7 : 00–8 : 00 a.m.; the radius of the circular area is 2.5 miles; the uniform speedVis 21.7 miles/h; the coordinate of the transfer station Ois (0, 0); there are two types of vehicles, M1=M11,M12,M13,M14,M15, M2=M21,M22,M23, Q1=10people,Q2=15people, C1=9.3$/shift,Q2=15.5$/shift, G1=1.9$/mile,G2=2.4$/mile; T is 45 min; C is 2.5 $/people; w1,w2,w3,andw4 are 1.0, 1.0, 2/3, and 2/3 respectively; α,β are 9.3 $/h and 13 $/h, respectively; there are 1 transfer station and 25 demand points (shown in Figure 6 and Table 4) and 124 pick-up passengers to transfer station and 36 deliver passengers leaving the transfer station, whose time windows and locations are shown in Table 5. The distances between demand points are shown in Table 6.Figure 6
Possible service area and demand point distribution.Table 4
Coordinates of demand points (miles).
PointXY00.000.0010.520.3320.66−0.1631.200.0141.410.4551.720.1760.920.7571.261.0081.770.6091.721.04101.980.43111.880.89122.580.41132.250.63142.790.86152.390.93162.081.04172.851.08182.431.12190.991.30200.601.13211.13−0.37221.62−0.22231.13−0.76240.61−0.76250.69−1.44Table 5
Passenger locations and time windows.
Passenger numberPassenger typeDemand pointLTmUTmDTm1Pick-up17 : 027 : 072Pick-up17 : 037 : 083Pick-up17 : 057 : 104Pick-up17 : 077 : 125Pick-up17 : 107 : 156Pick-up17 : 137 : 187Pick-up17 : 157 : 208Pick-up17 : 187 : 239Pick-up17 : 207 : 2510Pick-up17 : 227 : 2711Pick-up17 : 247 : 2912Pick-up17 : 277 : 3213Deliver17 : 307 : 357 : 0814Deliver17 : 407 : 457 : 1215Deliver17 : 457 : 507 : 1816Pick-up17 : 357 : 4017Pick-up17 : 407 : 4518Pick-up27 : 077 : 1219Pick-up27 : 107 : 1520Pick-up27 : 207 : 2521Pick-up27 : 277 : 3222Deliver27 : 337 : 387 : 0823Deliver27 : 407 : 457 : 1024Pick-up37 : 097 : 1425Pick-up37 : 127 : 1726Pick-up37 : 187 : 2327Pick-up37 : 207 : 2528Pick-up37 : 237 : 2829Pick-up37 : 267 : 3130Pick-up37 : 287 : 3331Pick-up37 : 307 : 3532Pick-up37 : 357 : 4033Pick-up37 : 387 : 4234Pick-up37 : 407 : 4535Pick-up37 : 427 : 4736Deliver37 : 307 : 357 : 0537Deliver37 : 407 : 427 : 0838Pick-up47 : 087 : 1339Pick-up47 : 107 : 1540Pick-up47 : 137 : 1841Pick-up47 : 157 : 2042Pick-up47 : 187 : 2343Pick-up47 : 237 : 2844Pick-up47 : 257 : 3045Pick-up47 : 277 : 3246Pick-up47 : 307 : 3547Pick-up47 : 327 : 3748Pick-up47 : 357 : 4049Pick-up47 : 377 : 4250Pick-up47 : 387 : 4351Pick-up47 : 407 : 4552Deliver47 : 457 : 507 : 1253Pick-up57 : 107 : 1554Pick-up57 : 127 : 1755Pick-up57 : 157 : 2056Pick-up57 : 237 : 2857Pick-up57 : 257 : 3058Pick-up57 : 277 : 3259Pick-up57 : 287 : 3360Pick-up57 : 307 : 3561Pick-up57 : 327 : 3762Pick-up57 : 357 : 4063Pick-up57 : 377 : 4264Deliver57 : 357 : 407 : 0565Deliver57 : 387 : 427 : 0566Deliver57 : 427 : 477 : 1267Deliver57 : 507 : 557 : 1568Pick-up67 : 157 : 2069Pick-up67 : 177 : 2270Pick-up67 : 207 : 2571Pick-up67 : 237 : 2872Pick-up67 : 287 : 3373Deliver67 : 307 : 357 : 0074Deliver67 : 357 : 407 : 0075Pick-up77 : 157 : 2076Pick-up77 : 207 : 2577Deliver77 : 357 : 407 : 0078Deliver77 : 407 : 457 : 0579Pick-up87 : 207 : 2580Pick-up87 : 237 : 2881Pick-up87 : 257 : 3082Pick-up97 : 057 : 1083Pick-up97 : 107 : 1584Pick-up97 : 157 : 2085Pick-up107 : 157 : 2086Pick-up107 : 187 : 2387Pick-up107 : 207 : 2588Deliver107 : 257 : 307 : 0089Deliver117 : 457 : 507 : 1090Deliver117 : 457 : 507 : 1091Pick-up127 : 107 : 1592Pick-up127 : 107 : 1593Deliver127 : 357 : 407 : 0594Deliver127 : 357 : 407 : 0595Pick-up137 : 307 : 3596Pick-up137 : 307 : 3597Deliver137 : 357 : 407 : 0598Pick-up147 : 107 : 1599Pick-up147 : 157 : 20100Deliver147 : 357 : 407 : 00101Deliver147 : 357 : 407 : 00102Deliver157 : 407 : 457 : 05103Deliver157 : 407 : 457 : 05104Pick-up167 : 207 : 25105Pick-up167 : 207 : 25106Pick-up177 : 307 : 35107Pick-up177 : 357 : 40108Deliver187 : 357 : 407 : 00109Deliver187 : 407 : 457 : 10110Deliver187 : 407 : 457 : 15111Pick-up197 : 107 : 15112Pick-up197 : 157 : 20113Pick-up197 : 207 : 25114Pick-up197 : 237 : 28115Pick-up197 : 307 : 35116Pick-up197 : 407 : 45117Pick-up207 : 127 : 17118Pick-up207 : 157 : 20119Pick-up207 : 257 : 30120Pick-up207 : 277 : 32121Pick-up207 : 357 : 40122Pick-up207 : 407 : 45123Pick-up217 : 127 : 17124Pick-up217 : 157 : 20125Pick-up217 : 207 : 25126Pick-up217 : 237 : 28127Pick-up217 : 257 : 30128Pick-up217 : 277 : 32129Pick-up217 : 307 : 35130Pick-up217 : 357 : 40131Pick-up217 : 387 : 43132Deliver217 : 357 : 407 : 05133Deliver217 : 407 : 457 : 08134Pick-up227 : 187 : 23135Pick-up227 : 187 : 23136Pick-up227 : 247 : 29137Pick-up227 : 247 : 29138Pick-up227 : 307 : 35139Pick-up237 : 137 : 18140Pick-up237 : 157 : 20141Pick-up237 : 207 : 25142Pick-up237 : 257 : 30143Pick-up237 : 407 : 45144Deliver237 : 357 : 407 : 05145Deliver237 : 407 : 457 : 12146Pick-up247 : 107 : 15147Pick-up247 : 137 : 18148Pick-up247 : 157 : 20149Pick-up247 : 187 : 23150Pick-up247 : 207 : 25151Pick-up247 : 237 : 28152Pick-up247 : 257 : 30153Pick-up247 : 287 : 32154Pick-up247 : 307 : 35155Deliver247 : 357 : 407 : 00156Deliver247 : 427 : 457 : 08157Deliver247 : 457 : 507 : 12158Pick-up257 : 107 : 15159Pick-up257 : 127 : 17160Pick-up257 : 107 : 15Table 6
Distances between demand points (mile).
Point01234567891011121314151617181920212223242500.000.690.871.422.111.981.572.112.602.502.422.572.982.963.423.042.833.633.242.221.741.542.151.631.122.0810.690.000.741.301.691.820.941.482.051.872.031.932.812.682.792.412.203.002.601.591.121.371.982.062.063.0220.870.740.000.550.741.081.681.781.872.171.552.042.071.942.442.312.232.652.502.261.850.631.231.191.312.2831.421.300.550.000.680.531.441.231.311.531.001.461.521.391.891.751.682.101.951.712.180.590.681.151.662.3442.111.690.740.680.000.540.750.550.750.841.010.811.451.081.531.311.111.901.511.021.491.280.701.842.352.6251.981.821.080.530.540.001.291.090.861.290.480.931.000.861.361.311.261.571.431.562.031.120.541.682.192.4661.570.941.681.440.751.290.000.551.110.941.461.001.901.531.851.481.262.051.641.031.502.031.452.592.683.3772.111.481.781.230.551.090.550.000.910.731.250.791.691.321.641.261.051.871.460.480.951.821.242.382.893.1682.602.051.871.310.750.861.110.910.000.430.380.391.040.661.280.910.761.511.101.321.791.901.332.472.983.2492.501.872.171.530.841.290.940.730.430.000.820.321.220.851.180.790.461.140.730.891.362.121.542.683.193.47102.422.031.551.001.010.481.461.250.380.820.000.460.780.521.140.760.681.350.951.662.131.591.012.152.672.93112.571.932.041.460.810.931.000.790.390.320.460.000.900.530.920.550.331.130.711.201.672.051.692.613.123.39122.982.812.071.521.451.001.901.691.041.220.780.900.000.370.600.820.870.811.162.342.812.111.542.673.193.45132.962.681.941.391.080.861.531.320.660.850.520.530.370.000.740.550.430.950.741.772.241.981.402.543.053.32143.422.792.441.891.531.361.851.641.281.181.140.920.600.740.000.380.780.280.632.062.532.451.873.013.523.79153.042.412.311.751.311.311.481.260.910.790.760.550.820.550.380.000.400.590.511.682.152.421.852.993.503.77162.832.202.231.681.111.261.261.050.760.460.680.330.870.430.780.400.000.830.421.281.752.281.702.843.353.62173.633.002.652.101.901.572.051.871.511.141.351.130.810.950.280.590.830.000.411.972.442.692.113.253.764.03183.242.602.501.951.511.431.641.461.100.730.950.711.160.740.630.510.420.410.001.552.022.301.722.863.343.64192.221.592.261.711.021.561.030.481.320.891.661.202.341.772.061.681.281.971.550.000.472.542.193.332.863.83201.741.121.852.181.492.031.500.951.791.362.131.672.812.242.532.151.752.442.020.470.002.492.193.042.723.68211.541.370.630.591.281.122.031.821.902.121.592.052.111.982.452.422.282.692.302.542.490.001.280.561.071.75222.151.981.230.680.700.541.451.241.331.541.011.691.541.401.871.851.702.111.722.192.191.280.001.772.291.92231.632.061.191.151.841.682.592.382.472.682.152.612.672.543.012.992.843.252.863.333.040.561.770.000.511.55241.122.061.311.662.352.192.682.892.983.192.673.123.193.053.523.503.353.763.342.862.721.072.290.510.001.64252.083.022.282.342.622.463.373.163.243.472.933.393.453.323.793.773.624.033.643.833.681.751.921.551.640.00


## 4.2. Route and Scheduling Optimization in Initial Service Area

According to the land use, the light green dotted area, surrounded by Wanjiali Rd.(S.), Furong Rd.(S.), Huanbao Rd.(W.), and Huijin Rd., is set as the initial service area (shown in Figure6). In the initial service area, there are 59 reservation passengers. The computer program of the Figure 5 based on Matlab is operated to optimize routes and scheduling, and the results are shown in Tables 7–9.Table 7
Optimization results under mixed running mode in the initial service area.
Departure timeVehicle numberRouteMileage (miles)Cumulative number of passengers servicedSeat utilizationEnd timeRunning mode7 : 13M210-68-69-1-3-6-9-25-27-38-39-40-43-29-45-19-07.45151007 : 33Alone pick-up7 : 14M110-26-18-5-70-41-44-42-24-46-21-07.37101007 : 36Alone pick-up7 : 30M220-13-11-10-71-72-73-47-30-32-48-49-51-35-05.851386.67 : 47Mixed7 : 35M120-8-4-7-20-22-34-28-31-33-36-50-74-04.99121207 : 49Mixed7 : 45M110-23-52-37-12-14-2-15-16-17-04.289907 : 57MixedTable 8
Optimization results under pick-up and deliver alone in the initial service area.
Departure timeVehicle numberRouteMileage (miles)Cumulative number of passengers servicedSeat utilizationEnd timeRunning mode7 : 03M210-3-9-20-24-25-26-28-39-42-44-19-04.281173.37 : 30Alone pick-up7 : 13M110-1-2-4-5-6-7-53-40-38-18-03.94101007 : 24Alone pick-up7 : 18M120-58-59-13-14-15-22-23-36-37-52-06.58101007 : 37Alone deliver7 : 18M130-54-56-8-10-11-21-41-43-45-27-06.09101007 : 36Alone pick-up7 : 28M140-57-46-47-48-55-12-16-17-04.708807 : 41Alone pick-up7 : 36M110-29-30-31-32-34-49-50-51-33-35-04.21101007 : 48Alone pick-upTable 9
Comparisons of two running modes in the initial service area.
Running modeKNumber of vehicles requiredAverage seat utilization rateVehicle mileage required per passenger(miles)E ($)v = 1v = 2SumAlone641590.76%0.51−59.0Mixed522498.33%0.5114.5Increase rate(%)−16.7——−208.3——If the number of the vehicles is sufficient and other parameters in the initial service area are still used, routes and scheduling optimization under pick-up and deliver alone is performed based on the MIP model changed slightly constraints for the mixed running. The results are shown in Tables8 and 9.From Tables7–9, comparing to the pick-up and deliver mode alone, the advantage of the mixed mode is obvious: the number of departures and vehicles required are reduced by 16.7% and 20%, respectively. Also, average seat utilization rate is increased by 8.3%. System total benefit E becomes positive.


## 4.3. Route and Scheduling Optimization in Optimal Service Area

In Table7, only 4 vehicles are needed, so the service area can be expanded. There are three expandable directions (shown in Figure 7). The number of new demand points is the same when expanding a block in three directions, so road network connectivity in three directions should be compared. Road network connectivity that expanded to the north, to the east, to the south is 2.72, 2.61, and 2.66, respectively. Priority should be given to expanding the service area to the north. Loop this way until the optimal service area is obtained (dark green dotted line as shown in Figure 7).Figure 7
Service area optimization process.In the service area surrounded by the dark green dotted line, all vehicles are used (according to the calculations followed); the number of departures is 9, and the number of passengers served is 105. Based on Figure5, the service area under irregular road network and scope can be optimized.There are 105 reservation passengers in the optimal service area. The computer program of Figure4 is again utilized, and the results are shown in Tables 10–12.Table 10
Optimization results under mixed running in the optimal service area.
Departure timeVehicle numberRouteMileage (miles)Cumulative number of passengers servicedSeat utilizationEnd timeRunning mode7 : 09M110-111-112-76-68-70-41-42-28-124-127-06.81101007 : 32Alone pick-up7 : 10M210-139-140-123-39-20-4-5-128-119-143-141-013.491173.37 : 48Alone pick-up7 : 14M220-113-7-118-75-27-29-12-116-012.17853.37 : 47Alone deliver7 : 16M230-2-3-8-10-146-148-126-26-31-121-16-08.411173.37 : 43Alone pick-up7 : 22M120-1-6-9-11-18-24-25-142-151-153-04.77101007 : 35Alone pick-up7 : 30M130-13-19-38-40-43-44-46-114-115-69-71-05.80111107 : 46Mixed7 : 30M140-30-36-129-45-47-48-49-50-32-33-34-05.39111107 : 45Mixed7 : 40M150-72-73-74-77-78-117-120-122-51-130-131-145-147-150-154-08.03151508 : 02Mixed7 : 45M130-14-15-125-132-133-144-152-155-156-157-149-35-37-52-21-22-23-17-07.66181208 : 07MixedTable 11
Optimization results under pick-up and deliver alone in the optimal service area.
Departure timeVehicle numberRouteMileage (miles)Cumulative number of passengers servicedSeat utilization (%)End timeRunning mode7 : 07M110-19-41-38-39-24-25-95-76-28-21-07.04101007 : 31Alone pick-up7 : 10M120-71-40-77-94-97-99-44-45-46-010.069907 : 38Alone pick-up7 : 10M210-53-60-20-96-98-88-78-90-80-79-101-89-10210.611386.67 : 40Alone deliver7 : 12M130-13-14-85-86-92-93-103-104-105-04.269907 : 24Alone deliver7 : 16M220-64-65-66-67-61-54-55-56-2-3-4-6-12-04.441386.67 : 30Alone pick-up7 : 18M140-58-59-36-37-22-23-52-62-63-15-07.02101007 : 38Alone deliver7 : 18M150-5-7-8-9-26-27-87-70-72-74-07.95101007 : 41Alone pick-up7 : 20M230-1-10-42-73-84-34-43-47-49-91-100-011.101173.37 : 52Alone pick-up7 : 22M160-11-18-29-57-68-16-75-69-50-51-010.75101007 : 52Alone pick-up7 : 30M130-81-82-83-30-31-32-33-48-35-17-05.49101007 : 48Alone pick-upTable 12
Comparisons of two running modes in the optimal service area.
Running modeKNumber of vehicles requiredAverage seat utilization rateVehicle mileage required per passenger(miles)E ($)v = 1v = 2SumAlone1063991.3%0.7523.1Mixed9538100%0.69119.3Increase rate (%)−10.0——−11.19.5−8.0416If the number of the vehicles is sufficient and the other parameters in the optimal service area are still used, routes and scheduling optimization under pick-up and deliver alone is performed based on the MIP model. The results are shown in Tables11 and 12.From Tables10 and 12, comparing to the pick-up and deliver alone modes, the advantage of the mixed mode is also obvious: the number of departures, vehicles required, and vehicle mileage required per passenger is reduced by 10.0%, 11.1%, and 8%, respectively; average seat utilization rate is increased by 9.5%; system total benefit E is increased by more than 3 times. Compared with Tables 9 and 12, the number of passengers served by HFRFT system is increased by optimizing the service area. Therefore, regardless of whether the RFT system adopts the mixed running mode or alone running mode, the average seat utilization rate and the total system benefit E are improved significantly (as shown in Figure 8). Under the condition of certain transportation capacity, the optimization of service area has certain significance to improve vehicle utilization rate and reduce vehicle idle cost.Figure 8
Comparisons of two operation modes before and after optimization. (a) Comparisons of average seat utilization. (b) Comparisons of number of vehicles required.
(a)(b)


## 5. Conclusion and Future Work

This paper proposes a design method for the HFRFT system with multitype vehicles, mixed running, and capacity constraints, where the vehicle routes, scheduling, and service area are optimized according to reservation requirements. A mixed integer programming model and its hybrid of meta-heuristic algorithm is devised to efficiently and integrally solve for vehicle routes and scheduling parameters. A heuristic method is also put forward to optimize the service area based on the equilibrium of system supply and demand. Case studies show that the mixed running mode with multitype vehicle can significantly increase the seat utilization and consequentially reduce the vehicle ownership and average vehicle travel distance per passenger significantly. From the case studies, the following conclusions are obtained:(i)
The MIP model can optimize the running route and departure time of each shift under reservation requirements with the mixed running, multitype vehicles, and capacity constraints and also optimize the number of departures and vehicle possession.(ii)
In the same situation of reservation requirements, the mixed running mode can significantly improve the seat utilization rate compared with that of the pick-up and deliver alone modes. It can also significantly reduce the total system cost, number of vehicle ownership and departures, and vehicle running mileage required per passenger. The results indicated that the mixed running mode is superior.(iii)
The proposed service area heuristic optimization method based on the MIP model for HFRFT running routes and scheduling coordination model can determine an optimal service area that matches the capacity with the demand.The optimization design method can provide certain practical guidance for the transit operators to determine the operation strategy and also contribute to the promotion and implementation of the RFT technology. In this study, we focus on reservation requirements. In real world, passengers may make a pick-up or deliver request during the running of the vehicle, which means it will be more practical to consider the real-time requirements. In addition, the travel time of each road section is not a fixed value, it changes with the different traffic flow. Therefore, future research will focus on designing HFRFT system under the mixed demand (with reservation and real-time requirements at the same time) and dynamic road network.



---

*Source: 8365194-2020-07-25.xml*