JPH04262455A - Running operation scheduler for truck car and locomotive - Google Patents

Abstract

PURPOSE:To make it possible to prepare an appropriate running operation schedule for truck cars and locomotives in a short period of time. CONSTITUTION:From each of a truck car/locomotive dimension information storage section 6, a truck/locomotive operating schedule information storage section 7, a carry work information storage section 4, loading/unloading information storage section 5, and an operating rule information storage section 3 for storing allocation priority sequence of truck cars 1, 1..., and locomotives 2, 2... for carrying work and operating rule information relating to operating target for truck cars and locomotives, the truck car/locomotive dimension information, running operating shedule information, carry work information, loading/ unloading information, and running operating rule information are supplied to a truck car/locomotive running operating schedule determining section 8. The truck car/locomotive operating schedule determining section 8, based on these items of information, allocates truck cars and locomotives to be used for carry works to each carry work by means of a multitree search method to prepare a running operating schedule for truck cars and locomotives.

Description

[Detailed description of the invention]

0001

[Industrial Application Field] The present invention allocates the trolleys and mobile vehicles to be used for transportation work in which a mobile vehicle pulls a trolley loaded with the transported goods, and the operation plan of the trolleys and mobile vehicles is determined. Regarding the device to be created.

0002

[Prior Art] The distribution route for product shipment involves transporting products requested for shipment from a product storage area such as a warehouse to a crane installed on a quay by placing them on a trolley pulled by a mobile vehicle. However, there is a logistics route in which the transported products are loaded onto a ship docked at the quay using the crane. When creating a work schedule related to product logistics for such distribution routes, it is possible to create an appropriate work schedule using the branch-and-bound method, which solves the problem by generating a search tree and limiting it. ing.

[0003] The distribution of products in the above-mentioned distribution route consists of a first distribution route from the product storage area to the crane;
The distribution route can be divided into a second distribution route from the crane to the ship. The matters to be determined in the work schedule for the second distribution route are the quay where the work of loading the products onto the ship is to be carried out and the work time period. The method of creating such a schedule is to use the branch and limit method, while observing product shipping delivery dates, berthing conditions depending on the size of the ship, etc.
A method has been proposed to carry out dynamic allocation of loading operations and quays with the aim of minimizing ship berth time and leveling crane usage time (Operations Research, 1988).
, VOL33, No. 1, P33-39).

0004

[Problem to be Solved by the Invention] However, although the work schedule for the second logistics route can be determined by one-to-one assignment of loading work and crane in the same time period,
When creating a work schedule for the second logistics route, that is, a trolley/mobility vehicle operation plan, it is necessary to determine the one-to-multiple assignment of transportation work - trolleys and the multiple-to-multiple assignment of transportation work - mobile vehicles. Since the number of combinations of assignments based on the search tree is enormous, there is a problem in that when the branch and bound method is applied to create the bogie/mobile vehicle operation plan, it takes a long time to create it.

The present invention has been made in view of the above circumstances, and it is an object of the present invention to provide an operation plan creation device for bogies and mobile vehicles that makes it possible to create an appropriate operation plan for bogies and mobile vehicles in a short time. With the goal.

[0006]

[Means for Solving the Problems] The operation plan creation device for trolleys and mobile vehicles according to the present invention loads cargo onto a trolley that is towed by a mobile vehicle, and transports the cargo from a predetermined loading point to an unloading point. In an apparatus for allocating a trolley and mobile vehicle to be used from among a plurality of trolleys and mobile vehicles to each of a plurality of transport operations for transporting goods, and creating an operation plan for the trolley and mobile vehicle, the target of the operation plan is means for storing specification information of the bogie and mobile vehicle related to the bogie and mobile vehicle and their respective capacities; means for storing usage schedule information related to the usage schedule of each of the bogie and the mobile vehicle; A means for storing transport work information related to the transport work to be performed and its contents, and a means for storing transport work information related to the transport work and its contents, and a means for storing transport work information related to the transport work target, the distance from the loading port to the unloading port, and the location of the loading port and unloading port. a means for storing location information; a means for storing operational rule information related to priorities for assignment of trolleys and mobile vehicles to transport operations and operational objectives of the trolleys and mobile vehicles; A means for allocating a trolley and a mobile vehicle to be used for each transport operation using a multiple tree search method based on schedule information, transport work information, loading/unloading port information, and operation rule information is provided. It is characterized by

