A two-stage inter-trip commuting method for primary and secondary schools considering parking sharing

By building a collection of home, joint sites, work locations and school buses, using genetic algorithms and ant colony algorithms to optimize the travel costs of private cars and school buses, the traffic congestion problem during students' commuting is solved, and two-stage joint processes are achieved with an efficient and low-cost low-cost joint processes. The commuting travel plan meets students' door-to-door travel needs.

CN114707760BActive Publication Date: 2024-11-15JILIN UNIVERSITY
View PDF 0 Cites 0 Cited by

Patent Information

Application Number
CN202210466975.8
Authority / Receiving Office
CN · China
Patent Type
Patents(China)
Current Assignee / Owner
Filing Date
2022-04-29
Publication Date
2024-11-15
Estimated Expiration
2042-04-29

AI Technical Summary

Technical Problem

During the commuting period of the existing technology, the traffic around the school is congested, the commuting flexibility of private cars is high but the resource occupancy rate is high, the commuting flexibility of school buses is poor and the vehicle utilization rate is low, which cannot meet the door-to-door travel needs of all students, and it is difficult to take care of the relatively high route. A distant student.

Method used

A two-stage commuting method for primary and secondary schools that consider parking sharing is proposed. By constructing a collection of homes, joint sites, work locations and school buses, using genetic algorithms and ant colony algorithms to optimize the travel costs of private cars and school buses, and achieving two-stage Joint commuting.

Benefits of technology

An efficient and low-cost student commuting and travel plan has been realized, which has reduced traffic congestion around the school, made full use of school bus and private car resources, and reduced parents' time and economic costs.

✦ Generated by Eureka AI based on patent content.

Smart Images

  • Figure CN114707760B_ABST
    Figure CN114707760B_ABST
Patent Text Reader

Abstract

The present invention discloses a two-stage connecting commuting travel method for primary and secondary schools that takes parking sharing into consideration, and belongs to the field of path planning technology. The connecting commuting travel method mainly includes two stages. In the first stage, connecting stations are selected based on the travel cost of private cars, and students are sent to connecting stations by private cars to go to work or return to their home addresses. In the second stage, based on the number of students at the connecting stations obtained in the first stage and considering the operating cost of the school bus, connecting stations that need to stop are selected from the connecting stations, and school bus routes are formulated, and students are sent to school by school buses. Compared with the prior art, the present invention is based on the ideas of "public-private cooperation" and "parking sharing", fully considering the characteristics of the family travel chain during the commuting period, and providing an efficient and feasible solution for commuting travel in primary and secondary schools.
Need to check novelty before this filing date? Find Prior Art

Description

Technical Field

[0001] The present invention belongs to the technical field of route planning, and specifically relates to a two-stage connecting commuting travel method for primary and secondary schools taking parking sharing into consideration. Background Art

[0002] Student commuting is an important part of urban transportation demand. With the improvement of residents' income level and the acceleration of motorization, the proportion of private cars picking up and dropping off primary and secondary school students has gradually increased. Although private car commuting is more flexible, it occupies a high rate of urban road traffic resources, resulting in a high concentration of traffic around the school during the student commuting period. In addition, the parking facilities at the school gate are not perfect and the traffic organization is not in place, which leads to traffic congestion. School buses have the characteristics of customized public transportation, which can concentrate and effectively utilize transportation resources and have a low occupancy rate of urban road traffic resources. However, the single school bus commuting mode has poor flexibility, low vehicle utilization rate and cannot meet the door-to-door travel needs of all students. The unstable running time of school buses leads to long waiting time, and some students spend a long time on the bus, and it is difficult to take care of students who travel far away. When parents commute and students commute on the same route, the time cost and economic cost of parents picking up and dropping off their children will be reduced, so it will be more convenient to choose private cars for commuting. Therefore, proposing an efficient and feasible student commuting travel plan is a technical problem that needs to be solved urgently. Summary of the invention

[0003] In view of the problems existing in the commuting travel of primary and secondary school students in the prior art, the purpose of the present invention is to consider the balance between flexibility and resource utilization, and propose a two-stage connecting commuting travel method that simultaneously utilizes school buses and private cars, so as to provide primary and secondary school students with an efficient, low-cost and practical commuting travel plan.

[0004] The technical solution adopted by the present invention to achieve the above-mentioned purpose is: a two-stage inter-trip commuting travel method for primary and secondary schools considering parking sharing, characterized in that it includes the following steps:

