JPH09209603A - Departure scheduling method in mechanical parking lot - Google Patents

Abstract

(57) [Abstract] [Problem] In each of a plurality of stages, a trolley travels.
A book lane, a plurality of parking rooms on both sides of this lane and a loading and unloading elevator room, and a loading and unloading working time in a mechanical parking lot equipped with a loading and unloading elevator connected to each elevator room A few efficient shipping scheduling methods. SOLUTION: When a rule relating to load distribution to other stages and a rule relating to allocation of a carrier vehicle are respectively set in advance, and when a vehicle leaving request is issued, the two rules set above in the order of occurrence of this request are set. A leaving scheduling method in a mechanical parking lot, which is used alone or in combination (S1 to S9) to determine an operation schedule of the above-mentioned carriage and loading and unloading elevators.

Description

Detailed Description of the Invention

[0001]

BACKGROUND OF THE INVENTION 1. Field of the Invention The present invention relates to a shipping scheduling method in a mechanical parking lot.

[0002]

2. Description of the Related Art FIG. 4 is a view showing the structure of an underground multi-storey car park as an example of a conventional mechanical car park. In FIG. 4, a vehicle entrance room and a vehicle exit room are provided on the ground, and each of a plurality of steps in the basement has one lane on which two transport vehicles run, and one room on each side of the lane. A plurality of parking rooms and an entrance / exit elevator room separated from each other are provided, and an entrance / exit elevator room at each of the above stages and an entrance room / exit room on the ground are connected by an entrance / exit elevator, respectively. Conventionally, in the exit scheduling in the mechanical parking lot as described above, a measure that seems to be particularly effective is not taken in order to improve efficiency. For example, the exit vehicle is stored in response to a certain exit request. It is carried out by a method in which a trolley which is vacant at that time unloads the unloading car. Also,
If there are two transport carriages (hereinafter simply referred to as trolleys) in each tier in the case of unloading this car, use the trolley that is vacant at that time, or use 2 tiers in each center. The method of dividing into equal parts and using the truck in charge of the area to which the storage room belongs was taken.

[0003]

A request for delivery from a parking lot is random with respect to a parking room, and a plurality of requests for delivery are generally overlapped in time, so that a queue for processing is created. Therefore, two cars, three cars,
There may be a case where the delivery request is continuously generated. Normally, it takes considerably longer to move the carriage than to move the elevator, but in such a case, the load on the carriage becomes excessive,
With a simple shipping scheduling, the shipping work is greatly delayed and the shipping processing time becomes long. Also, if there are two trucks on each tier, they travel in the same lane. Therefore, if the unloading work is simply assigned to one truck, the two trucks will be connected in relation to the work of the other truck. Interference such as collision or overtaking may occur in the meantime. In reality, it is not possible to collide or overtake between two bogies, so in such a case, one of the bogies causing the interference will return and wait for the work of the other bogie. Will be required. In such a case, not only one trolley is not in operation, but it also consumes an extra time of evacuating, and in the plan where interference can occur frequently, the efficiency of the parking lot loading and unloading work is poor, and the total working time is There is a problem that it becomes long.

[0004]

According to a first aspect of the present invention, there is provided a method of scheduling a delivery of goods in a mechanical parking lot, wherein each of the plurality of stages has one lane on which a single or a plurality of transport carriages travel. , A plurality of parking rooms and an entrance / exit elevator room separated for each room are provided on both sides of this lane, and an entrance / exit elevator connected to each of the above-mentioned entry / exit elevator rooms is provided. In the method of scheduling delivery of goods in a mechanical parking lot, rules regarding load distribution to other stages and rules regarding assignment of transport vehicles are set in advance, and when a request for leaving a vehicle occurs, the above-mentioned order of occurrence By using the two rules that have been set, either individually or in combination, the transportation of the above-mentioned carriage and the operation of the loading and unloading elevator can be performed. It is intended to determine the schedule.

