CN114912797B

CN114912797B - Method, device, equipment and storage medium for generating multiplication shift switching table

Info

Publication number: CN114912797B
Application number: CN202210522763.7A
Authority: CN
Inventors: 田伟云; 钟兴飞; 洪建兵; 余鹏; 王大鹏; 许慧铭; 李恒; 孙文雍; 付蓉; 高俊; 蔡必波; 李灶培; 向金卫
Original assignee: Zhuhai Unitech Power Technology Co Ltd
Current assignee: Zhuhai Unitech Power Technology Co Ltd
Priority date: 2022-05-13
Filing date: 2022-05-13
Publication date: 2023-05-23
Anticipated expiration: 2042-05-13
Also published as: CN114912797A

Abstract

The invention relates to the field of computers, and discloses a method, a device, equipment and a storage medium for generating a traffic shift switching table, which can still generate the switching table with a small number of traffic drivers and high driving satisfaction rate of the traffic drivers when more transfer sites and complex transfer rules are provided. According to the method, an operation schedule of a train is obtained, a passenger operation fragment set is built based on the operation schedule, each passenger operation fragment in the passenger operation fragment set is combined according to a attendance system of a passenger person and a transfer rule of the train to obtain a traffic set, a target strategy is determined based on requirements of a user, an optimization model is built according to the target strategy and preset traffic table meeting rate constraint conditions, the optimization model is solved, traffic meeting evaluation indexes of the traffic table are screened out from the traffic set based on a solving result, and a passenger shift and traffic table is built based on the screened traffic; and automatically generating the intersection table based on the equal intersection table meeting rate constraint condition and the target policy.

Description

Method, device, equipment and storage medium for generating multiplication shift switching table

Technical Field

The present invention relates to the field of computers, and in particular, to a method, an apparatus, a device, and a storage medium for generating a traffic shift and exchange table.

Background

Along with the continuous expansion of urban scale and the rapid development of scientific technology, the number of rail transit lines is continuously increased, and the rail transit mileage is continuously increased. The high-density departure time interval and the faster driving speed in the train driving process have high requirements on the dispatching level of the service drivers of the rail transit operation company. In order to save operation cost, the rail transit operation is characterized in that the number of passenger drivers used when the number of vehicles is the same is a very critical index, and for this purpose, the manual road-crossing list is usually compiled by virtue of the shift experience of a shift man, and the mode has certain flexibility and applicability, but more situations of large workload, low efficiency, uneven workload of the passenger drivers and easy missing of the number of vehicles exist.

With the development of computer technology, a plurality of intelligent scheduling software appears, the time-consuming work of manual programming can be shared by using programs arranged in the software, but most of the methods adopt optimization algorithms related to column generation, compared with manual scheduling, the generation speed is greatly improved, the problem of missing train number does not exist, but the method still has poor popularity in solving the driving satisfaction rate of passenger drivers, and the problems related to more railway transfer stations still exist.

Disclosure of Invention

The invention provides a method, a device, equipment and a storage medium for generating a traffic shift switching table, which can still generate the switching table with a small number of traffic drivers and high driving satisfaction rate of the traffic drivers when more transfer stations and complex transfer rules are provided.

The first aspect of the invention provides a method for generating a riding shift-switching table, which comprises the following steps:

acquiring an operation schedule of a train, and constructing a passenger operation fragment set based on the operation schedule;

according to the attendance system of the crew members and the transfer rule of the train, combining each crew operation fragment in the crew operation fragment set to obtain a traffic path set;

determining a target strategy based on the requirement of a user, generating a target function according to the target strategy, and constructing an optimization model according to the target function and a preset intersection table meeting rate constraint condition;

carrying out integer linear programming solution on the optimization model to obtain an optimal solution;

and screening out the road crossing meeting the evaluation index of the road crossing list from the road crossing set according to the optimal solution, and constructing a passenger shift road crossing list based on the screened road crossing.

In a first implementation manner of the first aspect of the present invention, the acquiring an operation schedule of a train and constructing a passenger service fragment set based on the operation schedule includes:

Acquiring an operation schedule of a train, and extracting station information, time information of each station and train number information in the operation schedule;

constructing a time object data table and a station object data table based on the station information, the time information and the train number information of each station; the time object data table comprises train number information, site information, departure time and arrival time of each site, and the site object data table comprises site information and site attribute information;

and extracting a passenger operation sub-segment according to the train number information or the site attribute information based on the time object data table, and constructing a passenger operation segment set based on the passenger operation sub-segment.

In a second implementation manner of the first aspect of the present invention, the combining each of the crew operation segments in the crew operation segment set according to a crew attendance system and a transfer rule of a train to obtain a traffic set includes:

calculating the attendance time period of the crew member based on the attendance system and the actual attendance time of the crew member;

constructing a traffic constraint condition limit based on a transfer rule of the train and the attendance time period;

And sequentially taking the multiplication operation fragments in the multiplication operation fragment set as a traffic start point, inquiring the multiplication operation fragments meeting the restriction of the traffic constraint condition in the rest multiplication operation fragments in the multiplication operation fragment set, and constructing a traffic tree structure to obtain a traffic set.

In a third implementation manner of the first aspect of the present invention, the sequentially taking the pieces of the multiplication job in the multiplication job piece set as a traffic start point, querying the remaining pieces of the multiplication job in the multiplication job piece set for the multiplication job piece meeting the constraint of the traffic constraint condition, and constructing a traffic tree structure to obtain a traffic set includes:

sequentially taking the multiplication operation fragments in the multiplication operation fragment set as a traffic route starting point, and respectively constructing traffic routes with the rest multiplication operation fragments in the multiplication operation fragment set;

judging whether each intersection meets the intersection constraint condition limit or not;

and if so, interconnecting the intersections with the same multiplication operation fragments in each intersection to generate an intersection tree structure, and converting the intersection tree structure into an intersection set.

In a fourth implementation manner of the first aspect of the present invention, the connecting the intersections with the same multiplication operation segments in each intersection to generate an intersection tree structure, and converting the intersection tree structure into an intersection set includes:

Classifying the service operation fragments in each intersection based on preset fragment attribute categories, and marking classification numbers;

the multiplication job fragments with the same classification number are distributed to corresponding threads for intersecting processing, and an intersecting tree structure is generated;

and integrating the traffic tree structures of all the categories to obtain a traffic set.

In a fifth implementation manner of the first aspect of the present invention, after the allocating the multiplication job segments with the same class number to the corresponding threads to perform the intersection processing, generating the intersection tree structure, the method further includes:

and sequentially reading and storing the multiplication job fragments in the traffic tree structure corresponding to each classification number into the cache file according to the sequence from the father node to the child node for storage.

In a sixth implementation manner of the first aspect of the present invention, before the determining a target policy based on a requirement of a user, generating a target function according to the target policy, and determining an optimization model according to the target function and a preset intersection table meeting rate constraint condition, the method further includes:

judging whether each intersection in the intersection set reaches the intersection constraint condition limit or not;

if not, adding the marking information on the corresponding intersection.

In a seventh implementation manner of the first aspect of the present invention, the determining a target policy based on a requirement of a user, generating a target function according to the target policy, and determining an optimization model according to the target function and a preset intersection table meeting rate constraint condition includes:

extracting the intersections with the marking information in the intersection set, and establishing a satisfaction rate constraint formula according to preset satisfaction rate constraint conditions and the extracted intersections;

determining a target strategy based on the requirement of a user, determining a target coefficient according to the target strategy, and generating a target function according to the target coefficient;

and establishing an optimization model according to the satisfaction rate constraint formula and the objective function.

In an eighth implementation manner of the first aspect of the present invention, the objective function is:

wherein each intersection x _i The number of unsatisfied items is defined as F ₁ …F _n A is a target coefficient which followsThe target strategies are different, and the target strategies comprise a strategy with the priority of the number of the traffic routes and a strategy with the priority of the satisfaction rate.

In a ninth implementation manner of the first aspect of the present invention, after the screening, according to the optimal solution, a road that meets an evaluation index of a road-crossing table from the road-crossing set, and constructing a passenger shift road-crossing table based on the screened road-crossing, the method further includes:

Calculating the number of routes which do not meet all evaluation indexes in the passenger shift switching list according to the satisfaction rate evaluation indexes;

and calculating the evaluation value of the passenger shift switching table by using a preset evaluation formula based on the number of each switching road, and evaluating the switching road in the passenger shift switching table based on the evaluation value.

The second aspect of the present invention provides a device for generating a traffic shift and road-switching table, comprising:

the acquisition module is used for acquiring an operation schedule of the train and constructing a passenger operation fragment set based on the operation schedule;

the combination module is used for combining the various multiplication operation fragments in the multiplication operation fragment set according to the attendance system of the crew members and the transfer rule of the train to obtain a road exchange set;

the computing module is used for determining a target strategy based on the requirement of a user, generating a target function according to the target strategy, and constructing an optimization module according to the target function and a preset intersection table meeting rate constraint condition; carrying out integer linear programming solution on the optimization model to obtain an optimal solution;

and the table construction module is used for screening out the road crossing meeting the evaluation index of the road crossing table from the road crossing set according to the optimal solution, and constructing a passenger shift road crossing table based on the screened road crossing.

In a first implementation manner of the second aspect of the present invention, the acquiring module includes:

the system comprises an acquisition unit, a control unit and a control unit, wherein the acquisition unit is used for acquiring an operation timetable of a train and extracting station information, time information of each station and train number information in the operation timetable;

a first construction unit, configured to construct a time object data table and a station object data table based on the station information, the time information of each station, and the train number information; the time object data table comprises train number information, site information, departure time and arrival time of each site, and the site object data table comprises site information and site attribute information;

and the segment extraction unit is used for extracting the passenger operation sub-segments according to the train number information or the site attribute information based on the time object data table, and constructing a passenger operation segment set based on the passenger operation sub-segments.

In a second implementation manner of the second aspect of the present invention, the combination module includes:

the first calculation unit is used for calculating the attendance time period of the crews based on the attendance system and the actual attendance time of the crews;

the second construction unit is used for constructing a traffic constraint condition limit based on the transfer rule of the train and the attendance time period;

And the combination unit is used for sequentially taking the multiplication operation fragments in the multiplication operation fragment set as a traffic start point, inquiring the multiplication operation fragments meeting the restriction of the traffic constraint condition in the rest multiplication operation fragments in the multiplication operation fragment set, and constructing a traffic tree structure to obtain a traffic set.

In a third implementation manner of the second aspect of the present invention, the combination unit is specifically configured to:

In a fourth implementation manner of the second aspect of the present invention, the combination unit is specifically configured to:

In a fifth implementation manner of the second aspect of the present invention, the combining unit is specifically further configured to:

In a sixth implementation manner of the second aspect of the present invention, the device for generating a traffic shift and lane departure table further includes a marking module, specifically configured to:

if not, adding the marking information on the corresponding intersection.

In a seventh implementation manner of the second aspect of the present invention, the calculating module includes:

the intersection extraction unit is used for extracting intersections with the marking information in the intersection set;

the formula establishing unit is used for establishing a meeting rate constraint formula according to a preset meeting rate constraint condition and the extracted intersection;

the function generating unit is used for determining a target strategy based on the requirement of a user, determining a target coefficient according to the target strategy and generating a target function according to the target coefficient;

And the model building unit is used for building an optimization model according to the satisfaction rate constraint formula and the objective function.

In an eighth implementation manner of the second aspect of the present invention, the objective function is:

wherein each intersection x _i The number of unsatisfied items is defined as F ₁ …F _n A is a target coefficient, the target coefficient is different along with the different target strategies, and the target strategies comprise a strategy with the priority of the number of the routes and a strategy with the priority of the satisfaction rate.

In a ninth implementation manner of the second aspect of the present invention, the device for generating a traffic shift and road-switching table further includes an evaluation module, specifically configured to:

A third aspect of the present invention provides an electronic device, comprising: a memory and at least one processor, the memory having instructions stored therein, the memory and the at least one processor being interconnected by a line; the at least one processor invokes the instructions in the memory to cause the electronic device to perform the steps of the above-provided method of generating a ride scheduling shift pattern.

A fourth aspect of the present invention provides a computer readable storage medium having instructions stored therein which, when run on a computer, cause the computer to perform the steps of the above-provided method of generating a ride scheduling shift pattern.

The beneficial effects are that:

according to the technical scheme, an operation schedule of a train is obtained, a passenger operation fragment set is constructed based on the operation schedule, each passenger operation fragment in the passenger operation fragment set is combined according to a attendance system of a crew member and a transfer rule of the train to obtain a traffic set, a target strategy is determined based on the requirement of a user, a target function is generated according to the target strategy, and an optimization model is constructed according to the target function and preset traffic table meeting rate constraint conditions; carrying out integer linear programming solution on the optimization model to obtain an optimal solution, screening out the traffic which meets the evaluation index of the traffic list from the traffic collection to obtain the optimal solution, and constructing a passenger shift traffic list based on the screened traffic; the automatic generation of the traffic sheet based on the same traffic sheet meeting rate constraint conditions and target strategies has higher efficiency compared with the traffic sheet generated by the existing shift, and the combination logic of the traffic sheet can be simplified by setting multi-station and complex transfer rules through constraint conditions, so that the traffic sheet with uniform workload, reasonable attendance time and attendance places of each crew member can be still realized under the simple logic, and the operability of the crew member plan is very high, and the system is more scientific, accurate and humanized.

Drawings

FIG. 1 is a schematic diagram of a first embodiment of a method for generating a shift-by-duty table in accordance with an embodiment of the present invention;

FIG. 2 is a schematic diagram of a second embodiment of a method for generating a shift-by-duty table in accordance with an embodiment of the present invention;

FIG. 3 is a schematic diagram of a third embodiment of a method for generating a shift-by-duty table in accordance with an embodiment of the present invention;

FIG. 4 is a schematic diagram of a constraint;

FIG. 5 is a schematic diagram of a cross-road tree structure;

FIG. 6 is a flow chart of a cross-road set generation;

FIG. 7 is a flow chart of another alternate set generation;

FIG. 8 is a schematic diagram of an embodiment of a device for generating a shift-by-duty and shift-by-way table according to an embodiment of the present invention;

FIG. 9 is a schematic diagram of another embodiment of a device for generating a shift-by-duty and shift-by-way table according to an embodiment of the present invention;

fig. 10 is a schematic diagram of an embodiment of an electronic device according to an embodiment of the present invention.

Detailed Description

Aiming at the defects of the existing method for generating the traffic shift switching table, the invention provides a scheme for mainly solving the problems that when more transfer stations and complex transfer rules exist, the traffic shift table with small quantity of traffic drivers and high driving satisfaction rate of the traffic drivers can still be generated.

The terms "first," "second," "third," "fourth" and the like in the description and in the claims and in the above drawings, if any, are used for distinguishing between similar objects and not necessarily for describing a particular sequential or chronological order. It is to be understood that the data so used may be interchanged where appropriate such that the embodiments described herein may be implemented in other sequences than those illustrated or otherwise described herein. Furthermore, the terms "comprises," "comprising," or any other variation thereof, are intended to cover a non-exclusive inclusion, such that a process, method, system, article, or apparatus that comprises a list of steps or elements is not necessarily limited to those steps or elements expressly listed or inherent to such process, method, article, or apparatus.