[0005] Step S1: construct multiple sets, including a family set A, a home address set H, a connecting station set P, a work location set D, and a school bus set M;

[0006] Step S2: The first stage of interline commuting is that parents use private cars to send students to interline stations, and then go to work or return to home addresses after sending them to the interline stations. The minimum travel cost of private cars is used as the objective function of the interline station location selection model, and the genetic algorithm is used to solve it to obtain the interline stations selected by each family and the number of students to be picked up at each interline station.

[0007] Step S3: The second stage of the inter-trip commuting trip is that the school bus sends students at the inter-trip station to school. Based on the number of students at each inter-trip station obtained in step S2, the minimum operating cost of the school bus is used as the objective function of the school bus route planning model, and the ant colony algorithm is used to solve it;

[0008] Step S4: Calculate the two-stage connecting commuting travel cost and the private car commuting travel cost, and thus complete the connecting commuting travel.

[0009] Further, the connecting site set P in step S1 includes the school and the school is represented by 0, and the set of connecting sites other than the school is P + .

[0010] Furthermore, the private car travel cost in step S2 specifically includes:

[0011] 1) Travel time during the school commute

[0012] 2) Stop time at connecting stations

[0013] 3) Travel costs to the workplace

[0014] 4) Driving cost on the way home

[0015] Furthermore, the M / M / S / ∞ queuing model is introduced to calculate the stop time at the connecting station.

[0016] Furthermore, the objective function of the inter-city station location selection model in step S2 specifically includes:

[0017] Travel time of private cars during the school commuting phase Driving time to return home Travel time of private cars on the way to the workplace Stop times at connecting stations

[0018] The objective function of the joint site location model is:

[0019]

[0020] The constraints are:

[0021]

[0022]

[0023] Condition (1) requires that each family a must and can only choose one connecting station; Condition (2) ensures that family a can choose to go to work or go home after going to the connecting station;

[0024] The meanings of the symbols in the above formula are as follows:

[0025] The travel time of household a from home address i to connecting station j;

[0026] The travel time of household a from connecting station j to home address i;

[0027] The travel time of household a from connecting station j to workplace k;

[0028] The stop time of family a at connecting station j;

[0029] If family a travels from home address i to connecting station j and then to work location k, X aijk =1 otherwise 0;

[0030] X aiji :If family a goes from home address i to connecting station j and then returns to home address i, X aiji =1, otherwise 0;

[0031] xaij: If family a travels from home address i to connecting station j, x aij =1, otherwise 0.

[0032] Furthermore, the operating costs of the school bus in step S3 specifically include:

[0033] 1) School bus travel time

[0034] 2) School bus stop service time at connecting stations

[0035] Furthermore, the objective function of the school bus route planning model in step S3 specifically includes:

[0036] School bus travel time The stop service time of the school bus at the connecting station

[0037] The objective function of the school bus route planning model is:

[0038]

[0039] Constraints:

[0040]

[0041]

[0042]

[0043]

[0044]

[0045]

[0046]

[0047]

[0048] Condition (3) requires that each connecting station must be visited by a school bus and must be visited at least once. Condition (4) requires that the school bus that visits the student connecting station must leave. Condition (5) requires that the school bus cannot be overloaded after visiting the student connecting station. Condition (6) represents the change in the number of people loaded on the school bus at consecutive connecting stations in the school bus route. Similarly, condition (7) represents the relationship between the travel time of the school bus at consecutive stations in the school bus route. Condition (8) indicates that there are no students when the school bus departs from the school. Condition (9) requires that the student's ride time does not exceed the maximum ride time T. max ,Condition (10) ensures that all students are picked up;

[0049] The meanings of the symbols in the above formula are as follows:

[0050] The travel time of the school bus from the connecting station j to the connecting station j′;

[0051] y mjj′ : If school bus m goes from connecting station j to connecting station j′, y mjj′ =1, otherwise 0;

[0052] The stop service time of school bus m at connecting station j;

[0053] The stop service time of school bus m at the connecting station j′;

[0054] L mj : The number of people on board school bus m after visiting connecting station j;

[0055] L mj′ : The number of people on board school bus m after it visits connecting station j′;

[0056] L m0 : The number of students whose school bus m visits the connecting stop at school 0;

[0057] Q: The maximum number of people that a school bus can carry;

[0058] n mj : The number of students picked up by school bus m at the connecting station j;

