Line Planning under the Operation Mode of Line Sharing between Metro and Suburban Railway

,


Introduction
By the end of May 2023, 54 cities across 31 provinces in China built and operated metro, suburban railway, and other types of rail transit lines, resulting in a total of 292 lines. In May 2023, the total operating mileage of rail transit reached 9652.6 kilometers, capable of running 3.22 million trains and transporting 2.49 billion passengers.
At present, most of the rail transit lines in China still use the operation mode of diferent rail transit systems operated independently, which ofers the advantages of simplicity and noninterference between systems. Nevertheless, with an increase in travel demand, the limitations of independent operation become more apparent. Taking the Beijing subway as an example, it comprises 475 stations, including 81 transfer stations. Te transfer passenger volume on weekdays has climbed to 5.8 million, which accounts for about 90% of the total volume. Table 1 illustrates the signifcant passenger fow and congestion at transfer stations. Moreover, many transfer stations have long and narrow transfer passageway, leading to occasional difculty in boarding trains due to overcrowded platforms. All the above factors may result in a longer transfer time. Te transfer issue has a detrimental impact on passenger travel efciency and the appeal of the subway as a transportation mode.
In addition, under the independent operation mode of each system, vehicle resources of diferent lines cannot be shared. As a result, lines with surplus transportation capacity are unable to support those with insufcient capacity. Tis poor matching between demand and supply and inadequate resource sharing results in low resource utilization and hinders the timely and efective response to emergencies. Statistics reveal that certain sections of the Beijing rail transit network experience overcrowding during the morning rush hour, with a load factor of nearly 150% observed in areas like the Life Science Park-Xi'erqi section of the Changping Line. On the other hand, there are sections with very low load factors, such as the Yancun East-Zicaowu section of the Yanfang line, which is only 8%. It can be seen that the imbalance of passenger distribution is serious in the morning rush hour and that there is a large waste of transportation capacity in the sections with less passenger fows.
With the rapid development of rail transit systems, travel distances and frequencies gradually increase, and passengers pay more and more attention to the comfort and convenience of travel while enjoying punctuality and safety. A conventional single and independent transportation system is hard to meet the travel needs brought by the increasingly expansion of the transit network scale. As a result, joint operation of multimodal rail transit systems is the shape of things to come. Joint operation can not only reduce the number of transfer passengers and provide more convenient service but also promote the utilization rate of trains and other facilities, reducing operating cost.
Joint operation refers to a mode in which trains can run through lines belonging to diferent railway systems, allowing them to share all or part of the line with trains originally running on it. Joint operation can be classifed into three operation modes: vehicle renting, line leasing, and line sharing, with line sharing being the most commonly adopted operation mode. Te earliest instances of the line-sharing operation can be traced back to Karlsruhe, Germany [1]. In this case, the city tram line could share track with a German Federal Railways freight line. Drechsler [2] pointed out that this operation mode created more convenient travel conditions between Kraichgau and Karlsruhe. Compared to the previous operation mode, transportation demand has grown rapidly, and the number of passengers has increased by approximately quintuple. In addition to delivering ferocious success in Germany, the line-sharing operation mode has also yielded favorable outcomes in other European cities as well as Japan. For example, after the Tokyu Corporation adopted the line-sharing operation mode, the number of passengers crossing lines between Shibuya and Yokohama increased by a huge 13.1%. As a result, the annual fnancial revenue of the Tokyu Corporation increased by 2 billion yen [3]. Te aforementioned successful cases in various countries illustrate the signifcant advantages of the line-sharing operation mode in actual transportation, which can facilitate passenger travel and generate considerable operational benefts.
For the sake of fast and convenient travel, alleviating the pressure on transfer stations during rush hours, and improving the competitiveness of the rail transit travel mode, it is necessary to adopt the line-sharing approach. However, the line-sharing operation mode needs to meet certain conditions, and many scholars have conducted a series of explorations on the technical requirements it must satisfy. Grifn [4] took the Sunderland Metro and light rail in the United Kingdom as an example, elaborated on the technical problems that need to be solved in the joint operation, and introduced the characteristics of a dual-voltage system and its application prospect. He also emphasized that the line sharing operation was perhaps the most efective way of meeting the travel needs of people living in urban and suburban areas. Novales et al. [5] analyzed the solutions to technical problems such as traction power, supply system, wheel/rail design, structural strength, communication system, and passenger access (platform height, gap between platform, and train) under the line-sharing operation of trams and state-owned railways. Naegeli et al. [6] surveyed existing systems to identify key requirements for the successful case of the line-sharing operation. Tese requirements included network design, city layout, population density, and existing technical standards. Ito [7] introduced the developments and current situation of the line-sharing operation in Tokyo and indicated that running direct trains between diferent operators required close coordination and full negotiation. Kurosaki [8] analyzed the striking diferences in the organization mode and management system of the line-sharing operation between Europe and Tokyo. He pointed out that it was crucial for other countries to choose the appropriate style of railway operation while introducing the line sharing operation.
Te above studies have technically proved the feasibility and necessity of the line-sharing operation. However, the theoretical and practical research on the line-sharing operation in China is still in the exploration stage. For example, some scholars discussed under what situation the linesharing operation mode will obtain good performance. Zheng [9] believed that the line-sharing operation mode should be adopted under the condition of uneven spatiotemporal distribution of passenger fows, or the number of passengers decreasing progressively with distance. Li [10] held that the line-sharing operation mode could be adopted between the two rail transit systems when the transfer passenger fow is large and the transfer time is long. Furthermore, some scholars pay attention to the macrolayout [11,12]; others study the plan and design of the line-sharing operation with realistic cases [13][14][15]. Tere is limited research on transport organization under the line-sharing operation condition. Considering limitations in this area, we need to conduct research on the line-sharing operation mode at the transport organization level. Line-planning problem (LPP) is the most crucial phase in railway transport organization. It mostly deals with stopping schemes, optimal paths, and service frequencies for demand cover [16][17][18]. Tere are many existing studies focused on subprocesses, such as those mainly concerned halting patterns [19,20], train frequency [21,22], and optimal routes [23,24]. Tere have also been numerous studies on the combinatorial problem involving the aforementioned subprocesses. Feng et al. [25] constructed a mixed-integer nonlinear program model to develop an optimal train service plan and determined the number of service routes, frequency, and train stopping patterns for a real-life case study in Chengdu, China. Szeto and Jiang [26] proposed a bilevel programming model to fnd the optimal routes and service frequencies. Meng et al. [27] transferred LPP into a complex network with the typical characteristics of small-world and degree free. Fu et al. [28] used an integrated hierarchical method to determine train frequencies as well as various halting patterns. Schöbel [29] combined the line-planning problem with other transport organization issues and established a generic model to describe the problem. Canca et al. [30] considered maximizing the net proft as the objective and used an adaptive large neighborhood search metaheuristic algorithm to solve the line-planning problem. Zhao et al. [31] applied Stackelberg game theory to deal with the combined optimization problem that balances the tradeofs between operating costs and passenger travel cost by incorporating the passenger fow assignment into line planning. Micco et al. [32] presented an approach to design better line plans for realistic scenarios and proposed a new metric to compare diferent transit networks. Zhang et al. [33] proposed a unifed integer linear programming model for the integrated optimization of line planning and train timetabling.
Trough the above analysis of the development and research status of the line-sharing operation mode, the advantages of the line-sharing operation mode are demonstrated, and the feasibility of implementing the linesharing operation mode is explained. However, research on the line-sharing operation in China is still in its early stages, and there is limited focus on the transport organization level in existing studies. Since LPP serves as the cornerstone of transport organization, it is imperative to conduct research on LPP within the context of the linesharing operation mode.
After reviewing the existing literature on LPP, we provide a comprehensive overview of its key aspects and summarize previous research conducted on this problem. Previous research on LPP has provided useful references for this paper from diferent aspects, but most of the existing studies only concern a single rail transit system, such as the high-speed rail network and urban railways. Te aforementioned studies do not take into account LPP under the conditions of joint operation in diferent rail transit systems. Unlike previous research, we establish a multiobjective comprehensive optimization model for LPP under the operation mode of line sharing between metro and suburban railway.
Te detailed contributions are as follows: (1) Te line-sharing operation mode is studied from the perspective of line plan. A novel line plan model under the operation mode of line sharing between metro and suburban railway is built. In addition, all kinds of transfer passengers and fare clearing rules under the line-sharing mode are described in detail. (2) Te artifcial bee colony algorithm is improved to solve the line plan problem. An actual case is used to verify the reliability of the proposed model and algorithm, which inspire the realization of the linesharing operation between diferent rail transit systems.
Te remainder of the paper is organized as follows. Section 2 uses a mathematical approach to describe LPP in detail. Section 3 designs the improved artifcial bee colony (IABC) algorithm to address the line plan problem. Numerical experiments and comparative analysis are shown in Section 4 to verify the efectiveness of the proposed method. Section 5 draws conclusions and puts forward the future study aspects.

