Dispatching method and device for urban rail trains in large and small route modes
By adopting the urban rail train scheduling method with large and small transportation modes in urban rail transit, re-dividing time periods and optimizing continuation solutions, the problem that the existing technology is difficult to meet residents' travel needs is solved, and the uniform distribution and scheduling of train running lines is achieved. Improved efficiency.
Patent Information
- Application Number
- CN202211655809.9
- Authority / Receiving Office
- CN · China
- Patent Type
- Patents(China)
- Current Assignee / Owner
- Filing Date
- 2022-12-21
- Publication Date
- 2024-11-08
- Estimated Expiration
- 2042-12-21
AI Technical Summary
The existing train operation map scheduling strategy is difficult to meet residents' travel needs, especially when the urban rail transit network is expanded and passenger flow is rising, resulting in uneven temporal and spatial distribution during peak hours, making it difficult to effectively dispatch train operations.
The urban rail train dispatch method adopts the large and small transfer mode. By configuring the basic parameters of the train operation chart, re-dividing the peak period, adjusting the continuation plan, optimizing the entry and exit section plan, generating a relief network, reducing retracement conflicts, and ensuring uniform intervals between train operation lines .
By inserting transition periods between peaks, the sudden change in the departure intervals can be reduced, the frequent entry and exit of trains can be reduced, the conflicts between the reversing stations and entrances and exits can be relieved, the uniform interval between train running lines can be ensured, and the scheduling efficiency and quality can be improved.
Smart Images