[0059] n mj′ : The number of students picked up by school bus m at the connecting station j′;

[0060] Z mj : The time when school bus m arrives at the connecting station j;

[0061] Z mj′ : The time when school bus m arrives at the connecting station j′;

[0062] N j : The number of students at the connecting station j;

[0063] T max : Maximum riding time for students.

[0064] Furthermore, before using the ant colony algorithm for solving the problem, the connecting stations are grouped. The specific grouping process is as follows: with the school as the center of the area circle, the initial position of the ray starting from the school does not intersect with any connecting station position, and moves counterclockwise to connecting station I to determine whether the number of people exceeds the rated passenger capacity of the school bus. If not, all the students at the connecting station will be served by the bus, and the number of people on the bus will be accumulated to find the next connecting station II, and so on, until the connecting station III exceeds the rated passenger capacity of the school bus, the student demand at the connecting station III will be split, and the fan-shaped area formed at this time will be a group, and the remaining number of students at the connecting station III will be calculated and divided into the next area, and so on, until all connecting stations are divided.

[0065] Through the above-mentioned design scheme, the present invention can bring the following beneficial effects: Compared with the prior art, the present invention fully considers the relationship between students' commuting and parents' commuting in the "family travel chain", and proposes a two-stage connecting commuting mode that utilizes school buses and private cars at the same time, which is conducive to solving traffic congestion around schools. BRIEF DESCRIPTION OF THE DRAWINGS

[0066] Figure 1 This is a flow chart of the first stage intelligent algorithm for intercity commuting in an embodiment of the present invention;

[0067] Figure 2 This is a flowchart of the second stage algorithm for inter-trip commuting in an embodiment of the present invention;

[0068] Figure 3 This is a schematic diagram of the distribution of home addresses, connecting stations and workplaces in an embodiment of the present invention;

[0069] Figure 4A schematic diagram of a school bus route in an embodiment of the present invention;

[0070] Figure 5 Flowchart of the two-stage inter-trip commuting travel method for primary and secondary schools considering parking sharing. DETAILED DESCRIPTION

[0071] In order to explain the present invention more clearly, the present invention is further described below in conjunction with preferred embodiments and accompanying drawings. It should be understood by those skilled in the art that the content described below is illustrative rather than restrictive, and should not be used to limit the scope of protection of the present invention. Unless otherwise defined, the technical terms or scientific terms used herein should be the common meanings understood by people with ordinary skills in the field to which the present invention belongs.

[0072] like Figure 5 As shown, a two-stage inter-trip commuting travel method for primary and secondary schools considering parking sharing includes the following steps:

[0073] Step S1: construct multiple sets, including a family set A, a home address set H (there may be multiple families at the same home address), a connecting station set P, a workplace set D and a school bus set M.

[0074] Furthermore, the set of connecting stations P in step S1 includes the school, and the school is represented by 0, and the set of connecting stations other than the school is P + .

[0075] Among them, the connecting station is a place with a large number of idle parking spaces during the school hours and easy to share parking spaces, and has certain requirements for the convenience of vehicle access and the safety of primary and secondary school students. For the selection of connecting stations, the present invention considers government agencies and state-owned enterprises with idle parking spaces that are close to the school during this period as connecting stations according to the students' school hours.

[0076] Step S2: The first stage of inter-city commuting: parents use private cars to send students to inter-city stations and then go to work or return to their home address. The minimum cost of private car travel is used as the objective function of the inter-city station location selection model, and an intelligent optimization algorithm is used to solve the inter-city stations selected by each family and the number of students to be picked up at each inter-city station.

[0077] Furthermore, the cost of private car travel specifically includes:

[0078] 1) Travel time during the school commute

[0079] Without considering the changes in road traffic conditions, assume that the average speed of all private cars is v c , based on the distance d between home address i and connecting station jij and the average speed of private cars v c Calculated

[0080] 2) Stop time at connecting stations

[0081] The drop-off process of private cars at the connecting station can be regarded as a multi-service station queuing model (M / M / s / ∞), and the stop time at the connecting station is The queuing model calculation is introduced. Assume that the time interval between the arrival of vehicles conforms to the negative exponential distribution with parameter λ, where λ represents the arrival rate. The drop-off area is regarded as multiple service desks, and the number of service desks is determined by the number of drop-off parking spaces s. The service time of each service desk follows the negative exponential distribution with parameter μ, where μ represents the service rate. The drop-off process is the service process.

