CN109409611B - Bus transfer optimization method - Google Patents

Abstract

The invention discloses a bus transfer optimization method, which comprises the following steps: 1. establishing a bus station set, a bus line and a bus set; 2. obtaining transfer information of passengers; 3. obtaining information of the bus participating in transfer optimization and information of transfer of passengers on the bus; 4. different arrangement and combination are carried out on the buses participating in the transfer optimization to obtain the optimal bus arrival sequence; 5. and processing the optimal bus arrival sequence, and scheduling the buses by the bus station so that the buses can arrive in the sequence. The invention can lead the buses participating in the transfer to enter the station according to the optimal sequence through the optimal arrangement of the bus-entering sequence participating in the optimization of the bus transfer, thereby leading the passengers needing to be transferred on the buses to participate in the transfer in time to the greatest extent and saving the time for waiting for the transfer when the passengers go out.

Description

Bus transfer optimization method

Technical Field

The invention belongs to the field of bus transfer optimization, and particularly relates to a bus transfer optimization method.

Background

With the advance of urbanization process, the increase of urban population faces increasingly severe traffic retardation phenomenon, and the rising of oil price, high-efficiency and low-cost public transportation becomes the appeal and desire of most city-saving citizens. According to investigation, most passengers have at least one transfer when taking the bus, so that a large number of passengers need to transfer, but the existing bus transfer has no measures for the order of entering the bus, and two buses possibly leave the bus around the bus station, so that the passengers on the back bus can not transfer the passengers on the front bus, thereby leading a plurality of passengers not to participate in the transfer in time and prolonging the travel time. Meanwhile, the existing bus station only displays the distance between the bus and the bus station and also displays the condition that whether the bus enters the station simultaneously or not, so that transfer passengers do not know the information of the bus entering the station and transfer, and great troubles are generated for the transfer of the passengers.

Disclosure of Invention

The invention aims to solve the defects in the prior art, and provides a bus transfer optimization method, so that buses can enter the bus in sequence according to the passenger transfer requirement by optimizing the arrangement of the bus entering sequence, the number of the passengers participating in the transfer is increased, the passengers participating in the transfer can participate in the transfer in time, and the travel time is further saved.

The invention adopts the following technical scheme for solving the technical problems:

the invention discloses a bus transfer optimization method which is characterized by comprising the following steps:

step 1, assuming that N bus stops and K bus lines exist in a road network environment, and recording a bus stop set formed by the N bus stops as S ═ S₁,s₂,…,s_n,…,s_N}，s_nRepresents the nth bus stop, N is 1,2, …, N; and recording a bus line set formed by the K bus lines as J ═ J₁,j₂,…,j_k,…,j_K}，j_kRepresents the kth bus line, K is 1,2, …, K; order the kth bus line j_kThe bus set formed by all the buses is j_k＝{j_k(1),j_k(2),…,j_k(m),…j_k(M)}；j_k(m) represents the kth bus line j_kThe mth bus; m is 1,2, …, M;

step 2, setting the starting time of transfer optimization of N bus stations as t₀(ii) a Let the c-th acquisition cycle of the transfer information of the N bus stations be T_cLet t_c＝t₀+T_cRepresenting the current time, and initializing c to be 1;

step 3, orderingC acquisition period T_cInner kth bus line j_kM bus j on_k(m) total number of passengers R (j)_k(m))；

Step 4, ordering the c-th acquisition period T_cInner kth bus line j_kM bus j on_k(m) the current passenger is the r-th passenger, and initializing k as 1;

step 5, initializing m to be 1;

step 6, initializing r to be 1;

step 7, ordering the c-th acquisition period T_cInner kth bus line j_kM bus j on_k(m) transfer information of all passengers is w_c(j_k(m),j_k',s_n) Is shown in the c-th acquisition period T_cInner kth bus line j_kM bus j on_k(m) at the nth bus stop s_nTransfer the k' th bus line j_k'K '≠ K, K' ═ 1,2, …, K and initializes w_c(j_k(m),j_k',s_n)＝0；