For easy understanding, the following describes a specific flow of an embodiment of the present invention, referring to fig. 1, in a first embodiment of a method for generating a traffic shift switching table in the embodiment of the present invention, the method for generating a traffic shift switching table is mainly applied to a staff management system for public transportation such as subways, buses, taxis, flights, etc., and in addition, the method may also be applied to an industry management system requiring staff scheduling, mainly for constructing a more reasonable and higher-utilization shift scheme based on the output shift switching table for the shift switching table output in the system, and specifically, the method includes the following steps:

101. Acquiring an operation schedule of a train, and constructing a passenger operation fragment set based on the operation schedule;

in the step, the operation schedule can be obtained in two ways, namely, the operation schedule is connected with an operation system of a train through the Internet, train shift update data in each day or each time period in the operation system is monitored in real time, so that the operation schedule of each train is obtained, and the operation schedules of each train are combined to obtain a total operation schedule; and extracting information of each station based on the total operation schedule, and constructing the passenger operation fragments based on the station information.

The other is that manual entry is carried out by staff or crews, and when manual entry is carried out, specifically, train times of each time period or each day are input based on a management interface of the passenger scheduling, then an operation schedule is automatically generated based on the departure time of each train, and the operation schedule is generated, and the operation schedule further comprises stations with specific properties such as transfer stations, turning-back stations and the like.

In practical application, when constructing the service operation fragment, the method specifically comprises the following steps:

102. According to the attendance system of the crew members and the transfer rule of the train, combining each crew operation fragment in the crew operation fragment set to obtain a traffic collection;

in this embodiment, a attendance system of a crew member is obtained from a scheduling management system, different attendance time points and time periods of three shifts in the morning, in the evening are calculated based on the attendance system, and operation rules of a train are obtained from a train operation system, wherein the operation rules mainly include rules of train operation and rest rules of the crew member for controlling the train, a first constraint condition of an initial intersection table is constructed based on the attendance time points, the time periods, the rules of train operation and the rest rules, and a plurality of intersections are constructed by splicing and combining satisfied crew member fragments found from a crew member fragment set based on the first constraint condition, so as to obtain an intersection set.

In practical application, in the process of constructing the intersection set, the construction of the intersection may be to construct the intersection with two multiplication operation fragments, and then, the intersection including the two multiplication operation fragments is intersected by the first constraint condition to obtain the intersection set. Preferably, after constructing the intersection set, the method further comprises converting the intersection set into a representation form of a tree structure.

103. Determining a target strategy based on the requirement of a user, generating a target function according to the target strategy, and constructing an optimization model according to the target function and a preset intersection table meeting rate constraint condition;

in this embodiment, the target policy specifically includes the following two types: the policy with the priority of the number of the routes and the policy with the priority of the satisfaction rate select the corresponding objective function based on the objective policy and the constraint condition, and the specific is:

the objective function includes two parts: target coefficient, target value.

Wherein the target coefficients differ according to the target policy.

The target strategy includes two parts: a policy with priority of the number of the routes and a policy with priority of the satisfaction rate.

Policy for priority of number of routes:

the number of each intersection unsatisfied item is defined as F ₁ …F _n The unsatisfied coefficient is defined as 0.01, and the target value is the minimum value Then a formula for the objective function is established:

for policies that meet rate priority:

the number of each intersection unsatisfied item is defined as F ₁ …F _n If the unsatisfied coefficient is defined as 100 and the target value is the minimum value, establishing a formula of an objective function:

in practical application, when the objective function is created, the objective strategy is determined based on the requirement of the user, and the objective function is determined according to the objective strategy and the preset intersection table meeting rate constraint conditions, specifically including:

extracting the intersections with the marking information in the intersection set, and calculating the satisfaction rate evaluation index of the intersection set based on the extracted intersections;

judging whether the satisfaction rate evaluation index meets the preset intersection table satisfaction rate constraint condition or not;

if the road traffic is not satisfied, determining a target strategy according to the requirement of the user, and determining an unsatisfied coefficient of the corresponding road traffic based on the target strategy;

and creating a corresponding objective function according to the unsatisfied coefficients, and carrying out integer linear programming solution on the objective function to obtain an optimal solution.

104. Carrying out integer linear programming solution on the optimization model to obtain an optimal solution;

in this step, the meeting rate constraint condition of the intersection table may be understood as a limit value set based on the first constraint condition, specifically, by calculating a specific value of the first constraint condition of each intersection in the intersection set, comparing the specific value with the first constraint condition, and constructing the intersection set based on the comparison result, where the calculated target value is actually a value of whether a specific value of an intersection constructed by a plurality of intersections in the intersection set is equal to the value of the first constraint condition, and if so, selecting a function variable of the corresponding intersection constructed by the intersection set to determine an optimization model corresponding to the objective function pair.

In practical application, the constraint condition model obtained by modeling the intersection table meeting rate is specifically based on the first constraint condition used in the step 102, the objective function is adjusted based on the constraint condition model to obtain an optimization model corresponding to the objective function, the type of the objective strategy is determined according to the requirement of the user, the corresponding objective strategy is selected based on the type of the objective strategy to calculate the objective coefficient of the objective function, and finally the meeting rate of the intersection in the intersection set is calculated based on the objective coefficient and the objective function to obtain the optimal solution of the optimization model.

105. And screening out the road crossing meeting the evaluation index of the road crossing list from the road crossing set according to the optimal solution, and constructing a passenger shift road crossing list based on the screened road crossing.

In this embodiment, in the screening process, a reasonable value interval may also be calculated according to the target value, a road crossing in the value interval is selected from the road crossing set based on the value interval, and a passenger shift road-crossing table is constructed based on the road crossing. Of course, after screening, the target value can be calculated until the target value is similar to or equal to the preset expected value, and the final passenger shift-shift table is output.

In summary, through implementation of the method provided by the invention, after a plurality of service operation fragments are divided based on an operation schedule of a train, the service fragments are combined and spliced by using a service system and a transfer rule as constraint conditions to obtain a road-crossing set, and then the road-crossing in the road-crossing set is evaluated according to the meeting rate constraint conditions and the target strategy of the road-crossing table, and the road-crossing which does not meet the meeting rate constraint conditions is screened out to obtain the service class-arrangement road-crossing table. The method realizes automatic generation of the shift-and-route-switching table with less number of crew members and balanced workload under the same constraint condition, and solves the problems that the existing method can not generate the route-and-route-switching table with less number of crew drivers and high driving satisfaction rate of the crew drivers when the transfer sites are more and the transfer rules are complex.

Referring to fig. 2, in a second embodiment of the present invention, a method for generating a shift-and-shift table includes:

201. acquiring an operation schedule of a train, and constructing a passenger operation fragment set based on the operation schedule;

in this embodiment, the operation schedule is entered and stored and converted into a table, the fields in the table are marked by using a character recognition tool based on the fields in the table, and then the data in the table is split by using a text extraction tool to form a plurality of data tables, including a time data table and a site data table.

On the basis of the data table obtained by splitting, splitting and combining the two data tables by taking a special site as the starting point and the ending point of the multiplication operation fragment to obtain a plurality of multiplication operation fragments, and obtaining a multiplication operation fragment set.

202. Calculating the attendance time period of the crew member based on the attendance system and the actual attendance time of the crew member;