[0007]

[Operation] The multiple tree search method is an application of the branch and bound method for tree search, in which the tree for search is decomposed into subproblems, the trees are multiplexed, and the solution is calculated for each tree. It is designed to perform a search. Multiplexing trees in this way simplifies tree traversal because each tree has fewer branches. In the present invention, an operation plan is created for each trolley and mobile vehicle based on usage schedule information, trolley/mobile vehicle specification information, transportation work information, loading/unloading point information, and operation rule information. This information limits the tree generation, and the tree generated based on these limitations includes usage schedule information, trolley/mobile vehicle specification information, transportation work information, and loading and unloading point information. and operation rule information are taken into account in tree generation, so the allocation of carts and mobile vehicles is performed mainly based on the operation rule information that optimizes logistics throughout the transportation work. Furthermore, since the multiple tree search method is used when allocating carts and mobile vehicles to transport operations as described above, the search can be performed in a short time.

[0008]

DESCRIPTION OF THE PREFERRED EMBODIMENTS The present invention will be specifically described below with reference to drawings showing embodiments thereof. FIG. 1 is a schematic block diagram showing the configuration of an operation plan creation device for a bogie and a mobile vehicle according to the present invention. In the figure, reference numerals 1, 1... are carts on which products to be transported are loaded, and these carts 1, 1... can be self-propelled or cannot be self-propelled. It is connected to mobile vehicles 2, 2, and is towed. Allocation of trolleys 1, 1... to the transportation work of the product,
The assignment of the mobile vehicles 2, 2... to the product transportation work determined by the trolleys 1, 1... to be used is the assignment of the mobile vehicles 2, 2... to the product transportation work determined by the trolleys 1, 1...
is supposed to be done. The trolley/motor vehicle operation plan determination unit 8 includes an operation rule information storage unit 3 and a transportation work information storage unit 4.
, a loading/unloading area information storage section 5, a trolley/mobile vehicle specification information storage section 6, and a trolley/mobile vehicle usage schedule information storage section 7 are connected.

[0009] The operation rule information storage section 3 stores information on each trolley 1.
, 1... and each mobile vehicle 2, 2..., that is, equalization of the number of vehicles used, reduction of the number of vehicles used, minimization of moving distance, and transported products. Goals such as maximizing the allocation rate of appropriate trolleys 1, 1... for the types of vehicles, priorities among these goals, and priority items for transportation work in allocating trolleys 1, 1... and mobile vehicles 2, 2... , that is, operational rules consisting of priority items such as work during time periods with a large number of bogie requests, work with a large number of mobile vehicle requests, work with a small number of usable bogies, work with a large number of mobile vehicle requests, etc., and the priority order among the priority items. Information is stored in advance.

The transport work information storage unit 4 stores the work number of each transport work, work start time, work end time, work time, rest time, name of the ship on which the product was loaded, name of the place where the product was loaded, name of the place where the product was shipped, Transportation work information consisting of product name, product delivery date, and transportation weight is stored in advance.

[0011] The loading/unloading area information storage section 5 stores the loading/unloading area information storage unit 5.
Loading and unloading area information is stored in advance, which includes the distance between unloading areas, the range of loading and unloading areas where it is desirable to work with one mobile vehicle 2, and group data for each range.

[0012] The bogie/mobile vehicle specification information storage unit 6 stores information on the vehicle type, car number, maximum loading capacity, bogie suitability for each product, usability or not, and information on the number of bogies for each bogie 1, 1... Transport capacity by transport distance and transport product, and vehicle type of each mobile vehicle 2, 2...
Bogie/mobile vehicle specification data consisting of vehicle number, information on whether or not it can be used, and transportation capacity by number of bogies and transportation distance is stored in advance.

