JP2018045312A - Operation plan creation method and operation plan creation system - Google Patents

Abstract

PROBLEM TO BE SOLVED: To provide an operation plan creation method capable of automatically creating an operation plan of a railway vehicle or the like, and an operation plan creation system.SOLUTION: An operation plan creation method creates an operation circuit pattern in which a plurality of pieces of path information configuring a transit diagram of a transport machine are connected in an arithmetic logical section. The arithmetic logical section extracts entering/dispatching pair information denoting time when the transport machine enters a storage area and time when it is dispatched from the storage area between pieces of adjacent path information in the operation circuit pattern from the operation circuit pattern. The arithmetic logical section further allocates a storage numbered line where the transport machine is stored on the basis of the entering/dispatching pair information and storage numbered line information of the storage area of the transport machine.SELECTED DRAWING: Figure 1

Description

  Embodiments according to the present invention relate to an operation plan creation method and an operation plan creation system.

  Conventionally, an operation plan of a vehicle or the like in a transportation device having a predetermined operation schedule such as a railway, a bus, and an aircraft has been manually created. The initial operation plan is to create a basic basic vehicle operation plan and obtain each daily plan based on it. The basic vehicle operation plan is composed of an operation patrol pattern and a campus patrol pattern, and is determined so that it can be operated with a small number of vehicles and crews while considering various constraint conditions. The operation patrol pattern is a pattern indicating a periodic repetition of an operation start location (and time) and an operation end location (and time) of a vehicle or the like. The on-site patrol pattern is a pattern that indicates periodic repetition of the entry location (and the time) and the exit location (and the time) when the vehicle is detained on the campus.

  In order to create the operation patrol pattern, it is necessary to consider the vehicle detention location / departure time at the start of operation and the vehicle detention location / entry time at the end of operation. Necessary. On the other hand, in order to create the on-site patrol pattern, it is necessary to consider the operation start location / departure time, the operation end location / arrival time, etc. of the vehicle. Thus, the operation tour pattern and the campus tour pattern are closely related to each other. Therefore, the planner of the operation plan has formulated an operation plan with no contradiction while repeatedly adjusting both the operation patrol pattern and the campus patrol pattern.

  However, in recent years, it has become difficult to train an operation planner, and it is desired to automate the operation plan formulation work.

JP 9-315308 A Japanese Patent No. 3928268 Japanese Patent No. 5075577 Japanese Patent No. 3540642 Japanese Patent No. 4241484 Japanese Patent No. 4894035

  Provided is an operation plan creation method and an operation plan creation system capable of automatically creating an operation plan for a transportation device such as a railway, a bus, an aircraft, etc., whose operation schedule is determined in advance.

  In the operation plan creation method according to the present embodiment, an operation patrol pattern in which a plurality of pieces of route information constituting the operation schedule of the transport equipment is connected is generated in the calculation unit. The calculation unit extracts from the operation patrol pattern, the entry / exit pair information indicating the time when the transport device enters the depot location and the time when the transport device leaves the depot location between the adjacent route information in the operation patrol pattern. Further, the calculation unit assigns a detention number line for detention of the transport device based on the entry / exit pair information and the detention number line information of the depot location of the transport device.

