JPH0228762A - Car dispatching system - Google Patents

Abstract

PURPOSE:To obtain the total sum of working cars in the course of work at optional time by inputting order reception information, and calculating order reception data such as starting time and coming-back time at real time according to storage data inputted beforehand. CONSTITUTION:When the order reception information is inputted from inputting devices 11, 12 provided at an office 10, a processing device 15 provided with a microcomputer performs an operation according to the storage data stored in a memory 14, and generates order reception car dispatch data. In a car dispatch room 20, addition, cancellation and mixing instructions, etc., are performed by the inputting device 21, and actual starting time and actual coming-back time are inputted by a card reader 41. In an operating room 30, control for mixing and loading is performed by a plant operating panel 33. The worked result of the car is actualized on the basis of the starting time and the coming-back time by the respective card readers 41, 42, and the car dispatch data after a second car is rewritten by the operation. Thus, the total sum of the cars in the course of the work can be obtained.

Description

DETAILED DESCRIPTION OF THE INVENTION (Field of Industrial Application) The present invention relates to a vehicle dispatch system that efficiently arranges a plurality of work vehicles such as concrete mixer trucks.

(Prior art) In the past, when arranging work vehicles such as concrete mixer trucks, there was no fixed method or calculation formula, and the work vehicles were arranged in order of scheduled departure time based on the experience and intuition of dedicated personnel. However, it is common to write down the day's schedule on paper or type it into a personal computer to dispatch vehicles. In addition, if there is a change in order information, we will reconsider the necessary data based on the changed information, take into account multiple vehicles and multiple sites, and create a dispatch schedule by arranging work vehicles in order of scheduled departure time. However, because the situation changes every moment due to force majeure factors such as the site and work conditions, it is necessary to constantly change the order of scheduled vehicle dispatch times. However, it is difficult for human beings to carry out accurate examinations without delay, and currently this work is carried out by specialized experts.

(Problem to be solved by the invention) However, in conventional delivery systems, the necessary order data is processed based on experience and intuition, and work vehicles are usually arranged in order of departure time. When changes in orders are added to the system, there is a problem in that it becomes difficult to allocate vehicles even for experienced personnel.

On the other hand, it has been conventional to incorporate vehicle dispatch schedules using a personal computer, but in this case, a person in charge examines the arrangement order of vehicles in advance, and the schedule is created by inputting the resulting data. Because of this, it is complicated to operate, and it cannot cope with the rapidly changing real-world situations.

In particular, if there is a change in orders or changes in on-site work hours, the number of waiting vehicles at the terminal may temporarily increase.
On the other hand, there was a risk that the scales would be shipped out and then completely run out, making it impossible to effectively utilize work vehicles or making it difficult to dispatch vehicles in response to orders.

Taking the transportation industry as an example, the following points can be considered. In other words, the next day's schedule is from 8pm to 10pm the night before.
It will be confirmed in due course. Profit cannot be increased unless these are delivered efficiently, so the experience of the vehicle dispatcher is used to decide on efficient routes (distribution of vehicle order). Even if I could do this, I would be home past midnight. Then, the next morning, we receive rush orders before 8am, so we have to incorporate them into our schedule for the day. In the end, it took a considerable amount of time to finalize the schedule, and then the work vehicles finally departed, leading to an inefficient daily life. The person in charge of dispatching is an experienced person who cannot be replaced by someone else, so they end up overextending themselves, and on days when the person in charge is absent due to illness or errands, delivery efficiency drops dramatically. As is well known.

Furthermore, in the case of concrete mixer trucks, there are more pressing problems. In other words, the above-mentioned transportation industry case is of course more appropriate, and the number of work vehicles to be dispatched must be considered.

As is well known, a concrete mixer truck weighs 1 ton.

