Schedule planning device and schedule planning method

Abstract

To provide a transportation schedule and a charging schedule that lead to high transportation efficiency and can be easily corrected even when a schedule modification is required.SOLUTION: A schedule planning device plans schedule combinations including a transportation schedule and a charging schedule on the basis of a plurality of parameter values, evaluates efficiency of transportation and ease of schedule modification for each of one or the plurality of schedule combinations planed, and outputs information based on at least part of a schedule combination that exhibits relatively high efficiency and ease of modification. Each of one or more combinations of constraint parameter values is a combination made up of a plurality of constraint parameter values respectively corresponding to a plurality of constraint parameter names. The constraint parameter value for at least one constraint parameter name affects the ease of modification.SELECTED DRAWING: Figure 1

Description

Technical Field

[0001] The present invention generally relates to a technique for scheduling, and more particularly to a technique for scheduling a transportation schedule by an electric vehicle and a charging schedule of the electric vehicle.

Background Art

[0002] When an electric vehicle is adopted as a transport vehicle such as a truck, it is desirable to establish a charging schedule in addition to the transport schedule. For example, there is an electric vehicle as an electric vehicle. As a technique for establishing a transportation schedule and a charging schedule of an electric vehicle, there is a technique described in Patent Document 1. This publication describes, "A battery charging system characterized by integrating the charging schedule of each electric vehicle and the vehicle operation schedule of each electric vehicle, and determining each schedule after adjusting them."

Prior Art Documents

Patent Documents

[0003]

Patent Document 1

Summary of the Invention

Problems to be Solved by the Invention

[0004] A plurality of predicted parameter values are referred to for establishing a transportation schedule and a charging schedule. The "predicted parameter value" is a predicted value that forms the basis of the transportation schedule and / or the charging schedule. Examples of the predicted parameter value include the power consumption of a building, the amount of luggage, etc. Based on a plurality of parameter values including a plurality of predicted parameter values, a transportation schedule and a delivery schedule are established on weekends, the previous night, etc.

[0005] At least one predicted parameter value may have a prediction error. Considering the risk of prediction errors, at least one predicted parameter value input for schedule creation is set to a value with a margin, so that the schedule creator does not need to modify the once-established schedule. This value with a margin is called a "buffer value". The buffer value can also be referred to as the tolerance of the prediction error of the predicted parameter value.

[0006] When it is assumed that the prediction deviates in the direction of increasing transport load, by setting a large buffer value for predicted parameter values such as the required number of vehicles and operation time, a schedule that does not require schedule modification is expected even if the prediction deviates. However, since the required number of vehicles, operation time, etc. are estimated to be large, such a schedule is a schedule with low transport efficiency.

[0007] In recent years, the shortage of workers in the transportation industry has become a social problem, so it is desirable to improve efficiency. To improve efficiency, the buffer value can be reduced. However, reducing the buffer value increases the need for schedule modification.

Means for Solving the Problem

[0008] One representative aspect of the present invention for solving at least one of the above problems is as follows. A schedule planning device formulates a schedule combination including a transportation schedule for transporting a plurality of cargos to a plurality of locations by a plurality of transportation vehicles including a plurality of electric vehicles that require charging, and a charging schedule (a schedule based on the transportation schedule) for charging the plurality of electric vehicles, based on a plurality of parameter values. The schedule planning device evaluates the transportation efficiency and the ease of schedule modification for each of one or more schedule combinations, and outputs information based on at least a part of the schedule combinations having relatively high efficiency and ease of modification. The plurality of parameter values include a plurality of predicted parameter values and one or more sets of constraint parameter value combinations. Each predicted parameter value is a predicted value for a parameter name. For each of the plurality of constraint parameter names, there are one or more constraint parameter values. For each of the one or more sets of constraint parameter value combinations, the set of constraint parameter value combinations is a combination composed of a plurality of constraint parameter values respectively corresponding to the plurality of constraint parameter names. At least one constraint parameter value affects the ease of modification.

Advantages of the Invention

[0009] According to one aspect of the present invention, it is possible to provide a transportation schedule and a charging schedule that are easy to modify even when schedule modification is required, and have high transportation efficiency. Problems, configurations, and effects other than those described above will be clarified by the description of the following embodiments.

Brief Description of the Drawings

[0010]

Figure 1

Figure 2

Figure 3

Figure 4

Figure 5

Figure 6

Figure 7

Figure 8

Figure 9

Figure 10

Figure 11

Figure 12

Figure 13

Figure 14

Figure 15

Figure 16

Figure 17

Figure 18

Figure 19

Mode for Carrying Out the Invention

[0011] In the following description, the "interface device" may be one or more interface devices. The one or more interface devices may be at least one of the following. · One or more I / O (Input / Output) interface devices. The I / O (Input / Output) interface device is an interface device for at least one of an I / O device and a remote display computer. The I / O interface device for the display computer may be a communication interface device. At least one I / O device may be either an input device such as a user interface device, for example, a keyboard and a pointing device, or an output device such as a display device. · One or more communication interface devices. The one or more communication interface devices may be one or more of the same type of communication interface devices (for example, one or more NICs (Network Interface Cards)) or two or more different types of communication interface devices (for example, a NIC and an HBA (Host Bus Adapter)).

[0012] Also, in the following description, the "memory" is one or more memory devices, which is an example of one or more storage devices, and may typically be a main memory device. At least one memory device in the memory may be a volatile memory device or a non-volatile memory device.

[0013] Also, in the following description, the "persistent storage device" may be one or more persistent storage devices, which is an example of one or more storage devices. The persistent storage device may typically be a non-volatile storage device (for example, an auxiliary storage device), and specifically, for example, an HDD (Hard Disk Drive), an SSD (Solid State Drive), an NVME (Non-Volatile Memory Express) drive, or an SCM (Storage Class Memory).

[0014] Also, in the following description, the "memory device" may be at least a memory among a memory and a persistent storage device.

[0015] Also, in the following description, the "processor" may be one or more processor devices. At least one processor device may typically be a microprocessor device such as a CPU (Central Processing Unit), but may also be other types of processor devices such as a GPU (Graphics Processing Unit). At least one processor device may be single-core or multi-core. At least one processor device may be a processor core. At least one processor device may be a circuit that is an aggregate of gate arrays by a hardware description language that performs part or all of the processing (for example, a general processor device such as an FPGA (Field-Programmable Gate Array), a CPLD (Complex Programmable Logic Device), or an ASIC (Application Specific Integrated Circuit)).

[0016] In the following description, the function may be described in terms of a "yyy unit", but the function may be realized by one or more computer programs being executed by a processor, or by one or more hardware circuits (such as an FPGA or ASIC), or by a combination thereof. When the function is realized by a program being executed by a processor, since the defined processing is performed while appropriately using a storage device and / or an interface device, etc., the function may be regarded as at least a part of the processor. The processing described with the function as the subject may be the processing performed by the processor or a device having the processor. The program may be installed from a program source. The program source may be, for example, a program distribution computer or a computer-readable storage medium (such as a non-transitory storage medium). The description of each function is an example, and a plurality of functions may be combined into one function, or one function may be divided into a plurality of functions.

[0017] Also, as information (identification information, identifier) for identifying an element, any information (for example, at least one of "ID", "name", and "number") may be adopted.

[0018] Also, in the following description, the unit of "date and time" may be a coarser unit or a finer unit than month, day, hour, and minute.