According to a second aspect of the present invention, there is provided a method of scheduling delivery of goods in a parking lot, wherein in the method of scheduling of delivery of goods according to the first aspect, the rules regarding load distribution to the other stages are as follows: When there is no warehousing work between two or three cars in a row, one of the unloading cars is moved to the other stage using the warehousing elevator, and the unloading carrier is used to unload.
(2) A rule is set that the destination of the movement to the other tier is a tier that maximizes the allowance of the carrier truck in consideration of the completion condition of the previous loading and unloading work and the time until the next unloading work. As a rule regarding the allocation of the carrier trucks, when there are two carrier trucks, (1) when the carrier trucks accessible at both ends of each stage and in the vicinity thereof are limited, the accessible carrier truck is selected. Allocation, (2) Considering the positions of the parking room and the elevator of the first and second delivery vehicles in the continuous delivery order, and avoiding interference between the transport vehicles during the delivery processing. (3) The above-mentioned (1) and (2) do not determine the allocation of the carrier vehicles, so that separate carrier vehicles are allocated to two consecutive delivery operations, and (4) Allocation of the carrier in (3) above Is to set a rule that performs so as not to cause interference between the transport carriage each other.

According to a third aspect of the present invention, there is provided a method for scheduling delivery of goods in a mechanical parking lot, wherein when the two rules set as described above are used in combination in the method of scheduling delivery of goods according to claim 1 or 2, When a delivery queue occurs, it is first checked whether or not there are two or three consecutive delivery vehicles in the same row in the delivery queue. If there is no continuous location, load balancing is not performed. Create a schedule, and if there are consecutive points, create a schedule that uses the rules for load balancing to the other stages and a schedule without load balancing for each of these consecutive points, and then create the above. Each delivery schedule for which a carrier is assigned using the rules for assigning a carrier for each of all schedules. Create a is the last one to unloading operation time from among all of the goods issue schedule described above creation is adopted as the optimum unloading schedule unloading schedule becomes minimum.

By applying the delivery scheduling method as described above, when delivery requests are continuously made to the same stage during the delivery work in the mechanical parking lot, some of the delivery cars are not busy with the other stages. By allocating to, it is possible to shorten the delivery work time. Also, as much as possible to avoid interference when processing two trolleys,
There is little extra work time required for evacuation and waiting.

[0008]

BEST MODE FOR CARRYING OUT THE INVENTION First, the rules of a method of scheduling a delivery in a mechanical parking lot according to the present invention will be described. The exit scheduling method in the mechanical parking lot according to the present invention uses the following rules regarding load distribution and trolley allocation to other stages, either alone or in combination. (A) The rules regarding load distribution to other stages are as follows. (A-1) When the unloading work continues in two or three units on the same tier, if there is no warehousing work during that period, take one of them to another tier in advance using the warehousing elevator and use the trolley of that tier Take out. (A-2) The tier of the carry-out destination to the other tier in the above (a-1) has the largest allowance for the trolley in consideration of the completion condition of the previous loading / unloading work and the time until the next unloading work. Step.

(B) The rules regarding the allocation of the truck are as follows. (B-1) For the exit from the parking room where only one of the carriages is accessible at both ends of each stage and in the vicinity of both ends, the accessible carriage is assigned. (B-2) Bogie allocation regarding load distribution to other stages is performed as follows. Considering the positions of the parking room and the elevator room of the cars in the first and second shipping orders in the continuous shipping order, two carriages A and B are provided so as not to cause interference during the shipping process.
Assign. (B-3) For those in which the truck allocation is not determined by the above rules (b-1) and (b-2), two consecutive
Two trolleys A and B are assigned to one unloading work as much as possible. (B-4) The truck allocation in (b-3) above is performed so that the trucks A and B do not interfere with each other.

In the following description, as in the case of the parking lot shown in FIG. 4, each of a plurality of tiers is provided with two carriages and a warehousing and unloading elevator room, and warehousing and unloading of each tier. It is also assumed that there is an entrance / exit elevator connected to the elevator room. Of the two vehicles on each stage, the vehicle on the left side is the vehicle A and the vehicle on the right side is the vehicle B.

FIG. 5 is a step 3 for explaining the rules of the present invention.
It is a figure which shows the example of a delivery vehicle arrangement | positioning when there is a delivery request | requirement in succession of cars, and demonstrates the rule regarding the load distribution to another stage by the example of FIG. In the arrangement example of FIG. 5, three consecutive P, Q, and R exit requests are made in a certain stage, and the first exit vehicle P is the parking room on the right side of the exit elevator room, and the second and third exits. Both cars Q and R are in the parking room on the left side of the exit elevator room, but Q is the room on the left side. In this case, according to the load distribution rule (a-1) and the trolley allocation rule (b-2), the trolley A takes out the vehicle R, conveys it to the storage elevator room, and takes it to another stage by the storage elevator. The trolley B takes out the car P, conveys it to the unloading elevator room, and leaves it. Since the work of the carriages A and B does not interfere with each other, they can be processed in parallel at the same time. Car B is car R
After the processing of, the vehicle Q is taken out, and after the processing of leaving the vehicle P is completed,
Delivered to the elevator room for delivery.