in this embodiment, according to the operation time and the attendance system of the train, the early shift, the middle shift and the late shift are set, each crew member can work independently for one shift, or can span a plurality of shifts, but spans a plurality of shifts to follow the constraint of the conditions such as the working time length, the driving mileage and the like of a single crew member, and the attendance time period (namely, the early shift, the middle shift and the late shift) of each crew member is calculated, specifically, the attendance time is calculated based on the attendance system and the actual attendance time, wherein the attendance time of the early shift and the attendance time of the middle shift overlap, the attendance time of the middle shift and the attendance time of the late shift overlap, and the attendance time period of the crew member is calculated based on the attendance time point after the actual attendance time period is calculated through the overlapping time.

203. Constructing a traffic constraint condition limit based on a transfer rule and an attendance time period of the train;

In the step, the limit of the traffic constraint condition is calculated according to the transfer rule and the attendance time period, the actual attendance time place of the crews is combined, the traffic constraint condition is adjusted based on the actual attendance place, and the limit of each condition is calculated by combining the rest time of the crews, namely the maximum value of each condition.

204. Sequentially taking the multiplication operation fragments in the multiplication operation fragment set as a traffic start point, inquiring the multiplication operation fragments meeting the restriction of the traffic constraint condition in the rest multiplication operation fragments in the multiplication operation fragment set, and constructing a traffic tree structure to obtain a traffic set;

in this embodiment, the range of the intersection constraint condition is constructed based on the calculated intersection constraint condition, and the intersection of the segments satisfying the range is obtained by mutually matching the multiplication segments from the multiplication segment set based on the range, thereby constructing the intersection set.

When the queries are combined, the structure trees are intersected one by one, then constraint judgment is carried out on the intersected intersecting roads by utilizing the intersecting road constraint condition, intersecting roads which do not meet the intersecting road constraint condition are removed based on the judgment result, and the rest of the structure trees are converted into an intersecting road set.

In an optional embodiment, the sequentially taking the service segments in the service segment set as a traffic start point, querying the remaining service segments in the service segment set for service segments meeting the traffic constraint condition constraint, and constructing a traffic tree structure to obtain a traffic set, including:

In practical application, before the combination and the splicing of the multiplication operation fragments, classification processing is further included on the multiplication fragments, screening is conducted one by one based on different categories, the intersection constraint conditions are utilized for screening, and fragments meeting the intersection constraint conditions are obtained for intersection construction.

Specifically, the step of connecting the intersections with the same multiplication operation fragments in each intersection to generate an intersection tree structure, and converting the intersection tree structure into an intersection set includes:

Further, after the task segments with the same classification number are allocated to the corresponding threads for intersection processing to generate the intersection tree structure, the method further includes:

205. Judging whether each intersection in the intersection set reaches the restriction of intersection constraint conditions or not;

206. if not, adding marking information on the corresponding intersection;

in this embodiment, the intersection set obtained by combining and splicing the segments based on the intersection constraint conditions only meets a certain range of intersections, and does not have constraint conditions which are met by mandatory requirements for part of the intersection set, such as insufficient driving mileage, insufficient working time and the like. A flag is added to this intersection to indicate whether the constraint is met.

The road-crossing with insufficient driving mileage in the early shift, the middle shift and the late shift is marked as ZDL 1, BDL 1 and WDL 1.

The routes of the breakfast, the middle shift and the late shift with insufficient working time are marked as ZWL 1, BWL 1 and WWL 1.

207. Extracting the intersections with the marking information in the intersection set, and establishing a satisfaction rate constraint formula according to preset satisfaction rate constraint conditions and the extracted intersections;

208. determining a target strategy based on the requirement of a user, determining a target coefficient according to the target strategy, and generating a target function according to the target coefficient;

209. establishing an optimization model according to the satisfaction rate constraint formula and the objective function;

210. carrying out integer linear programming solution on the optimization model to obtain an optimal solution;

in this embodiment, steps 207-210 may also be implemented as follows:

In this embodiment, the meeting rate constraint condition of the traffic table is calculated based on a percentage of meeting rate of users for the traffic in the shift, for example, a repeated percentage is set for the same piece of the traffic operation in the shift of the same crew member on the same day, and based on the repeated percentage, all pieces of the traffic operation in the shift traffic table of the crew member cannot exceed a certain number, so as to obtain the meeting rate constraint condition of the traffic table.

In this embodiment, when determining that the coefficient is not satisfied (i.e., the target coefficient) is based on different target strategies, different calculation modes are available, for example, when there are fewer crew members capable of scheduling, the priority strategy of the number of routes to be crossed may be selected, that is, the number of pieces of the crew work covered in each crew member scheduling needs to be up to a certain number, so that the problem of fewer crew members can be alleviated.

Of course, if the crew members are reorganized or the crew members are scattered in the attendance places, a policy of meeting the priority of the rate may be adopted, that is, the shift connection of the crew members may be utilized as much as possible from the viewpoint of the driving mileage of the crew members and the repetition of the crew work segments.

In this embodiment, the objective function is:

Wherein each intersection x _i The number of unsatisfied items is defined as F ₁ …F _n The unsatisfied coefficient is A, and the unsatisfied coefficient is different according to the target strategy.

In practical application, the target strategy comprises a traffic number priority strategy and a satisfaction rate priority strategy;

the determining, based on the objective policy, the unsatisfied coefficient of the corresponding objective function and the corresponding intersection includes:

if the target policy is a traffic number priority policy, determining that the corresponding unsatisfied coefficient of the traffic is a first threshold value A, and the corresponding target function is:

if the target policy is a meeting rate priority policy, determining that the unsatisfied coefficient of the corresponding intersection is a second threshold B, and the corresponding objective function is:

wherein the number of unsatisfied items of each intersection is defined as F ₁ …F _n The first threshold is A, and the second threshold is B.

211. And screening out the road crossing meeting the evaluation index of the road crossing list from the road crossing set based on the optimal solution, and constructing a passenger shift road crossing list based on the screened road crossing.

In this embodiment, when a traffic shift and a road-switching table is constructed based on the screened road-switching, the road-switching is converted into a specific form by an optimization operation tool, and a form is output according to the singular number of the crew members, wherein the form includes information such as the time of attendance, the working time, the place of rest, and the like of the road-switching.

In an alternative embodiment, after constructing the passenger shift-and-shift table, the method further comprises performing an overall evaluation on the passenger shift-and-shift table, specifically, calculating the number of routes which do not meet all evaluation indexes in the passenger shift-and-route-switching table according to the satisfaction rate evaluation indexes; and calculating the evaluation value of the passenger shift switching table by using a preset evaluation formula based on the number of each switching road, and evaluating the switching road in the passenger shift switching table based on the evaluation value.

Through implementation of the method, the operation timetable is converted into the plurality of multiplication operation fragments, the multiplication operation fragments are combined into a plurality of intersecting ways, integer linear programming modeling is conducted on each intersecting way, the optimized intersecting way table is used for generating the intersecting way table of the multiplication scheduling, the scheduling intersecting way table is generated in the mode, workload arrangement, time arrangement and the like of each crew member are more reasonable, constraint condition logic of piece complexity is simplified, fewer crew members are used in the intersecting way table generated by the method under the same condition, resources are reasonably utilized, and excessive waste of manpower resources is avoided.

The method provided by the present application is described below in connection with a particular train operation schedule. As shown in fig. 3 to 7, fig. 3 is a third embodiment of a method for generating a shift-and-shift-by-service table according to the present embodiment, and the method specifically includes the following steps:

301. Converting an operation schedule into a plurality of ride operation fragments T ₁ …T _n ；