[0019] Hereinafter, embodiments will be described with reference to the drawings. In this embodiment, the same components are generally denoted by the same reference numerals, and repeated descriptions are omitted. It should be noted that this embodiment is merely an example for realizing the present invention and does not limit the technical scope of the present invention.

[0020] FIG. 1 is a diagram showing an example of the configuration of a schedule planning system 1 according to an embodiment and an example of the functional configuration of a schedule planning apparatus 100.

[0021] The scheduling system 1 includes a scheduling device 100, an in-vehicle terminal 200, a location schedule management terminal 300, and a charging facility device 400 that are communicably connected to the scheduling device 100 via a network 51. Each of the scheduling device 100, the in-vehicle terminal 200, the schedule management terminal 300, and the charging facility device 400 may include an interface device, a storage device, and a processor connected thereto.

[0022] The scheduling device 100 has functions such as a storage unit 110, a control unit 130, an input unit 140, and an output unit 141 (for example, a function including at least one of a display unit 150 and a communication unit 160). These functions may be realized by a CPU 410 (see FIG. 2) of the scheduling device 100 executing a program.

[0023] The storage unit 110 stores prediction performance information 111, parameter information 112, order information 113, vehicle information 114, location information 115, charger information 116, movement cost information 117, evaluation information 118, transport schedule plan information 119, and charging schedule plan information 120. The prediction performance information 111 is information on predictions and actual results in past transport schedules and charging schedules. The parameter information 112 is information on calculation parameters to be considered when formulating a transport schedule or a charging schedule. The order information 113 is order information on the goods to be transported. The vehicle information 114 is information on vehicles that can be used during schedule execution. The location information 115 is information on locations where at least one of collection, delivery, and charging is performed. The charger information 116 is information on chargers installed at locations targeted by the charging schedule. The movement cost information 117 is information defining the cost required for movement between two locations. The evaluation information 118 is information on parameters for evaluating the combination of the formulated transport schedule plan and charging schedule plan. The transport schedule plan information 119 is information on the transport schedule plan created by the control unit 130. The charging schedule plan information 120 is information on the charging schedule plan created by the control unit 130.

[0024] The control unit 130 includes a prediction error calculation unit 131, a schedule planning unit 132, and an evaluation unit 133. The prediction error calculation unit 131 calculates a buffer value of input information using the prediction performance information 111, and stores the calculated buffer value in the parameter information 112. The schedule planning unit 132 generates a transportation schedule plan and a charging schedule plan using the parameter information 112, the order information 113, the vehicle information 114, the location information 115, the charger information 116, and the movement cost information 117, and stores the transportation schedule plan in the transportation schedule plan information 119 and the charging schedule plan in the charging schedule plan information 120, respectively. The evaluation unit 133 evaluates the modification cost of schedule modification from the viewpoints of transportation efficiency, necessity of schedule modification, and ease of schedule modification using the parameter information 112, the generated transportation schedule plan information 119, and the charging schedule plan information 120, and stores the combination of the best transportation schedule plan and the charging schedule plan as the optimal schedule.

[0025] The input unit 140 receives an input operation from the user.

[0026] The output unit 141 outputs information. For example, the display unit 150 displays the transportation schedule and the charging schedule planned by the control unit 130 on the display device 450 (see FIG. 2). The communication unit 160 transmits or receives information among the in-vehicle terminal 200, the location schedule management terminal 300, and the charge control device 400.

[0027] The in-vehicle terminal 200 is an information processing terminal mounted on an electric vehicle (e.g., an electric car) as a transport vehicle. The in-vehicle terminal 200 has functions such as a communication unit 210, a control unit 220, and a display unit 230. The communication unit 210 transmits the current status information of the host vehicle (information representing the current status of the host vehicle) to the communication unit 160 of the scheduling device 100, or receives the vehicle-specific information of the host vehicle (e.g., information representing the transport schedule of the host vehicle) transmitted from the communication unit 160 of the scheduling device 100. The "host vehicle" is the transport vehicle having the in-vehicle terminal 200. When the host vehicle is in autonomous driving, the control unit 220 controls the host vehicle to perform transport according to the transport schedule represented by the received vehicle-specific information. When the host vehicle is driven by a driver, the control unit 220 instructs the display unit 230 to display an alert when the difference between the transport schedule represented by the vehicle-specific information and the actual performance exceeds a certain amount. The display unit 230 displays the transport schedule represented by the received vehicle-specific information and the alert instructed by the control unit 220 on the display screen of the in-vehicle terminal 200.

[0028] The schedule management terminal 300 is arranged at each location. The schedule management terminal 300 has functions such as a communication unit 310, a control unit 320, and a display unit 330. The communication unit 310 receives the location-specific information of the host location (e.g., information representing the transport schedule and / or charging schedule related to the host location) transmitted from the communication unit 160 of the scheduling device 100. The "host location" is the location where the schedule management terminal 300 is arranged. The control unit 320 determines whether the receiving system for loading, delivery, or charging is ready, and issues a work instruction if it is not ready. The display unit 330 displays the transport schedule and charging schedule represented by the received location-specific information on the display screen of the schedule management terminal 300.

[0029] The charging control device 400 is respectively arranged at a plurality (or one) of charging points among a plurality of locations. A "charging point" is a location where charging can be performed. The charging control device 400 has functions such as a communication unit 41 and a control unit 42. The communication unit 41 receives location-directed information of its own charging point (for example, information representing a charging schedule at the own charging point) transmitted from the communication unit 160 of the scheduling device 100. An "own charging point" is the charging point where the charging control device 400 is arranged. The control unit 42 controls charging related to the charger and the vehicle according to the charging schedule represented by the location-directed information of the own charging point.

[0030] FIG. 2 is a block diagram showing an example of the hardware configuration of the scheduling system 1 according to the embodiment.

[0031] The scheduling device 100 includes a CPU (Central Processing Unit) 410, a RAM (Random Access Memory) 420, a ROM (Read Only Memory) 430, an auxiliary storage device 440, a display device 450, an input device 460, a media reader 470, and a communication device 480. The scheduling device 100 can transmit and receive data with the in-vehicle terminal 200 of the vehicle 510 (omitted in FIG. 2), the schedule management terminal 300 of the location 520 where collection, distribution, and charging are performed (omitted in FIG. 2), and the charging control device 400 of the location 520 where charging is performed (omitted in FIG. 2) via the communication device 480. The media reader 470 and the communication device 480 are examples of interface devices. The RAM 420 and the ROM 430 are examples of memories. The auxiliary storage device 440 is an example of a permanent storage device. The CPU 410 is an example of a processor.

[0032] The CPU 410 is a device that executes various operations. The RAM 420 is a memory that stores programs, data, etc. executed by the CPU 410. The ROM 430 is a memory that stores programs necessary for starting the scheduling system. The auxiliary storage device 440 is a device such as an HDD (Hard Disk Drive). The display device 450 is a device such as a liquid crystal display. The input device 460 is a device used for a user to input information to the scheduling device 100, such as a keyboard. The media reader device 470 is a device that reads information from a portable storage medium such as a USB (Universal Serial Bus) memory (USB is a registered trademark). The communication device 480 is a device that transmits or receives information to and from an external device via the network 51. For example, the information 111 to 120 shown in FIG. 1 is stored in the RAM 420 or the like.