The maximum loading capacity is set to a certain value, such as 2t and 4 for a car (for example, a 4 for a car can carry 2m3),
It goes without saying that if the delivered volume is 6 m3 at the site, three 4-cars are required, but if the delivered volume is 5.5 m3, three 4-cars are similarly required. Also, depending on the site, only small vehicles are allowed, so
It is necessary to consider the size of the vehicle, the number of vehicles to be allocated relative to the amount delivered, and the efficient distribution of vehicles.

For example, at site A, dividing the delivery amount by the loading capacity of a car (for convenience of explanation, 2 will be used as a car) is 2.2 units, so 3 units are required. B
The site has 1.3 units, so there are 2 units, and the C site has 2.5 units, so there are 3 units.
Assuming that the D site has 2.8 units and 3 units, and the E site has 3.1 units and 4 units, 11.9 units would be sufficient in terms of numbers, but 15 units are required to fit the site without any problems. shall be. Therefore, the dispatcher arranges 15 vehicles. In other words, 15 units will be secured. Originally, the number of vehicles in the above calculation would be prepared, and vehicles returning from one site would be immediately directed to another site, and vehicles returning from another site would be directed to that site. By repeating this process and dispatching vehicles,
Vehicles can be operated efficiently, but in reality there are many sites (A-E) as described above, and in real time, changes in orders, changes in on-site work hours, traffic congestion, etc. In order to deal with this, it is difficult to rely on past experience and intuition, and in the end, the necessary vehicles are allocated to each site (
The actual situation is that 2.5 vehicles would be 3 vehicles), and in the case of the above example, 15 vehicles would have been required as described above.

Therefore, the present invention makes it possible to obtain order data and vehicle dispatch data through simple operations, and also to respond to the actual vehicle dispatch situation in real time. The purpose is to solve problems.

(Means for Solving the Problems and Effects) The vehicle dispatch system of the present invention is a vehicle dispatch system that arranges a plurality of work vehicles from a terminal to a plurality of work sites.
By inputting order information such as the site, arrival time at the site, and work conditions, the order data for at least the departure time and return time is calculated in real time based on the accumulated data entered in advance, and based on this order data, the order data can be placed at any time. The total number of working vehicles in operation is calculated, and further,
When changing, adding, or canceling the order information, the order data is changed by real-time calculation, and the total number of active work vehicles at any given time is calculated based on the changed order data.2 Therefore, Order data and dispatch data are displayed through calculations based on accumulated data, and since you only need to input the minimum order information and change information, the operation is simple and can be operated not only by experts but also by amateurs. . Also,
Since order data and vehicle dispatch data can be obtained through real-time calculations, it is possible to respond to changes and additions, and dispatch vehicles while grasping the actual situation.Moreover, it is possible to dispatch vehicles when necessary, in other words, at any time. Since it is possible to grasp the total number of vehicles currently in operation and scheduled to be in operation, it is possible to accurately plan future vehicle allocation, and to ensure effective vehicle operation.

(Example) An explanation will be given below based on one embodiment of the present invention.

In this embodiment, a case will be described in which a plurality of concrete mixer trucks are delivered to a plurality of sites.

FIG. 1 shows a schematic configuration of a vehicle dispatch control device, in which numeral 10 indicates an office, 20 a dispatch room, and 30 an operation room. At office 10, orders are accepted, additions, cancellations, and changes are made.
In the dispatch room 20, additions, cancellations, changes, completions, slips are issued, and crosstalk instructions are performed, and in the operation room 30, kneading and loading are controlled by operating the plant operation panel 33.

The office 10 also includes two sets of input devices 11 and display devices 12, a data file device 13, a memory 14, and a processing device 15 consisting of a microcomputer unit.
is installed. The memory 14 stores accumulated data that is basic data for vehicle allocation as will be described later. An input device 21 is also provided in the dispatch room 20. A display device 22, a data file device 23, and an input device 31 are provided in the operation room 30.
, a display device 32 is installed. Furthermore, each input device 1
1, 21, and 31 are connected to each other and to the processing device 15, so that they can be operated online. The processing device 15 also includes a work attendance card reader 41 that reads the departure time via the interface 16;
A return card reader 42 for reading the return time is connected,
The driver inserts his/her card to input the actual time of arrival and return to work.