Problem Description.
Since the traditional operation mode fails to meet the travel needs of passengers adequately, we propose a scenario of joint operation between the metro and suburban railway systems. Cross-line metro (or suburban) trains could operate seamlessly between the metro and suburban lines, and the two operating companies adopt the line-sharing operation mode.
Te fact is that the metro line and suburban railway line interconnect at the cross-line station S b , as shown in Figure 1. S Met � S 1 , · · · , S a , · · · , S b is the set of metro stations, S Sub � S b , · · · , S c , · · · , S N is the set of suburban railway stations, and N is the total number of stations. Te direction from S 1 to S N is considered the upward direction, while the direction from S N to S 1 is considered the downward direction. E 1 is the running section of metro trains without a cross-line operation. In other words, metro trains depart from the station S 1 then run to the station S b and turn back. Similarly, E 2 is the running section of cross-line metro trains, E 3 is the running section of suburban trains without a cross-line operation, and E 4 is the running section of crossline suburban trains. Te station S a is the departure station of cross-line suburban trains in the upward direction, while the station S c is the terminal station of cross-line metro trains in the upward direction.
Line zoning is shown in Figure 2, and the subsequent description of travel time savings is based on this division. Generally, the passenger volume is small in sections I and IV, which are located at ends of the line, while it is large in sections II and III.
Taking the upward direction as an example, as shown in Figure 3, passengers traveling in the upward direction can be divided into 10 categories: Both the origin and destination of passengers belonging to Class 11-up (where "up" refers to the upward direction) are within section I. Te passengers belonging to Class 12-up have their travel path originating in section I and their destination in section II. Te travel path for Class 13-up passengers begins in section I and concludes in section III. Similarly, we can get the origin and destination for other passenger categories.
Under the line-sharing operation mode, all expenses arising from the operation of cross-line trains are borne by the enterprises to which the cross-line trains belong. Te ticket income brought by passengers taking cross-line trains belongs to the enterprises at which the cross-line section is located. Detailed fare clearing rules are shown in Figure 4.
In this mode, the tracks of metro and suburban lines are integrated and shared, allowing trains from diferent lines to operate on the overlapping sections. Passengers can travel from suburban railway line to metro line without transferring. Line planning under the line-sharing operation mode requires coordinating train frequency, resource utilization, and ticket income clearing to ensure smooth and confict-free operations at shared segments.