[0033] The vehicle 510 is equipped with an in-vehicle terminal 200, and the in-vehicle terminal 200 communicates with the scheduling device 100 via the network 51. Also, at the chargeable location 520, a communication device 20 that performs communication via the network 51 and a charge control device 400 are provided. The communication unit 41 of the charge control device 400 can communicate with the scheduling device 100 via the communication device 20.

[0034] In this embodiment, the scheduling device 100 is a physical computer system (one or more computers), but instead, a logical computer system based on a physical computer system (for example, a system as a cloud computer service based on a cloud infrastructure) may be used. For example, without the display device 450 and the input device 460, the scheduling device 100 may communicate with a remote client computer having a display device and an input device via the communication device 480.

[0035] FIG. 3 is a flowchart showing an example of a series of processes according to the embodiment.

[0036] The input unit 140 acquires information 111 to 118 (S100) in response to an input operation from at least one of the in-vehicle terminal 200, the schedule management terminal 300, and the input device 460. At least a part of the acquired information 111 to 118 may include information input by the input operation.

[0037] Next, the prediction error calculation unit 131 calculates a buffer to be considered at the time of scheduling, and stores the calculated buffer in the parameter information 112 (S200).

[0038] Next, the schedule planning unit 132 generates a transportation schedule plan and a charging schedule plan, stores the generated transportation schedule plan in the transportation schedule plan information 119, and stores the generated charging schedule plan in the charging schedule plan information 120 (S300).

[0039] Next, the evaluation unit 133 performs a schedule evaluation process (S400). The schedule evaluation process is a process of evaluating a combination of a transportation schedule plan and a charging schedule plan, and saving those schedule plans when a good evaluation is obtained.

[0040] Finally, the schedule is output (S500). Specifically, the display unit 150 displays the schedule on the display device 450. Also, the communication unit 160 transmits vehicle-oriented information to the in-vehicle terminal 200, transmits location-oriented information to the schedule management terminal 300, or transmits location-oriented information of the charging location to the charging control device 400 via the network 51.

[0041] S300 and S400 are performed for each of a plurality of (all in this embodiment) combinations of constraint parameter values. A "combination of constraint parameter values" is a combination consisting of a plurality of constraint parameter values. For example, if there are "a1" and "a2" as the constraint parameter values of the constraint parameter name "A", and "b1" and "b2" as the constraint parameter values of the constraint parameter name "B", all the combinations of constraint parameter values are four combinations: (a1, b1), (a2, b1), (a1, b2), and (a2, b2). A "constraint parameter value" is a parameter value that affects the ease of schedule modification. The "ease of schedule modification" is one of the evaluation items of the schedule. Details of the "constraint parameter value" and the "ease of schedule modification" will be described later.

[0042] Hereinafter, each step of FIG. 3 will be described.

[0043] In S100, prediction performance information 111, parameter information 112, order information 113, vehicle information 114, location information 115, charger information 116, movement cost information 117, and evaluation information 118 are acquired. Hereinafter, examples of information 111 to 118 will be described. The structures of information 111 to 118 (for example, the information included in an entry) are not limited to the following examples.

[0044] FIG. 4 is a chart showing an example of the data structure of the prediction performance information 111 according to the embodiment.

[0045] The prediction performance information 111 has an entry for each pair of prediction and performance. An entry has information such as a date 401, an item 402, a prediction score 403, and an error 404.

[0046] Date 401 represents the scheduled target date (the date targeted by the schedule). "Item" represents an item as a prediction parameter name. Prediction score 403 is a prediction parameter value. Error 404 represents the prediction error, that is, the error between the prediction parameter value and the actual value (the actual value) obtained for the scheduled target date for the prediction parameter name. As the item 402 (prediction parameter name), for example, at least one of building power consumption, demand target, initial power remaining, electricity cost, power consumption cost between locations, delivery time, and quantity of goods may be adopted.

[0047] FIG. 5 is a diagram showing an example of the data structure of parameter information 112 according to the embodiment.

[0048] Parameter information 112 has an entry for each pair of an item and a value. The entry has information such as item 501 and value 502.

[0049] Item 501 represents a constraint parameter name or a buffer name. Value 502 represents a constraint parameter value or a buffer value. Depending on the constraint parameter name (or buffer name), multiple constraint parameter values (or multiple buffer values) may be set as value 502. Specifically, for example, for the constraint parameter name "lower limit value of the total time staying at a location without charging", there are three constraint parameter values "0", "60", and "120".

[0050] FIG. 6 is a diagram showing an example of the data structure of order information 113 according to the embodiment.

[0051] Order information 113 has an entry for each order. The entry has information such as order number 601, collection source code 602, delivery destination code 603, quantity 604, collection date and time (start) 605, collection date and time (end) 606, delivery date and time (start) 607, and delivery date and time (end) 608.

[0052] Order number 601 represents the identification number of an order. Shipping origin code 602 represents the identification code of the shipping origin location. Delivery destination code 603 represents the identification code of the delivery destination location. Quantity 604 represents the number of packages. Shipping date and time (start) 605 and shipping date and time (end) 606 represent the start date and time and end date and time of the period during which shipping is possible. Delivery date and time (start) 607 and delivery date and time (end) 608 represent the start date and time and end date and time of the period during which delivery is possible. The value of quantity 604 may be an example of the value of the package quantity, and the value of the package quantity may be expressed based on at least one of the total weight value and the total volume value of the packages instead of or in addition to the number of packages. The expression of the period during which shipping is possible and the period during which delivery is possible may be an expression in combination with the start date and time and the period length from the start date and time.

[0053] Figure 7 is a diagram showing an example of the data structure of vehicle information 114 according to the embodiment.

[0054] Vehicle information 114 has an entry for each vehicle. The entry has information such as vehicle name 701, maximum loading quantity 702, vehicle unit price 703, operating unit price 704, maximum charge amount 705, minimum charge amount 706, and electricity cost 707.

[0055] Vehicle name 701 represents the identification name of the vehicle. Maximum loading quantity 702 represents the maximum loading quantity of the vehicle (for example, the maximum number of packages). Vehicle unit price 703 represents the handling cost per vehicle. Operating unit price 704 represents the usage fee of the vehicle per unit operating time of the vehicle. Maximum charge amount 705 represents the maximum charge amount for the vehicle. Minimum charge amount 706 represents the minimum charge amount for the vehicle. Electricity cost 707 represents the electricity cost of the vehicle. The value of maximum loading quantity 702 may be expressed based on at least one of the maximum weight value and the maximum volume value that can be loaded instead of or in addition to the maximum number of packages that can be loaded. Also, the entry may have information such as "driver unit price" representing the labor cost of the driver per unit operating time of the vehicle instead of or in addition to at least a part of information 702 to 707, or information such as "carbon dioxide emission unit price" representing the carbon dioxide emission amount per unit power consumption.

[0056] FIG. 8 is a chart showing an example of the data structure of the location information 115 according to the embodiment.

[0057] The location information 115 has an entry for each location. The entry has information such as a location name 801, a working time 802, a latitude 803, a longitude 804, and a maximum charge amount 805.