[0082] Due to the time limit for students to go to school, all students are required to arrive within the specified time period Δt, and the arrival rate is λ=N j / Δt.

[0083] The service rate μ depends on the vehicle’s drop-off time t u and the time t when the vehicle starts to merge into the driving lane v :μ=1 / (t u +t v ).

[0084] According to the theoretical formula of the insertable gap, the maximum flow rate of drop-off vehicles merging into the lane can be obtained:

[0085]

[0086] Among them, q dmax The maximum number of drop-off vehicles merging into the lane, in veh·s -1 , q is the traffic flow rate of motor vehicles in the lane, in veh·s -1 , τ is the critical gap time distance at which the drop-off vehicle can merge into the driving lane, in seconds, and h is the headway time distance when the drop-off vehicle merges into the driving lane and continuously follows, in seconds.

[0087] The time when the vehicle starts to merge into the driving lane is t v =1 / q dmax .

[0088] Then the service rate μ is:

[0089]

[0090] when When , the idle probability can be expressed as:

[0091]

[0092] Among them, P 0 is the idle probability of no customers queuing in the system, that is, the probability that no vehicles are queuing to drop off passengers in the system, s is the number of drop-off vehicles at the connecting station, ρ is the service intensity of the service desk, and ρ s is the system load, and n is the number of customers in the system, that is, the number of drop-off vehicles.

[0093] The average waiting time for private car drop-off is:

[0094]

[0095] Among them, W s is the average waiting time for each customer in the queue, that is, the average waiting time for each vehicle to drop off passengers, L s is the average length of the system, i.e. the average length of the drop-off vehicles, L q It is the average queue length of the system, that is, the average queue length of vehicles dropping off passengers.

[0096] Stop time at connecting stations

[0097] When s When >1, the queuing theory cannot be used to calculate the average waiting time for passengers to drop off at the station. The residence time of all private cars at the school station can be obtained based on the relationship between family arrival and departure, and then the average waiting time can be obtained:

[0098]

[0099] 3) Travel costs to the workplace

[0100] For families who need to go to work after sending their children to a connecting station, the cost of driving a private car to the workplace

[0101] Among them, d jk is the distance between the connecting station j and the work location k, v c is the average speed of private cars.

[0102] 4) Driving cost on the way home

[0103] For families who need to go home after sending their children to the connecting station, the cost of driving a private car on the way home

[0104] Among them, d ji is the distance between connecting station j and home address i, v c is the average speed of private cars.

[0105] The objective function of the joint site location model specifically includes:

[0106] Travel time of private cars during the school commuting phase Driving time to return home Travel time of private cars on the way to the workplace Stop times at connecting stations

[0107] The objective function of the joint site location model is:

[0108]

[0109] The constraints are:

[0110]

[0111]

[0112] Condition (1) requires that each family a must and can only choose one connecting station; Condition (2) ensures that family a can choose to go to work or go home after going to the connecting station;

[0113] The meanings of the symbols in the above formula are as follows:

[0114] The travel time of household a from home address i to connecting station j;

[0115] The travel time of household a from connecting station j to home address i;

[0116] The travel time of household a from connecting station j to workplace k;

[0117] The stop time of family a at connecting station j;

[0118] X aijk :If family a travels from home address i to connecting station j and then to work location k, X aijk =1, otherwise 0;

[0119] X aiji :If family a goes from home address i to connecting station j and then returns to home address i, X aiji =1, otherwise 0;

[0120] x aij :If family a travels from home address i to connecting station j, x aij =1, otherwise 0.

[0121] Furthermore, the intelligent optimization algorithm used to solve the objective function of the joint station location selection model is the genetic algorithm. The algorithm flow chart is as follows: Figure 1 As shown in the figure. Taking the private car travel path as the optimization object, the connecting station selected by each family under the condition of minimum total cost is obtained, and the number of students to be picked up at each connecting station is obtained. The process of family selection of connecting stations can be regarded as a special distribution center location problem. The location selection plan of connecting stations belongs to a nonlinear programming problem with 0-1 decision variables.

[0122] In terms of chromosome encoding of genetic algorithms, chromosomes are composed of 0 and 1, that is, each gene is a binary variable. Each gene indicates whether the candidate joint site is selected, "1" indicates that the joint site is selected, and "0" indicates that the joint site is not selected. The genetic algorithm solution process is as follows:

[0123] 1. Input initial data and related parameters;