Assumptions.
Before constructing a mathematical model, certain necessary assumptions are made as follows: S a can be any station between S 1 and S b , and S c can be any station between S b and S N . Passengers can transfer at S a , S b , or S c .

Symbols of the Line Plan Model.
Te meaning of all the symbols of the LPP model is listed in Table 2.

Objective Functions of the Line Plan
Model. Te quality of a line plan is often judged by the travel time from the passengers' point of view and operation costs from the perspective of operators. Terefore, the objective function is considered from three parts: net proft of the subway operating company, net proft of the suburban railway operating company, and passengers travel time savings. Te net proft of the metro operating company can be expressed as fare revenue minus the operating costs: Metro station Suburban railway station Cross-line-station Figure 1: Joint operation between metro and suburban railway.   Similarly, the net proft of the suburban railway operating company can be expressed as: (2) Te total travel time savings can be expressed as the sum of the time savings for ten types of passenger fows. Taking the travel time savings of Class 11-up passenger fows as an example, T 1,1 consists of two parts: T up 11 and T down 11 . Total travel time includes waiting time, time on the train, and transfer time. Time on the train mainly depends on the technical speed of vehicles and the travel distance. Joint operation has little impact on this kind of time, so we only consider waiting time and transfer time. Under the condition of the short departure interval, passenger waiting time is close to half of the departure interval [34,35]. In China, upward and downward trains typically operate in pairs, meaning that the service frequency and train types are the same in both directions. Terefore, the waiting time of passengers before joint operation can be expressed as 1/2f Met ′ . As for f Met ′ , it can be calculated by maximum passenger volumes of each section in the metro line, which is shown in formula (6). Te waiting time of passengers after joint operation can be expressed as 1/2(f Met + f Met cross ), and there is no transfer time. Terefore, the total travel time savings of Class 11-up passenger fows are Similarly, we can derive Journal of Advanced Transportation

