CN102930399A - Scheduling method of subway attendant management system - Google Patents
Scheduling method of subway attendant management system Download PDFInfo
- Publication number
- CN102930399A CN102930399A CN 201210440943 CN201210440943A CN102930399A CN 102930399 A CN102930399 A CN 102930399A CN 201210440943 CN201210440943 CN 201210440943 CN 201210440943 A CN201210440943 A CN 201210440943A CN 102930399 A CN102930399 A CN 102930399A
- Authority
- CN
- China
- Prior art keywords
- driver
- cross
- channel
- task
- execution
- Prior art date
- Legal status (The legal status is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the status listed.)
- Pending
Links
Images
Landscapes
- Management, Administration, Business Operations System, And Electronic Commerce (AREA)
Abstract
The invention discloses a scheduling method of a subway attendant management system. The scheduling method includes the following steps: step 101, arranging a scheduling cycle and a scheduling rule; step 102, adding routing table data in the scheduling cycle; step 103, adding all subway numbers in a subway number collection U and adding all routings in a task collection T; step 104, circulating the scheduling cycle and stopping the circulation if the scheduling cycle is completed; step 105, judging whether the routing Ti of the same day is empty and returning to the step 104 if the judged result is yes; step 106, arranging the routing Ti to a subway number Uj according to the scheduling rule, enabling i to be equal to i + 1 and j to be equal to j + 1, and returning to the step 105. According to the scheduling method of the subway attendant management system, attendant scheduling can be achieved by leading in a time table, operation is easy, errors cannot happen easily, and safe management of a subway is achieved.
Description
Technical field
The present invention relates to the subway technical field of arranging an order according to class and grade, relate in particular to a kind of scheduling method of subway crewing management system.
Background technology
Progress and industrial expansion along with science and technology, the volume of traffic increases sharply in the city, urban public transport is the artery of urban society's economic activity, it is the important component part of urban society and economic activity, being the public basic installations of the city necessity of depending on for existence, also is the basic goods and materials condition that City Investment Environment and socialization are produced.Industrial development is more and more for the various vehicles that urban transportation provides, and subway is the direction of city traffic development, and is the key of public transport development, and subway has advantages of that capacity is large, speed is fast, the time is accurate, do not disturb traffic above-ground.
The start a work shift formulation of plan of existing service on buses or trains driver needs manually to formulate various service on buses or trains cross-channels according to timetable, then cross-channel is being distributed to each driver, forms the service on buses or trains plan.Increase the weight of the personnel's of arranging an order according to class and grade workload by manual mode, and easily cause makeing mistakes, also be difficult to guarantee for the correctness of distributing.
Summary of the invention
The technical problem to be solved in the present invention is, manually forms the service on buses or trains plan according to timetable for prior art, and the with heavy work load and defective of easily makeing mistakes etc. provides a kind of scheduling method of subway crewing management system.
The technical solution adopted for the present invention to solve the technical problems is: a kind of scheduling method of subway crewing management system is provided, may further comprise the steps:
S101, arrange an order according to class and grade cycle and the rule of arranging an order according to class and grade are set;
S102, loading are positioned at the cross-channel table data in the cycle of arranging an order according to class and grade;
S103, organic class of institute is loaded among the set U of machine class, all cross-channels are loaded among the set of tasks T;
S104, cyclic scheduling cycle, whether the cycle of arranging an order according to class and grade finishes, if then finish; If not, execution in step S105 then;
S105, judgement cross-channel T on the same day
iWhether be empty, if then return step S104; If not, execution in step S106 then;
S106, according to the rule of arranging an order according to class and grade, with cross-channel T
iArrangement is to the U of machine class
j, make i=i+1, j=j+1, and return step S105.
Preferably, step S106 specifically may further comprise the steps:
S1061, plan cross-channel T
iArrangement is to the U of machine class
j
S1062, the traversal rule of arranging an order according to class and grade check whether meet the demands, if, execution in step S1064 then; If not, execution in step S1063 then;
S1063, adjustment cross-channel task, and return step S1061;
S1064, with cross-channel T
iArrangement is to the U of machine class
j, make i=i+1, j=j+1, and return step S105.
Preferably, the described rule of arranging an order according to class and grade comprises the time of having a rest between order of classes or grades at school, order, needs arrange to replace the meal cross-channel and/or ignore the inspection of machine class deficiency in shifts.
Preferably, generating cross-channel table data may further comprise the steps:
S201, line parameter circuit value is set and imports timetable;
S202, set up cross-channel set M, set of tasks D to be allocated and the allocating task driver gather P; Task among the set of tasks D to be allocated according to train number time of departure from arriving first laggard line ordering;
S203, judge that whether set of tasks D to be allocated is empty, if, execution in step S212 then; If not, execution in step step S204 then;
S204, select task K among the set of tasks D to be allocated in order, and under the calculation task K cross-channel and under order of classes or grades at school;
S205, judge that the website that sets out of task K is whether identical with changing shifts website in the affiliated cross-channel, if the driver that then will satisfy the changing shifts condition is designated and moves back duty;
S206, check the allocating task driver gathers whether the driver that can be connected task K is arranged among the P, if having, execution in step S209 then; If not, execution in step S207 then;
S207, judge whether set out website and the departure time of task K satisfy for the meal condition, if then gathering allocating task driver increases a fresh driver and be used for being designated and moving back duty for meal among the P, and increases corresponding cross-channel information in cross-channel set M; If not, gathering allocating task driver increases a fresh driver among the P, and increases corresponding cross-channel information in cross-channel set M;
S208, by bus parameter is set, and execution in step S210;
Whether S209, driver arrive the time of changing shifts point more than or equal to the interval of service, if not, then gather allocating task driver and upgrade this driver information among the P, and described task K is increased to this driver in cross-channel information corresponding to cross-channel set M, execution S211; If, identify this driver for moving back duty, gathering allocating task driver increases a fresh driver among the P, and increases corresponding cross-channel information in cross-channel set M;
S210, in cross-channel set M, increase task K;
S211, task K have assigned, and execution in step S203;
S212, by bus carriage return factory parameter is set, and finishes.
Preferably, described allocating task driver gathers among the P driver information and comprises under cross-channel number, the current train number cross-channel, affiliated order of classes or grades at school, current arrival website, current time of arrival and whether moved back duty.
Preferably, described changing shifts condition is, gathers among the P allocating task driver, finds out all current arrival websites driver information identical with the website that sets out of task K, if the departure time of task K, then this driver satisfied the changing shifts condition more than or equal to the interval of service of order of classes or grades at school under this driver.
Preferably, describedly for the meal condition be, the rest website of website for having dinner that set out of task K, and the departure time in the mealtime of affiliated order of classes or grades at school scope, and the allocating task driver has gathered and has not had the driver that can be connected among the P; Affiliated order of classes or grades at school condition is that according to first train number start time calculating in the corresponding cross-channel set of driver, if first train number " middle class in a kindergarten is succeeded the time " before, what then carry out is morning, in like manner draws the middle class in a kindergarten and night shift.
Preferably, judging whether task K can be connected need to meet the following conditions simultaneously:
A, judge that the allocating task driver gathers the website that sets out that the current arrival the website whether driver is arranged among the P equals task K, current time of arrival is early than the departure time of task K, and the allocating task driver gathers P and do not move back duty;
B, judge the scheduling model of this circuit, if the current affiliated cross-channel that " cross-channel is arranged an order according to class and grade respectively " needs to judge the driver whether with task K under cross-channel consistent, only have consistent could the linking; If " cross-channel mixed composition " then ignores this condition;
C, calculate the driver's number that meets above condition, driver the earliest is connected task K if driver's number, is then selected current time of arrival greater than the number of turning back that this website of task K time period of living in requires.
Preferably, step S208 specifically may further comprise the steps:
S2081, judge task K the website that sets out whether for turning out for work a little, if, execution in step S210 then;
S2082, judge whether need to calculate the by bus train number of turning out for work, if not, execution in step S210 then;
S2083, in cross-channel set M, increase by bus train number in the set of corresponding cross-channel, get nearest one time from a train number that arrives task K website of turning out for work, and execution in step S210.
Preferably, described step S212 specifically may further comprise the steps:
S2121, judge whether to calculate by bus carriage return factory train number, if not, execution in step S2124 then; If, execution in step S2122 then;
S2122, do not move back last train number of diligent driver and arrive website and whether move back diligent point, if, execution in step S2124 then; As no, execution in step S2123 then;
S2123, in the set of the train number of cross-channel, increase the nearest train number that moves back diligent point for a time, be designated by bus;
S2124, all be not designated and move back duty moving back diligent driver;
S2125, according to the information of turning out for work of each bar cross-channel of calculation of parameter.
Implement the scheduling method of subway crewing management system of the present invention, have following beneficial effect: by importing timetable, can finish service on buses or trains and arrange an order according to class and grade, easy and simple to handle, and be difficult for makeing mistakes, realize the safety management to subway.
Description of drawings
In order to be illustrated more clearly in the technical scheme of the embodiment of the invention, the accompanying drawing of required use was done simple the introduction during the below will describe embodiment, obviously, accompanying drawing in the following describes only is some embodiments of the present invention, for those of ordinary skills, under the prerequisite of not paying creative work, can also obtain according to these accompanying drawings other accompanying drawing, in the accompanying drawing:
Fig. 1 is the overall procedure schematic diagram of the scheduling method embodiment of subway crewing management system of the present invention;
Fig. 2 is the service on buses or trains of the scheduling method embodiment of the subway crewing management system of the present invention schematic diagram of arranging an order according to class and grade;
Fig. 3 is the service on buses or trains of the scheduling method embodiment of the subway crewing management system of the present invention complete diagram of arranging an order according to class and grade;
Fig. 4 is the cross-channel schematic flow sheet of the scheduling method embodiment of subway crewing management system of the present invention;
Fig. 5 is the cross-channel entire flow schematic diagram of the scheduling method embodiment of subway crewing management system of the present invention.
Embodiment
In order to make purpose of the present invention, technical scheme and advantage clearer, the various embodiment that hereinafter will describe will be with reference to corresponding accompanying drawing, these accompanying drawings have consisted of the part of embodiment, have wherein described and have realized the various embodiment that the present invention may adopt.Should understand, also can use other embodiment, the embodiment that perhaps this paper is enumerated carries out the modification on the 26S Proteasome Structure and Function, and can not depart from the scope and spirit of the present invention.
As shown in Figure 1, in the process of arranging an order according to class and grade of subway crew management, data are many and process is numerous and diverse, and most important step mainly comprises generation cross-channel table and service on buses or trains shift report after simplifying.Wherein, import subway timetable data, cross-channel and station data, and after the cross-channel parameter is set, by the train operation route algorithm, generating cross-channel table data; Further add driver's data and fleet's data, by the operation service on buses or trains algorithm of arranging an order according to class and grade, generate the service on buses or trains shift report, draw the shift report of whole subway service on buses or trains.
In the scheduling method embodiment of a kind of subway crewing management system provided by the invention, as shown in Figure 2, may further comprise the steps:
S101, arrange an order according to class and grade cycle and the rule of arranging an order according to class and grade are set; Wherein, the cycle of arranging an order according to class and grade is generally one month, certainly also can adjust as required, such as two weeks etc.
S102, loading are positioned at the cross-channel table data in the cycle of arranging an order according to class and grade; Wherein, cross-channel table data communication device is crossed the cross-channel algorithm and is generated, and concrete generative process sees aftermentioned for details.The cross-channel table mainly describe the driver train number on duty, go out to move back diligent place and train number, go out to move back diligent time, man-hour, mealtime, the information such as the cross-channel number of handing over to the next shift.Cross-channel is driver's train number on duty, is the combination of the train number that starts of driver, the path that forms in a certain order.Because the requirement of travelling of subway train, the driver can not drive twice train (requiring lounge every 7 minutes such as the centre) continuously; Therefore driver's row on duty can not be continuous inferior number.(every time time on duty of driver is generally in 1 hour).
S103, organic class of institute is loaded among the set U of machine class, all cross-channels are loaded among the set of tasks T; Wherein, all tasks among the set of tasks T sort according to attendance time, come at last for the meal cross-channel; In addition, also need fleet under organic class of institute is loaded among the set Q of fleet, the last issue that the set Q of this fleet comprises this fleet last 1 day order of classes or grades at school of arranging an order according to class and grade, same, the set U of machine class also comprise this machine class last last 1 task of arranging an order according to class and grade order of classes or grades at school and turn out for work sequentially.Machine class refers to the general designation to the single driver on duty that reaches the standard grade, and a machine class generally forms (forming a machine class by two or more people when by driver student the time) by a driver.
S104, cyclic scheduling cycle, whether the judgement cycle of arranging an order according to class and grade finishes, if then finish; Namely need the every day in the cyclic scheduling cycle, begin to last day from first day, when the cycle of arranging an order according to class and grade all finishes, can finish to arrange an order according to class and grade, generate the service on buses or trains shift report.If not, then proceed the step of back, execution in step S105.
S105, judgement cross-channel T on the same day
iWhether be empty, if then return step S104; If not, execution in step S106 then; Wherein, i is illustrated in the fate in the cycle of arranging an order according to class and grade.
S106, according to the rule of arranging an order according to class and grade, with cross-channel T
iArrangement is to the U of machine class
j, make i=i+1, j=j+1, and return step S105.Wherein, j represents driver's numbering.
Wherein, arrange an order according to class and grade that rule comprises the time of having a rest between order of classes or grades at school, order, needs arrange to replace the meal cross-channel and/or ignore the inspection of machine class deficiency in shifts.Time of having a rest between order of classes or grades at school, namely driver connects the time that two continuous order of classes or grades at school are had a rest, such as 4 hours etc., if the attendance time of moving back diligent time and next class of a upper class less than this parameter of regularity, then can not be distributed to this driver next.Order in shifts, i.e. driver's order in shifts: early, middle and late, stop, arrange after the order, will be according to the different order of classes or grades at school of this order-assigned to the driver when arranging an order according to class and grade.Need to arrange for the meal cross-channel, namely whether type needs automatically to arrange machine class for the cross-channel for meal.Ignore the inspection of machine class deficiency, if namely select, then can also successfully generate shift report when machine class deficiency, do not have the cross-channel of dispenser class to leave a blank, allow the user process by hand.
By above-mentioned service on buses or trains scheduling method, can automatically generate subway service on buses or trains shift report, this table refers to the train on duty according to " cross-channel table " reasonable arrangement driver, also namely certain number cross-channel in " cross-channel table " specifically is assigned to certain driver, in this method, according to the rule of arranging an order according to class and grade, the driver in the reasonable arrangement machine class.
Fig. 3 is step S 106 refinement expansion figure among Fig. 2, and as shown in Figure 3, step S106 specifically may further comprise the steps:
S1061, plan cross-channel T
iArrangement is to the U of machine class
jHere just hope cross-channel T
iArrangement is to the U of machine class
j, reality does not arrange, and also needs the checking by the rule of arranging an order according to class and grade.
S1062, the traversal rule of arranging an order according to class and grade check whether meet the demands, if, execution in step S1064; If not, execution in step S1063 then;
S1063, adjustment cross-channel task, and return step S1061; Namely arrange new machine class to meet cross-channel T
i
S1064, with cross-channel T
iArrangement is to the U of machine class
j, make i=i+1, j=j+1, and return step S105.
In whole subway service on buses or trains was arranged an order according to class and grade process, it was of paramount importance that cross-channel table data generate, and as shown in Figure 4, cross-channel table data generate and may further comprise the steps:
S201, line parameter circuit value is set and imports timetable; Wherein, line parameter circuit value comprises circuit, the setting of having dinner, changing shifts arrange, rest website and work attendance website etc.Timetable is the demonstration chart directly perceived of train operation situation, and each time train operation is through each station name of station and stop constantly gathering with the form of form.
S202, set up cross-channel set M, set of tasks D to be allocated and the allocating task driver gather P; Task among the set of tasks D to be allocated according to train number time of departure from arriving first laggard line ordering; Wherein, cross-channel set M and allocating task gather D and begin to be sky; The allocating task driver gather each driver information among the P should comprise cross-channel, affiliated order of classes or grades at school, current arrival website, current time of arrival under cross-channel number, the current train number, whether moved back diligent etc.
S203, judge that whether set of tasks D to be allocated is empty, if, execution in step S212 then; If not, execution in step S204 then;
S204, select task K among the set of tasks D to be allocated in order, and under the calculation task K cross-channel and under order of classes or grades at school.
S205, judge that the website that sets out of task K is whether identical with changing shifts website in the affiliated cross-channel, if the driver that then will satisfy the changing shifts condition is designated and moves back duty.Wherein, the changing shifts condition is, gathers among the P allocating task driver, finds out all current arrival websites driver information identical with the website that sets out of task K, if the departure time of task K, then this driver satisfied the changing shifts condition more than or equal to the interval of service of order of classes or grades at school under this driver.
S206, check the allocating task driver gathers whether the driver that can be connected task K is arranged among the P, if having, execution in step S209 then; Wherein, judging whether task K can be connected need to meet the following conditions simultaneously: A, judge that the allocating task driver gathers the website that sets out that the current arrival the website whether driver is arranged among the P equals task K, current time of arrival is early than the departure time of task K, and the allocating task driver gathers P and do not move back duty; B, judge the scheduling model of this circuit, if the current affiliated cross-channel that " cross-channel is arranged an order according to class and grade respectively " needs to judge the driver whether with task K under cross-channel consistent, only have consistent could the linking; If " cross-channel mixed composition " then ignores this condition; C, calculate the driver's number that meets above condition, driver the earliest is connected described task K if driver's number, is then selected current time of arrival greater than the number of turning back that this website of task K time period of living in requires.
S207, judge whether set out website and the departure time of task K satisfy for the meal condition, if then gathering allocating task driver increases a fresh driver and be used for being designated and moving back duty for meal among the P, and increases corresponding cross-channel information in cross-channel set M; If not, gathering allocating task driver increases a fresh driver among the P, and increases corresponding cross-channel information in cross-channel set M.Wherein, for the meal condition be, the rest website of website for having dinner that set out of task K, and the departure time in the mealtime of affiliated order of classes or grades at school scope, and the allocating task driver has gathered and has not had the driver that can be connected among the P; Affiliated order of classes or grades at school condition is that according to first train number start time calculating in the corresponding cross-channel set of driver, if first train number " middle class in a kindergarten is succeeded the time " before, what then carry out is morning, in like manner draws the middle class in a kindergarten and night shift.
S208, by bus parameter is set, and execution in step S210;
Whether S209, driver arrive the time of changing shifts point more than or equal to the interval of service, if not, then gather allocating task driver and upgrade this driver information among the P, and task K is increased to this driver in cross-channel information corresponding to cross-channel set M, carry out S211; If, identify this driver for moving back duty, gathering allocating task driver increases a fresh driver among the P, and increases corresponding cross-channel information in cross-channel set M;
S210, in cross-channel set M, increase task K;
S211, task K have assigned, and execution in step S203;
S212, by bus carriage return factory parameter is set, and finishes.
As shown in Figure 5, step S208 specifically may further comprise the steps:
S2081, judge task K the website that sets out whether for turning out for work a little, if, execution in step S210 then; If not, execution in step S2082 then;
S2082, judge whether need to calculate the by bus train number of turning out for work, if not, execution in step S210 then; If, execution in step S2082 then;
S2083, in cross-channel set M, increase by bus train number in the set of corresponding cross-channel, get nearest one time from a train number that arrives task K website of turning out for work, and execution in step S210.
As shown in Figure 5, step S212 specifically may further comprise the steps:
S2121, judge whether to calculate by bus carriage return factory train number, if not, execution in step S2124 then; If, execution in step S2122 then;
S2122, do not move back last train number of diligent driver and arrive website and whether move back diligent point, if, execution in step S2124 then; If not, execution in step S2123 then;
S2123, in the set of the train number of cross-channel, increase the nearest train number that moves back diligent point for a time, be designated by bus;
S2124, all be not designated and move back duty moving back diligent driver;
S2125, according to the information of turning out for work of each bar cross-channel of calculation of parameter.
The present invention only need import timetable, can finish service on buses or trains and arrange an order according to class and grade, and is easy and simple to handle, and is difficult for makeing mistakes, and realizes the safety management to subway.
After the content that will describe below reading, those skilled in the art should be understood that various feature described herein can realize by method, data handling system or computer program.Therefore, but these feature sections adopt the mode of hardware, all adopt the mode of software or adopt the mode of hardware and software combination to show.In addition, above-mentioned feature also can adopt the form that is stored in the computer program on one or more computer-readable recording mediums to show, comprise computer readable program code section or instruction in this computer-readable recording medium, it is stored in the storage medium.Can use the computer-readable recording medium of any use, comprise the combination of hard disk, CD-ROM, light storage device, magnetic storage apparatus and/or the said equipment.
The above only is preferred embodiment of the present invention, and those skilled in the art know, in the situation that do not break away from the spirit and scope of the present invention, can carry out various changes or be equal to replacement these features and embodiment.In addition, under instruction of the present invention, can make amendment to adapt to concrete situation and material to these features and embodiment and can not break away from the spirit and scope of the present invention.Therefore, the present invention is not subjected to the restriction of specific embodiment disclosed herein, and all interior embodiment of claim scope that fall into the application belong to protection scope of the present invention.
Claims (10)
1. the scheduling method of a subway crewing management system is characterized in that, may further comprise the steps:
S101, arrange an order according to class and grade cycle and the rule of arranging an order according to class and grade are set;
S102, loading are positioned at the cross-channel table data in the described cycle of arranging an order according to class and grade;
S103, organic class of institute is loaded among the set U of machine class, all cross-channels are loaded among the set of tasks T;
S104, described the arranging an order according to class and grade the cycle of circulation, whether the described cycle of arranging an order according to class and grade finishes, if then finish; If not, execution in step S105 then;
S105, judgement cross-channel T on the same day
iWhether be empty, if then return step S104; If not, execution in step S106 then;
S106, according to the described rule of arranging an order according to class and grade, with cross-channel T
iArrangement is to the U of machine class
j, make i=i+1, j=j+1, and return step S105.
2. the scheduling method of subway crewing management system according to claim 1 is characterized in that, described step S106 specifically may further comprise the steps:
S1061, plan cross-channel T
iArrangement is to the U of machine class
j
S1062, the described rule of arranging an order according to class and grade of traversal check whether to meet the demands, if, execution in step S1064 then; If not, execution in step S1063 then;
S1063, adjustment cross-channel task, and return step S1061;
S1064, with cross-channel T
iArrangement is to the U of machine class
j, make i=i+1, j=j+1, and return step S105.
3. the scheduling method of subway crewing management system according to claim 2 is characterized in that, the described rule of arranging an order according to class and grade comprises the time of having a rest between order of classes or grades at school, order, needs arrange to replace the meal cross-channel and/or ignore the inspection of machine class deficiency in shifts.
4. the scheduling method of subway crewing management system according to claim 1 is characterized in that, generates described cross-channel table data and may further comprise the steps:
S201, line parameter circuit value is set and imports timetable;
S202, set up cross-channel set M, set of tasks D to be allocated and the allocating task driver gather P; Task among the described set of tasks D to be allocated according to train number time of departure from arriving first laggard line ordering;
S203, judge that whether described set of tasks D to be allocated is empty, if, execution in step S212 then; If not, execution in step step S204 then;
S204, select task K among the set of tasks D to be allocated in order, and calculate under the described task K cross-channel and under order of classes or grades at school;
S205, judge that the website that sets out of described task K is whether identical with changing shifts website in the affiliated cross-channel, if the driver that then will satisfy the changing shifts condition is designated and moves back duty;
S206, check described allocating task driver gathers whether the driver that can be connected described task K is arranged among the P, if having, execution in step S209 then; If not, execution in step S207 then;
S207, judge whether set out website and the departure time of described task K satisfy for the meal condition, if, then gathering described allocating task driver increases a fresh driver for for meal among the P, be designated and move back duty, and increase corresponding cross-channel information in described cross-channel set M; If not, gather fresh driver of increase among the P described allocating task driver, and in described cross-channel set M, increase corresponding cross-channel information;
S208, by bus parameter is set, and execution in step S210;
Whether S209, described driver arrive the time of changing shifts point more than or equal to the interval of service, if not, then gather described allocating task driver and upgrade this driver information among the P, and described task K is increased to this driver in cross-channel information corresponding to described cross-channel set M, execution in step S211; If, identify this driver for moving back duty, gathering described allocating task driver increases a fresh driver among the P, and increases corresponding cross-channel information in described cross-channel set M;
S210, in described cross-channel set M, increase described task K;
S211, described task K have assigned, and execution in step S203;
S212, by bus carriage return factory parameter is set, and finishes.
5. the scheduling method of subway crewing management system according to claim 4, it is characterized in that, described allocating task driver gathers among the P driver information and comprises under cross-channel number, the current train number cross-channel, affiliated order of classes or grades at school, current arrival website, current time of arrival and whether moved back duty.
6. the scheduling method of subway crewing management system according to claim 4, it is characterized in that, described changing shifts condition is, gather among the P described allocating task driver, find out all current arrival websites driver information identical with the website that sets out of described task K, if the departure time of described task K, then this driver satisfied the changing shifts condition more than or equal to the interval of service of order of classes or grades at school under this driver.
7. the scheduling method of subway crewing management system according to claim 4, it is characterized in that, the described meal condition of replacing is, the rest website of website for having dinner that set out of described task K, and the departure time is in the mealtime of affiliated order of classes or grades at school scope, and described allocating task driver gathers and do not have the driver that can be connected among the P; The order of classes or grades at school condition is under described, and according to first train number start time calculating in the corresponding cross-channel set of driver, if first train number " middle class in a kindergarten is succeeded the time " before, what then carry out is mornig shift, in like manner draws the middle class in a kindergarten and night shift.
8. the scheduling method of subway crewing management system according to claim 4 is characterized in that, judges whether described task K can be connected need to meet the following conditions simultaneously:
A, judge that described allocating task driver gathers the website that sets out that the current arrival the website whether driver is arranged among the P equals described task K, current time of arrival is early than the departure time of described task K, and described allocating task driver gathers P and do not move back duty;
B, judge the scheduling model of this circuit, if the current affiliated cross-channel that " cross-channel is arranged an order according to class and grade respectively " needs to judge the driver whether with described task K under cross-channel consistent, only have consistent could the linking; If " cross-channel mixed composition " then ignores this condition;
C, calculate the driver's number that meets above condition, driver the earliest is connected described task K if driver's number, is then selected current time of arrival greater than the number of turning back that this website of described task K time period of living in requires.
9. the scheduling method of subway crewing management system according to claim 4 is characterized in that, described step S208 specifically may further comprise the steps:
S2081, judge task K the website that sets out whether for turning out for work a little, if, execution in step S210 then;
S2082, judge whether need to calculate the by bus train number of turning out for work, if not, execution in step S210 then;
S2083, in described cross-channel set M, increase by bus train number in the set of corresponding cross-channel, get nearest one time from a train number that arrives described task K website of turning out for work, and execution in step S210.
10. the scheduling method of subway crewing management system according to claim 4 is characterized in that, described step S212 specifically may further comprise the steps:
S2121, judge whether to calculate by bus carriage return factory train number, if not, execution in step S2124 then; If, execution in step S2122 then;
S2122, do not move back last train number of diligent driver and arrive website and whether move back diligent point, if, execution in step S2124 then; As no, execution in step S2123 then;
S2123, in the set of the train number of cross-channel, increase the nearest train number that moves back diligent point for a time, be designated by bus;
S2124, all be not designated and move back duty moving back diligent driver;
S2125, according to the information of turning out for work of each bar cross-channel of calculation of parameter.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN 201210440943 CN102930399A (en) | 2012-11-07 | 2012-11-07 | Scheduling method of subway attendant management system |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN 201210440943 CN102930399A (en) | 2012-11-07 | 2012-11-07 | Scheduling method of subway attendant management system |
Publications (1)
| Publication Number | Publication Date |
|---|---|
| CN102930399A true CN102930399A (en) | 2013-02-13 |
Family
ID=47645193
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN 201210440943 Pending CN102930399A (en) | 2012-11-07 | 2012-11-07 | Scheduling method of subway attendant management system |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN102930399A (en) |
Cited By (12)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN104112175A (en) * | 2013-04-17 | 2014-10-22 | 腾讯科技（深圳）有限公司 | Duty arranging method and system |
| CN106372741A (en) * | 2016-08-19 | 2017-02-01 | 中南大学 | Locomotive crew scheduling loop optimization compilation method and apparatus |
| CN106874673A (en) * | 2017-02-17 | 2017-06-20 | 黄国伟 | A kind of hospital's Workforce Management method for designing |
| CN108009720A (en) * | 2017-11-30 | 2018-05-08 | 交控科技股份有限公司 | A kind of method for automatically generating service on buses or trains and sending shift plan |
| CN108229776A (en) * | 2016-12-15 | 2018-06-29 | 平安科技（深圳）有限公司 | One kind is arranged an order according to class and grade method of adjustment and device |
| CN110163501A (en) * | 2019-05-21 | 2019-08-23 | 成都轨道交通集团有限公司 | A kind of system and method for automatic establishment urban track traffic driver's cross-channel table |
| CN110490440A (en) * | 2019-08-05 | 2019-11-22 | 北京交通大学 | Service on buses or trains Routing Scheme and value multiply the optimization method and device of the integrated establishment of plan |
| CN111222660A (en) * | 2018-11-23 | 2020-06-02 | 上海宝信软件股份有限公司 | Rail transit riding traffic generation method and system based on full-line two-dimensional cutting |
| CN111538737A (en) * | 2020-04-21 | 2020-08-14 | 襄阳国铁机电股份有限公司 | Data processing method and device and readable storage medium |
| CN111547113A (en) * | 2020-05-22 | 2020-08-18 | 卡斯柯信号(成都)有限公司 | Automatic scheduling method for subway driver positive line multi-point value multiplication |
| CN111923964A (en) * | 2020-08-14 | 2020-11-13 | 北京交通大学 | Car-buckling method and system based on subway fault and emergency condition |
| CN112990688A (en) * | 2021-03-09 | 2021-06-18 | 陕西金合信息科技股份有限公司 | Flight guarantee automatic scheduling system |
-
2012
- 2012-11-07 CN CN 201210440943 patent/CN102930399A/en active Pending
Cited By (20)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN104112175A (en) * | 2013-04-17 | 2014-10-22 | 腾讯科技（深圳）有限公司 | Duty arranging method and system |
| WO2014169712A1 (en) * | 2013-04-17 | 2014-10-23 | 腾讯科技（深圳）有限公司 | Method and system for scheduling |
| CN106372741A (en) * | 2016-08-19 | 2017-02-01 | 中南大学 | Locomotive crew scheduling loop optimization compilation method and apparatus |
| CN108229776A (en) * | 2016-12-15 | 2018-06-29 | 平安科技（深圳）有限公司 | One kind is arranged an order according to class and grade method of adjustment and device |
| CN106874673A (en) * | 2017-02-17 | 2017-06-20 | 黄国伟 | A kind of hospital's Workforce Management method for designing |
| CN108009720A (en) * | 2017-11-30 | 2018-05-08 | 交控科技股份有限公司 | A kind of method for automatically generating service on buses or trains and sending shift plan |
| CN111222660B (en) * | 2018-11-23 | 2023-09-26 | 上海宝信软件股份有限公司 | Rail transit traffic road generation method and system based on full-line two-dimensional cutting |
| CN111222660A (en) * | 2018-11-23 | 2020-06-02 | 上海宝信软件股份有限公司 | Rail transit riding traffic generation method and system based on full-line two-dimensional cutting |
| CN110163501A (en) * | 2019-05-21 | 2019-08-23 | 成都轨道交通集团有限公司 | A kind of system and method for automatic establishment urban track traffic driver's cross-channel table |
| CN110163501B (en) * | 2019-05-21 | 2022-11-29 | 成都轨道交通集团有限公司 | System and method for automatically compiling driver traffic list of urban rail transit |
| CN110490440B (en) * | 2019-08-05 | 2022-06-17 | 北京交通大学 | Optimization method and device for integrated compilation of riding traffic plan and value-riding plan |
| CN110490440A (en) * | 2019-08-05 | 2019-11-22 | 北京交通大学 | Service on buses or trains Routing Scheme and value multiply the optimization method and device of the integrated establishment of plan |
| CN111538737A (en) * | 2020-04-21 | 2020-08-14 | 襄阳国铁机电股份有限公司 | Data processing method and device and readable storage medium |
| CN111538737B (en) * | 2020-04-21 | 2024-04-12 | 襄阳国铁机电股份有限公司 | Data processing method and device and readable storage medium |
| CN111547113B (en) * | 2020-05-22 | 2022-04-19 | 卡斯柯信号(成都)有限公司 | Automatic scheduling method for subway driver positive line multi-point value multiplication |
| CN111547113A (en) * | 2020-05-22 | 2020-08-18 | 卡斯柯信号(成都)有限公司 | Automatic scheduling method for subway driver positive line multi-point value multiplication |
| CN111923964A (en) * | 2020-08-14 | 2020-11-13 | 北京交通大学 | Car-buckling method and system based on subway fault and emergency condition |
| CN111923964B (en) * | 2020-08-14 | 2021-05-14 | 北京交通大学 | Car-buckling method and system based on subway fault and emergency condition |
| CN112990688A (en) * | 2021-03-09 | 2021-06-18 | 陕西金合信息科技股份有限公司 | Flight guarantee automatic scheduling system |
| CN112990688B (en) * | 2021-03-09 | 2023-08-18 | 陕西金合信息科技股份有限公司 | Automatic scheduling system for flight guarantee |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN102930399A (en) | Scheduling method of subway attendant management system | |
| Motraghi et al. | Analysis of urban freight by rail using event based simulation | |
| Li et al. | Estimating a transit passenger trip origin-destination matrix using automatic fare collection system | |
| Yan et al. | Logistical support scheduling under stochastic travel times given an emergency repair work schedule | |
| Yan et al. | A model with a heuristic algorithm for solving the long-term many-to-many car pooling problem | |
| CN103885817B (en) | Comprehensive intelligent implement plan system and emulation platform | |
| Cao et al. | Robust and optimized urban rail timetabling using a marshaling plan and skip-stop operation | |
| WO2021162200A1 (en) | Diversified and connected vehicle allocation system and method | |
| JP2784330B2 (en) | Automatic dispatching device | |
| CN103839408A (en) | Traffic accident auxiliary processing system and method | |
| Lu et al. | Joint optimal scheduling for a mixed bus fleet under micro driving conditions | |
| CN102538812A (en) | Taboo search simulation optimization system based on dynamic multi-vehicle path plan and method | |
| Tran et al. | Factors affecting intelligent transport systems towards a smart city: A critical review | |
| Hu et al. | Modeling Real-time operations of Metro-based urban underground logistics system network: A discrete event simulation approach | |
| Javanshour et al. | Performance evaluation of station-based autonomous on-demand car-sharing systems | |
| Guedes et al. | Vehicle scheduling problem with loss in bus ridership | |
| EP4220505A1 (en) | System for designing train operation organization plan for rail transit | |
| CN105667546B (en) | A kind of track traffic scheduling method for distributing business, apparatus and system | |
| Jung et al. | Simulation framework for modeling large-scale flexible transit systems | |
| Čertický et al. | Analyzing on-demand mobility services by agent-based simulation | |
| West et al. | Individual and Synergetic Effects of Transit Service Improvement Strategies: Simulation and Validation | |
| Isaksson-Lutteman et al. | OPERATIVE TESTS OFA NEW SYSTEM FOR TRAIN TRAFFIC CONTROL | |
| Kucirek | Comparison between MATSIM & EMME: Developing a dynamic, activity-based microsimulation transit assignment model for Toronto | |
| Li et al. | Dynamic railcar connection planning in classification yards | |
| Yu et al. | A design for a public transport information service in China |
Legal Events
| Date | Code | Title | Description |
|---|---|---|---|
| C06 | Publication | ||
| PB01 | Publication | ||
| C02 | Deemed withdrawal of patent application after publication (patent law 2001) | ||
| WD01 | Invention patent application deemed withdrawn after publication |
Application publication date: 20130213 |