Information management system, method for optimizing route, and program

Abstract

To optimize a route for a garbage vehicle to circulate.SOLUTION: The information management system according to an embodiment includes: a route information acquisition unit for acquiring route information including candidates of routes for circulating garbage collection sites and the distance and the inclination of each route; an energy consumption prediction unit for predicting the energy that a garbage vehicle consumes in each virtual operation and travel in each route, from the route information and information showing the amount of collected garbages in each garbage collection site; and a route selection unit for selecting a route with the smallest energy consumption of the routes.SELECTED DRAWING: Figure 1

Description

Technical Field

[0001] The present invention relates to an information management system, a route optimization method, and a program.

Background Art

[0002] Generally, a garbage truck (also referred to as a refuse collection vehicle) makes one or more rounds a day from the location serving as the base of the business office, tours a plurality of garbage collection points in a predetermined order to collect garbage, discharges the collected garbage at a garbage incineration plant, and then returns to the base of the business office again.

Prior Art Documents

Patent Documents

[0003]

Patent Document 1

Patent Document 2

Patent Document 3

Summary of the Invention

Problems to be Solved by the Invention

[0004] In the future, garbage trucks are expected to increase not only gasoline-powered vehicles using gasoline and diesel-powered vehicles using light oil, but also electric vehicles (EVs) using electricity. In any case, when the garbage truck tours each garbage collection point, it is desirable that the energy consumed in the operation and driving of the mounted equipment of the garbage truck be minimized.

[0005] In order to reduce the energy consumption of the garbage truck, it is conceivable to change the route for touring each garbage collection point, but it is not easy to determine which route is optimal. For example, even if it is the shortest route, if it has to climb a steep slope with a large amount of garbage loaded, the energy consumption will increase, so it may not be the optimal route.

[0006] The present invention has been made in view of the above circumstances, and an object thereof is to provide an information management system, a route optimization method, and a program that enable optimization of the route along which garbage trucks travel.

Means for Solving the Problems

[0007] An information management system according to a first aspect of the present invention includes a route information acquisition unit that acquires route information indicating a plurality of route candidates for traveling around each garbage collection site and at least the distance and gradient of each route, and from the route information and information indicating the amount of garbage collected at each garbage collection site, a power consumption prediction unit that predicts the energy consumed in at least the loading operation and traveling of the garbage truck for each route, and a route selection unit that selects the route with the smallest energy consumption among the respective routes.

[0008] A route optimization method according to a second aspect of the present invention includes acquiring, by a route information acquisition unit, a plurality of route candidates for traveling around each garbage collection site and route information indicating at least the distance and gradient of each route, predicting, by a power consumption prediction unit, the energy consumed in at least the loading operation and traveling of the garbage truck for each route from the route information and information indicating the amount of garbage collected at each garbage collection site, and selecting, by a route selection unit, the route with the smallest energy consumption among the respective routes.

[0009] A program according to a third aspect of the present invention is a program for causing one or more computers to realize a function of acquiring a plurality of route candidates for traveling around each garbage collection site and route information indicating at least the distance and gradient of each route, a function of predicting the energy consumed in at least the loading operation and traveling of the garbage truck for each route from the route information and information indicating the amount of garbage collected at each garbage collection site, and a function of selecting the route with the smallest energy consumption among the respective routes.

Effects of the Invention

[0010] According to the present invention, it is possible to optimize the route along which the garbage truck travels.

Brief Description of the Drawings

[0011]

Figure 1

Figure 2

Figure 3

Figure 4

Figure 5

Figure 6

Figure 7

Figure 8

Figure 9

Figure 10

Figure 11

Embodiments for Carrying Out the Invention

[0012] Hereinafter, embodiments will be described with reference to the drawings.

[0013] <Overall configuration> FIG. 1 is a diagram showing an example of a configuration including an information management system according to an embodiment.

[0014] The information management system 1 shown in FIG. 1 enables optimization of the route along which the garbage truck V travels, and is realized as a computer having a control unit 2, a storage unit 3, and a communication unit 4. The control unit 2, the storage unit 3, and the communication unit 4 are not limited to being arranged in one computer, and may be separately arranged in two or more computers. For example, the control unit 2 and the communication unit 4 may be arranged in the first computer, and the storage unit 3 may be arranged in the second computer.

[0015] The control unit 2 corresponds to a processor, and various functions are realized by the processor executing a program. The various functions are not limited to being realized by a processor provided in one computer, and may be configured such that two or more processors provided in two or more computers share and realize the various functions.