The block diagram which shows the structural example of the operation plan preparation system 1 by this embodiment. The flowchart which shows the operation example of the system 1 by this embodiment. The conceptual diagram which shows the operation example of the system 1 by this embodiment. The figure which shows an example of the operation plan of the vehicle based on the operation patrol pattern of FIG.3 (B). The flowchart which shows the production | generation algorithm of the operation | movement patrol pattern by this embodiment. The conceptual diagram which shows the production | generation algorithm of the operation | movement patrol pattern by this embodiment. The flowchart which shows the setting algorithm of the work plan by this embodiment. The conceptual diagram which shows the setting algorithm of the work plan by this embodiment. The flowchart which shows the allocation algorithm of the indwelling number line by this embodiment. The conceptual diagram which shows the assignment setting algorithm of the indwelling number line by this embodiment. The conceptual diagram which shows the assignment setting algorithm of the indwelling number line by this embodiment.

  Embodiments according to the present invention will be described below with reference to the drawings. This embodiment does not limit the present invention.

  FIG. 1 is a block diagram illustrating a configuration example of an operation plan creation system 1 according to the present embodiment. The operation plan creation system 1 is a system for creating an operation plan for a transportation device such as a railway, a bus, an aircraft, etc., in which an operation schedule is determined in advance, and a crew work plan. Hereinafter, as an example, the operation plan creation system 1 will be described as a system for creating a railway vehicle operation plan.

  The operation plan creation system 1 automatically formulates and determines the vehicle operation patrol pattern and the campus patrol pattern so that there is no contradiction. An operation patrol pattern is a pattern that indicates a periodic repetition of an operation start location (and time) and an operation end location (and time) of a vehicle, and a series of operation patterns of vehicles that can be periodically repeated. Show. The on-site patrol pattern is a pattern that indicates a periodic repetition of the entry location (and the time) and the exit location (and the time) when the vehicle is detained on the premises, and the vehicle detention pattern that can be repeated periodically. Is shown. The local tour pattern is almost complementary to the operation tour pattern.

  The operation plan creation system 1 (hereinafter also simply referred to as “system 1”) includes a database 10 and a calculation unit 20 in order to create a vehicle operation tour pattern and a campus tour pattern.

  The database 10 as a storage unit stores operation diagrams 11, work data 12, search parameters 13, and indwelling line data 14 as information.

  The operation diagram 11 indicates a departure / arrival station and a departure / arrival time, and includes a plurality of pieces of route information. The route information (hereinafter also referred to as a box diagram) is a minimum unit of vehicle operation in which a series of operations from the start station to the end station of a certain vehicle are shown together with their times. The service diagram 11 is composed of a number of box diagrams.

  The work data 12 is information on work that must be periodically performed, such as vehicle cleaning and inspection. Some implementation cycles of vehicle cleaning, inspection, etc. (hereinafter also simply referred to as work) are stipulated by law. For this reason, work must be performed at daily intervals close to the target execution period. On the other hand, since frequent work leads to high costs, the work execution cycle is within the legal cycle and is as close to the legal cycle as possible. It is preferable that it is preferable, and it is required to implement it with a target cycle as much as possible. In addition, detention places (stations) where work can be performed are limited.

  The search parameter 13 is a parameter used when performing a tabu search (taboo search) method to be described later, for example. In the present embodiment, creation of a work plan is facilitated by using the tabu search method.

  Indwelling number line data 14 is data indicating a detention location of a vehicle, a detention number line at the detention location, and a connection structure between them. The system 1 can determine whether or not there is a contradiction in the operation plan based on the indwelling number line data 14. A more detailed method for correcting the operation plan will be described later.

  The computing unit 20 includes an operational cyclic pattern generation unit 30 and a local cyclic pattern generation unit 40. The operational cyclic pattern generation unit 30 and the local cyclic pattern generation unit 40 may be configured by a single arithmetic device (for example, a CPU or the like), or may be configured as separate arithmetic devices.

  The operational cyclic pattern generation unit 30 includes a constraint extraction unit 31, an operational cyclic pattern candidate generation unit 32, and a storage unit 33. The constraint extraction unit 31 extracts constraint conditions stored in the storage unit 43 of the local tour pattern generation unit 40. The constraint condition is, for example, entry / exit pair information prohibited by the user or the system 1 in order to solve the contradiction of the operation plan.

  The operation tour pattern candidate generation unit 32 generates an operation tour pattern based on the operation schedule information. The operation patrol pattern is generated by connecting a plurality of box diagrams so that there is no contradiction with the preceding and following box diagrams at the loading / unloading location and loading / unloading time. A method for generating the operation patrol pattern will be described later.

  The storage unit 33 stores the operation circulation pattern generated by the operation circulation pattern candidate generation unit 32. At this time, the operation tour pattern is not yet determined, and when a new constraint condition is generated by the local tour pattern, it is generated (corrected) again in consideration of the constraint condition. In other words, the operation cyclic pattern is stored in the storage unit 33 as one candidate, and is then determined when there is no contradiction in the local cyclic pattern and no constraint condition occurs.

  The local tour pattern generation unit 40 includes an entry / exit pair extraction unit 41, an indwelling number line assignment unit 42, and a storage unit 43. The entry / exit pair extraction unit 41 extracts entry / exit pair information based on the operation patrol pattern stored in the storage unit 33. For example, the entry / exit pair information is information indicating the time when the vehicle enters and exits from the detention location between adjacent box diagrams in the operation patrol pattern.

  The indwelling number line assigning unit 42 assigns the indwelling number line for placing the vehicle to the entering / exiting pair information based on the entering / exiting pair information and the indwelling place retaining line data 14. At this time, as described above, when there is a contradiction in the assignment of the indwelling number line, the indwelling number line assigning unit 42 generates a constraint condition that prohibits the entry / exit pair information that causes the contradiction. In such a case, a constraint condition is generated so as to prohibit either the entry / exit pair information or other entry / exit pair information already assigned to the detention location. This constraint condition is stored in the storage unit 43.

  The storage unit 43 stores entry / exit pair information, a detention number line, and the like extracted based on the operation patrol pattern. Entry / exit pair information, indwelling number lines, and the like are on-premises patrol patterns. At this time, the local tour pattern is not yet determined and is stored in the storage unit 43 as one candidate. After that, the inbound / outbound pair information and the detention number line are extracted from the operation pattern regenerated in consideration of the constraint conditions, and when the inconsistency does not occur in these in / out pair information and the detention number line, Determine.

  The arithmetic unit 20 repeatedly executes the generation of the operation cyclic pattern and the generation of the local cyclic pattern until no new constraint condition occurs. In this repetitive execution, the user 50 may control the switching timing of the on-site cyclic pattern generation unit 40 and the operation of the operation cyclic pattern generation unit 30 and the repetition abortion. There is also a case where the repeated execution is not performed. Thereby, the system 1 can automatically generate an operation tour pattern and a campus tour pattern without contradiction.

  The GUI (Graphical User Interface) 50 includes an operation unit 51 and a display unit 52. The GUI 50 is connected to the system 1 via the network 60. For example, the GUI 50 is a user terminal. A user can obtain an operation plan from the system 1 via the network 60 by operating the GUI 50. The network 60 may be, for example, a local area network (LAN), a wide area network (WAN), or the like. Note that the calculation unit 20 and the GUI 50 may operate on the same computer, or the database 10 and the calculation unit 20 may be connected via a network. In the present invention, the network configuration between devices is not particularly limited.

  The operation unit 51 is a device that allows a user to input constraint conditions and the like, and may be, for example, a keyboard or a touch panel. The display unit 52 may be a display capable of displaying the operation tour pattern and the campus tour pattern stored in the storage units 33 and 43. The operation unit 51 and the display unit 52 may be integrally configured as a touch panel.

  The user can arbitrarily make corrections such as rearrangement of the order of box diagrams of the operation patrol pattern using the GUI 50. Furthermore, the user can use the GUI 50 to transfer the corrected operation cyclic pattern to the local cyclic pattern generation unit 40 at an arbitrary timing. Furthermore, using the GUI 50, the user can arbitrarily set constraint conditions such as designation of an indwelling number line, fixation of an incoming / outgoing pair, prohibition of an incoming / outgoing pair, etc., for a local tour pattern. Furthermore, the user can transfer these constraint conditions to the operation cyclic pattern generation unit 30 at an arbitrary timing using the GUI 50.

  Next, the operation of the system 1 will be described.

  FIG. 2 is a flowchart showing an operation example of the system 1 according to the present embodiment. FIG. 3A to FIG. 3E are conceptual diagrams showing an operation example of the system 1 according to the present embodiment.

  First, the arithmetic unit 20 obtains initial information such as operation schedules, work data, search parameters, indwelling line data, and the like from the database 10 (S10). When the constraint condition is already set, the arithmetic unit 20 also obtains the constraint condition. Such information may be stored in the database 10 in advance. Alternatively, the user may input such information using the GUI 50.

  For example, FIG. 3 (A) shows box diagrams L1 to L7 that constitute a service diagram. FIG. 3A shows seven box diagrams L1 to L7. These box diagrams L1 to L7 are stored in the database 10 as independent information without being related to each other. Of course, the number of box diagrams stored in the database 10 is not particularly limited and may be more than seven.

  Each box diagram L1 to L7 includes at least information of a departure station (first station) ID, an arrival station (end station) ID, a departure time from the first station, and an arrival time at the end station. In FIG. 3A, the vehicle is operated in the direction of the arrow. The departure station ID (for example, A or B) and the departure time are displayed on the left side of each arrow. The arrival station ID (for example, A or B) and the arrival time are displayed on the right side of each arrow. There may be one or more stop stations between the departure station and the arrival station. In FIG. 3A, there are only two stations A and B where vehicles can be placed. Further, it is assumed that the station A is a detention place where work can be performed, and the station B is a station where work cannot be performed. The number of detention stations is not particularly limited, and may be three or more.

  Next, the operation circulation pattern generation unit 30 automatically generates an operation circulation pattern based on the box diagrams L1 to L7 (S20). For example, as shown in FIG. 3 (B), in the box diagrams L1 to L7 of FIG. 3 (A), another box diagram L2 starting from the arrival location A of the box diagram L1 as certain first route information. , L3, L4, and L7, the box diagram L4 having the departure time closest to the arrival time 15:00 after the arrival time 15:00 of the box diagram L1 is used as the second route information. Connect to L1. Next, among the other box diamonds L2, L3, and L7 whose departure place is the arrival place A of the box diamond L4, it is after the arrival time 23:00 of the box diamond L4 and the arrival time 23:00. The box diagram L2 having the departure time closest to is connected to the box diagram L4 as the third route information. Next, among the other box diamonds L5 and L6 that have the arrival place B of the box diamond L2 as the departure place, it is after the arrival time 4:00 of the box diamond L2 and most at the arrival time 4:00. The box diagram L6 having a near departure time is connected to the box diagram L2 as the fourth route information. In many cases, the initial solution of the operational cyclic pattern generated by such an operation is an unexecutable cyclic plan in which places are not connected. By repeating the operational cyclic pattern repair process described later, FIG. ) Is generated. In this operation cyclic pattern, the plurality of box diamonds L1 to L7 are connected to other box diamonds adjacent to each other at the detention location, and are connected so that the operation cyclic cycle is the shortest. For example, the operation patrol pattern in FIG. 3B circulates at a cycle of 4 days.

  Thus, by shortening the circulation cycle of the operation circulation pattern, it is possible to increase the operation rate of the vehicle and reduce the number of vehicles necessary for operation. Thereby, the cost required for equipment and operation can be reduced.

  For example, FIG. 4 is a diagram illustrating an example of a vehicle operation plan based on the operation patrol pattern of FIG. The same number of vehicles (for example, 4 cars) as the number of cycle days (for example, 4 days) of the operation patrol pattern are prepared, and the vehicles are operated while being cycled one day at a time. At this time, the operation patrol pattern is generated as one candidate, but in order to explain the vehicle operation plan, an example in which a vehicle is assigned to the operation patrol pattern is shown. For example, referring to each row in FIG. 4, it can be seen that the vehicles 1 to 4 are periodically operated according to the operation patrol pattern of FIG. However, the operation patterns of the vehicles 1 to 4 are shifted by one day each. Thereby, in each of the first day D1 to the fourth day D4, the vehicles 1 to 4 travel on all the routes L1 to L7. For example, on the first day D1, the vehicle 1 travels through L1 and L4, the vehicle 2 travels through L7 and L5, the vehicle 3 travels through L6 and L3, and the vehicle 4 travels through L2. On the second day D1, the vehicle 1 travels L2, the vehicle 2 travels L1, L4, the vehicle 3 travels L7, L5, and the vehicle 4 travels L6, L3. Similarly, on the third day L3 and the fourth day L4, the vehicles 1 to 4 travel all along the routes L1 to L7. Thus, the vehicles 1 to 4 travel all along the routes L1 to L7 every day. The first day D1 to the first day D4 are repeatedly executed in a round. Therefore, although the vehicles 1 to 4 travel on different routes every day, they travel on the routes L1 to L7 in the same order and with the same frequency. Therefore, the usage frequency, travel distance, wear and the like of the vehicles 1 to 4 can be made substantially uniform. This prolongs the life of the vehicle and results in cost reduction. Actually, the vehicle may travel in a pattern different from the operation patrol pattern, such as weekends and holidays, event days, year-end and New Year holidays, etc. Modify and use the plan.

  A more detailed description of the operation cyclic pattern generation algorithm will be described later with reference to FIGS.

  Next, a work plan to be performed on the vehicle is set as an operation patrol pattern (S30). The work plan is an assignment plan for an operation patrol pattern of work that must be carried out in a short cycle such as vehicle inspection, repair, cleaning, etc., and part of the work plan is a work defined by the implementation law. Detention places where work can be performed are limited. The work plan is information including the execution place of these work and the schedule on the operation patrol pattern. The operation tour pattern generation unit 30 also checks whether or not a work plan can be set for the operation tour pattern.

  For example, in FIG. 3, it is assumed that the detention place where the work can be performed is the station A, and the maximum cycle of the work specified by law is two days. In this case, as shown in FIG. 3C, the operation patrol pattern generation unit 30 sets work for the vehicle at the station A indicated by a circle. For example, the work is performed at a detention period 23:00 to 7:00 between the first day D1 and the second day D2, and at a detention period 23:00 to 6 between the third day D3 and the fourth day D4. : 00 is set. That is, the work is set to be performed at the detention site A every other day. A more detailed description of the work plan setting algorithm for the operation patrol pattern will be described later with reference to FIGS.

  If the vehicle does not stay too much at the detention place where the work can be performed, the work plan may not be set with a prescribed cycle (NO in S40). In such a case, the operation cyclic pattern generation unit 30 randomly shuffles the order at the time of box diagram input, or changes the initial setting or parameter (S50), and executes steps S20 to S50 again. As a result, the operation circulation pattern generation unit 30 generates the operation circulation pattern again, and resets the work plan for the operation circulation pattern.

  Steps S20 to S50 are repeated until a predetermined value is exceeded (NO in S60).

  When the number of iterations of steps S20 to S50 exceeds a predetermined value (YES in S60), or when a work plan can be set within a specified period (YES in S40), the user can use the GUI 50. The operational patrol pattern and the work plan are confirmed / corrected (S65). The display unit 52 displays the operation patrol pattern and the work plan setting on the display unit 52. The display unit 52 also displays whether or not the work plan has been successfully set.

  While referring to the display unit 52, the user changes the order of the operation tour pattern box diagrams or adjusts the setting of the work plan to temporarily determine the operation tour pattern. Further, the user transfers the operation cyclic pattern to the local cyclic pattern generation unit 40 via the GUI 50 at an arbitrary timing. Note that if the work plan is successfully set, the operation circuit pattern generation unit 30 may automatically transfer the operation circuit pattern to the local circuit pattern generation unit 40 without user confirmation.

  Next, the in / out pair extracting unit 41 extracts in / out pair information from the operation patrol pattern (S70). Entry / exit pair information can be automatically extracted from a plurality of box diagrams connected in the operation patrol pattern. For example, when the operation patrol pattern of FIG. 3C is used, the warehousing / extracting pair extracting unit 41 can extract the warehousing / extracting pair information P1 to P7 shown in FIG. The entry / exit pair information P1 is detention information between the box diagrams L1 and L4, and has information on detention location A, entry time 15:00, and exit time 16:00. This indicates that the storage place A is loaded at 15:00 and the detention place A is shipped at 16:00. Similarly, the entry / exit pair information P2 becomes detention information between the box diagrams L4 and L2, and includes information on the depot location A, the entry time 23:00, and the exit time 7:00. The entry / exit pair information P3 becomes detention information between the box diagrams L2 and L6, and has information of detention place B, entry time 4:00, and exit time 5:00. The entry / exit pair information P4 becomes detention information between the box diagrams L6 and L3, and has information of detention location A, entry time 13:00, and exit time 14:00. The entry / exit pair information P5 becomes detention information between the box diagrams L3 and L7, and includes information on the depot location A, the entry time 23:00, and the exit time 6:00. The entry / exit pair information P6 becomes detention information between the box diagrams L7 and L5, and has information of detention location B, entry time 11:00, and exit time 12:00. The entry / exit pair information P7 is detention information between the box diagrams L5 and L1, and includes information on the detention location A, the entry time 6:00, and the exit time 8:00. Thus, the entry / exit pair information P1 to P7 is extracted from the operation patrol pattern.

  In addition, the work is carried out at a specific number line at a specific detention location. Therefore, when a work plan is set, the entry / exit pair information P1 to P7 needs to include information on whether or not a work plan is set.

  Next, the retention number line assigning unit 42 allocates the retention number line to the entry / exit pair information based on the entry / exit pair information and the retention number line information of the detention location A (S80). The entry / exit pair information requires a place (detention number line) where the vehicle is detained during the detention period indicated by the pair of the entry time and the exit time. Therefore, the indwelling number line assigning unit 42 assigns the indwelling number line to the entry / exit pair information. For example, in the example shown in FIG. 3E, the station A has two detention number lines, and the station B has one detention number line. At station A, the entry / exit pair information P4 and P1 do not overlap in time with other entry / exit pair information. Therefore, the indwelling number line assigning unit 42 assigns one common indwelling number line (for example, number line 1) to the entry / exit pair information P4 and P1. The entry / exit pair information P2 overlaps with the entry / exit pair information P5 and P7 in time. Therefore, the retention number line assigning unit 42 assigns one retention number line (for example, number line 1) to the entry / exit pair information P2, and assigns the other retention number line (for example, number line 2) to the entry / exit pair information P5 and P7. . In the station B, the entry / exit pair information P3 and P6 do not overlap in time with other entry / exit pair information. Therefore, the indwelling number line assigning unit 42 assigns one common indwelling number line (for example, number line 1) to the entry / exit pair information P3 and P6. In this way, an indwelling number line is assigned to the entry / exit pair information P1 to P7.

  As shown in FIG. 4, the operation of the vehicles 1 to 4 is patroling according to the operation patrol pattern. Therefore, the vehicles detained according to the entry / exit pair information P1 to P7 also circulate, and the vehicles detained on the detention number line change in order.

  A more detailed description of the indwelling number line assignment algorithm will be described later with reference to FIGS.

  When allocation of the detention number line fails, that is, when generation of the local tour pattern fails (NO in S90), the GUI 50 displays the in-house cyclic pattern that associates the entry / exit pair information, the detention location and the detention number line, and the detention number line. Entry / exit pair information that has failed to be assigned is displayed on the display unit 52. The user refers to the display unit 52, confirms the entry / exit pair information for which the allocation of the indwelling number line has failed, and inputs the constraint condition from the operation unit 51 (S100). The constraint condition is, for example, a constraint such as prohibiting generation of entry / exit pair information that has failed in allocation of an indwelling number line. The constraint condition is not limited to this, and may be adjusted or corrected so that no contradiction occurs in the assignment of the retention number line to the entry / exit pair information. The constraint condition is stored in the storage unit 43, and is considered when the operation tour pattern and the campus tour pattern are generated again in steps S20 to S90.

  When the detention number line can be assigned to the entry / exit pair information, that is, when the on-site tour pattern is successfully generated (YES in S90), the on-site tour pattern generation unit 40 selects the in / out pair information, the depot location, and the detainment. The number lines are associated and stored in the storage unit 43 as a local tour pattern. At the same time, the GUI 50 displays the local tour pattern together with the operation tour pattern (S110). The user confirms the operation tour pattern and the campus tour pattern (S120). If there is no problem in the operation tour pattern and the campus tour pattern (NO in S120), the generation of the operation tour pattern and the campus tour pattern ends. When there is a problem with the operation tour pattern and the campus tour pattern (YES in S120), the user inputs a constraint condition (S100), and the system 1 returns to Step S20.

  As described above, the system 1 can automatically create the operation tour pattern and the campus tour pattern while adjusting each other in consideration of the work plan and the constraint conditions.