[0013] The trolley/mobility vehicle usage schedule information storage unit 7 includes:
Information on the usage schedule for each trolley 1, 1... and mobile vehicle 2, 2..., consisting of the usage status and future usage schedule, is given, and this information is stored. There is.

The bogie/mobile vehicle operation plan determination section 8 includes an operation rule information storage section 3, a transportation work information storage section 4, a loading/unloading point information storage section 5, a bogie/mobile vehicle specification information storage section 6, and The above-mentioned information stored in each of these is provided from the trolley/mobile vehicle usage schedule information storage section 7. Based on this information, the bogie/mobile vehicle operation plan determination unit 8
Now, the operation plan for the bogies 1, 1, . . . and the mobile vehicles 2, 2, . . . is determined.

[0015] The operation of the thus constructed operation plan creation device for bogies and mobile vehicles will be explained. Figure 2 shows the trolley
The mobile vehicle operation plan determining unit 8 determines the trolleys 1, 1... and the mobile vehicle 2.
, 2... is a flowchart showing the procedure for determining the operation plan of First, the bogies 1, 1... and mobile cars 2, 2... stored in the bogie/motor vehicle specification information storage section 6 are targeted for operation planning, and the bogies/motor vehicle usage schedule information storage section 7 stores them. Based on the usage schedule information, the usable time periods of the trolleys 1, 1... and the mobile vehicles 2, 2... are determined (step S
1).

Next, in order to limit the search space for solutions to the trolley/mobile vehicle operation plan, the transportation tasks stored in the transportation task information storage section 4 are divided into a plurality of work groups according to their work time periods (step S2).

[0017] Then, it is determined whether or not the assignment of carts 1, 1, . . . has been completed for the transportation work of all the work groups (step S3). If it is determined in step S3 that the allocation of carts 1, 1, etc. for the transportation work of all groups has not been completed, the following step S4 is performed.
~Step S6 is repeated to allocate the carts 1, 1, . . . . When allocating trolleys 1, 1, etc., first, among the work groups for which allocation has not been completed, the work group with the earliest work time slot is assigned to the priority item stored in the operation rule information storage unit 3. Based on this, the transportation tasks in the work group are sorted, and data of a transportation task sequence is created by arranging the transportation tasks in order of priority (step S4).

[0018]Next, in step S1, data of a bogie train of the car numbers of bogies 1, 1, . . . that are targets of the operation plan is created (step S5). Then, the transportation work information storage section 4
transportation work information, loading/unloading area information in the loading/unloading area location information storage section 5, trolley/mobile vehicle specification information in the trolley/mobile vehicle specification information storage section 6, and operation of the operation rule information storage section 3. Based on the rule information, a multiple tree search method, which will be described later, is used for the data of the transport work sequence and the data of the trolley train to perform transport work-carriage assignment (step S6), and the process returns to step S3.

Furthermore, if it is determined in step S3 that the allocation of carts 1, 1, etc. has been completed for the transportation work of all groups, that is, by repeating steps S4 to S6, When the transportation work--truck assignment is completed, the trolley determined in step S6 is assigned to the mobile vehicle based on the vehicle type data of the trolleys 1, 1, etc. stored in the trolley/mobile vehicle specification information storage unit 6. 2, 2... determines whether or not it requires towing by mobile vehicle 2, 2..., thereby determining the transport work that requires mobile vehicle 2, 2..., and dividing the requested transport work into multiple tasks depending on the work time period. Divide into groups (step S7)
.

[0020] Then, for the transportation work of all the work groups divided in step S7, the mobile vehicles 2, 2...
Determine whether the allocation has been completed (step S8)
. If it is determined in step S3 that the assignment of mobile vehicles 2, 2, . When allocating mobile vehicles 2, 2, etc., first, among the groups for which allocation has not been completed, the group with the earliest working time slot is selected.
Sorts the transportation tasks in the group based on the priority items stored in the operation rule information storage unit 3, and creates data for a transportation task sequence in which the transportation tasks are arranged in order of priority (
Step S9).