[0016] As various functions, the control unit 2 has an information acquisition unit 21, a garbage collection amount prediction unit 22, a route information acquisition unit 23, an energy consumption prediction unit 24, a route selection unit 25, and an information output unit 26. Details thereof will be described later.

[0017] The storage unit 3 stores a program, and also stores information used by the control unit 2 for processing and information indicating the result processed by the control unit 2. In this storage unit 3, for example, various data, position information, garbage collection amount, route information, energy consumption, optimal route information, etc. are stored. Details thereof will be described later.

[0018] The communication unit 4 can communicate with a plurality of garbage collection stations 10, the garbage truck base 11, and the garbage truck base 11 respectively.

[0019] At the garbage truck base 11 within the office, a garbage truck V is deployed. The garbage truck V may be a gasoline vehicle, a diesel vehicle, or an EV. The garbage truck V makes one or more trips a day from the garbage truck base 11 (starting from the garbage truck base (S point)) to visit a plurality of garbage collection points 10 (garbage collection point (A point), garbage collection point (B point), garbage collection point (C point)) to collect garbage, discharges the collected garbage at the garbage incineration plant 12 (garbage incineration plant (E point)), and then returns to the garbage truck base 11 again (with the garbage truck base (G point) as the end point). There are six candidate routes for the garbage truck V to travel, as will be described later.

[0020] In addition, in FIG. 1, to avoid complicated explanations, the case where the number of garbage collection points 10 is three is illustrated, but the number of garbage collection points 10 is not limited to this example and may be four or more. The number of garbage trucks V is also not limited to one and may be multiple.

[0021] Garbage in a predetermined area is collected at each of the plurality of garbage collection points 10.

[0022] A camera that constantly photographs the garbage or a weighing scale that constantly measures the weight of the garbage may be installed at each garbage collection point 10, and the image data of the garbage captured by the camera or the weight data of the garbage measured by the weighing scale may be transmitted to the information management system 1 in real time via communication means. In addition, when the garbage truck V is equipped with a weighing scale, instead of installing a camera or a weighing scale at each garbage collection point 10, when the garbage truck V collects garbage at each garbage collection point 10, the weight of the garbage is measured by that weighing scale, and the obtained weight data is transmitted from the garbage truck with the weighing scale to the information management system 1.

[0023] In addition, instead of installing the camera or the weighing scale at each garbage collection point 10, it may be installed at the garbage incineration plant 12 instead. In that case, the image data of the garbage captured by the camera or the weight data of the garbage measured by the weighing scale may be transmitted to the information management system 1 via communication means when the garbage truck V discharges the garbage at the garbage incineration plant 12 (that is, once per round trip).

[0024] The dustcart base 11 is provided with an information management device 1, a garbage incinerator 12, and an information processing device capable of communicating with each dustcart V. The garbage incinerator 12 is also provided with an information processing device capable of communicating with the dustcart base 11.

[0025] The information processing device provided in the dustcart base 11 can, for example, transmit information indicating the specifications related to the mounting, auxiliary equipment (such as air conditioners), and running of the dustcart V, information indicating the area under the jurisdiction of the business office, and information indicating the positions of the dustcart base 11, each garbage collection point 10, and the garbage incinerator 12 to the information management system 1, or receive information indicating the optimal route transmitted from the information management system 1. In addition, the information processing device provided in the dustcart base 11 can exchange various information with the dustcart V and the garbage incinerator 12 as needed.

[0026] The dustcart V can transmit data indicating the position of the dustcart V, data indicating the respective states of the mounting, auxiliary equipment (such as air conditioners), and running of the dustcart V to the dustcart base 11 and the information management system 1 in real time or periodically.

[0027] Fig. 2 schematically shows an example of a map representing the route along which the dustcart V travels.

[0028] In the map M shown in Fig. 2, "S" represents the "dustcart base (S point)". "A" represents the aforementioned "garbage collection point (A point)". "B" represents the aforementioned "garbage collection point (B point)". "C" represents the aforementioned "garbage collection point (C point)". "E" represents the garbage incinerator (E point). "G" represents the dustcart base (G point).

[0029] In the example of Fig. 2, a route is represented in which the dustcart V goes from the dustcart base (S point) to the garbage collection point (A point) to collect garbage, then goes to the garbage collection point (B point) to collect garbage, then goes to the garbage collection point (C point) to collect garbage, then goes to the garbage incinerator (E point) to discharge the garbage, and returns to the dustcart base (G point).

[0030] Regarding the elevation, it is assumed to have the following characteristics.