[0124] The initial data includes the distance matrix, the number of drop-off stations and traffic volume, v c ,τ,h,Δt,t u etc.; determine the number of iterations, population size, selection rate.

[0125] 2. Randomly generate an initial population pop, in which the chromosomes contain the initial joint site selection plan.

[0126] 3. Calculate chromosome fitness;

[0127] Since the objective function of the model is a minimization problem and its value is always positive, the fitness function is expressed as the inverse of the objective function value; assuming that the objective function value of the oth individual is g(o), the fitness value corresponding to the chromosome is z(o)=1 / g(o). For individuals that do not meet the constraints, their fitness values ​​are set to 0.

[0128] 4. Select the operator;

[0129] Individuals with high fitness in the population are selected and can be directly reproduced as parent chromosomes, while other chromosomes are selected using a roulette wheel method.

[0130] The cumulative probability is

[0131] Among them, P o represents the probability of an individual being selected, z(o) represents the chromosome fitness, and o represents an individual in the population;

[0132] Generate a random number, find the cumulative probability greater than the random number, and pass on the individual at the first position with a cumulative probability greater than the random number.

[0133] 5. Perform crossover and mutation operations on chromosomes;

[0134] Adaptive crossover probability is used. During the calculation process, the crossover probability will be automatically adjusted as the value of the fitness function changes. The specific formula is:

[0135]

[0136] Where P c is the adaptive crossover probability; z max is the maximum fitness function value of individuals in the group; z avg is the average fitness function value of each generation; z is the fitness function value of the two individuals that produce the crossover, one of which has a larger fitness function value; K 1 and K 2 are all constants in the interval (0, 1);

[0137] Adopting adaptive mutation probability:

[0138]

[0139] Where P m is the adaptive mutation probability; K 3 and K 4 are all constants in the interval (0, 1);

[0140] 6. Determine the value of the fitness function;

[0141] After completing step 5, jump to step 3, recalculate the fitness function value and make a judgment, and then continue the loop solution.

[0142] 7. Determine whether the number of iterations has been reached. If it has not yet reached the maximum number of iterations, return to step 4; if it has reached the maximum number of iterations, terminate the algorithm and output the site selection plan and the number of households at each connecting station.

[0143] Step S3: Second stage of inter-trip commuting: the school bus takes the students at the inter-trip station to school. Based on the number of students at each inter-trip station obtained in step S2, the minimum operating cost of the school bus is used as the objective function of the school bus route planning model and solved using an intelligent optimization algorithm.

[0144] Furthermore, the operating costs of school buses specifically include:

[0145] 1) School bus travel time

[0146] Without considering the changes in road traffic conditions, assume that the average speed of all school buses is v b , according to the distance d between the connecting station j and the connecting station j′ jj' and the average speed of the school bus v b Calculated

[0147] 2) School bus stop service time at connecting stations

[0148] When the school bus arrives at the student waiting station and the school station, the student boarding and alighting stop time cost is generated. The stop service time after the school bus arrives at the station j is The number of students getting on or off at the connecting station n mj The cost of the boarding service is The drop-off service time is

[0149] The objective function of the school bus route planning model specifically includes:

[0150] School bus travel time The stop service time of the school bus at the connecting station

[0151] The objective function of the school bus route planning model is:

[0152]

[0153] Constraints:

[0154]

[0155]

[0156]

[0157]

[0158]

[0159]

[0160]

[0161]

[0162] Condition (3) requires that each connecting station must be visited by a school bus and must be visited at least once. Condition (4) requires that the school bus that visits the student connecting station must leave. Condition (5) requires that the school bus cannot be overloaded after visiting the student connecting station. Condition (6) represents the change in the number of people loaded on the school bus at consecutive connecting stations in the school bus route. Similarly, condition (7) represents the relationship between the travel time of the school bus at consecutive stations in the school bus route. Condition (8) indicates that there are no students when the school bus departs from the school. Condition (9) requires that the student's ride time does not exceed the maximum ride time T. max,Condition (10) ensures that all students are picked up;

[0163] The meanings of the symbols in the above formula are as follows:

[0164] The travel time of the school bus from the connecting station j to the connecting station j′;

[0165] y mjj′ : If school bus m goes from connecting station j to connecting station j′, y mjj′ =1, otherwise 0;

[0166] The stop service time of school bus m at connecting station j;

[0167] The stop service time of school bus m at the connecting station j′;

[0168] L mj : The number of people on board school bus m after visiting connecting station j;