[0021] Next, in step S1, data of a mobile vehicle convoy with vehicle numbers of mobile vehicles 2, 2, etc. targeted for planning is created (
Step S10). Then, transportation work information in the transportation work information storage section 4, loading and unloading point information in the loading and unloading point information storage section 5, and trolley/mobile vehicle specification information and operation in the trolley/mobile vehicle specification information storage section 6. Based on the operation rule information in the rule information storage unit 3, the transport work is performed using a multiple tree search method as described later for the transport work train data and the mobile vehicle train data.
Mobile vehicles are allocated (step S11), and step S3
Return to Further, if it is determined in step S8 that the assignment of mobile vehicles 2, 2, .

Next, the aforementioned multiple tree search method will be explained in detail. The multiple tree search method used in steps S6 and S11 is a search method that applies a branch and bound method. Hereinafter, the multiple tree search method will be explained using the transportation work-carriage assignment in step S6 as a representative example. The purpose of the multiple tree search method is to find the transport work sequence (i1, i2
...in ) and the train of bogies (j1, j2 ...jm), the solution X as shown in equation (1) below is
The objective is to solve i j at high speed.

[0023]

[Math 1]

FIG. 3 is a conceptual diagram of the multiple tree search method. The multiple tree search method uses the second tree of the conventional two-dimensional search9
It has a multidimensional structure in which a plurality of first trees 91, 91... (only one is shown) are generated on each branch of the second tree. In the transportation work-trolley assignment, the first tree 91, 91... generates a trolley pattern that can be assigned for each transportation task,
In the second tree 92, the trolley patterns obtained in the first trees 91, 91, . . . are assigned to each transportation task.

FIG. 4 is a detailed diagram showing an example of the first tree 91 that generates cart patterns that can be assigned to transportation operations. In FIG. 4, carts j1, j2 are arranged in the depth direction of the tree in order of priority of carts 1, 1, etc. obtained based on the operation rule information stored in the operation rule information storage section 3.
, j3, j4 (bogie row) are lined up (the shallower the depth, the higher the priority), and in the width direction, the bogies j1, j2,
There are two branches, one in which j3 and j4 are assigned to, for example, transportation work i1, and one in which they are not assigned. Such a search of the first tree 91 is performed with priority given to depth, and branches are pruned based on the usage status of the trolley in other transport operations, the transport capacity of the trolley, and the transported weight and work time of the transport operation i1. This search is terminated when more than a predetermined number of solutions are found, or when the entire search is completed. For example, in FIG. 4, the trolley pattern (j1, j2
, j3 ), (j1 , j2 , j4 ) and (
j2, j4) have been found. Since the order in which the cart patterns are generated is the priority order of the cart patterns, the cart pattern located further to the left at the end of the first tree 91 has a higher priority for the transportation work i1.

FIG. 5 is a detailed diagram showing an example of the second tree 92 for allocating truck patterns to each transport operation. In FIG. 4, transport operations i1, i2, i3, . . . are lined up in the depth direction of the second tree 92, and cart patterns that can be assigned to the transport operations i1, i2, i3, . . . are lined up in the width direction. The transportation operations i1, i2, i3, . . . are arranged in such a manner that the shallower the depth, the higher the priority, and the cart patterns are arranged in such a way that the priority becomes higher toward the left in the width direction. Such a search of the second tree 92 proceeds in a depth-first manner, and ends when a solution is obtained (when the search reaches the end of the branch). In addition, if branch generation fails before the search reaches the end of the branch (if there is no allocatable cart pattern), backtracking (destroying the most recently allocated cart pattern - transportation task assignment) Attempt to allocate a cart pattern and generate branches again).

Further, the transport work-mobile vehicle assignment in step S11 is performed using the same multiple tree search method as the transport work-carriage assignment described above.

FIG. 6 is a bogie operation diagram showing a comparison between the bogie operation plan obtained by the present invention and the bogie operation plan obtained by the conventional technique. This operation diagram shows how to transport products from the warehouse to the quay.
It represents the movement of the trolley over time. In the figure, a, b, c, and d represent the movement of the trolley, QA is the loading operation for ship A at the quay, and QB is loading work for ship B at the quay. WA represents the unloading work for ship A at the warehouse, and WB represents the unloading work for ship B at the warehouse. As is clear from FIG. 6, in the prior art, the number of carts (for example, two) required for each task is determined, so four carts (a, b, c) are required for this series of tasks.
, d) is required. On the other hand, in the present invention, since allocation is taken into consideration in units of carts, only two carts (a, b) are required for this series of operations. In this way, in the present invention, the number of carts used can be reduced compared to the conventional method.