[0031] (a) It is low near point A (b) The elevation rises from point A to point C (c) The elevation rises from point A to point B (d) On the way from point B to point C, it crosses a bridge over a river with a low elevation, so it goes down once and then climbs up. The candidate routes for the garbage truck V to travel are not just the one shown in Fig. 2, but there are a total of six routes.

[0032] Fig. 3 schematically shows examples of six maps representing the six routes for the garbage truck V to travel.

[0033] The differences among the six routes lie in the order of visiting the "garbage collection point (point A)", "garbage collection point (point B)", and "garbage collection point (point C)".

[0034] The map M in Fig. 3(a) corresponds to the map M described in Fig. 2 and represents Route 1 that visits each garbage collection point in the order of "garbage collection point (point A)", "garbage collection point (point B)", and "garbage collection point (point C)".

[0035] The map M in Fig. 3(b) represents Route 2 that visits each garbage collection point in the order of "garbage collection point (point A)", "garbage collection point (point B)", and "garbage collection point (point C)".

[0036] The map M in Fig. 3(c) represents Route 3 that visits each garbage collection point in the order of "garbage collection point (point C)", "garbage collection point (point A)", and "garbage collection point (point C)".

[0037] The map M in Fig. 3(d) represents Route 4 that visits each garbage collection point in the order of "garbage collection point (point B)", "garbage collection point (point C)", and "garbage collection point (point A)".

[0038] The map M in Fig. 3(e) represents a route 5 that circulates through each garbage collection point in the order of "garbage collection point (point C)", "garbage collection point (point A)", and "garbage collection point (point B)".

[0039] The map M in Fig. 3(f) represents a route 6 that circulates through each garbage collection point in the order of "garbage collection point (point C)", "garbage collection point (point B)", and "garbage collection point (point A)".

[0040] For example, when circulating through "garbage collection point (point A)", "garbage collection point (point B)", and "garbage collection point (point C)", there are often gradients such as slopes. For example, if a large amount of garbage is loaded when going up a slope, the energy consumption will increase. On the other hand, if a small amount of garbage is loaded when going up a slope, the energy consumption can be suppressed. In this embodiment, considering such points, a route with the smallest energy consumption is obtained.

[0041] Fig. 4 conceptually shows the relationship between the slope, the weight of garbage, and the energy consumption.

[0042] Here, it is assumed that there is a large amount of garbage at "garbage collection point (point A)" and there is an uphill slope from "garbage collection point (point A)" to "garbage collection point (point B)".

[0043] In such a case, as shown in Fig. 4(a), when the garbage truck V climbs the slope with a large amount of garbage at "garbage collection point (point A)" loaded, the energy consumption of the garbage truck V increases. In the case of an EV, the electricity cost deteriorates, and in the case of a gasoline vehicle or a diesel vehicle, the fuel efficiency deteriorates.

[0044] On the other hand, when the garbage truck V climbs the slope without loading a large amount of garbage at "garbage collection point (point A)" and heads towards "garbage collection point (point B)", the energy consumption of the garbage truck V can be suppressed. In the case of an EV, the electricity cost improves, and in the case of a gasoline vehicle or a diesel vehicle, the fuel efficiency improves. It can be said that it is efficient to collect a large amount of garbage at "garbage collection point (point A)" after going down the slope, for example.

[0045] In addition, the energy consumption of the garbage truck V can be roughly divided into the energy consumed in the "loading" operation and the energy consumed in the "traveling" operation. However, there is also energy consumed in the operation of "auxiliary equipment". These vary depending on the situation. In this embodiment, considering such points, a route with the lowest energy consumption is sought.

[0046] Fig. 5 shows an example of the change over time of the output of the energy consumed in the "loading" operation and the output of the energy consumed in the "traveling" operation.

[0047] Here, an example of the change in energy consumption of the garbage truck V from the "garbage collection point (Point A)" to the "garbage collection point (Point B)" is shown.

[0048] P1 in Fig. 5 represents the energy consumption (output) of "loading", and P2 represents the energy consumption (output) of "traveling".

[0049] As shown in Fig. 5, the energy consumption P1 of "loading" shows a large value immediately after the start of garbage collection at the "garbage collection point (Point A)" because the loading is in full operation. When the garbage collection is about to end, P1 becomes smaller and becomes zero during the travel between collection points. P1 becomes large when the garbage collection at the "garbage collection point (Point B)" starts because the loading is in full operation.