In the above-mentioned device, as shown in FIG. 2, when order information is input, calculations are performed based on the accumulated data,
Create order/vehicle dispatch data. Furthermore, vehicle operation records are realized based on the actual work arrival and return times recorded by each card reader 41, 42, and this enables the management of second and subsequent orders and orders in order to adapt to the ever-changing real-world situation.
Vehicle allocation data is rewritten by calculation. In other words, by using a card against pre-created data, the actual operating status can be clarified, and the priority order of the next vehicle can be determined by calculation, allowing the schedule to be constantly revised and the gap between the schedule and reality to be eliminated. It should be removed as much as possible. The above-mentioned data can be immediately rewritten by calculation even when an order is changed or a shipment is changed. Further, among the rewritten data, the data that becomes the basic condition is stored in the memory as accumulated data. As shown in FIG. 2, the above calculations are performed continuously in a circular manner, so that the order/vehicle allocation data can be set or changed in real time.

According to such a device, by first inputting order information from a customer, the necessary order data and vehicle allocation data for the day can be obtained.

The above order information includes the delivery destination of the mixer truck (delivery sites A, B, C,...), the delivery time at each site (To1 +
"r, 2...), amount of concrete delivered, required vehicle size (vehicle type indicating tonnage), type of work on site (e.g. building frame, scrubbing, foundation, etc.), unloading arrangements. There are conditions (for example, chute, wheeled vehicle, conveyor, etc.), and by inputting these conditions, the required time from the terminal to each site, that is, the outward trip time t and the return trip time j
21 Pitch (work time required for unloading) tp, scheduled departure time TM, scheduled return time Tb, and number of vehicles to be dispatched at the same site are calculated in real time and displayed on the display device as order data indicating the work schedule at each site. 12 is displayed.

The above calculation is performed based on accumulated data inputted in advance to the memory of the microcomputer. This accumulated data is obtained by empirically accumulating round trip time data, pitch data, etc. The round-trip time data is, for example, obtained by subdividing the delivery area and averaging the accumulated data of the outward journey time and return journey time between each of the subdivided areas and the terminal. In addition, the pitch data differs depending on the type of work, cutting conditions, and vehicle type such as 2t, 3t, 4t, 5, etc., so the data is accumulated and averaged under these conditions.

When the above-mentioned order information for each site is input, as shown in Figure 3, the number of vehicles to be dispatched is determined based on the delivery amount and vehicle type for each site, and the outbound trip time 'Ef of the accumulated data is determined.
Based on the order data such as return time t2 and pitch tP, the scheduled departure time T8 of each mixer truck to be dispatched to each site is determined.
The scheduled return time Tb is calculated and displayed on the display device 12 as vehicle allocation data for each site.

For example, at site A, if the delivery volume is 20m3 and the required vehicle type is 4 cars (loading 2m3), the number of vehicles required is 10. Next, 1 out of 10
Regarding the mixer truck at the entrance (code No. is Aool), the outbound trip time tl and return trip time t2 of the above accumulated data
, pitch tp, the scheduled departure time '11, scheduled return time Tb□, etc. for the delivery time T0 are calculated using the following formula (1), (
2).