FIG. 6 is a diagram showing an example of the arrangement of delivery vehicles in a parking lot for explaining the rules of the present invention. A method of determining the stage of the load distribution destination when the load is distributed to other stages will be described with reference to FIG. FIG.
Shows the 1st to 9th delivery requests indicated by the numbers in the circles from the 1st stage to the 3rd stage.
The 5th, 6th and 7th warehousing has occurred continuously in the 3rd stage. In the load balancing rule, at this time, the first stage and the second
Of the stages, the second stage that has plenty of work for the truck is selected as the stage to which the load is distributed.

FIG. 7 is a diagram showing an example of the arrangement of delivery cars at a certain stage for explaining the rules of the present invention, and the numbers in the parking compartment indicate the delivery order according to the delivery request. The trolley allocation rule will be described with reference to the example of FIG. In the delivery vehicle arrangement example of FIG. 7, the vehicle in the delivery order 1 is in the leftmost room and can be accessed only by the truck A, so the truck A processes it. Vehicles in the delivery order 5, 15, and 17 are assigned trucks according to the truck assignment rules (b-3) and (b-4). As for the vehicle having the delivery number 5, the vehicle having the delivery number 1 in the previous process is the trolley A, and since there is time until the subsequent process, the trolley B processes it. Issue numbers 15 and 17 are 15
Since the car No. is on the left side of the exit elevator room and the car No. 17 is on the right side of the exit elevator room, the car A and the car B are processed so that they do not interfere with each other.

FIG. 1 is a flow chart showing the processing sequence of the method of scheduling a delivery in a mechanical parking lot according to the present invention. The numerical value following S in the figure indicates a step number.
The delivery scheduling method of the present invention will be described with reference to FIG. When a delivery queue occurs due to a delivery request, it is checked whether or not there are two or three consecutive delivery vehicles in the same row in the delivery queue (see S1 in FIG. 1). If there is no location, a schedule without load distribution is created (see S3 in FIG. 1). If there are continuous points, a schedule (see S2 in FIG. 1) and a schedule without load distribution (see FIG.
(See S3 in step 1). Assuming that there are two consecutive locations, there are four combinations (2 × 2) of each schedule, and four schedules can be created.

This is because it is better to distribute the load to other stages (short delivery time) and to other stages depending on the position of the parking room of the delivery car and the use situation of the truck and elevator at that time. Since it may be better not to balance the load, both schedules are created to compare the outgoing work time. Generally, if there are two or three consecutive delivery cars in the same stage in the delivery queue (that is, a place where it is necessary to judge whether or not it is better to distribute the load to other stages), each place In 2), schedules are created for both cases of load balancing and cases of no load balancing, and a total of 2 ⁿ schedules are created.

When the schedule creating process is completed for all the consecutive points in the delivery queue (see S4 in FIG. 1), next, trucks are assigned to each of the 2 ⁿ schedules (see FIG. 1). S5 in FIG.
See). When the trolley allocation is completed for all the delivery queues (see S6 in FIG. 1), as a result, a total of 2 ⁿ delivery schedules are completed. Therefore, the delivery work time for each completed delivery schedule is completed. Is calculated (see S8 in FIG. 1), and the schedule that minimizes the leaving work time is adopted as the optimal leaving schedule (see S9 in FIG. 1).

FIG. 2 is an explanatory view of the situation of the parking lot and the exit queue at the time of creating the exit schedule according to the present invention. In the figure, "in" means "incoming elevator room", "out" means "outgoing elevator room, hatching". The parked room indicates that there is a car in it. In FIG. 2, the parking lot has two tiers, the first tier and the second tier.
There are steps, and each step has 3 on each side of the lane.
There is a single-row parking room. The 15th row on one side has a storage elevator room and the 17th row has a storage elevator room. Therefore, there is one parking room for each, so there are 60 parking rooms per vehicle. . FIG. 2 shows a situation in which 11 delivery queues are completed when the vehicle is full. Here, the parking room to which the number n (however, n = 1, 2, 3, ... 11) is added indicates that the n-th delivery vehicle in the delivery queue is in. The characteristic in the example of FIG. 2 is that the delivery numbers 2 to 7 are continuously generated in the second stage, and during this period, a large load is concentrated in the second stage.