[0050] On the other hand, the energy consumption P2 of "traveling" is zero immediately after the start of garbage collection at the "garbage collection point (Point A)" because the garbage truck V is stopped. When the garbage collection is about to end, P2 becomes large for travel preparation. If there is a downhill slope between collection points, P2 may drop below zero due to the generation of regenerative power. P2 becomes zero when the garbage collection at the "garbage collection point (Point B)" starts because the garbage truck V stops.

[0051] <Functions of the control unit 2> The various functions of the control unit 2 will be sequentially described.

[0052] ·Information acquisition unit 21 The information acquisition unit 21 is a function that acquires, via the communication unit 4, various types of data transmitted from the garbage truck base 11, the garbage truck V, and each garbage collection point 10, and position information indicating the positions of the respective garbage collection points 10. The acquired various types of data and position information are stored in a predetermined storage area of the storage unit 3.

[0053] For example, when the information acquisition unit 21 receives image data of the garbage captured by a camera or weight data of the garbage measured by a weighing scale from each garbage collection point 10, it acquires them and sequentially records them in a predetermined storage area of the storage unit 3 for each garbage collection point.

[0054] In addition, when the information acquisition unit 21 receives weight data for each garbage collection point from the garbage truck V equipped with a weighing scale, it acquires them and sequentially records them in a predetermined storage area of the storage unit 3 for each garbage collection point. The weight data for each garbage collection point is recorded separately for each season, month, and day of the week. The recorded data is used as past performance data separated by season, month, and day of the week.

[0055] In addition, when the information acquisition unit 21 receives image data of the garbage captured by a camera or weight data of the garbage measured by a weighing scale from the garbage incineration plant 12, it acquires them and sequentially records them in a predetermined storage area of the storage unit 3. At that time, the weight data is divided equally by the number of garbage collection points or divided at a predetermined ratio for each garbage collection point to obtain the weight data for each garbage collection point, which is further recorded separately for each season, month, and day of the week. The recorded data is used as past performance data separated by season, month, and day of the week.

[0056] In addition, when the information acquisition unit 21 receives data indicating the position of the garbage truck V, data indicating the respective states of the mounted equipment, auxiliary equipment (such as air conditioners), and running of the garbage truck V from the garbage truck V, it acquires them and sequentially records them in a predetermined storage area of the storage unit 3.

[0057] In addition, when information indicating specifications regarding mounting, auxiliary equipment (such as air conditioners), and travel of the garbage truck V is transmitted from the garbage truck base 11, the information acquisition unit 21 acquires them and sequentially records them in a predetermined storage area of the storage unit 3.

[0058] In addition, the information acquisition unit 21 records, as position information, information indicating the area under the jurisdiction of the business office transmitted from the garbage truck base 11, and information indicating the position of the garbage truck base 11, the positions of the respective garbage collection points 10, and the position of the garbage incineration plant 12 in a predetermined storage area of the storage unit 3.

[0059] The various types of information stored in the storage unit 3 can be used in the learning processes for garbage collection amount prediction and energy consumption prediction described later, thereby improving the accuracy of each prediction.

[0060] · Garbage collection amount prediction unit 22 The garbage collection amount prediction unit 22 is a function that predicts, for example, the garbage collection amount (or garbage weight) of each garbage collection point 10 for 24 hours of that day using the data acquired by the information acquisition unit 21 and recorded in the storage unit 3. For predicting the garbage collection amount of each garbage collection point 10, the accuracy of the prediction may be improved by applying AI (Artificial Intelligence) that performs a learning process using various types of data. The predicted garbage collection amount of the garbage collection point 10 is stored in a predetermined storage area of the storage unit 3. The process for predicting the garbage collection amount of each garbage collection point 10 varies depending on the type of data used.

[0061] For example, when the information acquisition unit 21 uses the image data of each garbage collection point transmitted in real time from each garbage collection point 10, it determines the type and density of the garbage by image analysis (determines the material and density of the garbage from the shape and color in the image), determines the volume (determines the dimensions from the image), and from these, obtains the garbage weight corresponding to the garbage collection amount of the day for each garbage collection point. When using the weight data of each garbage collection point transmitted in real time from each garbage collection point 10, the garbage weight corresponding to the garbage collection amount of the day for each garbage collection point is obtained from these.

[0062] In addition, when the information acquisition unit 21 uses the weight data for each garbage collection site (past performance data classified by season, month, and day of the week) transmitted from the garbage truck V equipped with a weighing scale, it obtains the garbage weight corresponding to the daily garbage collection amount for each garbage collection site from these data.