Integration of Objective Functions.
Since the measuring unit and the order of magnitude of T are diferent from those of W Met and W Sub , we introduce the time value coefcient ω time to convert time into cost: Owing to the difculty of solving a multiobjective problem directly, we intend to use the linear weighted sum method to set diferent weights for the objective functions, which can merge multiple objectives into one. Φ 1 and Φ 2 are weight coefcients of optimization objectives W Met and W Sub , respectively. Te values of two coefcients are between (0, 1). (1 − Φ 1 − Φ 2 ) is the weight coefcient of the optimization objective W t . Te minimum and maximum values of three objective functions are calculated in advance; then, the min-max normalization method is used to unify the order of magnitude. W is the general objective after transformation: · q ij e π ∈ II, downward direction , Taking e π ∈ II, the upward direction is taken as an example to explain the above formula. Te passenger fows taking subway trains in this section are shown in Figure 5, including ① passenger fows from a station in section I to a station (the position of this station is located at station S π+1 or behind S π+1 ) in section II, ② passenger fows from a station (the position of this station is located at station S π or before S π ) in section II to another station (the position of this station is located at station S π+1 or behind S π+1 ) in section II, and ③ passenger fows from a station in section I to a station in section IV. According to the assumption (3), a direct train between two stations is always the frst priority for passengers comparing to a transfer train between two stations. It can be seen that the passenger fows from a station in section I to a station in section III, from a station in section II to a station in section III, and from a station in section II to a station in section IV will only choose to take cross-line trains. Terefore, these passenger fows are not included in q Met e π . Te assumptions indicate that cross-line trains and noncross-line trains are composed of the same type of vehicles. Passengers only have a preference for choosing between direct or transfer options and do not show a preference for any specifc train itself. During the study period, passengers arrive at the station evenly, and they typically opt to board the frst train that arrives after they reach the station, as long as it can take them to their destination. Terefore, we can calculate the amount of passenger fows taking metro trains or cross-line metro trains based on the ratio of operating frequency.
Class ① passenger fows may choose to take metro trains or cross-line metro trains. Terefore, Class ① passenger fows taking metro trains in the section e π are Class ② passenger fows can choose to take metro trains, cross-line metro trains, or cross-line suburban trains. Terefore, Class ② passenger fows taking metro train in the section e π are Tere are three diferent transfer schemes for Class ③ passenger fows, namely, transfer at the station S a , transfer at the station S b , and transfer at the station S c .
Passengers who transfer at the station S a have the option to either take regular metro trains or cross-line metro trains to reach the station S a and then transfer to cross-line suburban trains to reach their destination. Te passenger transfer scheme diagram at the station S a is shown in Figure 6; for the sake of contrast, cross-line trains and noncross-line trains in the fgure are represented by diferent icons, but they use the same type of vehicles in practical terms.

Journal of Advanced Transportation
Tose who transfer at the station S b may take metro trains or cross-line metro trains to the transfer station S b and then board suburban trains or cross-line suburban trains to their destination. Te transfer scheme diagram of the station S b is shown in Figure 7.
We can clearly see the transfer scheme of the station S c from Figure 8. Passengers who transfer at the station S c can only board cross-line metro trains in the section e π , and they will subsequently transfer to suburban trains or cross-line suburban trains at the station S c .

Constraint of Available Vehicles.
Te operated vehicles should be less than the total available vehicles:

Constraint of Line-Carrying Capacity.
During the considered period (one hour), the service frequency of trains must not exceed the line-carrying capacity: f Sub + f Sub cross + f Met cross ≤ C Sub max .