In the step, manual entry is performed by staff or crews, and during manual entry, specifically, train times of each time period or each day are input based on a management interface of a passenger scheduling, then an operation schedule is automatically generated based on departure time of each train, and after the operation schedule is generated, stations with specific properties such as a transfer station, a foldback station and the like are set, and then a total operation schedule is built based on each operation schedule, and then a passenger operation section is built by using the set stations.

The specific implementation process comprises the following steps:

In practical application, the practical application of Shenzhen No. 4 wire of Gangfei is taken as an example for the detailed description. The total length of Shenzhen 4 wire of Gangfei is 31.3 km, 23 stations are arranged in total, 62 vehicles are operated all day, and the operation period of each day is 05:30 to 00:30. The break place in the early shift is the down going of the Longsheng; the attendance-returning place in early shift is ascending, descending and descending in the cattle lake; the rest place between the middle classes is the Dragon descending; the middle work rest place is the descending of the cattle lake; the attendance places of the middle shift are ascending, descending and descending of the dragon win and descending of the cattle lake; the attendance-returning place in the middle shift is the ascending of the dragon win, the descending of the dragon win and the descending of the cattle lake; the rest place in the night is the Dragon descending; the rest place in the late shift is the down going of the Longsheng; the attendance places of the night shift are ascending, descending and descending of the dragon win and descending of the cattle lake; there is a parking lot and a vehicle section; there is a red mountain side line minor intersection and a madder pit side line minor intersection. The operation timetable based on Shenzhen No. 4 wire of Gangshen is converted into the passenger operation fragment set as follows:

and step 1, recording an operation timetable, storing and converting the operation timetable into a plurality of time objects.

The timetable stored in the form of a file is converted into a timetable object and stored in a database as shown in tables 1 and 2 below.

Table 1 train operation schedule

Table 2 time object data table

Time object ID	Train number	Site ID	Time of arrival	Time to start	Vehicle bottom number
						1	111002	15	06:28:24	06:28:24	10
2	111002	16	06:29:10	06:30:00	10
						......

And step 2, inputting basic site attribute information, including attributes such as whether to transfer a station, whether to turn back a station and the like, as shown in the following table 3.

TABLE 3 site object data model

Site ID

Name of the name

Whether or not to transfer station

Whether or not to turn back the station

Site type

Transfer type

1

Futian port

true

normal

0

2

Blessing people

false

normal

0

......

And step 3, splitting and combining the time objects in the operation timetable according to the transfer station and the foldback station according to the station attribute information.

Specifically, the time objects belonging to the same vehicle are time-ordered and sequentially processed, cut off by the train number and combined into the passenger work sub-segments, or cut off by the transfer station and combined into the passenger work segments.

And 4, combining a plurality of time objects into one multiplication operation segment to finally form a plurality of multiplication operation segments, as shown in the following table 4.

TABLE 4 multiplication operation fragment object data table

Passenger fragment ID

Start site

Time to start

Train number

Time of arrival

Ending site

1

15

06:28:24

111002

06:29:10

16

......

Wherein, a piece of the ride job may comprise a plurality of sub-pieces of the ride job.

Wherein, a passenger section may include a plurality of train numbers or a part of a train number.

302. Each multiplication operation segment is combined into a plurality of intersections;

in this embodiment, in the course of combining and intersecting the road based on the passenger operation fragments, different constraint conditions are set, where the constraint conditions include driving mileage, working time, attendance time, rest place, continuous driving mileage, etc., as shown in fig. 4.

(1) Driving mileage. The number of kilometers driven by the passenger drivers of each shift on the same day has a certain range limit.

(2) And (5) working time. The working time of each class of service drivers on the same day has certain range limit. Duration = attendance time-attendance time.

(3) Attendance time. The attendance time of the day of the passenger drivers in the middle and the late shifts has a certain range limit.

(4) And (5) the attendance time. The attendance times of the day of the passenger drivers in the early and middle shifts have certain range limits.

(5) The duration of the rest period. The time interval between the passengers of each shift and the delivery of the vehicles at different transfer stations is limited to a certain extent.

(6) Rest time. The time interval for the passenger drivers in the middle and the late shifts to transfer the cars at the rest places is limited to a certain extent, and the passengers have only one rest in the same day.

(7) A break site. The passenger drivers of each shift need to meet the limitation of the time duration when handing over at the time of the time-out place (transfer station). When the vehicle is delivered at a non-time place, the number of the vehicle running out is limited.

(8) Rest places. The duty drivers in the middle and late shifts take meals or other relaxation activities at rest places.

(9) Continuous driving mileage. Before the kilometers of the passenger drivers of each shift reach a certain value, at least one time of the rest time length at the rest place is needed to meet the minimum requirement.

The process for combining the intersections includes the steps of:

step 10, dividing the passenger operation fragments into three shifts according to the set time range: early shift, middle shift and late shift;

wherein the attendance time of the early shift and the middle shift are overlapped, and the attendance time of the middle shift and the late shift are overlapped. The method comprises the following steps:

the actual latest attendance time ZDT of the early shift is divided according to the earliest attendance time BDT of the middle shift and the attendance buffer time ZDTN of the early shift: zdt=bdt+zdtn;

the actual earliest attendance time BDT1 of the middle shift is divided according to the earliest attendance time BDT of the middle shift and the attendance buffer time BDTN1 of the middle shift: bdt1=bdt-BDTN 1;

the actual latest attendance time BDT2 of the shift is divided according to the earliest attendance time WDT of the shift and the attendance buffer time BDTN2 of the shift: bdt2=wdt+bdtn2;

The actual earliest attendance time WDT1 of the shift is divided according to the earliest attendance time WDT of the shift and the attendance buffer time WDTN of the shift: wdt1=wdt-WDTN; the time nodes for the above are shown in table 5 below.

Table 5 timetables for early, middle and late shifts

Step 20, generating a tree with one multiplication segment as a starting point according to various constraint conditions and other multiplication segments, and generating a plurality of intersections, as shown in fig. 5;

in this step, when a plurality of multiplication work segments are combined into a spanning tree, it is necessary to comprehensively consider the above constraint conditions and the following transfer rules:

(1) Dividing the rest places of the room according to the early shift, the middle shift and the late shift;

(2) Dividing transfer time and transfer number according to the places of the break between the early shift, the middle shift and the late shift;

(3) Dividing rest places according to breakfast, middle and late shifts;

(4) Dividing attendance places according to early shift, middle shift and late shift;

(5) Dividing attendance places according to early shift, middle shift and late shift;

(6) And dividing transfer time of the cross-site vehicle connection according to the early shift, the middle shift and the late shift.

The meanings to be expressed in fig. 5 are as follows:

(1) A number represents a node and corresponds to a piece of the ride operation.

(2) Starting from root node 1, an intersection is generated with each level of its child nodes. If 1-2 is an intersection, 1-2-3 is an intersection.

(3) A single root node generates a cross. If 1 is a cross-way.

(4) Constraint condition limits are satisfied between the two nodes. Such as meeting minimum duration constraints.

(5) Each intersection satisfies a constraint condition constraint. Such as meeting a maximum driving range limit, etc.

(6) Each intersection satisfies the transfer rule constraint. Such as meeting attendance location restrictions, etc.

Step 30, marking the satisfaction condition of each intersection according to the satisfaction rate evaluation condition;

when the meeting condition of each intersection is marked, judging whether the intersection set reaches the maximum value of the intersection constraint condition limit or not; if not, adding the marking information on the corresponding intersection.

In practical application, constraint conditions which are not satisfied by the forced requirements are partially met, such as insufficient driving mileage, insufficient working time and the like. A flag is added to this intersection to indicate whether the constraint is met.

Step 40, repeating steps 20 and 30 to process each of the multiplication segments, and finally generating a plurality of intersections to form an intersection set.