Figure CN115871750B_ABST
Abstract
Description
Technical Field
[0001] The present disclosure relates to the technical field of train dispatching, and in particular to a dispatching method and device for urban rail trains in large and small route modes. Background Art
[0002] Urban rail transit plays an important role in alleviating urban congestion due to its advantages of large capacity, high speed, high punctuality, safety and comfort. With the gradual expansion of the scale of rail transit lines and the continuous increase in passenger flow in some cities in China, higher requirements have been put forward for the operation and organization of urban rail transit.
[0003] With the continuous expansion of the scale of urban rail transit network, residents' travel demand has shown an increasing trend. Due to the different land use conditions along the lines, residents' travel distribution is more dispersed, and the passenger flow demand during peak hours shows obvious unbalanced temporal and spatial distribution characteristics.
[0004] As one of the core contents in the organization of urban rail transit, the train operation diagram is the basis for crew planning and train dispatching. The train operation diagram specifies the operation route plan, station stop plan, entry and exit plan of each train, as well as the arrival and departure time of each train at each platform.
[0005] The train dispatching strategy based on the train operation diagram in the prior art is difficult to meet the travel needs of residents. Summary of the invention
[0006] The present invention provides a method and device for dispatching urban rail trains in large and small route modes to meet the travel needs of residents.
[0007] According to a first aspect of the present disclosure, a method for scheduling urban rail trains in large and small route modes is provided, comprising:
[0008] Configure basic parameters for train operation diagram compilation;
[0009] Re-dividing the transition period between flat and peak hours according to the basic parameters, and drawing the train operation diagram for each period according to the departure interval;
[0010] According to the train operation diagram, the down line is fixed, the up line is adjusted, and the first connection plan of the train lines in each time period is compiled with the shortest connection time as the goal;
[0011] According to the first connection plan, a second connection plan for the corresponding train lines is generated by compiling in sequence according to time with the goal of minimizing the number of train connections in adjacent time periods and making the train lines uniform;
[0012] According to the train operation diagram, prepare the entry and exit plan of the train operation line;
[0013] A train dispatching method is generated according to the train operation diagram and the entry and exit plan.
[0014] In some embodiments, the basic parameters for configuring the train operation diagram compilation include:
[0015] Set the station set S in the line = {1, 2, ... n, n + 1, n + 2, ... 2n}, the upstream station set S up = {1,2,...n}, the set of downlink stations S down ={n+1,n+2,...2n};
[0016] Set the train departure intervals during peak hours and off-peak hours to H respectively. high and H low , the minimum turnaround time at the turnaround station and the maximum return time
[0017] According to the start and end time of each period, set the morning and off-peak period as The morning peak hours are The peak time is The evening peak period is The evening peak period is
[0018] Set the train's stop time at each station to d n , n∈S, let the running time of the interval be r n ,n∈S.
[0019] In some embodiments, the step of re-dividing the flat-peak transition period according to the basic parameters and drawing the train operation diagram for each period according to the departure interval includes:
[0020] Re-dividing the transition period between the flat and peak periods based on the first preset time length, and generating a corresponding period sequence and departure interval sequence;
[0021] Modify the start time and end time of each off-peak period so that the start time of the off-peak period continues with the latest end time of the transition period newly generated after the end of the previous peak period, and the end time of the off-peak period continues with the earliest start time of the transition period generated forward from the next peak period;
[0022] According to the time period sequence and the departure interval sequence, the train departure time and arrival time are calculated sequentially starting from the departure station. The arrival time of the train at the departure station 1 is recorded as and the departure time is recorded as And meet
[0023]
[0024]
[0025] Where H is the departure interval of the train during the departure period, d1 is the stop time of the train at station 1, and f is the train number;
[0026] According to the arrival time and departure time of the train at the origin station, the arrival time of the train at other stations is calculated in sequence and recorded as and the departure time is recorded as And meet
[0027]
[0028]
[0029] Among them, r i represents the running time of interval i, d i represents the stop time at station i.
[0030] In some embodiments, the fixing of the downlink line, adjusting the uplink line, and compiling a first connection plan for the train lines in each time period with the shortest connection time as the goal according to the train operation diagram includes:
[0031] Traversing each time period, fixing the running line of the side where no train is sent out from the vehicle depot, and continuously shifting the running line in the other direction by the second preset time length to generate a vehicle bottom connection relationship;
[0032] With the goal of minimizing the number of turnaround conflicts and the time required for turnaround, the best translation scheme is found in the generated vehicle bottom connection relationship to generate the first connection scheme for the train line within the time period.
[0033] In some embodiments, the second connection plan for the corresponding train lines is generated according to the first connection plan, with the goal of minimizing the number of train connections in adjacent time periods and uniform train lines, and is compiled in time sequence, including:
[0034] According to the first connection scheme, all time periods of the day are sorted by time to obtain a set of time periods in pairs.
[0035] Traversing the time period set, determining the number of uplink running lines of set element 0 and set element 1, and taking the set element with the smaller number of running lines as the reference time period sequence;
[0036] Traverse the operating lines in the benchmark time sequence, and according to the last stop track and time of operating line i, find another set that satisfies the minimum return time and maximum return time respectively. and The running line with the smallest connection time is selected to connect to running line i.
[0037] In some embodiments, the step of compiling an entry and exit plan of a train line according to the train operation diagram includes:
[0038] Traverse the entire day's running lines, and for the train i without a preceding order, obtain the departure plan of the train i according to the first stop and time of the train, the location of the depot, and the form of the switching track, forming a set O i ;
[0039] For train j without a subsequent sequence, the entry plan of train j is obtained according to the last stop and time of the train, the location of the depot, and the form of the transfer track, forming a set I j ;
[0040] For all trains entering and leaving the section, a plan for their entry and exit is prepared with the goal of minimizing conflicts with return operations.
[0041] In some embodiments, the method for generating a train scheduling according to the train operation diagram and the entry and exit plan includes:
[0042] Based on the train operation diagram, the turnaround station and the connection relationship between the operation lines, a relief network is established for all trains passing through the target station.
[0043] According to a second aspect of the present disclosure, a dispatching device for urban rail trains in large and small route modes is provided, comprising:
[0044] Parameter configuration module, used to configure the basic parameters for the compilation of train operation diagram;
[0045] A time period division module is used to re-divide the flat peak transition period according to the basic parameters and draw the train operation diagram of each time period according to the departure interval;
[0046] A first connection plan generating module is used to fix the down line and adjust the up line according to the train operation diagram, and compile a first connection plan for the train lines in each time period with the shortest connection time as the goal;
[0047] A second connection plan generating module is used to generate a second connection plan for the corresponding train running lines according to the first connection plan, with the goal of minimizing the number of train connection pairs in adjacent time periods and uniform train running lines, and compile them in sequence according to time;
[0048] An entry and exit plan preparation module is used to prepare an entry and exit plan for a train line according to the train operation diagram;
[0049] The scheduling method generation module is used to generate a train scheduling method according to the train operation diagram and the entry and exit plan.
[0050] In a third aspect of the present disclosure, an electronic device is provided, including a memory and a processor, wherein a computer program is stored in the memory, and when the processor executes the program, the method described above is implemented.
[0051] In a fourth aspect of the present disclosure, a computer-readable storage medium is provided, on which a computer program is stored, and when the program is executed by a processor, the method described above is implemented.
[0052] Through the scheduling method for urban rail trains with large and small route modes of the disclosed embodiment, different transition periods can be inserted between flat and peak hours to reduce the frequent entry and exit of trains caused by sudden changes in the departure intervals between flat and peak hours, or the situation where there are fewer running lines after leaving the depot. It can also alleviate the conflict of train running lines at reversing stations or entry and exit stations, and ensure the uniform distribution of train running line intervals. The method has a fast solution time and high solution quality.
[0053] It should be understood that the contents described in the summary of the invention are not intended to limit the key or important features of the embodiments of the present disclosure, nor are they intended to limit the scope of the present disclosure. Other features of the present disclosure will become easily understood through the following description. BRIEF DESCRIPTION OF THE DRAWINGS
[0054] The above and other features, advantages and aspects of the embodiments of the present disclosure will become more apparent with reference to the following detailed description in conjunction with the accompanying drawings. The accompanying drawings are used to better understand the present solution and do not constitute a limitation of the present disclosure. In the accompanying drawings, the same or similar reference numerals represent the same or similar elements, among which:
[0055] Figure 1 A flow chart showing a method for dispatching urban rail trains in large and small route modes according to an embodiment of the present disclosure;
[0056] Figure 2 A block diagram of a dispatching device for urban rail trains in large and small route modes according to an embodiment of the present disclosure is shown;
[0057] Figure 3 A block diagram of an exemplary electronic device capable of implementing embodiments of the present disclosure is shown. DETAILED DESCRIPTION
[0058] In order to make the purpose, technical solution and advantages of the embodiments of the present disclosure clearer, the technical solution in the embodiments of the present disclosure will be clearly and completely described below in conjunction with the drawings in the embodiments of the present disclosure. Obviously, the described embodiments are part of the embodiments of the present disclosure, not all of the embodiments. Based on the embodiments in the present disclosure, all other embodiments obtained by ordinary technicians in this field without creative work are within the scope of protection of the present disclosure.
[0059] In addition, the term "and / or" in this article is only a description of the association relationship between the associated objects, indicating that there can be three relationships. For example, A and / or B can represent: A exists alone, A and B exist at the same time, and B exists alone. In addition, the character " / " in this article generally indicates that the associated objects before and after are in an "or" relationship.
[0060] The present invention discloses a scheduling method for urban rail trains with large and small route modes, which re-divides the transition period between flat and peak hours according to basic parameters and generates a train operation diagram for each period; takes the number of train connection pairs between adjacent periods and the uniform entry and exit of trains as the goal, and sequentially compiles the operation line connection plan for different periods; compiles the entry and exit plan for the operation lines that need to enter and exit the sections; checks the operation diagram conflicts, and establishes a relief network to relieve the conflicts, and generates a scheduling method for urban rail trains to reduce the frequent entry and exit of trains in and out of the depot caused by the sudden change of the departure interval between flat and peak hours, or the situation where trains have fewer operation lines after leaving the depot.
[0061] Specifically, Figure 1 FIG. 1 is a flow chart of a method for dispatching urban rail trains in large and small route modes according to an embodiment of the present disclosure. Figure 1 It can be seen from the figure that the scheduling method for urban rail trains in the large and small route modes of this embodiment may include the following steps:
[0062] S101: Configure basic parameters for compiling train operation diagram.
[0063] S102: Re-divide the peak-offset transition period according to the basic parameters, and draw a train operation diagram for each period according to the departure interval.
[0064] S103: According to the train operation diagram, the down line is fixed, the up line is adjusted, and a first connection plan for the train lines in each time period is compiled with the shortest connection time as the goal.
[0065] S104: Based on the first connection plan, with the goal of minimizing the number of train connections in adjacent time periods and uniform train operation lines, a second connection plan for corresponding train operation lines is compiled in chronological order to generate a second connection plan for the corresponding train operation lines.
[0066] S105: According to the train operation diagram, prepare an entry and exit plan for the train line.
[0067] S106: Generate a train dispatching method according to the train operation diagram and the entry and exit plan.
[0068] The scheduling method for urban rail trains with large and small route modes in the disclosed embodiments can reduce the frequent entry and exit of trains in and out of the depot, or the situation where there are fewer running lines after leaving the depot, caused by the sudden change of the departure intervals in and out of the depot during flat and peak hours by inserting different transition periods between flat and peak hours. It can also alleviate the conflict of train running lines at turnaround stations or entry and exit stations, and ensure the uniform distribution of train running line intervals. The method has a fast solution time and high solution quality.
[0069] The technical solution of the present disclosure is described below with reference to specific examples.
[0070] Specifically, as an optional embodiment of the present disclosure, in the method for generating a scheduling method for urban rail trains with large and small route modes, it is necessary to first configure the basic parameters for the compilation of the train operation diagram. In the process of configuring the basic parameters for the compilation of the train operation diagram, the station set S in the line can be set to be {1, 2, ... n, n + 1, n + 2, ... 2n}, and the up station set S up = {1,2,...n}, the set of downlink stations S down ={n+1,n+2,……2n}; and set the train departure intervals during peak hours and off-peak hours respectively as H high and H low , the minimum turnaround time at the turnaround station and the maximum return time According to the start and end time of each period, set the morning and off-peak period as The morning peak hours are The peak time is The evening peak period is The evening peak period is Set the train's stop time at each station to d n , n∈S, let the running time of the interval be r n ,n∈S.
[0071] By configuring the basic parameters for compiling the train operation diagram, the train operation diagram can be compiled according to the actual situation of flat and peak hours, and the basic parameters for compiling the train operation diagram can be digitized to be applicable to train scheduling in different regions.
[0072] After configuring the basic parameters for the train operation diagram, the flat-peak transition period can be re-divided according to the basic parameters, and the train operation diagram of each period can be drawn according to the departure interval. For example, the transition period between the flat-peak period can be re-divided in units of a first preset time length (for example, 30 minutes), and the corresponding period sequence and departure interval sequence can be generated. Specifically, based on the early flat-peak period Morning rush hour and the departure interval H during peak hours high and H low, in units of 30 minutes, starting from the morning peak Generate transition period forward, the departure interval of transition period is from H high Xiang H low Decrease until it reaches H low Equal, get the time period and its departure interval H tp1 ...H tpi ; Based on the morning peak period The peak time is and the departure interval H during peak hours high and H low , in units of 30 minutes, from the end of the morning peak Generate a transition period backward, and the departure interval of the transition period is from H high Xiang H low Decrease until it reaches H low Equal, get the time period and its departure interval H tp1 ...H tpi ; The time period based on the midday peak is The evening peak period is and the departure interval H during peak hours high and H low , in units of 30 minutes, starting from the evening peak Generate transition period forward, the departure interval of transition period is from H high Xiang H low Decrease until it reaches H low Equal, get the time period and its departure interval H tp1 ...H tpi ; Based on the evening peak period The evening peak period is and the departure interval H during peak hours high and H low , in units of 30 minutes, from the end of the evening peak Generate a transition period backward, and the departure interval of the transition period is from H high Xiang H low Decrease until it reaches H low Equal, get the time period and its departure interval H tp1 ...H tpi .
[0073] Then modify the start and end time of each off-peak period so that the start time of the off-peak period continues with the latest end time of the newly generated transition period after the end of the previous peak period, and the end time of the off-peak period continues with the earliest start time of the transition period generated forward from the next peak period. In this way, the re-divided transition periods can be connected.
[0074] Afterwards, the train departure time and arrival time are calculated sequentially from the departure station according to the time period sequence and the departure interval sequence. The arrival time of the train at the departure station 1 is recorded as and the departure time is recorded as And meet
[0075]
[0076]
[0077] Among them, H is the departure interval of the train during the departure period, d1 is the stop time of the train at station 1, and f is the train number. In this way, the operation schedule of a train can be obtained.
[0078] And, according to the arrival time and departure time of the train at the origin station, the arrival time of the train at other stations is calculated in sequence and recorded as and the departure time is recorded as And meet
[0079]
[0080]
[0081] Among them, r i represents the running time of interval i, d i In this way, the operation schedule of all vehicles on a train line, i.e., the train operation diagram, can be obtained.
[0082] Through the above process, the running time of all vehicles on a train line can be determined, so that the trains can transition evenly between flat peaks and peaks.
[0083] After the train operation diagram is generated, the down line can be fixed and the up line can be adjusted according to the train operation diagram, so as to prepare the first connection plan of the train lines in each time period with the shortest connection time as the goal.
[0084] Specifically, it is possible to traverse each time period, fix the running line on the side where no train is sent out from the vehicle depot, and continuously shift the running line in the other direction at a second preset time length (for example, 5S) to generate a vehicle bottom connection relationship; with the goal of minimizing the number of turnaround conflicts and the minimum turnaround time, find the best shifting plan in the generated vehicle bottom connection relationship to generate the first connection plan for the train running line within the time period.
[0085] Through the above process, the number of return conflicts can be reduced and the return time can be minimized.
[0086] After generating the first connection plan, you can further generate a second connection plan for the corresponding train running lines based on the first connection plan, with the goal of minimizing the number of train connections in adjacent time periods and making the train running lines uniform, and compile it in chronological order.
[0087] Specifically, according to the first connection scheme, all time periods of the day can be sorted by time to obtain a set of time periods in pairs.
[0088] Traversing the time period set, determining the number of uplink running lines of set element 0 and set element 1, and taking the set element with the smaller number of running lines as the reference time period sequence;
[0089] Traverse the operating lines in the benchmark time sequence, and according to the last stop track and time of operating line i, find another set that satisfies the minimum return time and maximum return time respectively. and The running line with the smallest connection time is selected to connect to running line i.
[0090] Through the above process, the connection time of the generated running line can be minimized within a time period (such as a peak period or an off-peak period), thereby improving the train running efficiency.
[0091] After generating a train operation diagram in a single time period, the entry and exit plan of the train line can be compiled according to the train operation diagram. Specifically, the whole-day operation line can be traversed according to the time period, and for a train i without a preceding sequence, the exit plan of the train i can be obtained according to the first stop and time of the train, the location of the depot, and the form of the switching track, forming a set O i For train j without a subsequent sequence, the entry scheme of train j is obtained according to the last stop and time of the train, the location of the depot, and the form of the switching track, forming a set I j ; For all trains entering and leaving the section, a plan for their entry and exit is prepared with the goal of minimizing conflicts with return operations.
[0092] Through the above process, the conflicts of train turnaround operations during the whole day's operation can be minimized.
[0093] After generating the train operation diagram for the entire day's operation time, a relief network can be established for all trains passing through the target station based on the train operation diagram, the turnaround station and the connection relationship between the operation lines.
[0094] Through the above method, the conflicts in train operation during the whole day's operation are minimized.
[0095] It should be noted that, for the aforementioned method embodiments, for the sake of simplicity, they are all described as a series of action combinations, but those skilled in the art should be aware that the present disclosure is not limited by the order of the actions described, because according to the present disclosure, certain steps can be performed in other orders or simultaneously. Secondly, those skilled in the art should also be aware that the embodiments described in the specification are all optional embodiments, and the actions and modules involved are not necessarily required by the present disclosure.
[0096] The above is an introduction to the method embodiment. The following is a further explanation of the scheme disclosed in the present invention through an apparatus embodiment.
[0097] Figure 2 FIG. 1 is a block diagram of a dispatching device for urban rail trains in large and small route modes according to an embodiment of the present disclosure. Figure 2 As shown, the device comprises:
[0098] Parameter configuration module 201, used to configure basic parameters for train operation diagram compilation;
[0099] The time period division module 202 is used to re-divide the peak-peak transition period according to the basic parameters and draw the train operation diagram of each period according to the departure interval;
[0100] The first connection plan generating module 203 is used to fix the down line and adjust the up line according to the train operation diagram, and compile the first connection plan of the train lines in each time period with the shortest connection time as the goal;
[0101] The second connection plan generating module 204 is used to generate a second connection plan for the corresponding train running lines according to the first connection plan, with the goal of minimizing the number of train connections in adjacent time periods and uniform train running lines, and compile them in sequence according to time;
[0102] An entry and exit plan preparation module 205 is used to prepare an entry and exit plan for a train line according to the train operation diagram;
[0103] The scheduling method generation module 206 is used to generate a train scheduling method according to the train operation diagram and the entry and exit plan.
[0104] Those skilled in the art can clearly understand that, for the convenience and brevity of description, the specific working process of the described module can refer to the corresponding process in the aforementioned method embodiment, and will not be repeated here.
[0105] In the technical solution disclosed herein, the acquisition, storage and application of user personal information involved are in compliance with the provisions of relevant laws and regulations and do not violate public order and good morals.
[0106] According to an embodiment of the present disclosure, the present disclosure also provides an electronic device, a readable storage medium and a computer program product.
[0107] Figure 3 A schematic block diagram of an electronic device 300 that can be used to implement an embodiment of the present disclosure is shown. The electronic device is intended to represent various forms of digital computers, such as laptop computers, desktop computers, workstations, personal digital assistants, servers, blade servers, mainframe computers, and other suitable computers. The electronic device can also represent various forms of mobile devices, such as personal digital processing, cellular phones, smart phones, wearable devices, and other similar computing devices. The components shown herein, their connections and relationships, and their functions are merely examples and are not intended to limit the implementation of the present disclosure described and / or required herein.
[0108] The electronic device 300 includes a computing unit 301, which can perform various appropriate actions and processes according to a computer program stored in a ROM 302 or a computer program loaded from a storage unit 308 into a RAM 303. In the RAM 303, various programs and data required for the operation of the electronic device 300 can also be stored. The computing unit 301, the ROM 302, and the RAM 303 are connected to each other via a bus 304. An I / O interface 305 is also connected to the bus 304.
[0109] A number of components in the electronic device 300 are connected to the I / O interface 305, including: an input unit 306, such as a keyboard, a mouse, etc.; an output unit 307, such as various types of displays, speakers, etc.; a storage unit 308, such as a disk, an optical disk, etc.; and a communication unit 309, such as a network card, a modem, a wireless communication transceiver, etc. The communication unit 309 allows the electronic device 300 to exchange information / data with other devices through a computer network such as the Internet and / or various telecommunication networks.
[0110] The computing unit 301 may be a variety of general and / or special processing components with processing and computing capabilities. Some examples of the computing unit 301 include, but are not limited to, a central processing unit (CPU), a graphics processing unit (GPU), various dedicated artificial intelligence (AI) computing chips, various computing units running machine learning model algorithms, digital signal processors (DSPs), and any appropriate processors, controllers, microcontrollers, etc. The computing unit 301 performs the various methods and processes described above, such as the scheduling method of the urban rail train of the large and small cross-road mode. For example, in some embodiments, the scheduling method of the urban rail train of the large and small cross-road mode may be implemented as a computer software program, which is tangibly contained in a machine-readable medium, such as a storage unit 308. In some embodiments, part or all of the computer program may be loaded and / or installed on the electronic device 300 via ROM302 and / or the communication unit 309. When the computer program is loaded into RAM303 and executed by the computing unit 301, one or more steps of the scheduling method of the urban rail train of the large and small cross-road mode described above may be executed. Alternatively, in other embodiments, the computing unit 301 may be configured to execute the scheduling method for urban rail trains in large and small route modes in any other appropriate manner (for example, by means of firmware).
[0111] Various implementations of the systems and techniques described above herein can be implemented in digital electronic circuit systems, integrated circuit systems, field programmable gate arrays (FPGAs), application specific integrated circuits (ASICs), application specific standard products (ASSPs), systems on chips (SOCs), load programmable logic devices (CPLDs), computer hardware, firmware, software, and / or combinations thereof. These various implementations can include: being implemented in one or more computer programs that can be executed and / or interpreted on a programmable system including at least one programmable processor, which can be a special purpose or general purpose programmable processor that can receive data and instructions from a storage system, at least one input device, and at least one output device, and transmit data and instructions to the storage system, the at least one input device, and the at least one output device.
[0112] The program code for implementing the method of the present disclosure may be written in any combination of one or more programming languages. These program codes may be provided to a processor or controller of a general-purpose computer, a special-purpose computer, or other programmable data processing device, so that the program code, when executed by the processor or controller, enables the functions / operations specified in the flow chart and / or block diagram to be implemented. The program code may be executed entirely on the machine, partially on the machine, partially on the machine and partially on a remote machine as a stand-alone software package, or entirely on a remote machine or server.
[0113] In the context of the present disclosure, a machine-readable medium may be a tangible medium that may contain or store a program for use by or in conjunction with an instruction execution system, device, or equipment. A machine-readable medium may be a machine-readable signal medium or a machine-readable storage medium. A machine-readable medium may include, but is not limited to, an electronic, magnetic, optical, electromagnetic, infrared, or semiconductor system, device, or equipment, or any suitable combination of the foregoing. A more specific example of a machine-readable storage medium may include an electrical connection based on one or more lines, a portable computer disk, a hard disk, a random access memory (RAM), a read-only memory (ROM), an erasable programmable read-only memory (EPROM or flash memory), an optical fiber, a portable compact disk read-only memory (CD-ROM), an optical storage device, a magnetic storage device, or any suitable combination of the foregoing.
[0114] To provide interaction with a user, the systems and techniques described herein can be implemented on a computer having: a display device for displaying information to the user; and a keyboard and a pointing device (e.g., a mouse or trackball) through which the user can provide input to the computer. Other types of devices can also be used to provide interaction with the user; for example, the feedback provided to the user can be any form of sensory feedback (e.g., visual feedback, auditory feedback, or tactile feedback); and input from the user can be received in any form (including acoustic input, voice input, or tactile input).
[0115] The systems and techniques described herein may be implemented in a computing system that includes back-end components (e.g., as a data server), or a computing system that includes middleware components (e.g., an application server), or a computing system that includes front-end components (e.g., a user computer with a graphical user interface or a web browser through which a user can interact with implementations of the systems and techniques described herein), or a computing system that includes any combination of such back-end components, middleware components, or front-end components. The components of the system may be interconnected by any form or medium of digital data communication (e.g., a communication network). Examples of communication networks include: a local area network (LAN), a wide area network (WAN), and the Internet.
[0116] A computer system may include a client and a server. The client and the server are generally remote from each other and usually interact through a communication network. The relationship of client and server is generated by computer programs running on respective computers and having a client-server relationship with each other. The server may be a cloud server, a server of a distributed system, or a server combined with a blockchain.
[0117] It should be understood that the various forms of processes shown above can be used to reorder, add or delete steps. For example, the steps recorded in this disclosure can be executed in parallel, sequentially or in different orders, as long as the desired results of the technical solutions disclosed in this disclosure can be achieved, and this document does not limit this.
[0118] The above specific implementations do not constitute a limitation on the protection scope of the present disclosure. It should be understood by those skilled in the art that various modifications, combinations, sub-combinations and substitutions can be made according to design requirements and other factors. Any modification, equivalent substitution and improvement made within the spirit and principle of the present disclosure shall be included in the protection scope of the present disclosure.
Claims
1. A method for dispatching urban rail trains in large and small route modes, characterized in that: include: Configure basic parameters for train operation diagram compilation; The basic parameters for configuring the train operation diagram include: setting the station set S = {1, 2, ... n, n + 1, n + 2, ... 2n} in the line, the up station set Sup = {1, 2, ... n}, the down station set S down ={n+1,n+2,……2n}; Set the train departure intervals during peak hours and off-peak hours to be H respectively high and H low , the minimum turnaround time at the turnaround station and the maximum return time According to the start and end time of each period, set the morning and off-peak period as The morning peak hours are The peak time is The evening peak period is The evening peak period is Set the train's stop time at each station to d n , n∈S, let the running time of the interval be r n ,n∈S; Re-dividing the flat-peak transition period according to the basic parameters, and drawing the train operation diagram of each period according to the departure interval; the re-dividing the flat-peak transition period according to the basic parameters, and drawing the train operation diagram of each period according to the departure interval, includes: re-dividing the transition period between the flat-peak periods in units of a first preset time length, generating a corresponding time period sequence and a departure interval sequence; modifying the start time and end time of each flat-peak period, so that the start time of the flat-peak period continues the latest end time of the transition period newly generated after the end of the previous peak period, and the end time of the flat-peak period continues the earliest start time of the transition period generated forward from the next peak period; according to the time period sequence and the departure interval sequence, the train departure time and arrival time are sequentially calculated starting from the departure station, and the arrival time of the train at the departure station 1 is recorded as and the departure time is recorded as And meet Among them, H is the departure interval of the train, d1 is the stop time of the train at station 1, and f is the train number; according to the arrival time and departure time of the train at the departure station, the arrival time of the train at other stations is calculated in sequence and recorded as and the departure time is recorded as And meet Among them, r i represents the running time of interval i, d n represents the stop time at station n; The method of re-dividing the transition period between the flat and peak periods based on the first preset time length to generate the corresponding period sequence and departure interval sequence includes: based on the early flat peak period Morning rush hour and the departure interval H during peak hours high and H low , with the first preset duration as the unit, starting from the morning peak Generate transition period forward, the departure interval of transition period is from H high Xiang H low Decrease until it reaches H low Equal, get the time period and its departure interval H tp1 ...H tpi ; Based on the morning peak period The peak time is and the departure interval H during peak hours high and H low , taking the first preset duration as the unit, starting from the end time of the morning peak Generate a transition period backward, and the departure interval of the transition period is from H high Xiang H low Decrease until it reaches H low Equal, get the time period and its departure interval H tp1 ...H tpi ; The time period based on the midday peak is The evening peak period is and the departure interval H during peak hours high and H low , taking the first preset duration as the unit, starting from the evening peak Generate transition period forward, the departure interval of transition period is from H high Xiang H low Decrease until it reaches H low Equal, get the time period and its departure interval H tp1 ...H tpi ; Based on the evening peak period The evening peak period is and the departure interval H during peak hours high and H low , taking the first preset duration as the unit, starting from the end time of the evening peak Generate a transition period backward, and the departure interval of the transition period is from H high Xiang H low Decrease until it reaches H low Equal, get the time period and its departure interval H tp1 ...H tpi ; According to the train operation diagram, the down line is fixed, the up line is adjusted, and the first connection plan of the train lines in each time period is compiled with the shortest connection time as the goal; According to the first connection plan, a second connection plan for the corresponding train lines is generated by compiling the plan in time sequence with the goal of maximizing the number of train connections in adjacent time periods and making the train lines uniform; According to the train operation diagram, prepare the entry and exit plan of the train operation line; A train dispatching method is generated according to the train operation diagram and the entry and exit plan.
2. The scheduling method according to claim 1, characterized in that: The method of fixing the down line and adjusting the up line according to the train operation diagram and preparing a first connection plan for the train lines in each time period with the shortest connection time as the goal includes: Traverse each time period, fix the running line of the side where no train is sent out from the vehicle depot, and continuously shift the running line in the other direction by the second preset time length to generate the vehicle bottom connection relationship; With the goal of minimizing the number of turnaround conflicts and the time required for turnaround, the best translation scheme is found in the generated vehicle bottom connection relationship to generate the first connection scheme for the train line within the time period.
3. The scheduling method according to claim 1, characterized in that: The second connection plan for the corresponding train lines is compiled in time sequence according to the first connection plan with the goal of maximizing the number of train connections in adjacent time periods and uniform train lines, including: According to the first connection scheme, all time periods of the day are sorted by time to obtain a set of time periods in pairs. Traversing the time period set, determining the number of uplink running lines of set element 0 and set element 1, and taking the set element with the smaller number of running lines as the reference time period sequence; Traverse the operating lines in the benchmark time sequence, and according to the last stop track and time of operating line m, find another set that satisfies the minimum return time and maximum return time respectively. and of running lines, select the running line with the smallest connection time to connect to running line m.
4. The scheduling method according to claim 1, characterized in that: The step of preparing the entry and exit plan of the train line according to the train operation diagram comprises: Traverse the entire day's running lines, and for the train j without a preceding order, obtain the departure plan of the train j according to the first stop and time of the train, the location of the depot, and the form of the transfer track, forming a set O j ; For train j without a subsequent sequence, the entry plan of train j is obtained according to the last stop and time of the train, the location of the depot, and the form of the transfer track, forming a set I j ; For all trains entering and leaving the section, a plan for their entry and exit is prepared with the goal of minimizing conflicts with return operations.
5. The scheduling method according to claim 1, characterized in that: The method for generating a train dispatching method according to the train operation diagram and the entry and exit plan comprises: Based on the train operation diagram, the turnaround station and the connection relationship between the operation lines, a relief network is established for all trains passing through the target station.
6. A dispatching device for urban rail trains in large and small route modes, characterized in that: include: Parameter configuration module, used to configure the basic parameters for the compilation of train operation diagram; The basic parameters for configuring the train operation diagram compilation include: setting the station set S in the line = {1, 2, ... n,n+1,n+2,……2n}, the set of uplink stations Sup={1,2,……n}, the set of downlink stations S down ={n+1,n+2,……2n}; Set the train departure intervals during peak hours and off-peak hours to be H respectively high and H low , the minimum turnaround time at the turnaround station and the maximum return time According to the start and end time of each period, set the morning and off-peak period as The morning peak hours are The peak time is The evening peak period is The evening peak period is Set the train's stop time at each station to d n , n∈S, let the running time of the interval be r n ,n∈S; The time period division module is used to re-divide the transition period between flat and peak periods according to the basic parameters, and draw the train operation diagram of each time period according to the departure interval; the time period division module is specifically used to re-divide the transition period between flat and peak periods based on the first preset time length, and generate a corresponding time period sequence and a departure interval sequence; modify the start time and end time of each flat peak period, so that the start time of the flat peak period continues the latest end time of the transition period newly generated after the end of the previous peak period, and the end time of the flat peak period continues the earliest start time of the transition period generated forward from the next peak period; according to the time period sequence and the departure interval sequence, the train departure time and arrival time are sequentially calculated starting from the departure station, and the arrival time of the train at the departure station 1 is recorded as and the departure time is recorded as And meet Among them, H is the departure interval of the train, d1 is the stop time of the train at station 1, and f is the train number; according to the arrival time and departure time of the train at the departure station, the arrival time of the train at other stations is calculated in sequence and recorded as and the departure time is recorded as And meet Among them, r i represents the running time of interval i, d n represents the stop time at station n; The method of re-dividing the transition period between the flat and peak periods based on the first preset time length to generate the corresponding period sequence and departure interval sequence includes: based on the early flat peak period Morning rush hour and the departure interval H during peak hours high and H low , with the first preset duration as the unit, starting from the morning peak Generate transition period forward, the departure interval of transition period is from H high Xiang H low Decrease until it reaches H low Equal, get the time period and its departure interval H tp1 ...H tpi ; Based on the morning peak period The peak time is and the departure interval H during peak hours high and H low , taking the first preset duration as the unit, starting from the end time of the morning peak Generate a transition period backward, and the departure interval of the transition period is from H high Xiang H low Decrease until it reaches H low Equal, get the time period and its departure interval H tp1 ...H tpi ; The time period based on the midday peak is The evening peak period is and the departure interval H during peak hours high and H low , taking the first preset duration as the unit, starting from the evening peak Generate transition period forward, the departure interval of transition period is from H high Xiang H low Decrease until it reaches H low Equal, get the time period and its departure interval H tp1 ...H tpi ; Based on the evening peak period The evening peak period is and the departure interval H during peak hours high and H low , taking the first preset duration as the unit, starting from the end time of the evening peak Generate a transition period backward, and the departure interval of the transition period is from H high Xiang H low Decrease until it reaches H low Equal, get the time period and its departure interval H tp1 ...H tpi ; A first connection plan generating module is used to fix the down line and adjust the up line according to the train operation diagram, and compile a first connection plan for the train lines in each time period with the shortest connection time as the goal; A second connection plan generating module is used to generate a second connection plan for the corresponding train running lines according to the first connection plan, with the goal of maximizing the number of train connection pairs in adjacent time periods and uniform train running lines, and compile them in sequence according to time; An entry and exit plan preparation module is used to prepare an entry and exit plan for a train line according to the train operation diagram; The scheduling method generation module is used to generate a train scheduling method according to the train operation diagram and the entry and exit plan.
7. An electronic device comprising a memory and a processor, wherein a computer program is stored in the memory, wherein: When the processor executes the program, the method according to any one of claims 1 to 5 is implemented.
8. A computer-readable storage medium having a computer program stored thereon, characterized in that: When the program is executed by a processor, the method according to any one of claims 1 to 5 is implemented.