FIG. 7 is a mobile vehicle operation diagram representing a mobile vehicle operation plan obtained by the present invention. This operation diagram represents the movement of a mobile vehicle over time when carrying out multiple transport operations during a predetermined period of time. e in the diagram represents the movement of the mobile vehicle, and A, B, C,
D and E represent transportation work. As is clear from FIG. 7, the mobile vehicle e can move back and forth between a plurality of transport operations and perform a plurality of transport operations during the same time period.

[0030]

Effects of the Invention As described in detail above, in the operation plan creation device for bogies and mobile vehicles according to the present invention, a multiple tree search method is used to decompose a tree for search into subproblems, multiplex the trees, and divide each tree into subproblems. Since the solution is searched for each tree, the tree search is simplified and the time required to search for the assignment is short, making it possible to create a bogie/mobility vehicle operation plan in a short time. , bogie/mobile vehicle specification information,
Since it is obtained based on usage schedule information, transportation work information, loading/unloading point information, and operation rule information, it can also be obtained by taking into account information for optimizing logistics using trolleys and mobile vehicles. The present invention has excellent effects, such as being able to realize predetermined operational rules such as shortening the travel distance of vehicles and reducing the number of trolleys and mobile vehicles used.

[Brief explanation of the drawing]

FIG. 1 is a schematic block diagram showing the configuration of an operation plan creation device for a bogie and a mobile vehicle according to the present invention.

FIG. 2 is a flowchart showing a procedure for determining the operation plan of a bogie and a mobile vehicle in a bogie/mobile vehicle operation plan determination unit.

FIG. 3 is a conceptual diagram of a multiple tree search method.

FIG. 4 is a detailed diagram illustrating an example of a first tree that generates cart patterns that can be assigned to transport operations;

FIG. 5 is a detailed diagram illustrating an example of a second tree that allocates truck patterns to each transport operation.

FIG. 6 is a truck operation diagram showing a comparison between a truck operation plan obtained by the present invention and a truck operation plan obtained by the conventional technique.

FIG. 7 is a mobile vehicle operation diagram representing a mobile vehicle operation plan obtained by the present invention.

[Explanation of symbols]

1 Bogie 2 Mobile vehicle 3 Operation rule information storage section 4 Transportation work information storage section 5 Loading/unloading point information storage section 6 Bogie/mobile vehicle specification information storage section 7 Bogie/mobility vehicle usage schedule information storage section 8 Bogie/mobility vehicle usage plan information storage section 8 Vehicle operation plan decision department

Claims (1)

[Claims] Claim 1: A plurality of trolleys and a mobile vehicle are used for each of a plurality of transport operations in which goods are loaded onto a trolley towed by a mobile vehicle and the transported goods are transported from a predetermined loading point to an unloading point. In a device for allocating bogies and mobile vehicles to be used from among them and creating a travel plan for the bogies and mobile vehicles, the bogies and mobile vehicles related to the bogies and mobile vehicles to be used in the operation plan and their individual capabilities. means for storing specification information, means for storing usage schedule information related to usage schedules of each of the trolley and mobile vehicle, and means for storing transport work information related to the transport work to be performed and its contents; , means for storing loading and unloading point information related to the distance from the loading point to the unloading point, the loading point and the location of the unloading point, and priority for allocation of trolleys and mobile vehicles to the transporting operation. A means for storing operational rule information related to the ranking and operational objectives of the bogies and mobile vehicles, and a means for storing operation rule information related to the operational objectives of the bogies and mobile vehicles, and based on the above-mentioned bogie and mobile vehicle specification information, usage schedule information, transportation work information, loading and unloading port information, and operational rule information. , means for individually allocating a bogie and a mobile vehicle to be used for each transportation task using a multiple tree search method.