The method mainly aims at accelerating the generation speed of the intersection set and solving the problem of insufficient memory caused by overlarge scale of the intersection set. The method adopts a multithreading technology and a file caching technology to comprehensively solve the problem. As particularly shown in fig. 6 and 7.

Specifically, the multi-thread technology is used to classify the service operation, the classified classes are numbered, the service operation fragments with the same number are uniformly classified and processed by one thread, and the service operation fragments are written into the same file after the intersection set is generated, as shown in steps 601 to 604 in the figure. Five categories of selectable passenger segments are: zb, zbbbcomm, bb, bbwbcomm, wb. The number to which the passenger fragment belongs after classification increases from 1.

Further, reading corresponding files from zb classification according to the serial number sequence and writing the corresponding files into a large file; reading corresponding files from the zbbbcomm classification according to the serial number sequence and writing the corresponding files into a large file; reading corresponding files from the bb classification according to the serial number sequence and writing the corresponding files into a large file; reading corresponding files from the bbwbcomm classification according to the serial number sequence and writing the corresponding files into a large file; reading corresponding files from wb classification according to the serial number sequence and writing large files; after all the classified pieces of the multiplication work are written into the post-cache, as shown in fig. 7, the number of pieces of the multiplication work used in this embodiment is 1017, and the total number of generated routes is 3589652.

303. Carrying out integer linear programming modeling on each intersection;

in this embodiment, for integer linear programming modeling, variable modeling, constraint modeling, and objective function modeling are included, specifically:

variable modeling: each intersection in the intersection set is defined as a variable as: x is x ₁ …x _n ，x∈{0，1}；

Modeling constraint conditions: the multiplication operation fragment in the operation result cannot be repeated, cannot be deleted, and is other constraints related to meeting the rate evaluation condition, for example:

(1) The multiplication operation fragment is not repeated and not lost.

For each variable x containing a piece of the multiply task T, if x ₁ ，x ₁₈ ，x ₁₈₀ Establishing a constraint formula:

x ₁ +x ₁₈ +x ₁₈₀ ＝1

repeating the step of the formula for each of the multiplication segments T creates a plurality of constraints.

(2) The number of the early shift and the late shift is different.

If x ₂ ，x ₂₈ ，x ₂₈₀ Belonging to early shift, x ₃ ，x ₃₈ ，x ₃₈₀ Belonging to the late shift, the number difference is equal to 2, and a constraint formula is established:

x ₂ +x ₂₈ +x ₂₈₀ -x ₃ -x ₃₈ -x ₃₈₀ ＝2

(3) The number of intersections with insufficient driving mileage.

If x ₄ ，x ₄₈ ，x ₄₈₀ The number of the insufficient driving mileage is less than or equal to 2, and a constraint formula is established:

x ₄ +x ₄₈ +x ₄₈₀ ≤2

(4) Number of routes taken by the driver with insufficient continuous driving time.

If x ₅ ，x ₅₈ ，x ₅₈₀ ，x ₅₈₀₀ The continuous driving duration of the vehicle is insufficient, the number is less than or equal to 3, and a constraint formula is established:

x ₅ +x ₅₈ +x ₅₈₀ +x ₅₈₀₀ ≤3

modeling an objective function: the method comprises the steps of modeling a target coefficient and modeling a target value;

Wherein, for the policy with the priority of the number of the traffic routes, each variable does not satisfy the definition of the number as F ₁ …F _n The unsatisfied coefficient is fixed to be 0.01, and the objective function is established as follows:

for a policy that satisfies rate priority, the number of unsatisfied variables per variable is defined as F ₁ …F _n The unsatisfied coefficient is fixed to 100, and the objective function is established as follows:

304. operating by using an optimizing tool;

in the step, after the constraint condition and the objective function obtained by modeling are based, the calculation of solving each intersection in the intersection set is that:

extracting the intersections with the marking information in the intersection set, and calculating a satisfaction rate evaluation index of the intersection set based on the extracted intersections;

judging whether the satisfaction rate evaluation index meets a preset intersection table satisfaction rate constraint condition or not;

if the target function and the corresponding intersection path are not met, determining a target strategy according to the requirement of the user, and determining an unsatisfied coefficient of the corresponding target function and the corresponding intersection path based on the target strategy;

and calculating an optimal solution of each intersection in the intersection set according to the unsatisfied coefficient and the objective function.

Then, the intersection table is adjusted based on the target value, and finally, different modeling languages are used for adapting to different optimizing tools, such as Matlab, CBC, SCIP and the like; the operation result of the optimizing tool is a version of the intersection table formed by a plurality of intersections, namely, the operation result of the intersection table is converted into the intersection table. By adding the service operation fragments to the traffic, the information of the attendance time, the attendance withdrawal time, the working time, the rest place and the like of the traffic is calculated, and a finished traffic table is finally formed, and is specifically shown in the following table 6.

TABLE 6 traffic table

305. And evaluating the intersection table.

In this step, in the evaluation, the satisfaction rate evaluation is performed for each intersection of the intersection table, and the evaluation index is as follows: the system comprises a driving mileage range, a working time range, a continuous driving time upper limit, a attendance time lower limit, an attendance time upper limit, an attendance place range, a rest place range and a rest time range.

Based on the evaluation index, the intersection table satisfaction rate evaluation method comprises the following steps:

evaluating whether each road intersection is insufficient in driving mileage; the number of unconformities is defined as D _L ；

Evaluating whether the driving mileage of each intersection exceeds; the number of unconformities is defined as D _H ；

Evaluating whether the working time of each intersection is insufficient; the number of unconformities is defined as W _L ；

Evaluating whether the working time of each intersection exceeds; the number of unconformities is defined as W _H ；

Evaluating whether the continuous driving duration of each intersection exceeds; the number of unconformities is defined as D _s ；

Evaluating whether each road is attendanceToo early in the middle; the number of unconformities is defined as D _E ；

Evaluating whether each intersection is too late for the attendance time; the number of unconformities is defined as O _L ；

Evaluating whether each of the routes is inconsistent with the attendance places; the number of unconformities is defined as D _p ；

Evaluating whether each intersection has a rest place inconsistent; the number of unconformities is defined as R _p ；

And evaluating whether the rest time of each intersection is insufficient. The number of unconformities is defined as R _t ；

The number of the intersections in the intersection list is defined as N;

the evaluation formula:

the implementation of the method for generating the traffic shift and road-switching table provided by the embodiment of the invention has the following advantages:

and labor cost is saved. When the technical scheme is applied to Shenzhen No. 4 wire of port iron, under the same constraint condition and transfer rule, the number of the passenger drivers needed by the automatically generated road-crossing table is always 3% less than that needed by the road-crossing table generated by manual shift. The labor cost can be saved by hundreds of thousands yuan each year.

The scheduling plan is fair and reasonable. According to the technical scheme, the automatically generated traffic list has the advantages that the workload of each passenger driver is very uniform, the attendance time and the attendance place of the passenger driver are very reasonable, and the operability of the passenger plan is very high, and the system is more scientific, accurate and humanized.

And the method is suitable for multiple transfer sites and complex transfer rules. According to the technical scheme, the complex routing table problem is subjected to abstract arrangement, multiple transfer rules of multiple shifts and multiple transfer sites are formulated, and various configurations are realized to meet different transfer schemes and complex application scenes.

The method for generating the traffic shift and road-switching table in the embodiment of the present invention is described above, and the device for generating the traffic shift and road-switching table in the embodiment of the present invention is described below, referring to fig. 8, and one embodiment of the device for generating the traffic shift and road-switching table in the embodiment of the present invention includes:

An obtaining module 801, configured to obtain an operation schedule of a train, and construct a passenger operation fragment set based on the operation schedule;

the combination module 802 is configured to combine the pieces of the crew operation in the crew operation piece set according to the attendance system of crew members and the transfer rule of trains, so as to obtain a traffic collection;

the calculating module 803 is configured to determine a target policy based on a requirement of a user, and determine an objective function according to the target policy and a preset traffic table meeting rate constraint condition; carrying out integer linear programming solution on the objective function to obtain an optimal solution;

the table construction module 804 is configured to screen out a road intersecting set that meets the evaluation index of the road intersecting table based on the optimal solution, and construct a passenger shift road intersecting table based on the screened road intersecting set.

In the embodiment of the invention, the device for generating the passenger shift switching table operates the method for generating the passenger shift switching table, the device for generating the passenger shift switching table acquires the operation timetable of the train and constructs a passenger operation fragment set based on the operation timetable, and according to the attendance system of the passengers and the transfer rule of the train, combining all the multiplication operation fragments in the multiplication operation fragment set to obtain a traffic set, determining a target strategy based on the requirement of a user, generating a target function according to the target strategy, and constructing an optimization model according to the target function and a preset traffic table meeting rate constraint condition; carrying out integer linear programming solution on the optimization model to obtain an optimal solution, screening out the traffic which meets the evaluation index of the traffic list from the traffic collection based on the optimal solution, and constructing a traffic shift traffic list based on the screened traffic; the automatic generation of the traffic sheet based on the same traffic sheet meeting rate constraint conditions and target strategies has higher efficiency compared with the traffic sheet generated by the existing shift, and the combination logic of the traffic sheet can be simplified by setting multi-station and complex transfer rules through constraint conditions, so that the traffic sheet with uniform workload, reasonable attendance time and attendance places of each crew member can be still realized under the simple logic, and the operability of the crew member plan is very high, and the system is more scientific, accurate and humanized.

Referring to fig. 9, a second embodiment of a device for generating a traffic shift and exchange table according to an embodiment of the present invention includes:

In this embodiment, the obtaining module 801 includes:

the collecting unit 8011 is configured to obtain an operation schedule of a train, and extract station information, time information of each station, and train number information in the operation schedule;

a first construction unit 8012, configured to construct a time object data table and a station object data table based on the station information, the time information of each station, and the train number information; the time object data table comprises train number information, site information, departure time and arrival time of each site, and the site object data table comprises site information and site attribute information;

And a segment extraction unit 8013, configured to extract a passenger operation sub-segment according to the train number information or the station attribute information based on the time object data table, and construct a passenger operation segment set based on the passenger operation sub-segment.

In this embodiment, the combining module 802 includes:

a first calculating unit 8021 for calculating a attendance time period of the crew member based on the attendance schedule and the actual attendance time of the crew member;

a second construction unit 8022 for constructing a traffic constraint condition limit based on a transfer rule of the train and the attendance time period;

the combination unit 8023 is configured to sequentially use the multiplication operation segments in the multiplication operation segment set as a traffic start point, query multiplication operation segments satisfying the traffic constraint condition limitation in the remaining multiplication operation segments in the multiplication operation segment set, and construct a traffic tree structure to obtain a traffic set.

In this embodiment, the combining unit 8023 is specifically configured to:

In this embodiment, the combining unit 8023 is specifically further configured to:

In this embodiment, the device for generating a traffic shift and road-switching table further includes a marking module 805, specifically configured to:

if not, adding the marking information on the corresponding intersection.

In this embodiment, the calculating module 803 includes:

a cross path extracting unit 8031, configured to extract a cross path in the cross path set with the tag information;

A formula establishing unit 8032, configured to establish a meeting rate constraint formula according to a preset meeting rate constraint condition and the extracted intersection;

a function generating unit 8033, configured to determine a target policy based on a requirement of a user, determine a target coefficient according to the target policy, and generate a target function according to the target coefficient;

a model building unit 8034, configured to build an optimization model according to the satisfaction rate constraint formula and the objective function.

In this embodiment, the objective function is:

In this embodiment, the device for generating a traffic shift and road-switching table further includes an evaluation module 806, specifically configured to:

According to the method, an operation schedule of a train is obtained, a passenger operation fragment set is built based on the operation schedule, each passenger operation fragment in the passenger operation fragment set is combined according to a attendance system of a crew member and a transfer rule of the train to obtain a traffic set, a target strategy is determined based on requirements of a user, a target function is generated according to the target strategy, and an optimization model is built according to the target function and preset traffic table meeting rate constraint conditions; and carrying out integer linear programming solution on the optimization model to obtain an optimal solution, screening out the traffic which meets the evaluation index of the traffic list from the traffic set to obtain the optimal solution, and constructing the traffic shift traffic list based on the screened traffic. The scheduling consideration factors of the crew members are integrated in a constraint condition mode to form a combination constraint condition limitation of the traffic, so that the equal-traffic judgment logic is simplified, the traffic table is automatically generated under the equal-traffic table meeting rate constraint condition and the target strategy, compared with the existing traffic table generated by scheduling, the efficiency is higher, and the traffic table with less number of passenger drivers and high driving satisfaction rate of the passenger drivers can be still generated when more transfer sites and complex transfer rules are realized.

Fig. 8 to 9 above describe the device for generating a shift-and-route table for middle-passenger in the embodiment of the present invention in detail from the point of view of modularized functional entities, and the electronic device in the embodiment of the present invention is described in detail from the point of view of hardware processing.

Fig. 10 is a schematic structural diagram of an electronic device according to an embodiment of the present invention, where the electronic device 1000 may have a relatively large difference between configurations or performances, and may include one or more processors (central processing units, CPU) 1010 (e.g., one or more processors) and a memory 1020, and one or more storage media 1030 (e.g., one or more mass storage devices) storing application programs 1033 or data 1032. Wherein the memory 1020 and storage medium 1030 may be transitory or persistent. The program stored on the storage medium 1030 may include one or more modules (not shown), each of which may include a series of instruction operations in the electronic device 1000. Still further, the processor 1010 may be configured to communicate with the storage medium 1030 and execute a series of instruction operations in the storage medium 1030 on the electronic device 1000 to implement the steps of the model training method or to implement the steps of the image recognition method described above.

The electronic device 1000 can also include one or more power sources 1040, one or more wired or wireless network interfaces 1050, one or more input/output interfaces 1060, and/or one or more operating systems 1031, such as Windows Serve, mac OS X, unix, linux, freeBSD, and the like. It will be appreciated by those skilled in the art that the electronic device structure shown in fig. 10 is not limiting of the computer device provided by the present invention and may include more or fewer components than shown, or may combine certain components, or a different arrangement of components.

The present invention also provides a computer readable storage medium, which may be a non-volatile computer readable storage medium, or may be a volatile computer readable storage medium, where instructions are stored in the computer readable storage medium, where the instructions, when executed on a computer, cause the computer to perform the steps of the method for generating a passenger shift-and-shift table.

It will be clearly understood by those skilled in the art that, for convenience and brevity of description, the specific working process of the system or apparatus and unit described above may refer to the corresponding process in the foregoing method embodiment, which is not repeated herein.

The integrated units, if implemented in the form of software functional units and sold or used as stand-alone products, may be stored in a computer readable storage medium. Based on such understanding, the technical solution of the present invention may be embodied essentially or in part or all of the technical solution or in part in the form of a software product stored in a storage medium, including instructions for causing a computer device (which may be a personal computer, a server, or a network device, etc.) to perform all or part of the steps of the method according to the embodiments of the present invention. And the aforementioned storage medium includes: a U-disk, a removable hard disk, a read-only memory (ROM), a random access memory (random access memory, RAM), a magnetic disk, or an optical disk, or other various media capable of storing program codes.