Constraint of Train Service Frequency.
According to the relevant specifcations, service frequency of diferent kinds of trains shall not be lower than the minimum departure frequency [36]: f Sub + f Sub cross ≥ F Sub min .

Constraint of the Station Capacity.
Te passing capacity of stations cannot be exceeded: 2.6.6. Constraint of Cross-Line Setting. Location values of the station S a and station S c are unique:

Algorithm Design
LPP has been proven to be an NP-hard problem, even for a single rail line [37][38][39]. Te above mathematical model is nonlinear and hard to be solved in a short time using the existing software. Terefore, we employ a heuristic algorithm to tackle the problem. Te traditional artifcial bee colony (TABC) algorithm, initially proposed by Karaboga in 2005, simulates the behavior of bees in honey collection. It ofers advantages such as simple implementation, wide applicability, and strong robustness [40]. Te TABC algorithm demonstrates superior efciency compared to other swarm intelligence algorithms, and it is less prone to becoming trapped at locally optimal values [41]. Terefore, we select the artifcial bee colony algorithm to solve the line-planning problem and improve the algorithm to achieve higher efciency.

Algorithm Fundamentals.
Te traditional artifcial bee colony (TABC) algorithm mainly involves four elements: scout bees, employed bees, onlooker bees, and food sources. Te food source represents the feasible solution, and the quality of the food source can be assessed by the ftness function value in the algorithm. Employed bees are in charge  of the food source search in the neighborhood of every food source domain and the comparison between the current food source and the previous one with a greedy criterion, which means accepting the better one all the time. Tere is some information exchange between employed bees and onlooker bees after the neighborhood search. Onlooker bees can either choose to follow the employed bees with a certain probability to search the new food source in the domain, where they will convert to employed bees, or they can stay unchanged. When a food source cannot be improved after multiple continuous searches by the employed bees, scout bees intervene. Scout bees will search new food sources to replace the old ones outside the searching neighborhood.
Te ftness function designed in this paper is where W represents the general objective, σ represents the penalty coefcient, P represents the penalty term when violating constraint formulas (18)- (40), and G is the ftness value. Te larger the ftness value, the better the solution.

Renewal and Improvement Strategy of IABC.
Employed bees search for new food sources around the i-th food source according to formula (43), where a is the acceleration coefcient, θ is the random number uniformly distributed in the interval [−1, 1], and V j is the neighborhood food source of V i . According to the greedy criterion, the one with better ftness value will always be selected. Otherwise, the original one will not be replaced: Te improved roulette strategy in formula (44) is used to calculate the probability that onlooker bees follow employed bees to gather honey. After the onlooker bee selects a certain food source, it adopts the same neighborhood search strategy as the employed bee. When the onlooker bee fnds a better food source, it swaps roles with the employed bee, and the original food source is replaced with the new one: In the TABC algorithm, if the iterative number of times trial(i) reaches the threshold I max and the food source has not been updated yet, then this food source V i is abandoned and the scout bee looks for a new food source. Te formula for the location of the new food source is In order to improve the efciency of global search, the current global optimal solution can be used to guide the generation of new solutions, thereby efectively developing the solution space information near the new solution. When trial(i) ≥ I max , a food source V new is generated according to formula (45). Ten, the scout bees begin search for the new food source V new′ using the information from the current globally optimal food source V best with a probability p 0 . Afterward, the ftness values of the newly discovered food source V new′ and V new are compared, and the better solution is retained:

Solving Process of IABC.
Te solution steps are as follows, and a more visual description is provided in Figure 9: Step 1: We import the basic data and set the parameter values of the algorithm, which include the number of food sources nPop, current search times of each food source trial(i), maximum search number for a single food source I max , maximum iteration number R max , current iteration number Cycle, and the probability p 0 of the global optimal solution guiding the generation of new solutions. Let trial(i) � 0 and Cycle � 0.
Step 2: We initialize the food source using formula (42), calculate the ftness value of the solution, and then record the initial global optimal solution.
Step 3: Employed bees search for new food sources using formula (43). Once a new solution has been found, its ftness value is calculated. If the new solution has a better ftness value, then it replaces the original food source, and we make trial(i) � 0 after the replacement; otherwise, there is no replacement, and let trial(i) � trial(i) + 1.
Step 4: Onlooker bees follow employed bees using the improved roulette strategy in search of new food sources. Onlooker bees choose to follow employed bees according to the improved roulette strategy in search of new food sources. If a new solution has a better ftness value, the original food source is replaced by the new one, and we make trial(i) � 0 after the replacement; otherwise, there is no replacement, and let trial(i) � trial(i) + 1.
Step 5: If the ftness values of a given food source have not been improved during I max searches, this food source is abandoned. At this point, scout bees are dispatched to search for new food sources randomly. New solutions are generated using formula (45), and then learned from the global optimal solution with probability p 0 . If the ftness value has been improved within I max search cycles, it continues searching around this food source.
Step 6: We update the global optimal solution, make Cycle � Cycle + 1, and judge whether Cycle ≥ R max . If it reaches the maximum iteration number, then it terminates the cycle and outputs the optimal solution. Otherwise, we jump to Step3.

Basic Data.
Te line schematic is shown in Figure 10.
Te average station spacing of the metro line is 1.5 km, with a total length of 22.5 km. For the suburban line, the average station spacing is 3 km, with a total length of 30 km. Te set of metro stations is S Met � S 1 , S 2 , · · · , S 16 , and the set of suburban railway stations is S Sub � S 16 , S 13 , · · · , S 26 . S 16 is the cross-line-station, which connects two lines.
Most parameter values are given based on the practical experience or referring to the data in the existing studies [9,10,36,40,41]. Te parameters of the model are shown in Table 3.
Te forecasted passenger OD (origination and destination) fows are shown in Table 4. After a large number of experiments and calculation, we determine the optimal parameters for the algorithm: the number of food sources nPop � 30, the maximum search number for a single food source I max � 10, the maximum iteration number of the algorithm R max � 2000, and the probability of using the global optimal solution to guide the generation of new solutions p 0 � 0.4.

Sensitivity Analysis of Objective Function Weight.
To conduct a detailed sensitivity analysis on the weight of the objective function, we enumerate all possible weights for each of the three objective functions at intervals of 0.1, and the algorithm is implemented in Visual C#. Te comparative analysis results are presented in Table 5. Taking (1,1,8) as an example, the meaning of this weight allocation is as follows: As can be seen from Table 5, the line-sharing operation mode can lead to signifcant savings in travel time. Furthermore, when the weight coefcient of one optimization goal increases, the value of this objective function shows an increasing trend. However, due to the limited solution space of the problem and many constraints, the objective function will no longer change once it reaches a certain value, and this is further described in Figure 11.

Analysis of Cross-Line's Terminal Station Setting.
To analyze the infuence of the cross-line's terminal station setting, we standardized the weight of the objective functions using Φ 1 � 0.3, Φ 2 � 0.3, and (1 − Φ 1 − Φ 2 ) � 0.4 as an example. From Table 6, we can readily conclude that different terminal stations of the cross-line exert signifcant infuence on the objective function value. Terefore, it is essential to reasonably set the location of the cross-line's terminal station in advance. When , the optimal crossing-line routing scheme diagram can be described in Figure 12. In the fgure, diferent line shapes represent the service routings of diferent types of trains, and the operating frequency of each service route is also shown in Figure 12.