[0169] L mj′ : The number of people on board school bus m after it visits connecting station j′;

[0170] L m0 : The number of students connected to school 0 by school bus m;

[0171] Q: The number of people that a school bus can carry;

[0172] n mj : The number of students picked up by school bus m at the connecting station j;

[0173] n mj′ : The number of students picked up by school bus m at the connecting station j′;

[0174] Z mj : The time when school bus m arrives at the connecting station j;

[0175] Z mj′ : The time when school bus m arrives at the connecting station j';

[0176] N j : The number of students at the connecting station j;

[0177] T max : Maximum riding time for students.

[0178] In order to reduce the complexity of solving step S3, the route planning problem of multiple school buses is grouped before using the intelligent optimization algorithm to solve it. Each group can be converted into a separate TSP route optimization problem. The grouping process is as follows:

[0179] With the school as the center of the area circle, the initial position of the ray starting from the school does not intersect with any connecting station position. Move counterclockwise to connecting station I to determine whether the number of people exceeds the rated passenger capacity of the school bus. If not, all the students at the connecting station will be served by the bus, and the number of people on the bus will be accumulated to find the next connecting station II, and so on, until the connecting station III exceeds the rated passenger capacity of the school bus. The student demand at connecting station III is split. The fan-shaped areas formed at this time are grouped together, and the remaining number of students at connecting station III is calculated and divided into the next area, and so on, until all connecting stations are divided.

[0180] Furthermore, the intelligent optimization algorithm used to solve the objective function of the school bus route planning model is the ant colony algorithm. The specific process is as follows:

[0181] 1. Use the ant colony algorithm to find the optimal school bus route plan for each group.

[0182] 1.1 Initialization parameters;

[0183] Read the joint site data of each partition and set the initial parameters: number of ants e, number of iterations, pheromone factor α, heuristic function factor β, pheromone constant Q * , pheromone volatility factor ρ * .

[0184] 1.2 Construct solution space;

[0185] Assume that the ant leaves the school, that is, the initial point of the ant is defined as 0. For each ant w (w = 1, 2, ..., e), the following probability transfer formula is obtained according to the roulette method to calculate its next connecting station to be visited. The ant is transferred to the selected connecting station, and the reselected point is added to the taboo table and route record table until all nodes in the taboo table are visited, and the current path length is obtained.

[0186] The transition probability formula is

[0187]

[0188] in, represents the transfer probability of ant w at the connecting site j and the connecting site j′ at time t, represents the concentration of pheromone remaining on the line between the connecting station j and the connecting station j′ at time t. At the initial moment, the amount of information on each line is the same, and (C is a constant), α represents the pheromone factor, β represents the heuristic function factor, η jj′ represents the expected value of the ant from the connecting site j to the connecting site j′, allow w Indicates the path that ant e has not yet taken (the path that has been taken is stored in the taboo table).

[0189] For example, suppose there are 5 joint sites, starting from school 0 and then to joint site 3, assuming that pheromone and η jj′ The information is shown in the following table:

[0190]

[0191] The first step in determining the next site is to construct an array taueta, Assuming α is 3 and β is 2, calculate all taueta values ​​(sites 0 and 3 are already in the path and do not need to be calculated) as shown in the following table:

[0192] [0] [1] [2] [3] [4] / 7.81 64 / 10.45

[0193] Sum the taueta values ​​to get sum = 82.26, then divide the sum by each taueta value to get the probability of each site being selected and store it in the array probs:

[0194] [0] [1] [2] [3] [4] 0.00 0.09 0.78 0.00 0.13

[0195] Construct the array cumul to store the cumulative sum:

[0196] [0] [1] [2] [3] [4] [5] 0.00 0·00 0·09 0·87 0·87 i·00

[0197] Generate a random number p* between 0.0-1.0, and assume p*=0.538, which is between [2][3] in the cumul array, then site 2 is selected as the next site.

[0198] Repeat the above process for the initial set of e ants to complete the optimization process. Compare the iterative optimization results of the e ants and record the optimal running route.

[0199] 1.3 Update pheromones;

[0200] According to the pheromone update rules, the pheromones are updated and the taboo table and the plan record table are cleared.

[0201] During the iteration process, the pheromones on all paths in the problem space will change. One part is the evaporation of pheromones, and the other part is the pheromones left by each ant passing from j to j′. The update formula of pheromone concentration in the ant system is:

[0202]