(Operational patrol pattern generation algorithm)
FIG. 5 is a flowchart showing an operation tour pattern generation algorithm according to this embodiment. FIG. 6A to FIG. 6D are conceptual diagrams showing an operation cyclic pattern generation algorithm according to the present embodiment. In this embodiment, a unique heuristic search method is used, but the present invention is not limited to this, and an optimization method such as mixed integer linear programming (MILP) or genetic algorithm is used. May be.

  First, as described above, the operation patrol pattern candidate generation unit 32, after the arrival time of the first route information, among other box diagrams starting from the arrival location of a certain box diagram (first route information). A box diagram having a departure time closest to the arrival time is connected as second route information after the first route information. In other words, the operation cyclic pattern candidate generation unit 32 connects the box diagrams in a greedy front-packed manner (S200). The operation patrol pattern candidate generation unit 32 repeatedly executes the connection process for all box diagrams in the service diagram 11. As a result, the initial solution of the operational circulation pattern is generated at high speed.

  However, when box diamonds are connected using such an algorithm, there may be no unconnected box diamonds that use the arrival location of the connected box diamond as the departure location during the connection process. . In such a case, the operation patrol pattern candidate generation unit 32 selects a certain box diagram among the unconnected box diagrams (for example, a box diagram having the shortest travel time between the arrival place and the departure place of the connected box diagram). The connection process is executed again as the first route information. As a result, a plurality of discontinuous connection lines are provisionally generated. For example, FIG. 6A is a conceptual diagram showing a plurality of discontinuous connection lines LN1 to LN3. Each box in FIG. 6A indicates a box diagram (route information). Each pair of numbers in the box indicates the departure place ID and arrival place ID of the box diagram. For example, the box diagram L10 leaves the first station 18 and arrives at the last station 4. The box diagram L11 departs from the first place ID 18 and arrives at the end place ID4. The departure place ID4 of the box diagram L11 matches the arrival place ID4 of the box diagram L10, and the box diagram L11 is connected to the box diagram L10. Similarly, box diagrams L10 to L23 are connected in connection line LN1. The arrow A indicates the connection order of the box diagrams (vehicle operation order).

  As described above, the connection process is repeatedly performed on the plurality of box diagrams L10 to L30, and three connection lines LN1 to LN3 including the plurality of box diagrams are generated.

  Next, the operation tour pattern candidate generation unit 32 executes discontinuous box diagram connection processing in each of the connection lines LN1 to LN3 (S210). For example, the connection lines LN1 to LN3 have discontinuous box diagrams L10, L23, L24, L27, L28, and L30 to which one of the departure place and the arrival place is not connected. The operation tour pattern candidate generation unit 32 performs the above connection process on these discontinuous box diagrams. For example, the departure place ID 18 of the box diagram L10 is equal to the arrival place ID 18 of the box diagram L23. There is no other discontinuous box diagram with the same ID departure or arrival location. Accordingly, the box diagram L10 and the box diagram L23 are connected to each other. Similarly, box diagrams L24 and L27 are connected, and box diagrams L28 and L30 are connected to each other. Thereby, connection loops LP1 to LP3 are generated as shown in FIG. The connection loops LP1 to LP3 are independent loops. The total number of arrival places and the total number of departure places in all box diagrams are the same. If such a property is used, as described above, by executing the connection process for the discontinuous box diamond, it is possible to connect all the box diamonds and eliminate the discontinuous box diamond.

  Next, the connection loops LP1 to LP3 are merged by reconnecting the box diamonds having a common detention location between the connection loops LP1 to LP3 (S220). The operation tour pattern candidate generation unit 32 temporarily cuts the same detention location (departure location and arrival location) between the connection loops LP1 to LP3 and combines them between the connection loops. At this time, the operation cyclic pattern candidate generation unit 32 calculates a cyclic cycle of a plurality of combined connection loops. The cyclic period of the connection loop is a period from the start position of a certain box diagram in the connection loop to the return to the arrival position of the box diagram after going through the connection loop. The operation cyclic pattern candidate generation unit 32 repeatedly executes such a reconnection process between connection loops, and selects a case having the shortest cyclic cycle.

  For example, in FIG. 6B, the arrival place ID 13 of the box diagram L19 and the departure place ID 13 of the box diagram L20 of the connection loop LP1 are the arrival place ID 13 of the box diagram L25 and the departure place ID 13 of the box diagram L26 of the connection loop LP2. equal. Therefore, as shown in FIG. 6C, the operation tour pattern candidate generation unit 32 can connect the box diagram L20 to the box diagram L25 and connect the box diagram L26 to the box diagram L19. As a result, the connection loops LP1 and LP2 are combined to form one connection loop. This reconnection process is also executed in other box diagrams having the same detention location in the connection loops LP1 and LP2. Then, the operational cyclic pattern candidate generation unit 32 selects the case with the shortest cyclic cycle of the connected loops LP1 and LP2 after the combination. Here, for convenience, it is assumed that the case shown in FIG. 6C is the shortest case of the cyclic cycle.

  Further, for example, in FIG. 6B, the arrival place ID 23 of the box diagram L17 and the departure place ID 23 of the box diagram L18 of the connection loop LP1 are the arrival place ID 23 of the box diagram L30 and the departure place of the box diagram L28 of the connection loop LP3. It is equal to ID23. Therefore, although not shown, the operation patrol pattern candidate generating unit 32 can connect the box diagram L17 to the box diagram L28 and connect the box diagram L30 to the box diagram L18. Thereby, the connection loops LP1 and LP3 are combined to form one connection loop. This reconnection process is also executed in other box diagrams having the same detention location in the connection loops LP1 and LP3. Then, the operational cyclic pattern candidate generation unit 32 selects the case with the shortest cyclic cycle of the connected loops LP1 and LP3 after the combination. Here, for convenience, it is assumed that the above case is the shortest case of the cyclic cycle.

  This reconnection process is executed until there is one connection loop (NO in S230). When the number of connection loops becomes one (YES in S230), the connection loop becomes an operation circulation pattern (S240). In this way, the operation circulation pattern candidate generation unit 32 generates a single operation circulation pattern by switching the common departure place or arrival place in the plurality of connection loops LP1 to LP3.

  FIG. 6D shows an operation circulation pattern in which the connection loops LP1 to LP3 are combined. This operation patrol pattern shifts to box diagrams L10 to L17, L28 to L30, L18 to L19, L26 to L27, L24 to L25, and L20 to L23 according to the arrows, and returns to L10. In this way, the operation cyclic pattern is configured as one cyclic pattern.

  FIG. 7 is a flowchart showing a work plan setting algorithm according to this embodiment. FIG. 8A to FIG. 8C are conceptual diagrams showing a work plan setting algorithm according to this embodiment. In this embodiment, a so-called tabu search method is used for setting a work plan. In this embodiment, the tabu search method is used. However, the present invention is not limited to this, and a search method such as a genetic algorithm may be used.

  First, the operation circulation pattern generation unit 30 adds a preliminary date to the operation circulation pattern (S299). The spare day is an empty day without a box diagram. The number of days of patrol in the operation patrol pattern is equal to the number of vehicles operated. Therefore, when the number of vehicles that can be used first is determined, the spare days are added by the number of the difference between the number of traveling days of the operation traveling pattern and the number of vehicles. The method for setting the backup date is not particularly limited. For example, the operation patrol pattern generation unit 30 sets a spare day for a box diagram that has a short detention time among the box diagrams that arrive at the detention place at night and depart the next day. Of course, the backup date may not be set to the operation patrol pattern.

  Next, the operation tour pattern generation unit 30 divides the tour cycle of the operation tour pattern by the work execution cycle, and sets the number of work plans (S300). Next, the operation circulation pattern generation unit 30 sets as many work plans as the number obtained by the division as detention places where work can be performed in the operation circulation pattern (S310). For example, when the cyclic cycle of the operational cyclic pattern is 10 days and the execution cycle of the work is 5 days, the operational cyclic pattern generation unit 30 sets two work plans as one operational cyclic pattern. At this time, the setting of the work plan may be arbitrary. For example, in FIG. 8A, it is assumed that the box diagrams L50 to L59 constitute one operational patrol pattern. Also, the detention location ID 23 is a detention location where work can be performed. Then, work plans OP1 and OP2 are provisionally set during the indwelling period indicated by a circle. The initial arrangement method of the work plans OP1 and OP2 is not particularly limited, but may be set by a greedy front-packing method.

  If the cyclic cycle of the operational cyclic pattern is not divisible by the work execution cycle, the repetition cycle of both the operational cyclic pattern and the work plan is determined in consideration of the least common multiple of both. For example, when the cyclic cycle of the operational cyclic pattern is 10 days and the execution cycle of the work is 4 days, the operational cyclic pattern generation unit 30 needs to set five operational plans as two operational cyclic patterns. In this case, the operation tour pattern generation unit 30 may set the five work plans by regarding the operation visit pattern to be visited twice as one operation visit pattern.

  Further, for example, it is assumed that the cyclic cycle of the operational cyclic pattern is 21 days, the cyclic cycle of inspection is 7 days, and the cyclic cycle of cleaning is 14 days. In this case, the least common multiple of the operation cycle pattern cycle cycle, the inspection cycle cycle, and the cleaning cycle cycle is 42 days. Therefore, the inspection is performed 6 times and the cleaning is performed 3 times in 42 days when the operation patrol pattern circulates twice. This 42 day pattern can be repeated with the same pattern. Therefore, this 42-day pattern may be regarded as one operational patrol pattern. That is, when the cyclic cycle of the operational cyclic pattern is not divisible by the work execution cycle, the least common multiple of both may be used as the cycle of the operational cyclic pattern. In addition, when the least common multiple of the tour days of the operation tour pattern and the tour days of work exceeds the upper limit days, the GUI 50 notifies the user of an error, or the number of work is the number obtained by dividing the tour cycle by the work execution cycle. Add one extra to process.

  Hereinafter, for the sake of convenience, description will be made assuming that the operation tour pattern generation unit 30 sets N work plans (N is an integer of 2 or more) as one operation tour pattern.

  The operation cyclic pattern generation unit 30 includes a first interval between the k-th work plan OP_k (1 ≦ k ≦ N) and the adjacent k-1th work plan OP_k−1 among the N work plans. INT_k and a second interval INT_k + 1 between the k-th work plan OP_k and the k + 1-th work plan OP_k + 1 of the next cycle adjacent thereto are calculated (S320). The first and second intervals INT_k and INT_k + 1 are executed for all of k = 1 to N. For example, as shown in FIG. 8A, the first interval INT1 is a period from the box diagrams L56 to L59, and the second interval INT2 is a period from the box diagram L50 to L56 (of the next cycle). is there.

  Next, the operation cyclic pattern generation unit 30 changes any one of the first to Nth work plans OP_1 to OP_N so that the time difference (days difference) between the first interval INT_k and the second interval INT_k + 1 becomes small. . That is, among the first to Nth work plans OP_1 to OP_N, the setting is changed so that the kth work plan having the maximum difference between the first interval INT_k and the second interval INT_k + 1 is found and does not violate the taboo list (S330). ). Hereinafter, such work plan setting change is also referred to as work plan adjustment. For example, as shown in FIG. 8A, when the first interval INT1 is 4 days and the second interval INT2 is 6 days, the time difference between the first interval INT1 and the second interval INT2 is 2 days. . Therefore, as shown in FIG. 8B, the operation patrol pattern generation unit 30 changes, for example, the second work plan OP2 from the detention location 23 of the box diagram L56 to the detention location 23 of the box diagram L54. The operation patrol pattern generation unit 30 stores work plan adjustments executed in the past in the storage unit 33 as a tabu list. Adjustment that reverses the work plan adjustment registered in the taboo list leads to repeatedly executing the same adjustment endlessly (vibration phenomenon). Therefore, an adjustment that reverses the work plan adjustment registered in the tabu list is prohibited during the setting change repetition process for the length of the tabu list.

  Next, the operation cyclic pattern generation unit 30 executes Step S320 again. As shown in FIG. 8B, when the first interval INT1 is 6 days and the second interval INT2 is 4 days, the time difference between the first interval INT1 and the second interval INT2 is 2 days. It is. At this time, as described above, since the adjustment for moving the work plan OP2 from the box diagram L56 to the box diagram L54 is registered in the tabu list, the operation of returning the work plan OP2 from the box diagram L54 to the box diagram L56 is prohibited. Is done.

  For example, as shown in FIG. 8C, the operation patrol pattern generation unit 30 moves the work plan OP1 from the detention location 23 of the box diagram L50 to the detention location 23 of the box diagram L59.

  Next, the operation cyclic pattern generation unit 30 executes Step S320 again. As shown in FIG. 8C, when the first interval INT1 is 5 days and the second interval INT2 is 5 days, the time difference between the first interval INT1 and the second interval INT2 is 0 days. It becomes.

  The operation patrol pattern generation unit 30 repeats the work plan adjustment a predetermined number of times (NO in S340).

  When the number of executions of work plan adjustment reaches a predetermined number of times (YES in S340), the setting of the work plan stored in the storage unit 33 minimizes the time difference of each interval among the settings so far. Accordingly, the operation patrol pattern generation unit 30 sets the work plan setting stored in the storage unit 33 at this time as a solution (S350). Thereby, the setting of the work plan is completed. It should be noted that the predetermined number of times that the work plan setting work plan adjustment is repeated may be, for example, the cyclic cycle of the operation patrol pattern × the number of work (the physical upper limit of the total number of days on the moving day of the vehicle).

  By using such a tabu search method, the operation circulation pattern generation unit 30 can efficiently set a work plan to an operation circulation pattern.

  FIG. 9 is a flowchart showing an indwelling number line assignment algorithm according to the present embodiment. FIG. 10A to FIG. 11B are conceptual diagrams showing a work plan setting algorithm according to this embodiment. In the present embodiment, a so-called graph coloring method is used for assignment of indwelling number lines. In this embodiment, the graph coloring method is used. However, the present invention is not limited to this, and a search method such as a genetic algorithm may be used.

  First, the detention number line assigning unit 42 detects a detention time duplication relationship for the in / out pair information constituting the operation patrol pattern (S400). For example, FIG. 10 (A) is a graph showing the detention time of entry / exit pair information Pa to Pe at a certain detention location. The horizontal axis of the graph shows time. Therefore, the start point at the left end of each of the entry / exit pair information Pa to Pe is the arrival time (entry time), and the end point at each right end indicates the departure time (exit time). Each horizontal length of the entry / exit pair information Pa to Pe indicates the detention time. At this point, the indwelling number line is not assigned.

  Here, the detention time of the loading / unloading pair information Pb overlaps with the detention times of the three loading / unloading pair information Pa, Pc and Pd. Moreover, the detention time of the entry / exit pair information Pc overlaps with the detention times of the three entry / exit pair information Pb, Pd, and Pe. FIG. 10 (B) is a graph that shows the overlapping relationship between the entry / exit pair information by expressing the retention time overlap in a straight line. The entry / exit pair information connected in a straight line overlaps with the detention time. Therefore, the number of straight lines connected to each entry / exit pair information is a plurality.

  Next, the indwelling number line assigning unit 42 assigns indwelling number lines to the entry / exit pair information Pa to Pe using the graph coloring method. The assignment of indwelling number lines in the present embodiment corresponds to the assignment of colors in the graph color method. The indwelling number line assigning unit 42 assigns the incoming / outgoing pair information connected in a straight line to different indwelling number lines. Here, the number of the detention number lines at the detention location is determined in advance. Assuming that the number of vehicles that can be detained simultaneously on each detention number line is one, if the number of overlaps in the in / out pair information is equal to or less than the number of detention number lines, the detention number line can be reliably allocated. However, a large number of overlapped entry / exit pair information becomes a factor that makes it difficult to assign a retention line. Accordingly, the indwelling number line assignment unit 42 assigns a number line preferentially to the entry / exit pair information having a large number of duplicates. Thereby, the indwelling number line assigning unit 42 can accurately assign the indwelling number line to the entry / exit pair information in a short time. In addition, when there is a constraint condition when allocating a detention number line, the constraint condition is obeyed.

  For example, FIGS. 11A to 11J are examples in which the graph coloring method is applied to the graph shown in FIG. 10B. 11 (A) to 11 (E), the indwelling number line assigning unit 42 determines the order of assignment of indwelling number lines (S410). The indwelling number line assigning unit 42 counts the duplication time duplication number for each of the entry / exit pair information Pa to Pe at the same indwelling place (duplication counting process). The indwelling number line assigning unit 42 selects an in / out pair with fewer overlapping duplications (number of connection lines) in the inbound / outbound pair information Pa to Pe, or an in / out pair with fewer duplications than the number of selectable number lines. Remove from the graph (removal process). The indwelling number line assigning unit 42 repeatedly executes the duplication counting process and the removal process, and assigns indwelling number lines in the reverse order of the entry / exit pair information removed in the removal process.

  For example, in FIG. 11A, the overlap number of the incoming / outgoing pair information Pa and Pe is 1, which is the smallest. If the priority of the entry / exit pair information Pa is higher than that of Pe, the retention line assignment unit 42 first removes the entry / exit pair information Pe from the graph. Next, as shown in FIG. 11 (B), the indwelling number line assignment unit 42 confirms again the duplication number of the detention time, and removes the entry / exit pair information Pa with the smaller duplication number from the graph. Next, as shown in FIG. 11 (C), the indwelling number line assigning unit 42 reconfirms the duplication number of the detention time, and removes the entry / exit pair information Pd having a smaller duplication number from the graph. Next, as shown in FIG. 11 (D), the detention number line assignment unit 42 reconfirms the duplication number of the detention time, and the entry / exit pair information with a low duplication number and a relatively low priority among them. Remove Pc from the graph. The indwelling number line assigning unit 42 removes the last left / incoming warehouse entry information Pb.

  Next, the indwelling number line assignment unit 42 assigns indwelling number lines R1 to R3 in the reverse order to the order removed from the graph (S420). That is, the detention number line assignment unit 42 assigns detention number lines in the order of Pb, Pc, Pd, Pa, and Pe. For example, as shown in FIG. 11 (F), first, the retention number line assignment unit 42 assigns the retention number line R1 to the warehousing / exiting pair information Pb. Next, as shown in FIG. 11G, the indwelling number line assigning unit 42 assigns the indwelling number line R2 to the in / out pair information Pc. At this time, the detention number line assignment unit 42 assigns a detention number line different from the detention number line R1 of the entry / exit pair information Pb to which the detention number line has already been assigned, among the input / output pair information connected to the entry / exit pair information Pc. Next, as shown in FIG. 11H, the indwelling number line assigning unit 42 assigns the indwelling number line R3 to the in / out pair information Pd. At this time, the detention number line assignment unit 42 is different from the depot number lines R1 and R2 of the entry / exit pair information Pb, Pc to which the detention number line has already been allocated among the input / output pair information connected to the entry / exit pair information Pd. Assign a wire. Next, as shown in FIG. 11 (I), the indwelling number line assigning unit 42 assigns the indwelling number line R2 to the in / out pair information Pa. At this time, the detention number line assignment unit 42 assigns a detention number line R2 different from the detention number line R1 of the warehousing / departure pair information Pb to which the detention number line has already been allocated, among the warehousing / department pair information connected to the warehousing / department pair information Pa. . In addition, since the detention time of the entry / exit pair information Pa does not overlap with that of the entry / exit pair information Pc and Pd, the detention number line assignment unit 42 can assign the detention number line R2 to the entry / exit pair information Pa. Next, as shown in FIG. 11 (J), the retention number line assignment unit 42 assigns the retention number line R1 or R3 to the entry / exit pair information Pe. At this time, the retention number line assignment unit 42 is different from the retention number line R2 of the entry / exit pair information Pc to which the retention number line has already been assigned among the entry / exit pair information connected to the entry / exit pair information Pe. Assign. Since the detention time of the entry / exit pair information Pe does not overlap with that of the entry / exit pair information Pa, Pb, Pd, the detention number line assignment unit 42 may assign the detention number line R1 or R3 to the entry / exit pair information Pe. it can.

  After the allocation of the indwelling number line, the indwelling number line allocating unit 42 stores the entry / exit pair information to which the indwelling number line is allocated in the storage unit 43 as a local tour pattern (S430).

  Note that the local tour pattern is a pattern that travels in a certain cycle. Therefore, a plurality of incoming / outgoing pair information continuous from the end to the front end of the local tour pattern may be handled as a single incoming / outgoing pair information.