[0063] In addition, when the information acquisition unit 21 uses the weight data for each garbage collection site (past performance data classified by season, month, and day of the week) transmitted from the garbage incineration plant 12, it obtains the garbage weight corresponding to the daily garbage collection amount for each garbage collection site from these data.

[0064] · Route information acquisition unit 23 The route information acquisition unit 23 acquires map information and traffic information provided by an external information providing agency via the communication unit 4. In addition, by using a route search function and a road detail information search function such as a navigation API, it specifies the positions of the garbage truck base (S point), each garbage collection site (A point, B point, C point), the garbage incineration plant (E point), and the garbage truck base (G point), and performs route search and road detail information search to obtain route candidate information indicating candidates for a plurality of routes for touring each garbage collection site, or to obtain route detail information indicating the distance, gradient, and vehicle speed of each route. The above-mentioned map information, traffic information, route candidate information, and route detail information are collectively referred to as route information. The route information is stored in a predetermined storage area of the storage unit 3.

[0065] The map information is information indicating a road map including at least the area where the garbage truck V travels. This information also includes information indicating latitude, longitude, and altitude. The traffic information is information indicating the traffic volume or the degree of congestion, the presence or absence of construction work, and the presence or absence of lane restrictions.

[0066] The distance of each route means the driving distance from the garbage truck base (S point) by the garbage truck V, touring each garbage collection site (A point, B point, C point), discharging the garbage at the garbage incineration plant (E point), and returning to the garbage truck base (G point).

[0067] The gradient of each route means the change in elevation from when the garbage truck V leaves the garbage truck base (S point), tours each garbage collection point (A point, B point, C point), discharges the garbage at the garbage incineration plant (E point), and returns to the garbage truck base (G point).

[0068] Figs. 6(a) to (d) show an example of information obtained by performing route search and road detailed information search.

[0069] As shown in Figs. 6(a) and (b), when performing the above-mentioned route search and road detailed information search, a plurality of route candidates are obtained. Further, as shown in Figs. 6(c) and (d), the change over time of the gradient of each route (change over time of elevation) and the change over time of the vehicle speed of the garbage truck V on each route (change over time of average speed) are obtained. The change over time of the vehicle speed is obtained by using traffic information indicating the traffic volume or degree of congestion, the presence or absence of construction work, and the presence or absence of lane restrictions for each route. The information shown in Figs. 6(c) and (d) is used in the process of predicting the energy consumption described later.

[0070] · Energy consumption prediction unit 24 The energy consumption prediction unit 24 has a function of predicting the energy (energy consumption) consumed by the garbage truck V in the operations of "mounting", "auxiliary equipment", and "traveling" for each route from the above-mentioned route information and the information indicating the garbage collection amount at each garbage collection point. For predicting the energy consumption for each route, an AI (Artificial Intelligence) that performs learning processing using various data may be applied to improve the prediction accuracy. The information indicating the predicted energy consumption is stored in a predetermined storage area of the storage unit 3.

[0071] Fig. 7 shows an example of the breakdown of the predicted energy consumption (power consumption) of the garbage truck V.

[0072] Regarding the "mounting equipment", the energy consumption prediction unit 24 predicts, for each route, the energy (e.g., power consumption) consumed in the operation of the mounting equipment that changes according to the amount of garbage collected (or garbage weight) at each garbage collection site. For example, if the mounting equipment is a rotary plate type, it predicts the energy consumed in the operation of the rotary plate, and if the mounting equipment is a press type, it predicts the energy consumed in the operation of the compression plate. For predicting the power consumption of the mounting equipment, data indicating the specifications of the mounting equipment recorded in the storage unit 3 and performance data indicating the past state of the mounting equipment may be used.

[0073] Regarding the "auxiliary equipment", the energy consumption prediction unit 24 predicts, for each route, the power consumption of auxiliary equipment such as an air conditioner. For predicting the power consumption of the auxiliary equipment, data indicating the specifications of the auxiliary equipment recorded in the storage unit 3 and performance data indicating the past state of the auxiliary equipment may be used.

[0074] Regarding the "traveling", the energy consumption prediction unit 24 calculates the "traveling resistance" for each route from the above-described route information (including information on the change in gradient (change in elevation) of each route shown in FIGS. 6(c) and 6(d) and the change in vehicle speed (change in average speed) of the garbage truck V on each route). The "traveling resistance" includes elements such as "vehicle weight", "vehicle speed", and "gradient" that change during the process of the garbage truck V traveling around each garbage collection site. The calculation formula for the "traveling resistance" will be described later. Further, the energy consumption prediction unit 24 calculates the output required for traveling (e.g., the required torque as shown in FIG. 8) using the traveling resistance. Further, the energy consumption prediction unit 24 calculates various efficiencies such as those of the motor-inverter and the speed reducer, and calculates the "energy consumed during traveling" (e.g., power consumption) taking into account the various efficiencies. The calculation formula for the "energy consumed during traveling" will be described later.