[0203] In the formula, represents the pheromone after completing r cycles, r represents the number of connecting stations on the route, ρ * It is a pheromone volatile factor. It represents the total amount of pheromones left by ants from all paths j to j′ after a trip (traversing all cities), that is:

[0204]

[0205] In the formula, represents the amount of pheromone left by the w-th ant on the path from j to j′. If the w-th ant passes through the path from j to j′, then:

[0206]

[0207] In the formula, Q * is the pheromone constant, L w is the total length of the path that the ants have walked. Otherwise, the pheromone left by the wth ant on the path from j to j′ is 0.

[0208] The operating cost of school buses is the core issue that affects the optimization of school bus routes. Improving the pheromone update operator can more effectively select the best route. Combined with the objective function of the school bus route planning model, the linear equation of the time weight model is established:

[0209]

[0210] In the formula, ω jj′ is the time weight from connecting station j to connecting station j′; is the travel time of the school bus from the connecting station j to the connecting station j′; It means that at time t, the school bus travels between the connecting station j and the connecting station j′. When the condition is met The value of is 1, otherwise it is 0; θ represents the weighting coefficient of the time value.

[0211] Introducing the time function f(t) between sites, after completing a cycle, the pheromone update operator is as follows:

[0212]

[0213]

[0214] For the school bus, improving the pheromone update operator will increase the pheromone content of the path with the least time consumption, which will guide more ants to choose it.

[0215] 1.4 Determine whether the number of iterations has been reached. If it has not yet reached the maximum number of iterations, return to 1.2; if it has reached the maximum number of iterations, terminate the algorithm;

[0216] One iteration means that e ants have walked through all sites, that is, there are e search paths. Compare all paths, select the shortest path, make a visualization of this iteration, and update the pheromone. Compare the current shortest path with the previous shortest path, and increase the number of iterations by 1. Then determine whether the current number of iterations is equal to the set number of iterations. If it is equal, stop the iteration, otherwise proceed to the next iteration.

[0217] 2. Repeat step 1 until all groups have completed path optimization.

[0218] The second stage algorithm flow chart of the embodiment of the present invention is as follows: Figure 2 shown.

[0219] The two-stage inter-trip commuting method for primary and secondary schools considering parking sharing is applied to a school in Changchun. The distribution of relevant home addresses, inter-trip stations, and workplaces is as follows: Figure 3 As shown, set the parameters as follows according to the actual situation:

[0220]

[0221] In an embodiment of the present invention, the number of students at the connecting station calculated according to step S2 is shown in the following table:

[0222]

[0223] Based on the number of students at the connecting station obtained in step S2, the school bus route plan of the embodiment is obtained in step S3 as follows:

[0224]

[0225] The schematic diagram of the school bus route obtained by the embodiment of the present invention is as follows Figure 4 shown.

[0226] Step S4: Calculate the two-stage connecting commuting travel cost and the private car commuting travel cost.

[0227] The two-stage connecting commuting travel cost and the private car commuting travel cost of the embodiment of the present invention are shown in the following table:

[0228]

[0229] The specific embodiments described above further illustrate the objectives, technical solutions and beneficial effects of the present invention in detail. It should be understood that the above description is only a specific embodiment of the present invention and is not intended to limit the present invention. Any modifications, equivalent substitutions, improvements, etc. made within the spirit and principles of the present invention should be included in the protection scope of the present invention.

Claims

1. A two-stage inter-trip commuting method for primary and secondary schools considering parking sharing, characterized in that: The following steps are involved: Step S1: construct multiple sets, including a family set A, a home address set H, a connecting station set P, a work location set D, and a school bus set M; Step S2: The first stage of interline commuting is that parents use private cars to send students to interline stations, and then go to work or return to home addresses after sending them to the interline stations. The minimum travel cost of private cars is used as the objective function of the interline station location selection model, and the genetic algorithm is used to solve it to obtain the interline stations selected by each family and the number of students to be picked up at each interline station. Step S3: The second stage of the inter-trip commuting trip is that the school bus sends students at the inter-trip station to school. Based on the number of students at each inter-trip station obtained in step S2, the minimum operating cost of the school bus is used as the objective function of the school bus route planning model, and the ant colony algorithm is used to solve it; Step S4: Calculate the two-stage connecting commuting travel cost and the private car commuting travel cost, and thus complete the connecting commuting travel.