As described above, the system 1 according to the present embodiment can automatically create the operation tour pattern and the campus tour pattern while adjusting each other almost simultaneously. Since the operation patrol pattern and the campus patrol pattern are closely related to each other, the system 1 can adjust the operation patrol pattern and the campus patrol pattern close to the optimal solution relatively easily and in a short time by adjusting both of them at the same time. Can be generated. At this time, the system 1 automatically formulates and determines the operation tour pattern and the campus tour pattern so that there is no contradiction in the work plan set in the operation tour pattern and the assignment of the detention number set in the campus tour pattern. Can do. As a result, it is possible to automatically create an operation plan for transport equipment and crew members in a traffic system easily and in a short time. At least a part of the operation plan creation method according to the present embodiment may be configured by hardware or software. You may comprise. When configured by software, a program for realizing at least a part of the functions of the data processing method may be stored in a recording medium such as a flexible disk or a CD-ROM, and read and executed by a computer. The recording medium is not limited to a removable medium such as a magnetic disk or an optical disk, but may be a fixed recording medium such as a hard disk device or a memory. Further, a program that realizes at least a part of the operation plan creation method may be distributed via a communication line (including wireless communication) such as the Internet. Further, the program may be distributed in a state where the program is encrypted, modulated or compressed, and stored in a recording medium via a wired line such as the Internet or a wireless line.

  Although several embodiments of the present invention have been described, these embodiments are presented by way of example and are not intended to limit the scope of the invention. These embodiments can be implemented in various other forms, and various omissions, replacements, and changes can be made without departing from the spirit of the invention. These embodiments and their modifications are included in the scope and gist of the invention, and are also included in the invention described in the claims and the equivalents thereof.