[0058] The location name 801 represents the identification name of the location. The working time 802 represents the working time required for the operation (loading or unloading) of one piece of cargo at the location. The latitude 803 represents the latitude of the location, and the longitude 804 represents the longitude of the location. The maximum charge amount 805 represents the upper limit of the amount of electricity that can be charged per unit time at the location. The working time 802 may be divided into information such as a "loading time" representing the time required for loading one piece of cargo and a "unloading time" representing the time required for unloading one piece of cargo. Further, the entry may have information such as a "consumption power of the building" representing the consumption power of the building at the location instead of or in addition to at least a part of the information 802 to 805.

[0059] FIG. 9 is a chart showing an example of the data structure of the charger information 116 according to the embodiment.

[0060] The charger information 116 has an entry for each charger. The entry has information such as a location name 901, a charger number 902, a charge amount 903, a receiving time (start) 904, a receiving time (end) 905, a charging mode 906, and a flag indicating whether work can be performed in parallel 907.

[0061] The location name 901 represents the identification name of the location. The charger number 902 represents the identification number of the charger at the location. The charging amount 903 represents the charging amount per unit time that can be charged using the charger. The acceptance time (start) 904 represents the start date and time of the time zone when the charger can be used, and the acceptance time (end) 905 represents the end date and time of the time zone. The charging mode 906 represents the charging modes that can be used in the charger. The parallel operation flag for work 907 represents whether it is possible to perform charging and loading or unloading work in parallel at the location. The entry may further have information such as "electricity charge" representing the electricity charge required for charging per unit time.

[0062] FIG. 10 is a chart showing an example of the data structure of the movement cost information 117 according to the embodiment.

[0063] The movement cost information 117 has an entry for each pair of the departure location and the arrival location. The entry has information such as the departure location 1001, the arrival location 1002, the movement time 1003, the power consumption coefficient 1004, and the movement distance 1005.

[0064] The departure location 1001 represents the identification name of the departure location (the source location of the movement). The arrival location 1002 represents the identification name of the arrival location (the destination location of the movement). The movement time 1003 represents the movement time from the departure location to the arrival location. The power consumption coefficient 1004 represents the ratio of the magnitude of power consumption due to the movement from the departure location to the arrival location. The movement distance 1005 represents the movement distance from the departure location to the arrival location.

[0065] FIG. 11 is a chart showing an example of the data structure of the evaluation information 118 according to the embodiment.

[0066] The evaluation information 118 has an entry for each evaluation item. The entry has information such as the item 1101 representing the item name of the evaluation item and the value 1102 representing the evaluation value corresponding to the evaluation item. "Efficiency" is the efficiency of transportation, "necessity for correction" is the necessity for schedule correction, and "ease of correction" is the ease of schedule correction.

[0067] In S200 of FIG. 3, the prediction error calculation unit 131 calculates a buffer value to be used in schedule planning using the predicted performance information 111, the order information 113, the vehicle information 114, the location information 115, the charger information 116, and the travel cost information 117, and stores the buffer value in the parameter information 112.

[0068] In the predicted actual result information 111, the predicted score 403 is a predicted parameter value calculated by a predetermined method for the predicted parameter name represented by the item 402. For example, the predicted score 403 for the item 402 "building power consumption" is the maximum power consumption at the scheduled date and time represented by the date 401. The error 404 is the difference between the predicted score 403 and the actual value calculated by the same method as the predicted score 403. The prediction error calculation unit 131 determines a buffer value for the predicted score 403 based on a pair of the predicted score 403 and the error 40, and at least a part of the information in the order information 113, the vehicle information 114, the location information 115, the charger information 116, and the travel cost information 117. The input unit 140 may receive at least one of weather information (e.g., information indicating the weather at each point during a period including the scheduled date and time) and traffic congestion information (e.g., information indicating the degree of traffic congestion between each point during a period including the scheduled date and time) from the outside, and the prediction error calculation unit 131 may determine the buffer value by utilizing at least one of the weather information and the traffic congestion information, in addition to the pair of the prediction score 403 and the error 40 and at least some of the information in the order information 113, the vehicle information 114, the location information 115, the charger information 116, and the travel cost information 117.

[0069] In S300, the scheduling department 132 formulates a transportation schedule plan and a charging schedule plan based on at least a part of the parameter information 112, order information 113, vehicle information 114, location information 115, charger information 116, and movement cost information 117, and stores the transportation schedule plan in the transportation schedule plan information 119 and the charging schedule plan in the charging schedule plan information 120. As the constraint parameter names of the parameter information 112, for example, at least one of "upper limit of usage time of rapid chargers", "lower limit of time staying at locations without charging", "peak power", "upper limit of the number of vehicles staying simultaneously during business hours", "upper limit of the number of vehicles with a large ratio of driving distance to cruising distance", "upper limit of the number of consecutive operations with a short workable time frame length", and "lower limit of the difference between the work end time and the work deadline" may be adopted. For example, when the value 502 of item 501 "peak power" is "240 kW", even if the upper limit of the charging amount 805 stored in the location information 115 is "300 kW", the schedule plan must be formulated so that the peak power is 240 kW or less.

[0070] FIG. 12 is a chart showing an example of the data structure of the transportation schedule plan information 119 according to the embodiment.

[0071] The transportation schedule plan information 119 has information representing one or more transportation schedule plans. The transportation schedule plan information 119 illustrated in FIG. 12 represents one transportation schedule plan. The information representing the transportation schedule plan has an entry for each event related to transportation. The entry has information such as vehicle name 1201, location name 1202, status 1203, order number 1204, quantity 1205, time (start) 1206, and time (end) 1207.

[0072] Vehicle name 1201 represents the identification name of a vehicle. Location name 1202 represents the identification name of a location. Status 1203 represents the work performed at the location. Order number 1204 represents the identification number of the order for the work target. Quantity 1205 represents the number of packages for the work target. Time (start) 1206 represents the start date and time of the time when the work is performed, and Time (end) 1207 represents the end date and time of the time when the work is performed. The value of Quantity 1205 may be an example of the value of the package quantity, similar to the value of Quantity 604. The value of the package quantity may be expressed based on at least one of the total weight value and the total volume value of the packages instead of or in addition to the number of packages.

[0073] FIG. 13 is a chart showing an example of the data structure of the charging schedule plan information 120 according to the embodiment.

[0074] The charging schedule plan information 120 has information representing one or more charging schedule plans. The charging schedule plan information 120 illustrated in FIG. 13 represents one charging schedule plan. The information representing the charging schedule plan has an entry for each event related to charging. The entry has information such as location name 1301, charger number 1302, vehicle name 1303, charging amount 1304, Time (start) 1305, and Time (end) 1306.

[0075] Location name 1301 represents the identification name of the charging location. Charger number 1302 represents the identification number of the charger at the location. Vehicle name 1303 represents the identification name of the vehicle to be charged. Charging amount 1304 represents the charging amount per unit time. Time (start) 1305 represents the start date and time of the time when the charging work is performed, and Time (end) 1306 represents the end date and time of that time. For example, if the charger number is unique among all locations, the location name 1301 may not be required in the entry.

[0076] FIG. 14 is a flowchart showing an example of the schedule planning process according to the embodiment.

[0077] When the process starts, the scheduling department 132 reads the parameter information 112, the order information 113, the vehicle information 114, the location information 115, the charger information 116, and the movement cost information 117 (S310).

[0078] The scheduling department 132 generates a transportation schedule plan according to the combination of constraint parameter values in the parameter information 112 read in S310 (S320). For one combination of constraint parameter values, multiple transportation schedule plans may be generated. The transportation schedule plan is generated, for example, by exhaustive search or simulation.