When a schedule is created according to the flow chart of FIG. 1 in response to the delivery request of FIG. 2, four kinds of schedules are created depending on whether load distribution to other stages is taken into consideration. The first two of these four types are shown in Schedule 1 and Schedule 2 of FIG. FIG. 3 is a diagram showing an example of a delivery schedule created by applying the present invention to the example of FIG. 2. Schedule 1 in FIG. 3 is a schedule that does not consider load distribution to other stages, and schedule 2 is a delivery number 2. , 3 and 4 are continuous in the second stage, the load is distributed to other stages. In the case of schedule 2, the load is distributed to the other stages by first transporting the 4th delivery vehicle to the 1st stage using the receiving elevator,
It is carried out by the method of leaving from the stairs. Further, since the third delivery vehicle is stored in the parking room at the end of the second stage, only the accessible trolley A can be processed. Schedule 1
Comparing the delivery work processing times of Nos. 2 and 2, Schedule 2 is a better schedule because the processing time of Schedule 2 is shorter.

The above description has been made for the case where each of the plurality of stages of the parking lot is provided with two carriages, and one entrance elevator room and one exit elevator room. However, in a slightly smaller parking lot, only one trolley may be provided in each tier, and in a very large parking lot, there are two entrance elevator rooms and two exit elevator rooms on each tier. There are cases where each is provided. The present invention, as described above, in each tier depending on the size of the parking lot,
Even when the number of carriages, the number of warehousing / outgoing elevator rooms, and the number of warehousing / outgoing elevators connected to these rooms are changed, the optimum two rules are set in accordance with these numbers to set the present invention. By applying, it is possible to shorten the shipping time and the shipping time.

The field of application of the present invention is not limited to the above-described mechanical parking lot, and, for example, as in an automatic warehouse, the limited space can be effectively utilized to store articles, and It is possible to reduce the working time of warehousing and warehousing of goods by applying it to equipment for taking goods in and out.

[0021]

As described above, according to the present invention, each of a plurality of stages is divided into one lane on which a single or a plurality of transport carriages travel, and on both sides of this lane for each room. A plurality of parking rooms and a loading and unloading elevator room is provided, and also in the exit scheduling method in a mechanical parking lot provided with a loading and unloading elevator respectively connected to the loading and unloading elevator rooms of each stage,
Set the rules for load balancing to other stages and the rules for allocating transport vehicles beforehand,
When a vehicle leaving request is issued, the operation schedules of the carrier vehicle and the loading and unloading elevators are determined by using the two rules set above in order of occurrence of the request alone or in combination.
By setting the optimal two rules according to the facility scale of the mechanical parking lot, for example, the number of trolleys at each stage, the number of elevators, and the number of elevator rooms, etc., the mechanical parking lot can be used alone or in combination. When the delivery request is continuously issued to the same tier during the unloading work in, the unloading work time can be shortened by allocating some of the unloading vehicles to other tiers where the trolley is not busy, and the two trolleys handle it. Since the interference at the time is avoided as much as possible, there is an effect that it is possible to reduce the occurrence of extra work time required for saving or waiting.

Further, according to the present invention, a rule regarding load distribution to the other tiers is targeted for a general facility scale in which a plurality of tiers and a loading / unloading elevator room are provided in each tier of a mechanical parking lot. (1) When two or three unloading operations are continuously performed in the same tier and there is no warehousing operation in the meantime, one of the unloading vehicles is moved to another tier using the unloading elevator, and (2) The destination of the transfer to the other tier is the maximum allowance of the transfer trolley considering the completion of the previous loading and unloading work and the time until the next unloading work. Set a rule to be
As a rule regarding the allocation of the carrier vehicles, when there are two carrier vehicles, (1) when the carrier vehicles accessible at both ends of each stage and in the vicinity thereof are limited, the accessible carrier vehicle (2) Considering the positions of the parking rooms and the elevators of the first and second exit vehicles in the continuous exit order, and avoiding interference between the transport vehicles during the exit processing. Two transport carriages are allocated, and (3) In the above (1) and (2), it is not decided that the transport carriages should be assigned. ) In the above-mentioned (3) assignment of carrier vehicles, a rule is set so that the carrier vehicles do not interfere with each other. Therefore, the above two selection rules optimal for the general equipment scale are independently set. Or group By using together, the effect of unloading working time and Goods Movement working time is shortened is obtained.