DESCRIPTION OF SYMBOLS 1 ... Operation plan creation system, 10 ... Database, 20 ... Operation part, 11 ... Operation diagram, 12 ... Work data, 13 ... Search parameter, 14 ... Indwelling line data, 30 ... Operation circulation pattern generation part, 40 ... On-site circulation pattern Generating unit, 31 ... Constraint extracting unit, 32 ... Operating circulation pattern candidate generating unit, 33 ... Storage unit, 41 ... Receiving / extracting pair extracting unit, 42 ... Indwelling number line assigning unit, 43 ... Storage unit, 50 ... GUI, 51 ... Operation Part, 52 ... display part, 60 ... network

Claims (6)

An operation patrol pattern in which a plurality of route information constituting the operation schedule of the transport equipment is connected is generated in the arithmetic unit,
The arithmetic unit extracts from the operation circuit pattern the entry / exit pair information indicating the time when the transport device enters and leaves the depot location between the adjacent route information in the operation tour pattern, and the time when the transport device leaves the depot location. ,
An operation plan creation method comprising: allocating a detention number line for detention of the transport device by the arithmetic unit based on the entry / exit pair information and detention number information of a depot location of the transport device. If there is fail pair information that cannot be assigned to the indwelling number line among the entry / exit pair information,
Generate a constraint condition that prohibits the fail-pair information,
2. The operation plan creation method according to claim 1, further comprising executing again the generation of the operation patrol pattern, the generation of the in / out pair information, and the assignment of the detention number line based on the constraint condition. In generating the operational patrol pattern,
The calculation unit obtains the route information having the departure time closest to the arrival time after the arrival time of the first route information, among other route information having the arrival location of the first route information as the departure place. Execute connection processing to connect to the first route information as the second route information,
The connection process is repeatedly performed on the plurality of route information to generate a connection line including the plurality of route information,
A connection loop is generated by connecting discontinuous points where the arrival place and the departure place do not connect before and after the route information of the connection line,
3. The operation pattern according to claim 1, wherein when a plurality of the connection loops are generated, a single operation cyclic pattern is generated by switching a common starting place or arrival place in the plurality of connecting loops. How to create an operational plan. In the assignment of the detention number line,
The calculation unit is configured to count the duplication time duplication count for each of the plurality of entry / exit pair information at the same detention location, and among the plurality of entry / exit pair information, Repeat the removal process except for a few incoming / outgoing pairs or an incoming / outgoing pair in which the number of duplicates is less than the number of detained number lines that can be selected for the incoming / outgoing pair,
The said operation part is the operation plan creation method as described in any one of Claims 1-3 which allocates the said retention number line in the reverse order to the order of the said entering / exiting pair information removed in the said removal process. In the calculation unit, the cyclic period of the operational cyclic pattern is divided by the execution period of the work to be performed on the transport equipment,
A work plan of only the number N (N is an integer of 2 or more) obtained by the division is set as a detention place where the work can be performed in the operation patrol pattern,
Among the N work plans, the first interval between the k-th work plan (1 ≦ k ≦ N) and the k-th work plan adjacent thereto, and the k-th work plan and the next step The second interval between the next cycle and the (k + 1) -th work plan is calculated, and any one of the first to Nth work plans is changed so that the time difference between the first interval and the second interval is reduced. The operation plan creation method according to claim 1, further comprising executing work plan adjustment. A plurality of route information constituting the operation schedule of the transport device, and a storage unit for storing detention number line information of the depot location of the transport device;
An operation patrol pattern connecting the plurality of route information is generated, and an entry / exit indicating a time when the transport device enters and leaves the detention location between the route information adjacent in the operation tour pattern An operation plan creation system comprising: an operation unit that extracts pair information from the operation circulation pattern and assigns a detention number line for detaining the transport device based on the entry / exit pair information and the detention number information.

Images