[0079] The scheduling department 132 generates a charging schedule plan to charge during the time staying at a chargeable location among the multiple locations represented by the transportation schedule plan generated in S320 according to the combination of constraint parameter values in the parameter information 112 read in S310 (S330). For one transportation schedule plan, multiple charging schedule plans may be generated. The charging schedule plan is generated, for example, by exhaustive search or simulation.

[0080] The scheduling department 132 stores the transportation schedule plan generated in S320 in the transportation schedule plan information 119 and stores the charging schedule plan generated in S330 in the charging schedule plan information 120 (S340). In the transportation schedule plan information 119, information for identifying the charging schedule plan corresponding to each transportation schedule plan may also be stored. And / or, in the charging schedule plan information 120, information for identifying the transportation schedule plan corresponding to each charging schedule plan may be stored for each charging schedule plan.

[0081] Returning to FIG. 3, the description will be given. In S400, the evaluation unit 133 performs schedule evaluation processing using the vehicle information 114, the location information 115, the evaluation information 118, and one schedule plan combination generated in S300 (a combination of a transportation schedule plan and a charging schedule plan corresponding to the transportation schedule plan). As the value of item 1101 of the evaluation information 188, at least “efficiency” representing the efficiency in the schedule and “ease of modification” representing the ease of schedule modification are adopted. As the value of item 1101, “necessity of modification” representing the necessity of schedule modification may be further adopted.

[0082] FIG. 15 is a flowchart showing an example of schedule evaluation processing according to an embodiment.

[0083] When the process starts, the evaluation unit 133 reads the vehicle information 114, the location information 115, the evaluation information 118, one of the transportation schedule plans stored in the transportation schedule plan information 119, and one of the charging schedule plans stored in the charging schedule plan information 120 (S410). The read transportation schedule plan and charging schedule plan are corresponding plans to each other.

[0084] The evaluation unit 133 evaluates the efficiency of the schedule (S420). For example, the evaluation unit 133 evaluates the efficiency based on at least one of the number of vehicles with less remaining power or power shortage, the amount of cargo that cannot be transported, the number of vehicles used, the transportation cost, the transportation time, the power consumption by transportation, the electricity charge required for charging, and the amount of carbon dioxide emitted by transportation. Specifically, for example, the evaluation unit 133 can calculate the number of vehicles with remaining power below the threshold value by using the evaluation information 118, the transportation schedule plan information 119, and the charging schedule plan information 119 to count the number of vehicles with less remaining power or power shortage. The efficiency of the schedule is calculated using a weighted sum, for example, as shown in the following formula (1). <Formula (1)> Efficiency =(Weight α × Number of vehicles with less remaining power or power shortage) ×(Weight β × Amount of cargo that cannot be transported) ×(weight γ × transportation cost) ×(weight δ × electricity charge required for charging)

[0085] Here, each weight may be stored in the evaluation information 118. Also, each weight may be a value uniquely set for the scheduling device 100.

[0086] The evaluation unit 133 evaluates the necessity of schedule modification (S430). For example, the evaluation unit 133 evaluates the necessity of schedule modification based on at least one of the tolerance of the prediction error of the power consumption of the building, the tolerance of the prediction error of the demand target, the tolerance of the prediction error of the remaining power at the start, the tolerance of the prediction error of the electricity cost, the tolerance of the prediction error of the power consumption cost between locations, the tolerance of the prediction error of the delivery time, and the tolerance of the prediction error of the load quantity. Specifically, for example, the tolerance of the prediction error of the electricity cost can be specified by calculating, using the vehicle information 114, the transportation schedule plan information 119, and the charging schedule plan information 120, to what ratio the electricity cost can increase without modifying the transportation schedule plan information 119 and the charging schedule plan information 120.

[0087] The necessity of schedule modification is calculated using a weighted sum, for example, as shown in the following formula (2). <Formula (2)> Necessity of modification =(weight ε × buffer value of the prediction error of the demand target) ×(weight ζ × buffer value of the prediction error of the electricity cost) ×(weight η × buffer value of the prediction error of the load quantity)

[0088] Here, each weight may be stored in the evaluation information 118. Also, each weight may be a value uniquely set for the scheduling device 100.

[0089] The evaluation unit 133 evaluates the ease of schedule modification (S440). For example, the evaluation unit 133 evaluates the ease of schedule modification based on at least one of the total usage time of the quick charger, the time spent at the location without charging, the difference between the contracted power and the predicted peak power, the maximum number of vehicles simultaneously present during operation, the number of vehicles with a high ratio of the mileage to the cruising range, the maximum number of times that work with a short workable time frame is performed consecutively, and the magnitude of the difference between the work end time and the work deadline. Specifically, for example, the total usage time of the quick charger can be specified using the charger information 116 and the proposed charging schedule information 120. The ease of schedule modification is calculated using a weighted sum, for example, as shown in the following formula (3). <Formula (3)> Ease of modification = (weight θ × total usage time of the quick charger) × (weight x maximum number of vehicles in operation at the same time) × (weight κ × number of vehicles with a high ratio of driving distance to cruising range) × (weight λ × difference between task end time and task deadline)

[0090] Here, each weight may be stored in the evaluation information 118. Also, each weight may be a value set uniquely for the schedule planning device 100.

[0091] The evaluation unit 133 uses the evaluation information 119, the evaluation value of efficiency calculated in S420, the evaluation value of the necessity of correction calculated in S430, and the evaluation value of ease of correction calculated in S440 to calculate an evaluation value of the schedule using a weighted sum as shown in the following formula (4), and determines whether the evaluation value is better than the evaluation value as a provisional solution (S450). If it is determined that the evaluation value is good (the evaluation value is better than the provisional solution) (S450: YES), the evaluation unit 133 stores the combination of the proposed transportation schedule and the proposed charging schedule as a provisional solution (S460). In formula (4), the "parameter value" may be a value indicating the magnitude of the evaluation value, for example, a value after normalization of the evaluation value. In formula (4), a weight may be adopted instead of or in addition to one of the evaluation value and the parameter value. <Formula (4)> Schedule evaluation value = (Efficiency parameter value x Efficiency evaluation value) × (modification necessity parameter value × modification necessity evaluation value) × (modifiability parameter value × modifiability evaluation value)

[0092] Returning to Fig. 3, the description will be given. Finally, in S500, the display unit 150 outputs a tentative solution. In addition, the communication unit 160 transmits, via the network 51, vehicle-oriented information (e.g., information including a transportation schedule) to the in-vehicle terminal 200, location-oriented information (e.g., information including a transportation schedule and a charging schedule) to the location schedule management terminal 300, and a charging schedule to the charging control device 400.

[0093] FIG. 16 is a diagram showing an example of a transportation management screen 600 according to the embodiment.

[0094] The transportation management screen 600 is displayed on the display device 450. The transportation management screen 600 has information such as a vehicle transportation schedule 610, a vehicle transportation route 620, and a schedule evaluation result 630. From the transportation management screen 600, the transportation schedule and the evaluation result of the transportation schedule can be confirmed.