2. The two-stage inter-city commuting method for primary and secondary schools considering parking sharing according to claim 1 is characterized by: The connecting site set P in step S1 includes the school and the school is represented by 0, and the set of connecting sites other than the school is P + .

3. The two-stage inter-city commuting travel method for primary and secondary schools considering parking sharing according to claim 1 is characterized by: The private car travel cost in step S2 specifically includes: 1) Travel time during the school commute 2) Stop time at connecting stations 3) Travel costs to the workplace 4) Driving cost on the way home 4. The two-stage inter-city commuting method for primary and secondary schools considering parking sharing according to claim 3 is characterized by: The M / M / S / ∞ queuing model is introduced to calculate the stop time at the connecting station.

5. The two-stage inter-city commuting method for primary and secondary schools considering parking sharing according to claim 4 is characterized by: The objective function of the inter-city station location selection model in step S2 specifically includes: Travel time of private cars during the school commute Driving time to return home Travel time of private cars on the way to the workplace Stop times at connecting stations The objective function of the joint site location model is: The constraints are: Condition (1) requires that each family a must and can only choose one connecting station; Condition (2) ensures that family a can choose to go to work or go home after going to the connecting station; The meanings of the symbols in the above formula are as follows: The travel time of household a from home address i to connecting station j; The travel time of household a from connecting station j to home address i; The travel time of household a from connecting station j to workplace k; The stop time of family a at connecting station j; X aijk :If family a travels from home address i to connecting station j and then to work location k, X aijk =1, otherwise 0; X aiji :If family a goes from home address i to connecting station j and then returns to home address i, X aiji =1, otherwise 0; xaij: If family a travels from home address i to connecting station j, x aij =1, otherwise 0.

6. The two-stage inter-city commuting travel method for primary and secondary schools considering parking sharing according to claim 5 is characterized by: The operating costs of the school bus in step S3 specifically include: 1) School bus travel time 2) School bus stop service time at connecting stations 7. The two-stage inter-city commuting method for primary and secondary schools considering parking sharing according to claim 6 is characterized by: The objective function of the school bus route planning model in step S3 specifically includes: School bus travel time The stop service time of the school bus at the connecting station The objective function of the school bus route planning model is: Constraints: Condition (3) requires that each connecting station must be visited by a school bus and must be visited at least once. Condition (4) requires that the school bus that visits the student connecting station must leave. Condition (5) requires that the school bus cannot be overloaded after visiting the student connecting station. Condition (6) represents the change in the number of people loaded on the school bus at consecutive connecting stations in the school bus route. Similarly, condition (7) represents the relationship between the travel time of the school bus at consecutive stations in the school bus route. Condition (8) indicates that there are no students when the school bus departs from the school. Condition (9) requires that the student's ride time does not exceed the maximum ride time T. max ,Condition (10) ensures that all students are picked up; The meanings of the symbols in the above formula are as follows: The travel time of the school bus from the connecting station j to the connecting station j′; y mjj′ : If school bus m goes from connecting station j to connecting station j′, y mjj′ =1, otherwise 0; The stop service time of school bus m at connecting station j; The stop service time of school bus m at the connecting station j′; L mj : The number of people on board school bus m after visiting connecting station j; L mj′ : The number of people on board school bus m after it visits connecting station j′; L m0 : The number of students whose school bus m visits the connecting stop at school 0; Q: The maximum number of people that a school bus can carry; n mj : The number of students picked up by school bus m at the connecting station j; n mj′ : The number of students picked up by school bus m at the connecting station j′; Z mj : The time when school bus m arrives at the connecting station j; Z mj′ : The time when school bus m arrives at the connecting station j′; N j : The number of students at the connecting station j; T max : Maximum riding time for students.

8. The two-stage inter-city commuting method for primary and secondary schools considering parking sharing according to claim 1 is characterized by: Before using the ant colony algorithm for solving the problem, the connecting stations are grouped. The specific grouping process is as follows: take the school as the center of the area circle, and the initial position of the ray starting from the school does not intersect with any connecting station position. Move counterclockwise to connecting station I to determine whether the number of people exceeds the rated passenger capacity of the school bus. If not, all the students at the connecting station will be served by the bus, and the number of people on the bus will be accumulated to find the next connecting station II, and so on, until the connecting station III exceeds the rated passenger capacity of the school bus. The student demand at the connecting station III is split. The fan-shaped area formed at this time is a group, and the remaining number of students at the connecting station III is calculated and divided into the next area, and so on, until all connecting stations are divided.