The above embodiments are only for illustrating the technical solution of the present invention, and not for limiting the same; although the invention has been described in detail with reference to the foregoing embodiments, it will be understood by those of ordinary skill in the art that: the technical scheme described in the foregoing embodiments can be modified or some technical features thereof can be replaced by equivalents; such modifications and substitutions do not depart from the spirit and scope of the technical solutions of the embodiments of the present invention.

Claims

1. The method for generating the passenger shift switching table is characterized by comprising the following steps of:

acquiring a attendance system of a crew member and a transfer rule of a train, calculating attendance time points and time periods of the crew member in a early shift, a middle shift and a late shift based on the attendance system, and determining a rule and a rest rule of train operation based on the transfer rule, wherein the attendance time of the early shift and the middle shift are overlapped, and the attendance time of the middle shift and the late shift are overlapped;

constructing a first constraint condition of an initial intersection table based on the attendance time point, the time period, the train operation rule and the rest rule, and constructing a plurality of intersections by splicing and combining the passenger operation fragments in the passenger operation fragment set based on the first constraint condition to obtain an intersection set; the step of constructing a plurality of intersections by splicing and combining the multiplication operation fragments in the multiplication operation fragment set based on the first constraint condition, and the step of obtaining an intersection set comprises the following steps: acquiring the actual attendance time place of the crew member, and adjusting a first constraint condition based on the actual attendance place to obtain a traffic constraint condition; sequentially taking the multiplication operation fragments in the multiplication operation fragment set as a traffic route starting point, and respectively constructing traffic routes with the rest multiplication operation fragments in the multiplication operation fragment set; judging whether each intersection meets the limitation of the intersection constraint condition or not; if yes, connecting the intersecting paths with the same multiplication operation fragments in the intersecting paths to generate an intersecting path tree structure, and converting the intersecting path tree structure into an intersecting path set;

Judging whether each intersection in the intersection set reaches the limit of the intersection constraint condition or not; if not, adding marking information on the corresponding intersection;

determining a target strategy based on the requirement of a user, generating a target function according to the target strategy, and constructing an optimization model according to the target function and a preset intersection table meeting rate constraint condition, wherein the target strategy comprises a strategy with the priority of the intersection number and a strategy with the priority of the meeting rate, and the target function comprises a target coefficient and a target value;

carrying out integer linear programming modeling solution on the optimization model to obtain an optimal solution, wherein the integer linear programming modeling comprises variable modeling, constraint condition modeling and objective function modeling, the variable modeling is to take the intersection with the marking information in an intersection set as a variable, the objective function modeling is to target coefficient modeling and objective value modeling, and the constraint condition modeling is to set the number of the intersections with no duplication and no deletion of a passenger operation fragment, the difference of the number of the intersections of the early shift and the late shift, the insufficient driving mileage and the insufficient continuous driving duration; the target value modeling includes: if the target policy is a policy with priority to the number of routes, the target coefficient is a first threshold value a, and the corresponding objective function is:

If the target policy is a meeting rate priority policy, the target function corresponding to the target coefficient being the second threshold B is: />

Each intersection->

The number of unsatisfied items is defined as +.>

；

2. The method for generating a passenger shift schedule according to claim 1, wherein the steps of obtaining an operation schedule of a train and constructing a passenger work fragment set based on the operation schedule include:

3. The method for generating a traffic shift intersection table according to claim 1, wherein the step of connecting intersections having identical traffic segments among the intersections to each other to generate an intersection tree structure, and converting the intersection tree structure into an intersection set, comprises:

4. The method for generating a traffic shift intersection table according to claim 3, wherein after the traffic segments using the same class number are allocated to the corresponding threads for intersection processing to generate the intersection tree structure, further comprising:

5. The method for generating a shift-by-duty intersection table according to claim 1, wherein the determining a target policy based on the user's requirement, generating a target function according to the target policy, and determining an optimization model according to the target function and a preset intersection table satisfaction rate constraint condition, comprises:

6. The method for generating a passenger shift-out-of-way table according to claim 1 or 2, wherein after screening out the way meeting the evaluation index of the way-out-of-way table from the way-out set according to the optimal solution and constructing the passenger shift-out-of-way table based on the screened out-of-way, further comprising:

7. The utility model provides a take advantage of business class board generation device of taking advantage of, its characterized in that, take advantage of business class board generation device of taking advantage of includes:

The combination module is used for acquiring a duty system of a crew member and a transfer rule of a train, calculating duty time points and time periods of the crew member in the early shift, the middle shift and the late shift based on the duty system, and determining a rule for running the train and a rest rule based on the transfer rule, wherein the duty time of the early shift and the duty time of the middle shift are overlapped, and the duty time of the middle shift and the duty time of the late shift are overlapped; constructing a first constraint condition of an initial intersection table based on the attendance time point, the time period, the train operation rule and the rest rule, and constructing a plurality of intersections by splicing and combining the passenger operation fragments in the passenger operation fragment set based on the first constraint condition to obtain an intersection set; the step of constructing a plurality of intersections by splicing and combining the multiplication operation fragments in the multiplication operation fragment set based on the first constraint condition, and the step of obtaining an intersection set comprises the following steps: acquiring the actual attendance time place of the crew member, and adjusting a first constraint condition based on the actual attendance place to obtain a traffic constraint condition; sequentially taking the multiplication operation fragments in the multiplication operation fragment set as a traffic route starting point, and respectively constructing traffic routes with the rest multiplication operation fragments in the multiplication operation fragment set; judging whether each intersection meets the limitation of the intersection constraint condition or not; if yes, connecting the intersecting paths with the same multiplication operation fragments in the intersecting paths to generate an intersecting path tree structure, and converting the intersecting path tree structure into an intersecting path set; judging whether each intersection in the intersection set reaches the limit of the intersection constraint condition or not; if not, adding marking information on the corresponding intersection;

The computing module is used for determining a target strategy based on the requirement of a user, generating a target function according to the target strategy, and constructing an optimization model according to the target function and a preset intersection table meeting rate constraint condition; the integer linear programming modeling is carried out on the optimization model to obtain an optimal solution, wherein the target strategy comprises a strategy with the priority of the number of the traffic routes and a strategy with the priority of the satisfaction rate, the target function comprises a target coefficient and a target value, the integer linear programming modeling comprises variable modeling, constraint condition modeling and target function modeling, the variable modeling is to take the traffic routes with the marking information in a traffic route set as a variable, the target function modeling is to take the target coefficient modeling and the target value modeling, and the constraint condition modeling is to set the number of the traffic routes with the non-repeated missing of the traffic operation fragments, the difference of the number of the traffic routes with the early shift and the late shift, the insufficient driving mileage and the insufficient continuous driving duration; the target value modeling includes: if the target policy is a policy with priority to the number of routes, the target coefficient is a first threshold value a, and the corresponding objective function is:

if the target policy is a meeting rate priority policy, the target function corresponding to the target coefficient being the second threshold B is:

Each intersection->

The number of unsatisfied items is defined as +.>

；

8. An electronic device, the electronic device comprising: a memory and at least one processor, the memory having instructions stored therein, the memory and the at least one processor being interconnected by a line;

the at least one processor invoking the instructions in the memory to cause the electronic device to perform the steps of the method of generating a multiplication shift schedule of any of claims 1-6.

9. A computer readable storage medium having stored thereon a computer program, which when executed by a processor performs the steps of the method for generating a passenger shift switching table according to any of claims 1-6.