[0095] The vehicle transportation schedule 610 represents a transportation schedule in the best schedule combination (for example, a schedule combination with the highest sum of the evaluation value 1631 or the evaluation parameter value 1632 (a transportation schedule and a charging schedule corresponding to each other)). Specifically, for example, for each event related to transportation, a vehicle name 1601, a location name 1602, a status 1603, an order number 1604, a number 1605, a time (start) 1606, and a time (end) 1607 are displayed. The information 1601 to 1607 correspond to the information 1201 to 1207 of the transportation schedule proposal information 119. Furthermore, the transportation volume of the order may be displayed. The status 1603 may be at least one of departure, loading, unloading, charging, and arrival. The transportation volume may be displayed, and the transportation volume may be based on the number of packages, the total weight, the total volume, or a combination thereof. The time (start) 1606 and the time (end) 1607 may be the time period during which the vehicle stays at the location instead of the time period during which the work is performed. The transportation schedule may be visualized in a Gantt chart (not shown) with the horizontal axis representing time and the vertical axis representing each vehicle.

[0096] The vehicle transportation route 620 may represent a transportation route for each vehicle, or may represent a transportation route for the vehicle 1620 selected using a tool such as a pull-down menu 1630. In FIG. 16, the transportation route 1620 is a transportation route for vehicle A. The vehicle transportation route 620 may have an object 1611 representing each point. The position of the object 1611 for each point may be determined based on the latitude 803 and the longitude 804 in the point information 115. The transportation route for each vehicle is specified based on the vehicle name 1201, the point name 1202, and the status 1203 of each entry in the transportation schedule proposal information 119.

[0097] The schedule evaluation result 630 indicates the evaluation result of the efficiency, necessity of modification, and ease of modification of the displayed transportation schedule (best schedule combination). For each evaluation item, at least one of the evaluation value 1631 and the evaluation parameter value 1632 may be displayed. For each evaluation item, the value of the evaluation value 1631 and the value of the evaluation parameter value 1632 may be the value used in the above formula (4). Furthermore, at least one of the total transportation cost, the total transportation distance, the total transportation time, and the total power consumption may be displayed.

[0098] FIG. 17 is a diagram illustrating an example of a charge management screen 700 according to the embodiment.

[0099] The charging management screen 700 is displayed on the display device 450. The charging management screen 700 has a charging schedule 710 and an evaluation result of the schedule 720. From the charging management screen 700, the charging schedule and the evaluation result of the charging schedule can be confirmed.

[0100] A charging schedule 710 represents a charging schedule in the best schedule combination. Specifically, for each event related to charging, a location name 1701 (identification name of the charging location), a charger number 1702, a vehicle name 1703, a charging amount 1704, a time (start) 1705, and a time (end) 1706 are displayed. The information 1701 to 1706 correspond to the information 1301 to 1306 of the charging schedule proposal information 120.

[0101] Schedule evaluation result 720 indicates the evaluation result of the displayed charging schedule (best schedule combination), and information 1711 and 1712 are the same as information 1631 and 1632 in evaluation result 630 shown in FIG.

[0102] FIG. 18 is a diagram illustrating an example of a vehicle-oriented screen 800 according to the embodiment.

[0103] The vehicle-oriented screen 800 displays a transportation schedule of the vehicle 510 having the in-vehicle terminal 200 to which the vehicle-oriented screen 800 has been provided. Specifically, for each event related to transportation, information 1801 to 1806 about the vehicle 510 and progress 1807, which is information indicating the progress of the work indicated by the state 1802, are displayed. From the vehicle-oriented screen 800, the transportation schedule and the progress of transportation can be confirmed. The information 1801 to 1806 are the same as the information 1602 to 1607 shown in FIG. 16. The vehicle-oriented screen 800 may further display a charging schedule for the vehicle 510. In addition, the value of the progress 1807 may be automatically updated according to the situation detected by the in-vehicle terminal 200, or may be updated manually.

[0104] FIG. 19 is a diagram illustrating an example of a location-oriented screen 900 according to the embodiment.

[0105] The location screen 900 displays a schedule of work related to transportation and charging performed at the location 520. Specifically, for each event related to transportation or charging, an order number 1901 (identification number of the order to be worked on), a time (start) 1902 and a time (end) 1903 (time period of work), a charger number 1904 (identification number of the charger), a status 1905 (type of work), and a number 1906 (number of packages) are displayed. The information 1901 to 1906 is based on information held by an entry corresponding to the location 520 in the transportation schedule proposal information 119 and the charging schedule proposal information 120. The value of the status 1905 may be at least one of collection, delivery, and charging. The schedule of the collection and delivery work and the schedule of charging may be displayed separately. From the location screen 900, a schedule manager or a worker can check the schedule of work related to transportation and charging performed at each location.

[0106] The above describes a schedule planning system according to an embodiment of the present invention. With such a schedule planning system, in transportation operations using electric vehicles, it is possible to improve efficiency and reduce the number of revision man-hours required by a scheduler by adopting a schedule that is easy to use instead of a schedule that does not require revision.

[0107] Although one embodiment of the present invention has been described, this embodiment is presented as an example and is not intended to limit the scope of the invention. The present invention can be embodied in various other forms, and various omissions, substitutions, and modifications can be made without departing from the gist of the invention. This embodiment is included in the scope and gist of the invention, and is included in the scope of the invention and its equivalents described in the claims. For example, both the transportation schedule and the charging schedule may be a time-series event (e.g., what to do, where to do, and from when) in a schedule target period (e.g., a time period, a day, or a week, etc.).

[0108] For example, the above description can be summarized as follows: Note that the following summary may include supplementary explanations and explanations of modifications of the above description.

[0109] The schedule planning device 100 includes an input unit 140 , a schedule planning unit 132 , an evaluation unit 133 , and an output unit 141 .

[0110] The input unit 140 inputs a plurality of parameter values. The plurality of parameter values ​​are used to create a schedule combination. The schedule combination includes a transportation schedule and a charging schedule based on the transportation schedule. The transportation schedule is a schedule for transporting a plurality of packages to a plurality of locations by a plurality of transportation vehicles. The "plurality of transportation vehicles" includes a plurality of electric vehicles that require charging. The plurality of transportation vehicles may include transportation vehicles other than the electric vehicle that requires charging. The charging schedule includes a schedule for charging the plurality of electric vehicles.

[0111] The schedule creation unit 132 creates one or more schedule combinations based on the input parameter values.

[0112] The evaluation unit 133 evaluates the efficiency (transportation efficiency) and the ease of modification (the ease of modifying the schedule) for each of the one or more proposed schedule combinations. For example, the evaluation unit 133 calculates an evaluation value for each of the efficiency and the ease of modification for each of the one or more proposed schedule combinations.

[0113] The output unit 141 outputs information based on at least a part of a target schedule combination among one or more schedule combinations. The target schedule combination is a schedule combination in which the efficiency and the ease of modification are relatively high.

[0114] The multiple parameter values ​​used to plan the schedule combination include multiple predicted parameter values ​​and one or more constraint parameter value combinations. Each predicted parameter value is a predicted value for a parameter name. For each of the multiple constraint parameter names, there are one or more constraint parameter values. For each of the one or more constraint parameter value combinations, the constraint parameter value combination is a combination made up of multiple constraint parameter values ​​respectively corresponding to the multiple constraint parameter names. The constraint parameter value of at least one constraint parameter name affects modifiability (modifiability evaluation value).

[0115] In this way, an evaluation item (evaluation viewpoint) called modifiability is prepared, names of constraint parameters that affect modifiability are prepared, and the multiple parameter values ​​used to plan the schedule combination include one or multiple combinations of constraint parameter values. This makes it easy to modify the schedule even if it becomes necessary, and is expected to provide a transportation schedule and a charging schedule with high transportation efficiency.