Further, according to the present invention, when a combination of the above-mentioned two rules is used and a delivery queue occurs, first, two or three delivery vehicles are in the same stage in the delivery queue. Check whether or not there is a continuous place, and if there is no continuous place, create a schedule without load distribution, and if there is a continuous place, load to the other stage for each continuous place. Each issue that creates both a schedule with a rule for distribution and a schedule without load balancing, and then assigns a carrier using the rules for assigning a carrier for each of all the schedules created above Create a schedule, and finally select the optimal shipping schedule that minimizes the shipping time from all the shipping schedules created above. Since to adopt as the schedule, even when the number of goods issue queue is large, the effect of unloading working time and Goods Movement working time is greatly reduced.

[Brief description of drawings]

FIG. 1 is a flow chart showing a processing sequence of a shipping scheduling method in a mechanical parking lot of the present invention.

FIG. 2 is an explanatory diagram of a situation of a parking lot and a delivery queue when a delivery schedule is created according to the present invention.

FIG. 3 is a diagram showing an example of a delivery schedule created by applying the present invention to the example of FIG.

FIG. 4 is a diagram showing a structure of an underground multi-story parking lot as an example of a conventional mechanical parking lot.

FIG. 5 is a diagram showing an arrangement example of delivery vehicles when there are consecutive delivery requests for three vehicles at a certain stage for explaining the rule of the present invention.

FIG. 6 is a diagram showing an arrangement example of delivery vehicles in a parking lot for explaining the rules of the present invention.

FIG. 7 is a diagram showing an example of an arrangement of shipping from a certain stage for explaining the rule of the present invention.

 ─────────────────────────────────────────────────── ─── Continuation of the front page (72) Inventor Nobuyuki Kawai 1-2-1, Marunouchi, Chiyoda-ku, Tokyo Nihon Steel Pipe Co., Ltd.

Claims (3)

[Claims] 1. Each of the plurality of stages has one lane on which a single or a plurality of carrier trucks travel, and a plurality of parking rooms divided into rooms on both sides of the lane and an elevator for loading and unloading elevators. In the method of scheduling the exit and exit in a mechanical parking lot in which a room is provided, and an entrance and exit elevator room connected to each of the above-mentioned entry and exit elevator rooms, respectively, a rule regarding load distribution to other steps and transfer Rules for allocating trucks are set respectively, and when a vehicle exit request is issued, the above-mentioned transport vehicle and warehousing and exiting can be performed by using the two rules set above in the order in which the requests are issued, either individually or in combination. Departure scheduling method in mechanical parking lot characterized by deciding elevator operation schedule 2. A rule regarding load distribution to the other tiers is as follows: (1) When two or three warehousing operations are continuously performed in the same tier and no warehousing work is performed between them, one of the delivery vehicles The platform is moved to another stage by using the storage elevator, and is delivered by using the transfer carriage of the destination, (2) The destination of the other stage is the completion state of the previous loading and unloading work and the next delivery. In consideration of the time until work, a rule is set to set the stage that maximizes the margin of the transport carriage. As a rule regarding the assignment of the transport carriages, when there are two transport carriages, (1) both ends of each stage If the accessible carriages are limited in the vicinity and in the vicinity thereof, the accessible carriage is assigned, and (2) the position of the parking room of the first and second dispatch cars in the consecutive shipping order. Considering the position of the delivery elevator, In order to prevent interference between the carrier vehicles, the two carrier vehicles are assigned to each other. (3) In the above (1) and (2), the assignment of the carrier vehicles is not decided, so two consecutive delivery operations are performed. 2. A rule is set such that separate transport vehicles are allocated to each other, and (4) the transport vehicle allocation in (3) above is performed so that interference does not occur between the transport vehicles. A method for scheduling leaving a car in a mechanical parking lot. 3. When using the set two rules in combination, when a delivery queue occurs, first two or three delivery vehicles are in the same stage in the delivery queue.
Check whether or not there is a continuous place, and if there is no continuous place, create a schedule without load distribution, and if there is a continuous place, load to the other stage for each continuous place. Each issue that creates both a schedule with a rule for distribution and a schedule without load balancing, and then assigns a carrier using the rules for assigning a carrier for each of all the schedules created above 3. A schedule is created, and a shipping schedule that minimizes the shipping work time is adopted as the optimal shipping schedule from among all the shipping schedules created last. Exit scheduling method for mechanical parking lots in Japan.