[0075] Regarding the "vehicle weight" included in the above "traveling resistance", for each route, by using the information indicating the garbage weight obtained from the amount of garbage collected at each garbage collection site, the vehicle weight that changes during the process of the garbage truck V traveling around each garbage collection site can be calculated.

[0076] Regarding the "vehicle speed" included in the above "running resistance", for each route, by using traffic information indicating the traffic volume or the degree of congestion, the presence or absence of construction work, and the presence or absence of lane restrictions, it is possible to calculate the vehicle speed that changes during the process of the garbage truck V making rounds at each garbage collection point.

[0077] Regarding the "gradient" included in the above "running resistance", for each route, by using information indicating the latitude, longitude, and altitude of each part, it is possible to calculate the gradient that changes during the process of the garbage truck V making rounds at each garbage collection point.

[0078] (Regarding the calculation formula of "running resistance") "Running resistance" is expressed by the following formula.

[0079] R total =R r +R a +R g +R i Here, R total : Running resistance [N] R r : Rolling resistance [N] R a : Air resistance [N] R g : Gradient resistance [N] R i : Acceleration resistance [N] Rolling resistance R r 、Air resistance R a 、Gradient resistance R g 、Acceleration resistance R i are each expressed by the following formula.

[0080] R r =μ r mg R a =μ a Sv 2 R g =mg·sinβ R i =(m + Δm)b Here, m: Vehicle weight (including the weight of the garbage to be loaded) [kg] g: Acceleration due to gravity [m / s 2 μ r : Rolling resistance coefficient S: Projected area of the vehicle front [m 2 v: Vehicle running speed [km / h] μ a : Air resistance coefficient β: Inclination angle Δm: Inertial weight (inertial mass) of the rotating part of the vehicle's rotating mechanism [kg] b: Acceleration [m / s 2 That is, the rolling resistance R r includes the element of "vehicle weight". The air resistance R a includes the element of "vehicle speed". In particular, the gradient resistance R g includes the elements of "vehicle weight" and "gradient". The acceleration resistance R i includes the element of "vehicle weight".

[0081] From this, changes in the "vehicle weight", "vehicle speed", and "gradient" of the garbage truck V affect the "running resistance", and further affect the "output required for running" described later, and ultimately affect the "energy consumed during running" described later.

[0082] (Regarding the calculation formula of "output required for running") The "output required for running" is expressed by the following formula.

[0083] Pd = 2 * p i * R total * r w * N tire / 60 / eta_ final Here, Pd: Output required for running [kW] p i : Pi R total : Running resistance [N] r w : Tire diameter radius [m] N tire : Tire rotation speed [rpm] eta_​​​final : Efficiency of the final gear of the differential device (DEF).

[0084] (Regarding the calculation formula of "energy consumed during driving") "Energy consumed during driving" is expressed by the following formula.

[0085] P = Pd / (eff / 100) Here,[[]] P: Energy consumed during driving [kW] eff: Various efficiencies such as motor - inverter and speed reducer.

[0086] · Route selection unit 25 The route selection unit 25 is a function that selects the route with the smallest energy consumption among each route as the optimal route. Information indicating the selected optimal route is stored in a predetermined storage area of the storage unit 3.

[0087] · Information output unit 26 The information output unit 26 is a function that transmits information indicating the optimal route selected by the route selection unit 25 to the garbage truck base 11 etc. via the communication unit 4.

[0088] <An example of verification results> Figures 9 and 10 show an example of verification results in which the optimal route (optimal route) when the EV travels is obtained using the above - mentioned method for the six routes shown in Figure 3.

[0089] First, calculations were performed to obtain the "distance [km]", "required time [min]", "energy consumption [kWh]", and "electricity cost [km / kWh]" for the entire Route 1, especially for Route 1.

[0090] Route 1 consists of five sections, namely "Section 1_SA", "Section 2_AB", "Section 3_BC", "Section 4_CE", and "Section 5_EG", which represent the sections from point S to point A, from point A to point B, from point B to point C, from point C to point E, and from point E to point G, respectively. Also, "Recovery A", "Recovery B", and "Recovery C" shown in Fig. 9(a) represent the recovery at point A, the recovery at point B, and the recovery at point C, respectively. "Discharge" represents the discharge at point E.

[0091] Fig. 9(a) is a table showing the results of calculating the "accumulated waste weight [kg]", "travel distance [km]", "required time [min]", and "energy consumption [kWh]" for each part and section of Route 1, and then calculating the total for each. In this example, the calculation is based on the assumption that the weight of the waste collected (loaded) at one time is 200 kg.

[0092] Fig. 9(b) is a table showing the results of calculating the electricity cost [km / kWh] based on the table in Fig. 9(a). The electricity cost [km / kWh] is calculated in three categories. "Travel" in Fig. 9(b) shows the result of calculating the electricity cost [km / kWh] only for the travel excluding auxiliary equipment and mounting. "Travel + Auxiliary Equipment" shows the result of calculating the electricity cost [km / kWh] for the travel and auxiliary equipment excluding mounting. "Travel + Auxiliary Equipment + Mounting" shows the result of calculating the electricity cost [km / kWh] for all of the travel, auxiliary equipment, and mounting. Here, we focus on the electricity cost [km / kWh] of "Travel + Auxiliary Equipment + Mounting".

[0093] The calculations as shown in Figs. 9(a) and (b) were also performed in the same way for Routes 2 to 6.

[0094] Figs. 10(a), (b), (c), and (d) respectively show a comparison of the calculation results of the "travel distance [km]", "required time [min]", "energy consumption [kWh]", and "electricity cost [km / kWh]" for each route (Routes 1 to 6).

[0095] As shown in Fig. 10(c), it was confirmed that the route indicating the smallest value (optimal value) of "consumption energy [kWh]" is Route 3. As shown in Fig. 10(b), Route 3 also showed the smallest value (optimal value) in terms of "required time [min]". Also, as shown in Fig. 10(d), Route 3 showed a relatively high value (good value) in terms of "electricity cost [km / kWh]", although it was lower than that of Route 6 and Route 5. Further, as shown in Fig. 10(a), Route 3 also showed a relatively small value (good value) in terms of "travel distance [km]".

[0096] As a result of analyzing Route 3 with reference to Fig. 3(c), it was found that it has the following characteristics.

[0097] (a) Ascend the slope in a light state towards point B (b) Descend the slope in a slightly heavy state towards point A (c) Ascend the slope in a heavy state towards point C (d) Descend the slope in a heavy state towards point E From this, it is presumed that the following two points led to a reduction in consumption energy.

[0098] (i) "Run long" and "ascend the slope" in a light state (ii) "Run short" and "descend the slope" in a heavy state

[0099] In this embodiment, an example of selecting the route showing the smallest value of "consumption energy [kWh]" as the optimal route has been described. However, depending on the case, a route showing the smallest value of "travel distance [km]", "required time [min]", or "electricity cost [km / kWh]" may be selected instead.

[0100] Also, in the case of an EV, since the deterioration of the battery due to fluctuations in battery output may be a problem, depending on the case, it may be possible to select a route with the smallest degree of battery deterioration.

[0101] To determine the degree of battery deterioration, the "fluctuation range" and "number of fluctuations" of each fluctuation in the battery current are calculated from the time-series data of the battery output, and a predetermined battery deterioration index (an index obtained by performing a predetermined calculation) obtained from the "fluctuation range" and "number of fluctuations" is integrated for each fluctuation. Then, from among each route, the route showing the smallest integrated value of the battery deterioration index is selected.

[0102] <Example of operation> Next, an example of a basic operation performed by the control unit 2 of the information management system 1 will be described with reference to the flowchart of FIG.

[0103] In step S1, the information acquisition unit 21 acquires various data transmitted from the garbage truck base station 11, the garbage truck V, and each garbage collection point 10, as well as location information indicating the location of each garbage collection point 10, via the communication unit 4, and stores the acquired various data and location information in a specified memory area of ​​the memory unit 3.

[0104] In step S2, the waste collection volume prediction unit 22 uses the data acquired by the information acquisition unit 21 and recorded in the memory unit 3 to predict the waste collection volume (or waste weight) at each waste collection point 10 for a 24-hour period, for example, on that day, and stores the predicted waste collection volume at the waste collection point 10 in a specified memory area of ​​the memory unit 3.

[0105] In step S3, the route information acquisition unit 23 acquires map information and traffic information provided by an external information provider via the communication unit 4, and also performs a route search and road detailed information search by specifying the positions of the garbage truck base (point S), each garbage collection station (point A, point B, point C), garbage incineration plant (point E), and garbage truck base (point G) using a route search function and road detailed information search function of a navigation API, etc., to acquire information indicating multiple candidate routes for circulating each garbage collection station, as well as information indicating the distance, gradient, and vehicle speed of each route, and stores this in a specified memory area of ​​the memory unit 3 as route information.

[0106] In step S4, the energy consumption prediction unit 24 predicts, for each route, the energy consumed in the operations of "mounting", "auxiliary equipment", and "traveling" of the garbage truck V (energy consumption) from the route information and the information indicating the garbage collection amount at each garbage collection site, and stores the information indicating the predicted energy consumption in a predetermined storage area of the storage unit 3.

[0107] In step S5, the route selection unit 25 selects, as the optimal route, the route with the smallest energy consumption among each route, and stores the information indicating the selected optimal route in a predetermined storage area of the storage unit 3.

[0108] In step S6, the information output unit 26 transmits the information indicating the optimal route selected by the route selection unit 25 to the garbage truck base 11 or the like via the communication unit 4.

[0109] As described in detail above, according to the embodiment, it is possible to optimize the route along which the garbage truck travels.

[0110] Note that the present invention is not limited to the above-described embodiment, and various modifications can be made without departing from the gist thereof at the implementation stage. Also, each embodiment may be implemented in appropriate combination, and in that case, the combined effects can be obtained. Furthermore, the above-described embodiment includes various inventions, and various inventions can be extracted by combinations selected from a plurality of disclosed constituent elements. For example, even if some constituent elements are deleted from all the constituent elements shown in the embodiment, if the problem can be solved and the effects can be obtained, the configuration from which these constituent elements are deleted can be extracted as an invention.

Explanation of Reference Numerals

[0111] 1... Information management system 2... Control unit 3... Storage unit 4... Communication unit 10... Garbage collection site 11... Garbage truck base 12... Garbage incineration plant 21... Information acquisition unit 22... Garbage collection amount prediction unit 23... Route information acquisition unit 24... Energy consumption prediction unit 25... Route selection unit 26... Information output unit V... Garbage truck

Claims

1. A route information acquisition unit that acquires route information indicating candidates for a plurality of routes for traveling around each garbage collection site and at least the distance and gradient of each route; A power consumption prediction unit that predicts, for each route, the energy consumed in at least the loading operation and traveling of the garbage truck from the route information and information indicating the garbage collection amount of each garbage collection site; A route selection unit that selects, from among the routes, the route with the smallest energy consumption; An information management system comprising:

2. The power consumption prediction unit: For each route, calculates the garbage weight obtained from the garbage collection amount of each garbage collection site, and predicts the energy consumed in the loading operation; The information management system according to claim 1.

3. The power consumption prediction unit: For each route, calculates the running resistance including elements such as vehicle weight, vehicle speed, and gradient that change during the process of the garbage truck traveling around each garbage collection site, and predicts the energy consumed in the traveling using the running resistance; The information management system according to claim 1.

4. The power consumption prediction unit: For each route, calculates the vehicle weight that changes during the process of the garbage truck traveling around each garbage collection site using information indicating the garbage weight obtained from the garbage collection amount of each garbage collection site; The information management system according to claim 3.

5. The power consumption prediction unit: For each route, calculates the vehicle speed that changes during the process of the garbage truck traveling around each garbage collection site using traffic information indicating the traffic volume or degree of congestion, presence or absence of construction work, and presence or absence of lane restrictions; The information management system according to claim 3.

6. The power consumption prediction unit: For each route, calculates the gradient that changes during the process of the garbage truck traveling around each garbage collection site using information indicating the latitude, longitude, and altitude of each part; The information management system according to claim 3.

7. Obtaining, by the route information acquisition unit, candidates for a plurality of routes for traveling around each garbage collection site and route information indicating at least the distance and gradient of each route; Predicting, by the power consumption prediction unit, for each route, the energy consumed in at least the loading operation and traveling of the garbage truck from the route information and information indicating the garbage collection amount of each garbage collection site; Selecting, by the route selection unit, from among the routes, the route with the smallest energy consumption; A route optimization method comprising:

8. On one or more computers, A function to obtain candidates for a plurality of routes that tour each garbage collection site, and route information indicating at least the distance and gradient of each route, A function to predict the energy consumed in at least the mounting operation and driving of the garbage truck for each route from the route information and the information indicating the garbage collection amount of each garbage collection site, A function to select the route with the smallest energy consumption among each route, A program for realizing the above.

Images