[0116] The "multiple parameter values" may include, as parameter values, at least some of the information elements among luggage information (e.g., order information 113) regarding luggage to be transported, vehicle information 114 regarding multiple transport vehicles, location information 115 regarding locations from / to the transport vehicles (e.g., departure point, arrival point, relay point, charging point, etc.) (which may include, for example, information regarding movement between locations), and charger information 116 regarding chargers that are installed at locations designated as charging-enabled and can charge the electric vehicle.

[0117] Furthermore, "efficiency" may refer to, for example, whether transportation is carried out without waste, and at least one of the following factors may be adopted as factors that affect efficiency. - Is there a small number of vehicles? (For example, it is desirable to avoid creating a schedule with a large number of vehicles, or creating a schedule that cannot transport all the cargo or results in electric vehicles running out of power, which would require new transport vehicles on the scheduled date (the day itself).) Are the transportation costs low? -Is the amount of electricity consumed during transportation and is the electricity bill low? -Is the amount of carbon dioxide emitted during transportation small?

[0118] Furthermore, "ease of modification" may refer to how little effort is required to modify the proposed schedule (how small the modification cost is), and at least one of the following factors may be adopted as a factor affecting the ease of modification: "Modification cost" may be based on the effort required for modification, the time required for modification, or a combination of these. Is it possible to revise only the charging schedule without revising the transportation schedule? · Can we avoid modifying the relationship between the transport vehicle and the goods being transported?

[0119] The evaluation unit 133 may evaluate the efficiency and modifiability as well as the modification necessity, which is the necessity of schedule modification, for each of the one or more schedule combinations. The multiple parameter values ​​may include a buffer value associated with each of the one or more predicted parameter values ​​among the multiple predicted parameter values. At least one buffer value may affect the modification necessity. The target schedule combination may be a schedule combination having relatively high efficiency and modifiability and relatively low modification necessity. This makes it possible to provide a schedule combination that has high efficiency and low modification necessity, but in which the schedule modification cost is small even if a schedule modification becomes necessary due to an error exceeding the buffer value or other reasons.

[0120] The "necessity of revision" may be the degree of prediction error that can occur without the need to revise the schedule, and at least one of the following factors may be adopted as the factor that influences the necessity of revision. - Can transportation continue without modifying the planned schedule even if the volume of cargo increases by a greater amount than expected? - Even if the building's power consumption increases more than expected, will it be possible to continue transportation without modifying the planned schedule?

[0121] The one or more prediction parameter values ​​to which the buffer value is respectively associated may be at least one of the power consumption of the building at the point where charging can be performed, the demand target, the remaining power of the electric vehicle at the start of transportation, the power consumption (the distance that can be traveled per unit of power), the power consumption between the points, the departure date and time of the point, the arrival date and time of the point, and the amount of luggage. This is expected to improve the accuracy of the evaluation of the need for correction.

[0122] The schedule planning unit 132 may plan one or more schedule combinations for each of one or more constraint parameter value combinations. In this way, at least one schedule combination is planned for each constraint parameter value combination, and each of the planned schedule combinations is expected to be a schedule combination with high efficiency and ease of modification within a range in which the schedule combination complies with the constraint parameter value combination corresponding to the schedule combination.

[0123] The plurality of constraint parameter values ​​may include one or more first constraint parameter values ​​that affect the cost of modifying the charging schedule in order to preferentially modify the charging schedule so as to minimize the cost of modifying the transportation schedule when the need for modifying the schedule combination arises. This makes it possible to expect that even if the need for schedule modification arises, the schedule modification can be performed with minimal modification cost and without reducing efficiency in following the transportation schedule as much as possible.

[0124] The one or more first constraint parameter values ​​may include at least one of the following: an upper limit of the total usage time of the charger in the fast charging mode; a lower limit of the total stay time of one or more vehicles staying at the location without charging; a lower limit of the difference between the demand target and the predicted peak power; an upper limit of the number of vehicles staying at the same location during business hours; and an upper limit of the number of electric vehicles whose ratio of the mileage to the cruising distance is equal to or greater than a threshold. This is expected to improve the accuracy of the evaluation of the modifiability. For example, a schedule combination may be proposed or an evaluation value of the modifiability may be calculated based on the difference between the constraint parameter value and the parameter value of the same parameter name as the constraint parameter name. Also, for example, at least one of the following may tend to have a high evaluation value of the modifiability. - The total duration of one or more vehicles staying at a location without charging is long. -The total usage time of the quick charger is short. · There is a large difference between the demand target and the predicted peak power. · The number of vehicles simultaneously present at one location during business hours is low. The number of electric vehicles whose ratio of driving distance to cruising range is above a threshold is low.

[0125] The multiple constraint parameter values ​​may include one or more second constraint parameter values ​​that affect the cost of modifying the transportation schedule. The one or more second constraint parameter values ​​may include at least one of an upper limit of the number of consecutive operations in which the length of the pickup or delivery time frame is equal to or less than a threshold, and a lower limit of the difference between the end date and time of the pickup or delivery operation and the deadline for pickup or delivery. This is expected to result in a schedule combination that allows the transportation schedule to be modified at a small modification cost even if the schedule needs to be modified. For example, at least one of the following may tend to result in a small modification cost to the transportation schedule. - There are few consecutive operations where the length of the pickup or delivery window is below the threshold. - There is a large difference between the end date and time of the collection or delivery operation and the deadline for collection or delivery.

[0126] The one or more parameter values ​​that are included in the plurality of parameter values ​​or that are obtained from at least a part of the plurality of parameter values ​​and that affect efficiency may be at least one of the number of electric vehicles that are low on power or that run out of power, the amount of luggage that cannot be transported, the number of vehicles used, the transportation cost, the transportation time, the amount of power consumed by transportation, the amount of carbon dioxide emissions by transportation, and the electricity fee required for charging. This is expected to improve the accuracy of the efficiency evaluation.

[0127] The target schedule combination may be a schedule combination that is Pareto optimal in terms of efficiency and modifiability (e.g., their evaluation values), or a schedule combination that has the best evaluation of efficiency and modifiability (e.g., a schedule combination that has the best schedule evaluation value determined based on those evaluation values). This is expected to lead to the adoption of a schedule combination that is favorable at least from the viewpoints of efficiency and modifiability.

[0128] The output unit 141 may perform at least one of the following (a) to (d). This allows optimal information to be provided to the output destination. For example, (d) is expected to enable automatic charging control according to a charging schedule. (a) The output unit 141 displays the transportation schedule and / or the charging schedule of the target schedule combination on the display device 450 or a remote computer. (b) The output unit 141 transmits, for at least one of the multiple transport vehicles, information representing a transport schedule portion and / or a charging schedule portion of the target schedule combination that corresponds to the transport vehicle to an information processing terminal present in the transport vehicle. This "information processing terminal" may be, for example, an on-board device of the transport vehicle or a mobile terminal carried by a person aboard the transport vehicle. (c) The output unit 141 transmits, for at least one of the multiple locations, information representing the transportation schedule portion and / or the charging schedule portion of the target schedule combination that corresponds to the location to an information processing terminal present at the location. This "information processing terminal" may be, for example, a stationary or mobile personal computer or a smartphone at the location. (d) The output unit 141 transmits charging control information according to the charging schedule portion of the target schedule combination that corresponds to at least one of the multiple charging points to a charging control device that controls a charger at the point. This "charging control information" may be information on when and to what extent charging is performed at which charger, or may be a control command transmitted according to the charging schedule portion.