Step 8, in the c acquisition period T_cK-th bus line j for internally collecting passengers to take_kM bus j on_k(m) the kth 'bus line j as the information of the r-th passenger's bus and the transfer required by the r-th passenger_k'As transfer route information of the r-th passenger and the n-th bus stop s where the r-th passenger is transferred_nAs transfer station information of the r-th passenger; thereby obtaining the c-th acquisition period T_cThe transfer information of the r-th passenger is recorded as

Indicating the r-th passenger in the c-th acquisition period T_cTake the kth bus line j in_kM bus j on_k(m) at the nth bus stop s_nTransfer the k' th bus line j_k'If, if

Is shown asr passengers do not need to transfer, if

Indicating that the r-th passenger needs a transfer;

step 10, judgment

If true, let w_c(j_k(m),j_k',s_n) +1 assignment to w_c(j_k(m),j_k',s_n) Then step 11 is executed; otherwise, directly executing step 11;

step 11, after R +1 is assigned to R, R is judged to be more than R (j)_k(m)) and if so, indicating that the c-th acquisition period T is obtained_cInner kth bus line j_kM bus j on_k(m) transfer information w of all passengers_c(j_k(m),j_k',s_n)；

Step 12, after M +1 is assigned to M, judging whether M is greater than M, if not, executing step 6, otherwise, executing step 13;

step 13, after K +1 is assigned to K, judging whether K is greater than K or not, if not, executing step 5, and if so, acquiring transfer information { w ] of all passengers on all buses_c(j_k(m),j_k',s_n)|k＝1,2,…K；m＝1,2,…,M}；

Step 14, transfer information of all passengers on all buses { w_c(j_k(m),j_k',s_n) 1,2, … K; m is 1,2, …, M is respectively transmitted to the bus station where the passenger needs to transfer;

step 15, after c +1 is assigned to c, at t_c+1Acquiring a bus within a certain range from a bus station at a moment as t_c+1The buses participating in the transfer optimization at all times are recorded as

Is shown at t_c+1Time k_fBus line

M of (3)_fA bus; { k } is a function of₁,k₂,…,k_f,…,k_F}∈{1,2,…,K}；{m₁,m₂,…,m_f,…,m_FE.g. {1,2, …, M }; the information of the passengers participating in the bus transfer is given as

Step 16, order

For the nth bus stop s_nAt t_c+1The number of all buses participating in transfer optimization at any moment;

let alpha_nFor the nth bus stop s_nThe maximum number of buses that can be accommodated simultaneously;

order to

For the nth bus stop s_nAt t_c+1The number of queues arranged by buses at the moment is the same

Buses in a fleet arrangement;

let beta_yIs composed of

Buses in any y-th queue in the queues;

order to

Is shown at t_c+1Ride kth in time_fBus barLine

M of (3)_fBus with a movable rail

Passenger can be at the nth bus station s_nTransfer m'_fBus line

M 'of'_fBus with a movable rail

Order to

Is shown at t_c+1Ride kth in time_fBus line

M of (3)_fBus with a movable rail

Passenger on can't be at the nth bus stop s_nTransfer m'_fBus line

M 'of'_fBus with a movable rail

To be provided with

As the number of rows of the permutation combination, in α_nAs the number of rows of permutation and combination, for the nth bus stop s_nAll buses participating in transfer optimization

Are arranged and combined to obtain

Participating in different arrangement and combination forms of all buses for transfer optimization; wherein any u-th permutation and combination form is marked as X_u(ii) a Wherein, if the u permutation and combination type X_uIn the y-th row of (A) has the k-th_fBus line

M of (3)_fBus with a movable rail

And m'_fBus line

M 'of'_fBus with a movable rail

I.e. m_fBus with a movable rail

And m'_fBus with a movable rail

Are all arranged in the y-th queue; then order

Respectively represent the m-th_fBus with a movable rail

And m'_fBus with a movable rail

Enter the nth bus station s simultaneously_nAnd can be mutually transferred;

if the u-th permutation and combination type X_uIn the y-th row of_fBus line

M of (3)_fBus with a movable rail

If m 'exists in any line after the y line'_fBus with a movable rail

Then order

Respectively represent the u-th permutation and combination form X_uM in_fBus with a movable rail

Can be converted to m'_fBus with a movable rail

M'_fBus with a movable rail

Passengers of bus can not change m_fBus with a movable rail

Step 17, making the optimization target to be

For the optimization target

Corresponding to when taking the maximum valueThe arrangement and combination form is that all buses participating in transfer optimization

In that

The arrangement sequence in the queue, so that all buses which are scheduled to participate in transfer optimization enter the nth bus station s according to the corresponding arrangement sequence_n。

Compared with the prior art, the invention has the beneficial effects that:

1. according to the invention, by the bus transfer optimization method, the bus arrival sequence is optimized and arranged, so that the buses enter the bus station in sequence, and therefore, passengers needing to be transferred on the buses can participate in the transfer to the maximum extent in time, and the uncontrollable situation that the passengers needing to be transferred participate in the transfer due to the random arrival of the existing buses is solved.

2. According to the invention, different optimal arrangements are carried out on the bus arrival sequence by using the arrangement and combination method, and the optimal bus arrival sequence is selected from the bus arrival transfer conditions in all different arrangement and combination modes, so that the number of the passengers participating in the transfer is increased, the passengers participating in the transfer can participate in the transfer in time, and the travel time is saved.

3. The invention fully considers the maximum number of the buses which can be accommodated in the bus station when the bus arrival sequence is optimally arranged, and the buses can simultaneously enter the station when entering the station through dispatching, so that partial passengers can transfer at the same station in the bus station, the utilization efficiency of the bus station is improved, and the transfer of the passengers is facilitated.

Drawings

FIG. 1 is a flow chart of the present invention;

FIG. 2 is a list of the number of passengers in an example of the present invention participating in an optimized bus transfer to another bus;

FIG. 3 is a diagram illustrating an optimized forward and backward bus arrival sequence for the transfer of buses with a maximum number of two at a bus stop according to an embodiment of the present invention;

fig. 4 is a diagram showing the bus arrival sequence and the time schedule on the bus station platform information display panel according to the embodiment of the invention.

Detailed Description

In this embodiment, as shown in fig. 1, a bus transfer optimization method is applicable to the bus arrival problem in any city, and is performed according to the following steps:

step 1, assuming that N bus stops and K bus lines exist in a road network environment, and recording a bus stop set consisting of the N bus stops as S ═ S₁,s₂,…,s_n,…,s_N}，s_nRepresents the nth bus stop, N is 1,2, …, N; let the bus line set composed of K bus lines be recorded as J ═ J₁,j₂,…,j_k,…,j_K}，j_kRepresents the kth bus line, K is 1,2, …, K; let the kth bus line j_kThe bus set formed by all the buses is j_k＝{j_k(1),j_k(2),…,j_k(m),…j_k(M)}；j_k(m) represents the kth bus line j_kThe mth bus; m is 1,2, …, M; therefore, the buses, the bus stations and the bus lines in the road network are defined and expressed respectively, the data sets of the buses, the bus lines and the buses in all lines are set simultaneously, and the maximum bus station number, the maximum bus line number and the maximum bus number on each bus line are set.

Step 2, setting the starting time of transfer optimization of N bus stations as t₀(ii) a Let the c-th acquisition cycle of the transfer information of the N bus stations be T_cLet t_c＝t₀+T_cRepresenting the current time, and initializing c to be 1;

step 3, enabling the acquisition period to be the c-th acquisition period T_cInner kth bus line j_kM bus j on_k(m) total number of passengers R (j)_k(m))；

Step 4, ordering the c-th acquisition period T_cInner kth bus line j_kM bus j on_k(m) the current passenger is the r-th passenger, and initializing k as 1;

step 5, initializing m to be 1;

step 6, initializing r to be 1;

step 7, ordering the c-th acquisition period T_cInner kth bus line j_kM bus j on_k(m) transfer information of all passengers is w_c(j_k(m),j_k',s_n) Is shown in the c-th acquisition period T_cInner kth bus line j_kM bus j on_k(m) at the nth bus stop s_nTransfer the k' th bus line j_k'K '≠ K, K' ═ 1,2, …, K and initializes w_c(j_k(m),j_k',s_n) 0; defining passenger and bus transfer information and initializing the number of passengers transferred by each bus.

Step 8, in the c acquisition period T_cK-th bus line j for internally collecting passengers to take_kM bus j on_k(m) the kth 'bus line j as the information of the r-th passenger's bus and the transfer required by the r-th passenger_k'As transfer route information of the r-th passenger and the n-th bus stop s where the r-th passenger is transferred_nAs transfer station information of the r-th passenger; thereby obtaining the c-th acquisition period T_cThe transfer information of the r-th passenger is recorded as

Indicating the r-th passenger in the c-th acquisition period T_cTake the kth bus line j in_kM bus j on_k(m) at the nth bus stop s_nTransfer the k' th bus line j_k'If, if

Indicating that the r-th passenger does not need to transfer, if

Indicating that the r-th passenger needs a transfer;

step 10, judgment

If true, let w_c(j_k(m),j_k',s_n) +1 assignment to w_c(j_k(m),j_k',s_n) Then step 11 is executed; otherwise, directly executing step 11; (ii) a

Step 11, after R +1 is assigned to R, R is judged to be more than R (j)_k(m)) and if so, indicating that the c-th acquisition period T is obtained_cInner kth bus line j_kM bus j on_k(m) transfer information w of all passengers_c(j_k(m),j_k',s_n) (ii) a Each passenger transfer information is traversed.

Step 12, after M +1 is assigned to M, judging whether M is greater than M, if not, executing step 6, otherwise, executing step 13; each bus is traversed.

Step 13, after K +1 is assigned to K, judging whether K is greater than K or not, if not, executing step 5, and if so, acquiring transfer information { w ] of all passengers on all buses_c(j_k(m),j_k',s_n) 1,2, … K; m ═ 1,2, …, M }; and traversing each bus line.

Step 14, transfer information of all passengers on all buses { w_c(j_k(m),j_k',s_n) 1,2, … K; m is 1,2, …, M is respectively transmitted to the bus station where the passenger needs to transfer;

step 15, after c +1 is assigned to c, at t_c+1Acquiring a bus within a certain range from a bus station at a moment as t_c+1The buses participating in the transfer optimization at all times are recorded as

Is shown at t_c+1Time k_fBus line

M of (3)_fA bus; { k } is a function of₁,k₂,…,k_f,…,k_F}∈{1,2,…,K}；{m₁,m₂,…,m_f,…,m_FE.g. {1,2, …, M }; the information of the passengers participating in the bus transfer is given as

The information of the passengers who participate in the transfer optimization order of arrival is selected from the information of all the passengers who participate in the transfer, and as shown in fig. 2, each list represents the number of the passengers who participate in the transfer of the buses on other bus lines.

Step 16, order

For the nth bus stop s_nAt t_c+1The number of all buses participating in transfer optimization at any moment; and determining the number of buses participating in the transfer according to the selected buses participating in the transfer optimization station entering sequence.

Let alpha_nFor the nth bus stop s_nThe maximum number of buses that can be accommodated simultaneously; and determining the maximum number of the buses capable of being accommodated according to the actual conditions of the bus station platforms.

Order to

For the nth bus stop s_nAt t_c+1The number of queues arranged by buses at the moment is the same

Buses in a fleet arrangement; and determining the number of the bus arrangement queues.

Let beta_yIs composed of

Buses in any y-th queue in the queues;

order to

Is shown at t_c+1Ride kth in time_fBus line

M of (3)_fBus with a movable rail

Passenger can be at the nth bus station s_nTransfer m'_fBus line

M 'of'_fBus with a movable rail

Order to

Is shown at t_c+1Ride kth in time_fBus line

M of (3)_fBus with a movable rail

Passenger on can't be at the nth bus stop s_nTransfer m'_fBus line

M 'of'_fBus with a movable rail

And establishing a bus passenger transfer information rule.

To be provided with

As the number of rows of the permutation combination, in α_nAs the number of rows of permutation and combination, for the nth bus stop s_nAll buses participating in transfer optimization

Are arranged and combined to obtain

Participating in different arrangement and combination forms of all buses for transfer optimization; wherein any u-th permutation and combination form is marked as X_u(ii) a Wherein, if the u permutation and combination type X_uIn the y-th row of (A) has the k-th_fBus line

M of (3)_fBus with a movable rail

And m'_fBus line

M 'of'_fBus with a movable rail

I.e. m_fBus with a movable rail

And m'_fBus with a movable rail

Are all arranged in the y-th queue; then order

Respectively represent the m-th_fBus with a movable rail

And m'_fBus with a movable rail

Enter the nth bus station s simultaneously_nAnd can be mutually transferred; and determining rules for transferring passengers to other buses on the buses in the permutation and combination.

If the u-th permutation and combination type X_uIn the y-th row of_fBus line

M of (3)_fBus with a movable rail

If m 'exists in any line after the y line'_fBus with a movable rail

Then order

Respectively represent the u-th permutation and combination form X_uM in_fBus with a movable rail

Can be converted to m'_fBus with a movable rail

M'_fBus with a movable rail

Passengers of bus can not change m_fBus with a movable rail

To illustrate a certain arrangement combinationAll the transfer passenger information in the formula represents the situation.

Step 17, making the optimization target to be

For optimization target

Taking the corresponding permutation and combination form when the maximum value is taken, namely all buses participating in transfer optimization

In that

The arrangement sequence in the queue, so that all buses which are scheduled to participate in transfer optimization enter the nth bus station s according to the corresponding arrangement sequence_n. And traversing each permutation and combination form, and enabling the bus arrival permutation and combination form with the largest number of passengers participating in the transfer to optimize the optimal arrival sequence for the bus, as shown in fig. 3, showing the bus arrival sequence before the transfer optimization and the bus arrival sequence after the transfer optimization. And the arrival sequence information is displayed on a platform information display panel of the transfer bus, as shown in fig. 4, the platform information display panel displays the bus arrival sequence and the bus information of the same arrival station at a distance from the station, and the distance from the bus station when the bus distance from the station is not optimized, and the bus arrival sequence and the bus information of the same arrival station at a plurality of stations, and the bus arrival sequence and the bus information also comprise the bus route information of the traditional bus display panel.

Claims (1)

1. A bus transfer optimization method is characterized by comprising the following steps:

step 1, assuming that N bus stops and K bus lines exist in a road network environment, and recording a bus stop set formed by the N bus stops as S ═ S₁,s₂,…,s_n,…,s_N}，s_nRepresents the nth bus stop, N is 1,2, …, N; and recording a bus line set formed by the K bus lines as J ═ J₁,j₂,…,j_k,…,j_K}，j_kRepresents the kth bus line, K is 1,2, …, K; order the kth bus line j_kThe bus set formed by all the buses is j_k＝{j_k(1),j_k(2),…,j_k(m),…j_k(M)}；j_k(m) represents the kth bus line j_kThe mth bus; m is 1,2, …, M;

step 2, setting the starting time of transfer optimization of N bus stations as t₀(ii) a Let the c-th acquisition cycle of the transfer information of the N bus stations be T_cLet t_c＝t₀+T_cRepresenting the current time, and initializing c to be 1;

step 3, enabling the acquisition period to be the c-th acquisition period T_cInner kth bus line j_kM bus j on_k(m) total number of passengers R (j)_k(m))；

Step 4, ordering the c-th acquisition period T_cInner kth bus line j_kM bus j on_k(m) the current passenger is the r-th passenger, and initializing k as 1;

step 5, initializing m to be 1;

step 6, initializing r to be 1;

step 7, ordering the c-th acquisition period T_cInner kth bus line j_kM bus j on_k(m) transfer information of all passengers is w_c(j_k(m),j_k',s_n) Is shown in the c-th acquisition period T_cInner kth bus line j_kM bus j on_k(m) at the nth bus stop s_nTransfer the k' th bus line j_k'K '≠ K, K' ═ 1,2, …, K and initializes w_c(j_k(m),j_k',s_n)＝0；

Step 8, in the c acquisition period T_cK-th bus line j for internally collecting passengers to take_kM bus j on_k(m) the kth 'bus line j as the information of the r-th passenger's bus and the transfer required by the r-th passenger_k'As a replacement for the r-th passengerInformation on the route of the transfer and the nth bus stop s at which the r-th passenger is transferred_nAs transfer station information of the r-th passenger; thereby obtaining the c-th acquisition period T_cThe transfer information of the r-th passenger is recorded as

Indicating the r-th passenger in the c-th acquisition period T_cTake the kth bus line j in_kM bus j on_k(m) at the nth bus stop s_nTransfer the k' th bus line j_k'If, if

Indicating that the r-th passenger does not need to transfer, if

Indicating that the r-th passenger needs a transfer;

step 10, judgment

If true, let w_c(j_k(m),j_k',s_n) +1 assignment to w_c(j_k(m),j_k',s_n) Then step 11 is executed; otherwise, directly executing step 11;

step 11, after R +1 is assigned to R, R is judged to be more than R (j)_k(m)) and if so, indicating that the c-th acquisition period T is obtained_cInner kth bus line j_kM bus j on_k(m) transfer information w of all passengers_c(j_k(m),j_k',s_n)；

Step 12, after M +1 is assigned to M, judging whether M is greater than M, if not, executing step 6, otherwise, executing step 13;

step 13, after K +1 is assigned to K, judging whether K is greater than K or not, if not, executing step 5, and if so, acquiring transfer information { w ] of all passengers on all buses_c(j_k(m),j_k',s_n)|k＝1,2,…K；m＝1,2,…,M}；

Step 14, transfer information of all passengers on all buses { w_c(j_k(m),j_k',s_n) 1,2, … K; m is 1,2, …, M is respectively transmitted to the bus station where the passenger needs to transfer;

step 15, after c +1 is assigned to c, at t_c+1Acquiring a bus within a certain range from a bus station at a moment as t_c+1The buses participating in the transfer optimization at all times are recorded as

Is shown at t_c+1Time k_fBus line

M of (3)_fA bus; { k } is a function of₁,k₂,…,k_f,…,k_F}∈{1,2,…,K}；{m₁,m₂,…,m_f,…,m_FE.g. {1,2, …, M }; the information of the passengers participating in the bus transfer is given as

Step 16, order

For the nth bus stop s_nAt t_c+1The number of all buses participating in transfer optimization at any moment;

let alpha_nFor the nth bus stop s_nThe maximum number of buses that can be accommodated simultaneously;

order to

For the nth bus stop s_nAt t_c+1The number of queues arranged by buses at the moment is the same

Buses in a fleet arrangement;

let beta_yIs composed of

Buses in any y-th queue in the queues;

order to

Is shown at t_c+1Ride kth in time_fBus line

M of (3)_fBus with a movable rail

Passenger can be at the nth bus station s_nTransfer m'_fBus line

M 'of'_fBus with a movable rail

Order to

Is shown at t_c+1Ride kth in time_fBus line

M of (3)_fBus with a movable rail

Passenger on can't be at the nth bus stop s_nTransfer m'_fBus line

M 'of'_fBus with a movable rail

To be provided with

As the number of rows of the permutation combination, in α_nAs the number of rows of permutation and combination, for the nth bus stop s_nAll buses participating in transfer optimization

Are arranged and combined to obtain

Participating in different arrangement and combination forms of all buses for transfer optimization; wherein any u-th permutation and combination form is marked as X_u(ii) a Wherein, if the u permutation and combination type X_uIn the y-th row of (A) has the k-th_fBus line

M of (3)_fBus with a movable rail

And m'_fBus line

M 'of'_fBus with a movable rail

I.e. m_fBus with a movable rail

And m'_fBus with a movable rail

Are all arranged in the y-th queue; then order

Respectively represent the m-th_fBus with a movable rail

And m'_fBus with a movable rail

Enter the nth bus station s simultaneously_nAnd can be mutually transferred;

if the u-th permutation and combination type X_uIn the y-th row of_fBus line

M of (3)_fBus with a movable rail

If m 'exists in any line after the y line'_fBus with a movable rail

Then order

Respectively represent the u-th permutation and combination form X_uM in_fBus with a movable rail

Can be converted to m'_fBus with a movable rail

M'_fBus with a movable rail

Passengers of bus can not change m_fBus with a movable rail

Step 17, making the optimization target to be

For the optimization target

Taking the corresponding permutation and combination form when the maximum value is taken, namely all buses participating in transfer optimization

In that

The arrangement sequence in the queue, so that all buses which are scheduled to participate in transfer optimization enter the nth bus station s according to the corresponding arrangement sequence_n。

Images