Calculation Results of Diferent Algorithms.
We use the improved artifcial bee colony (IABC) algorithm to solve the line-planning problem in this paper. IABC is derived from improving the updating strategy of food sources based on the traditional artifcial bee colony (TABC) algorithm. To validate the efectiveness of the proposed improvement measures in addressing the line-planning problems within the research scenario presented in this paper, the TABC algorithm is employed as a comparative benchmark. In addition, the simulated annealing (SA) algorithm is a very classic heuristic algorithm, and it is widely used in solving the line-planning problems [31,34]. Terefore, the SA algorithm is also used as the comparison group, see Section 3.1. Algorithm Fundamentals for the basic principle of TABC. Te basic principle of SA is as follows.
In 1982, Kirkpatrick introduced the idea of annealing to combinatorial optimization problems and proposed the simulated annealing (SA) algorithm as a solution for tackling large-scale combinatorial optimization problems [42]. Temperature is used as a control parameter in the algorithm. Te internal energy E is analogous to the value of the objective function. In the process of cooling and annealing, a solution exists for every temperature. As temperature continuously declines, the value of the objective function also changes, and the local optimal solution is constantly searched in this process. Finally, as the internal energy decreases to the minimum, the global optimal solution for the problem is found.
Te concrete ideas of SA can be summarized as follows. First, we set any feasible solution as the initial solution for the problem. Ten, we generate the neighborhood solution according to certain criteria. In this paper, a new neighborhood solution is generated by randomly perturbing the current solution vector. Finally, the algorithm decides whether to accept the current or neighborhood solution based on the Metropolis criterion.
Te Metropolis criterion is an important sampling method proposed by Metropolis in 1953. Suppose that E i represents the internal energy of the current state i, E j represents the internal energy of the updated new state j, and if E j < E i , then we accept the new state j as the current state; otherwise, we accept the new state j with the probability p. Te probability p can be calculated according to the following equation: Onlooker bees select to follow employed bees according to formula (48), and continue to search new food sources Calculate the fitness value and use the greedy criterion to select the food source, update the sign variable trial (i) Abandon the original honey source, let scout bees look for new food sources by using the information of current global optimal food source according to probability P 0 Update the global optimal solution, letCycle=Cycle+1 Cycle ≥ R max ?
End and output the optimal solution   Figure 10: Line schematic in the example.      Journal of Advanced Transportation where k is the Boltzmann constant and ε is randomly generated on the interval (0, 1). If p > ε, the new state j is accepted; otherwise, it is discarded.
In addition, other related parameters required in SA can be obtained through repeated calculations: (1) initial temperature Temperature 0 � 10 6 , (2) decreasing function of temperature Temperature g+1 � β · Temperature g , let β � 0.95, (3) iterations limit at each temperature limit � 10, and (4) fnal temperature Temperature e � 10 − 6 . Te inner  Figure 12: Te optimal routing scheme.  loop is repeatedly executed until the number of iterations at the current temperature reaches a certain number of times, after which the temperature is reduced according to the formula Temperature g+1 � β · Temperature g . Tese steps are repeated until the temperature drops to Temperature e , and the optimal solution is output. TABC and SA are implemented using C# programming on the same computer to solve the model in this paper. We also take the weight (3,3,4) as an example, and the calculation results are shown in Table 7.
As it can be seen from Table 7, IABC has higher solution efciency and quality than TABC and SA. Compared with TABC, W increases from 0.860486 to 0.862374 and solution efciency increases by 20.45%. Compared with SA, W increases from 0.854365 to 0.862374 and solution efciency increases by 31.37%. Te iterative processes of the three algorithms are shown in Figure 13. Tis fgure demonstrates that IABC has a better solution quality and convergence rate. IABC can better adapt to the characteristics of this line plan model, and the improvement strategy for TABC is efective.
However, the above analysis of solution efciency and quality is limited to the model of this paper, as it depends on the algorithm implementations and problems tackled. With this study, it cannot be shown that the artifcial bee colony algorithm is always better than the simulated annealing algorithm in any study scenario.

Conclusion
Line planning of rail transit systems is a critical issue in transportation management, afecting key operational elements such as train timetabling, rolling stock planning, and crew planning. As joint operations between diferent rail transit systems become more prevalent, preparing line plans under joint operating conditions and allocating transportation resources efciently have become pressing issues for transit enterprises to address at present.
Te proposed approach in this paper can solve the lineplanning problem under the operation mode of line sharing between metro and suburban railway, distribute the OD fow on the metro line and suburban line, and determine the location of cross-line stations. Te objective and constraints of the line plan model describe the problem precisely, and the improved artifcial bee colony algorithm can solve the model efciently. Te proposed approach may be helpful to solve the problem of transportation resources sharing and improve transportation efciency and service quality. However, we only consider the line-sharing operation between metro and suburban railway lines, and passengers are unidirectional and static. Te line plan under other diferent rail transit systems joint operation mode with networked transportation routes and dynamic passenger fows can be further studied in the future.

Data Availability
Te data that support the fndings of this study are available from the corresponding author.

Conflicts of Interest
Te authors declare that they have no conficts of interest.