[0129] The functions of the input unit 140, the prediction error calculation unit 131, the schedule planning unit 132, the evaluation unit 133, and the output unit 141 may be present in one device or may be distributed among multiple devices. For example, there may be a first device having functions of the input unit 140, the prediction error calculation unit 131, the schedule planning unit 132, etc., and a second device having functions of the evaluation unit 133 and the output unit 141, etc. The first device may output information representing one or more schedule combinations that have been planned, and the second device may evaluate each of the one or more schedule combinations represented by the information and output information based on the evaluation results. [Explanation of symbols]

[0130] 1...schedule planning system, 100...schedule planning device, 110...storage unit, 111...predicted performance information, 112...parameter information, 113...order information, 114...vehicle information, 115...order information, 115...location information, 116...charger information, 117...travel cost information, 118...evaluation information, 119...proposed transportation schedule information, 120...proposed charging schedule information, 130...control unit, 131... Prediction error calculation unit, 132... schedule planning unit, 133... evaluation unit, 140... input unit, 141... output unit, 150... display unit, 160... communication unit, N... network, 200... in-vehicle terminal, 210... communication unit, 220... control unit, 230... display unit, 300... location schedule management terminal, 310... communication unit, 320... control unit, 330... display unit, 410... charging control device, 410... communication unit, 420... control unit

Claims

1. An input unit for inputting a plurality of parameter values used for formulating a schedule combination including a transport schedule for transporting a plurality of cargos to a plurality of locations by a plurality of transport vehicles including a plurality of electric vehicles that require charging, and a charging schedule that is a schedule for charging the plurality of electric vehicles and is a schedule based on the transport schedule; A schedule formulation unit for formulating one or more schedule combinations based on the plurality of parameter values; An evaluation unit for evaluating, for each of the one or more schedule combinations, an efficiency that is the efficiency of transportation and an ease of modification that is the ease of schedule modification; An output unit for outputting information based on at least a part of a target schedule combination Comprising The plurality of parameter values include a plurality of predicted parameter values and one or more sets of constraint parameter values; Each predicted parameter value is a predicted value for a parameter name; For each of the plurality of constraint parameter names, there are one or more constraint parameter values; For each of the one or more sets of constraint parameter values, the set of constraint parameter values is a combination composed of a plurality of constraint parameter values respectively corresponding to the plurality of constraint parameter names; The constraint parameter value of at least one constraint parameter name affects the ease of modification; The target schedule combination is a schedule combination in which the efficiency and the ease of modification are relatively high; A schedule formulation device.

2. The evaluation unit evaluates, for each of the one or more schedule combinations, in addition to the efficiency and the ease of modification, a necessity for modification that is the necessity for schedule modification; The plurality of parameter values include buffer values associated with each of one or more of the plurality of predicted parameter values; At least one buffer value affects the necessity for modification; The target schedule combination is a schedule combination in which the efficiency and the ease of modification are relatively high and the necessity for modification is relatively low; The schedule formulation device according to Claim 1.

3. The one or more predicted parameter values each associated with a buffer value are at least one of the power consumption of the building at the point where charging can be performed, the demand target, the remaining power of the electric vehicle at the start of transportation, the electricity cost, the power consumption between points, the departure date and time of the point, the arrival date and time of the point, and the amount of luggage. The scheduling device according to claim 2.

4. The scheduling unit creates one or more schedule combinations for each of the one or more combinations of constraint parameter values. The scheduling device according to claim 1.

5. The plurality of constraint parameter values include one or more first constraint parameter values that affect the modification cost of the charging schedule in order to minimize the modification cost of the transportation schedule as much as possible when a modification of the schedule combination is required, and preferentially modify the charging schedule. The scheduling device according to claim 1.

6. The one or more first constraint parameter values include at least one of an upper limit value of the total usage time of chargers with a rapid charging mode, a lower limit value of the total stay time of one or more vehicles staying at a point without charging, a lower limit value of the difference between the demand target and the predicted peak power, an upper limit value of the number of vehicles staying at a point simultaneously during business hours, and an upper limit value of the number of electric vehicles with a ratio of the driving distance to the cruising distance equal to or greater than a threshold value. The scheduling device according to claim 5.

7. The plurality of constraint parameter values include one or more second constraint parameter values that affect the modification cost of the transportation schedule. The one or more second constraint parameter values include at least one of an upper limit value of the number of consecutive operations with a collection or delivery time frame length equal to or less than a threshold value, and a lower limit value of the difference between the end date and time of the collection or delivery operation and the collection or delivery deadline. The scheduling device according to claim 1.

8. One or more parameter values included in the plurality of parameter values or obtained from at least a part of the plurality of parameter values, and the one or more parameter values that affect the efficiency are at least one of the number of electric vehicles with a decreasing remaining power or a power outage, the amount of luggage that cannot be transported, the number of vehicles used, the transportation cost, the transportation time, the power consumption due to transportation, the carbon dioxide emission due to transportation, and the electricity charge required for charging. The schedule planning device according to claim 1.

9. The target schedule combination is a schedule combination in which the efficiency and the ease of modification are Pareto optimal, or a schedule combination in which the evaluation of the efficiency and the ease of modification is the best. The schedule planning device according to claim 1.

10. The output unit performs at least one of the following (a) to (d). (a) Display the transport schedule and / or the charging schedule of the target schedule combination on a display device or a remote computer. (b) For at least one of the plurality of transport vehicles, transmit information representing the transport schedule portion and / or the charging schedule portion corresponding to the transport vehicle in the target schedule combination to the information processing terminal existing in the transport vehicle. (c) For at least one of the plurality of locations, transmit information representing the transport schedule portion and / or the charging schedule portion corresponding to the location in the target schedule combination to the information processing terminal existing at the location. (d) For at least one chargeable location among the plurality of locations, transmit charging control information according to the charging schedule portion corresponding to the location in the target schedule combination to the charging control device that controls the charger existing at the location. The schedule planning device according to claim 1.

11. Input a plurality of parameter values used for planning a schedule combination including a transport schedule for transporting a plurality of goods to a plurality of locations by a plurality of transport vehicles including a plurality of electric vehicles that require charging, and a charging schedule that is a schedule for charging the plurality of electric vehicles and is based on the transport schedule. Plan one or more schedule combinations based on the plurality of parameter values. For each of the one or more schedule combinations, evaluate the efficiency that is the efficiency of transportation and the ease of modification that is the ease of schedule modification. Output information based on at least a part of the target schedule combination among the one or more schedule combinations. Execute this by a computer. The plurality of parameter values include a plurality of predicted parameter values and one or more sets of constraint parameter values. Each predicted parameter value is a predicted value for the parameter name. For each of the plurality of constraint parameter names, there is one or more constraint parameter values, For each of the one or more sets of constraint parameter values, the set of constraint parameter values is a combination composed of a plurality of constraint parameter values respectively corresponding to the plurality of constraint parameter names, The constraint parameter value of at least one constraint parameter name affects the ease of modification, The target schedule combination is a schedule combination in which the efficiency and the ease of modification are relatively high, A schedule planning method.

Images