T-t=Tol-tt...(1)T
bi=To1" tP+t2 ...(2) On the other hand, the second and subsequent mixer trucks (code NO is AOO2
, AOO3,...), the scheduled delivery time (TO
2+ "r03...), as shown in Figure 3, it is desirable for efficiency to be set at the end of the previous work on the mixer truck, so the end of the previous work is set as the next delivery time, and this is set as the next delivery time. As a reference, the scheduled departure time T g2+ T, 31Ts4sea 1, scheduled return time Tb2.T, 3.Tb4, etc. of the second and subsequent mixer trucks are sequentially calculated using the above formula (1).
, (2) are similarly calculated. Then, each mixer truck (AOol, AOO2, AOO3, ・
), as shown in FIG. 4, the scheduled departure time Tsl+
Vehicle allocation schedules arranged in priority order based on Tg□, T, . . . are displayed. Therefore, you can see the dispatch schedule for each site at a glance, and by inputting the minimum necessary order information with a simple operation, you can obtain the necessary order data and dispatch data, making it possible for even experienced workers to manage dispatch. becomes.

Then, at each site, a one-way mixer truck is delivered according to the vehicle allocation schedule in the vehicle allocation data.

When the mixer truck at the 1st station departs, the driver inserts the card into the attendance card reader 41, and the actual departure time TS□ of the vehicle allocation data at the 1st station is written, and the return schedule is accordingly written. Time Tb1 is recalculated and newly written. The driver of the departing mixer truck will contact the terminal via radio if there is congestion on the outbound or return route or if unloading at the work site is likely to take longer than planned. When the driver returns to the terminal after completing the work, the driver inserts the card into the return card reader 42, and the actual return time TB□ is newly written and the vehicle is registered as a dispatchable vehicle. Then, the dispatch schedule of the dispatch data for the second and subsequent vehicles is changed by inputting the actual outward trip time t1, pitch tp, and return trip time t2 required for the first stop, and a more realistic scheduled departure time (Ti2+ T, 3...), scheduled time of return to work (T b 2 ).

Tb3. ...) is displayed. For example, if the line is congested, an operation is performed to advance the scheduled departure time of the second and subsequent cars based on the actual data for the first stop.

In addition, the vehicle allocation data for each site mentioned above includes the mixer trucks (Bool, BOO2, BOO3, ...), (C
:001. COO2, C003,...)... are obtained as vehicle allocation data for each site arranged in priority order.

Furthermore, using the vehicle assignment data at each site (A, B, C,...), the vehicle assignment data for all mixer trucks at all sites is arranged in priority order based on the scheduled departure time. The result is as shown in FIG. 5(a). In addition, as mentioned above, if the departure start time, etc. is revised due to actual data of one-way mixer truck, other changes or additions to the delivery amount from the customer, or changes to the delivery time, etc., each time. , 5th
As shown in Figure (b), the priority order of vehicle allocation data is automatically corrected based on the scheduled departure time.

Therefore, the mixer truck can be set off for each site according to the actual situation, the error in the arrival time at the site can be minimized, and the distribution of trucks can be controlled according to the actual situation. Furthermore, since it is possible to more realistically know when to return to work, it is possible to make a schedule for the next job site. As a result, it becomes possible to perform vehicle allocation management that reduces idle time of the mixer trucks and eliminates unnecessary waiting vehicles, increases the rotation rate of the mixer trucks, and makes effective use of the mixer trucks. Furthermore, since the data of the vehicle that actually returned to the office is actually used by the return card reader, it is possible to accurately schedule the delivery to the next site.

The above-mentioned order data and vehicle allocation data are similarly modified in real time and displayed on the display device 12 even when they are changed due to order changes, shipping changes, etc.

For example, if there is a change in order information such as delivery amount (in the case of addition, etc.), delivery time, composition, destination, vehicle type, etc., the information is corrected accordingly. In addition, in the case of cancellation where construction at site B is canceled, BOOl.

BOO2,... will disappear from the screen, the arrangement of dispatched vehicles will be automatically rearranged excluding these, and the canceled mixer truck will be included and displayed in the return-to-work data, allowing for effective vehicle operation. be able to. In this way, since we keep track of the operating status of vehicles, we are able to respond appropriately to unplanned customer orders (so-called walk-in orders), thereby increasing vehicle utilization rates. becomes possible.

Figure 6 is a chart for distributing mixer trucks to the 1st to 4th sites.In reality, the delivery times for the 1st to 4th sites overlap in a complicated manner, but for the sake of explanation. , the delivery times for each site are shown slightly shifted. In Figure 6, the horizontal bars at each site are No. 1 to No. 8.
The left end of each horizontal bar indicates the scheduled departure time, and the right end indicates the scheduled return time.

With respect to these horizontal bars, the optimal vehicle allocation for vehicles N001 to N008 can be obtained from the vehicle allocation data, and accordingly, the total number of active vehicles at each time is determined. In the example shown in the figure, eight vehicles are required around noon, and the number of vehicles required gradually decreases after that. Therefore, 1:30P, m has 5 units, 2:00P, m
3 machines at 1:30 p.m., 3 machines from 1:30 p.m., 2
: From 30P and m, it is instantly understood that 5 units... can be directed elsewhere.

This way, you can receive separate orders for the afternoon in the morning, and you can also handle additional and urgent orders.

Since deliveries are made according to on-site conditions, there are often changes to order information while the vehicle is in operation.
In addition, the presence or absence of traffic jams due to constantly changing traffic volumes, etc.
Since reality differs from the schedule, order data is changed (updated) using real-time calculations. By changing this order data, the latest vehicle allocation data can be obtained at any given time, and the graph shown in Figure 6 has also been changed. As a result, the number of required vehicles has also been changed over time, and based on this latest data, the graph shown in Figure 6 has also been changed. After that, we will make plans for receiving orders, etc. In this case, the portion of the graph before that time is expressed based on actual data.

In addition, in the example shown in Figure 6, vehicles N087 and N008 only need to arrive after 11:00 am, respectively, and from this point of view as well, it is possible to schedule vehicles and drivers in advance, resulting in an efficient Vehicles can be dispatched.

In the above embodiment, the concrete mixer truck was used as an example to explain the dispatch of vehicles for the same day, but the present invention is not limited to this, and can be applied to a wide variety of similar vehicles. It goes without saying that future dispatch of vehicles, such as the next day or the day after, can also be carried out.

(Effects of the Invention) As explained above, according to the present invention, the necessary order data and vehicle allocation data can be obtained by inputting the minimum order information, so the system operation is simple and only an experienced person can operate the system. be able to.

In addition, since each data creation process is performed based on real-time calculations, vehicle allocation data can be immediately corrected even if there is a change in order information, etc., making it possible to manage vehicle allocation according to the actual situation. As a result, it becomes possible to eliminate unnecessary waiting vehicles, increase the rotation rate of vehicles, and make effective use of vehicles. In particular, since it is possible to know the total number of active and scheduled vehicles when necessary, that is, at any given time, it is possible to accurately plan future vehicle allocation, contributing to even more effective use of vehicles. It is.

[Brief explanation of the drawing]

1 to 5 relate to an embodiment of the present invention, in which FIG. 1 is a schematic diagram of the vehicle dispatch control device, FIG. 2 is a schematic diagram showing data processing of the vehicle dispatch control device, and FIG. 3 is a diagram of each site. Figure 4 is a diagram showing the arrangement of vehicles at each site, Figure 4 is a diagram showing vehicle allocation data at each site, and Figures 5 (a) and (b) are diagrams showing the overall vehicle allocation data and corrected vehicle allocation data. , Figure 6 is the first
~ Char 1 showing the case of distributing a mixer truck to the 4th site
This is a diagram. T8...Departure time tb...Working time Tb...Return time

Claims (2)

[Claims] (1) In a vehicle dispatch system that arranges multiple work vehicles from a terminal to multiple work sites, by inputting order information such as the site, site arrival time, work conditions, etc., at least the departure time is determined based on pre-entered accumulated data. A vehicle dispatch system that calculates in real time the order data of the vehicle and return time, and calculates the total number of active work vehicles at any given time based on this order data. (2) In a vehicle dispatch system that arranges multiple work vehicles from a terminal to multiple work sites, by inputting order information such as the site, site arrival time, work conditions, etc., at least the departure time is determined based on pre-entered accumulated data. The order data of the time of arrival and return to work is calculated in real time, and when the order information is changed, added, or canceled, the order data is changed by real-time calculation, and based on this changed order data, the order data of the active time at any time is calculated. A vehicle dispatch system characterized by calculating the total number of work vehicles.