Delivery planning device, delivery planning method, and delivery planning program
The delivery planning device improves delivery plans by reallocating cargo based on allocation difficulty levels, addressing the inefficiency of conventional methods by reducing vehicle count through continuous evaluation and optimization, achieving faster and more economical delivery plans.
Patent Information
- Application Number
- JP2021077037
- Authority / Receiving Office
- JP · JP
- Patent Type
- Patents
- Current Assignee / Owner
- Filing Date
- 2021-04-30
- Publication Date
- 2024-11-22
- Estimated Expiration
- 2041-04-30
AI Technical Summary
Conventional delivery planning methods take too long to find an optimal delivery plan that minimizes the number of vehicles due to the lack of a continuous evaluation of improvement status and reliance on discrete vehicle count, leading to inefficient and time-consuming iterative processes.
A delivery planning device that calculates allocation difficulty levels based on package features and repeatedly improves the plan by reallocating cargo to reduce the number of vehicles, using a continuous evaluation of ease of reduction through optimization problems.
Enables the formulation of an economical delivery plan with a reduced number of vehicles in a shorter time by continuously evaluating and improving the allocation process, facilitating faster convergence to an optimal solution.
Smart Images

Figure 0007588550000004 
Figure 0007588550000005 
Figure 0007588550000006
Abstract
Description
[Technical field]
[0001] The present disclosure relates to a delivery planning device, a delivery planning method, and a delivery planning program. In particular, the present disclosure relates to a delivery planning device, a delivery planning method, and a delivery planning program that quickly create a delivery plan with a small number of delivery vehicles in the creation of a delivery plan required for delivery operations in the field of logistics. [Background technology]
[0002] In delivery operations, a delivery plan is created to efficiently deliver parcels to their destinations using delivery vehicles such as trucks. A delivery plan is information that describes the allocation of parcels to delivery vehicles and the order in which each delivery vehicle will deliver the parcels. If a time period for delivering a parcel is specified, the delivery must be completed within the specified time period. Since the cost of using vehicles is high, it is generally desirable to reduce the number of vehicles in order to obtain an economical delivery plan. Reducing the number of vehicles makes it possible to reduce the number of vehicles that need to be owned, which leads to reductions in costs such as investment costs, maintenance costs, external vehicle rental fees, and driver labor costs.
[0003] In Patent Document 1, a large-scale delivery planning problem with a large number of delivery destinations is divided into a process for formulating a feasible initial plan and a process for improving the plan. A method for solving the delivery planning problem by repeatedly solving small-scale problems in the process for improving the plan has been proposed. In addition, a method has been proposed for reducing the number of vehicles, in which a solution with a reduced number of vehicles is more easily obtained by improving the plan by specifying vehicles to be reduced. In addition, a method has been proposed for obtaining a desired solution more quickly by forming a tabu list and suppressing searches for solutions that do not lead to a reduction in the number of vehicles. [Prior art documents] [Patent documents]
[0004] [Patent Document 1] JP 2002-302257 A Summary of the Invention [Problem to be solved by the invention]
[0005] In the conventional technology, vehicles to be reduced are specified, and improvement candidate plans are prepared using a tabu list, thereby making it more efficient to find a solution that realizes a reduction in the number of vehicles. However, in the conventional technology, the prepared plan is evaluated using an evaluation function that has the number of vehicles, which is a discrete value, as a cost element. Therefore, in the conventional technology, if there is no change in the evaluation function from the viewpoint of reducing the number of vehicles, even if an improved plan is prepared, the superiority or inferiority of the plan before and after the improvement cannot be determined, and the improvement status does not change. Therefore, in the conventional technology, it is necessary to repeat the plan improvement process until a solution with a small number of vehicles is found by chance, and there is a problem that it takes a long time to calculate to obtain the desired solution.
[0006] The present disclosure aims to enable the rapid creation of delivery plans that require the use of a smaller number of vehicles. [Means for solving the problem]
[0007] A delivery planning device according to the present disclosure is a delivery planning device that improves a delivery plan for delivering packages by a plurality of vehicles, an allocation difficulty calculation unit that calculates an allocation difficulty level representing a degree of difficulty of allocating the luggage to a vehicle based on a physical characteristic amount of the luggage and a temporal characteristic amount of the luggage; The system further includes a plan improvement unit that improves the delivery plan by selecting vehicles to be reduced and vehicles for which luggage allocations are to be changed from the plurality of vehicles, determining the sum of the difficulty levels of allocation of luggage assigned to the vehicles to be reduced as reduction ease, and repeating an improvement process of changing the luggage allocations for the vehicles to be reduced and the vehicles for which luggage allocations are to be changed so as to improve the reduction ease. Effect of the Invention
[0008] In the delivery planning device according to the present disclosure, the cargo of the vehicle designated as the reduction target is replaced with cargo with a low allocation difficulty, i.e., cargo that is easy to allocate to other vehicles, by repeating the improvement process. Therefore, according to the delivery planning device according to the present disclosure, it is possible to improve the delivery plan to one that makes it easy to gradually reduce the number of vehicles, and it is possible to create an economical delivery plan with a small number of vehicles in a short time. [Brief description of the drawings]
[0009] [Figure 1] FIG. 1 is a diagram showing an example of the overall configuration of a delivery planning system according to a first embodiment. [Diagram 2] FIG. 1 is a diagram showing an example of the configuration of a delivery planning device according to a first embodiment. [Diagram 3] FIG. 1 is a diagram showing an example of the configuration of a delivery request management device according to a first embodiment. [Figure 4] FIG. 2 is a diagram showing a configuration example of a delivery plan confirmation terminal according to the first embodiment. [Diagram 5] FIG. 2 is a diagram showing a detailed example of a functional configuration of the delivery planning device according to the first embodiment. [Figure 6] FIG. 2 is a diagram showing an example of a detailed configuration of a storage unit of the delivery planning device according to the first embodiment. [Figure 7] FIG. 4 is a diagram showing an example of the configuration of a delivery request according to the first embodiment. [Figure 8] FIG. 2 is a diagram showing an example of the configuration of a delivery plan according to the first embodiment. [Figure 9] FIG. 2 is a diagram showing an example of the configuration of delivery vehicle information according to the first embodiment. [Figure 10] FIG. 4 is a diagram showing an example of the configuration of cost definition information according to the first embodiment. [Figure 11] FIG. 4 is a diagram showing an example of a configuration of mileage definition information according to the first embodiment. [Figure 12] FIG. 4 is a diagram showing an example of a configuration of running time definition information according to the first embodiment. [Figure 13] FIG. 2 is a flowchart showing the overall processing of the delivery planning device according to the first embodiment. [Figure 14] 4 is a flowchart showing the operations of an allocation difficulty level calculation unit and a delivery plan improvement unit according to the first embodiment. [Figure 15] FIG. 13 is a diagram showing an example of the configuration of a delivery planning device according to a modified example of the first embodiment. [Figure 16] FIG. 11 is a diagram showing a detailed example of a functional configuration of a delivery planning device according to a second embodiment. [Figure 17] FIG. 11 is a flowchart showing the operations of an allocation difficulty level calculation unit and a delivery plan improvement unit according to the second embodiment. DETAILED DESCRIPTION OF THE PREFERRED EMBODIMENTS
[0010] Hereinafter, the present embodiment will be described with reference to the drawings. In each drawing, the same or corresponding parts are given the same reference numerals. In the description of the embodiment, the description of the same or corresponding parts will be omitted or simplified as appropriate. In addition, the relationship of the size of each component in the following drawings may differ from the actual one. In addition, in the description of the embodiment, directions or positions such as up, down, left, right, front, back, front, and back may be indicated. These notations are for the convenience of explanation and do not limit the arrangement, direction, or orientation of devices, instruments, parts, etc.
[0011] Embodiment 1 ***Configuration Description*** FIG. 1 is a diagram showing an example of the overall configuration of a delivery planning system 500 according to the present embodiment. The delivery planning system 500 includes a delivery request management device 10, a delivery planning device 20, and a delivery plan confirmation terminal 30. The delivery plan device 20 communicates with each of the delivery request management device 10 and the delivery plan confirmation terminal 30 via a network 300 .
[0012] The delivery request management device 10 is a device that centrally manages requests for delivery of parcels from customers. The delivery planning device 20 is a device that creates a delivery plan 12 based on the delivery request 11 sent from the delivery request management device 10. The delivery planning device 20 improves the delivery plan 12 and outputs the improved delivery plan 12 as delivery plan information 13. The delivery plan confirmation terminal 30 is a terminal for receiving delivery plan information 13, which is the delivery plan 12 that has been completed by the delivery planning device 20 through planning and improvement, and for confirming the contents. The delivery request management device 10, the delivery plan device 20, and the delivery plan confirmation terminal 30 may be integrated into one device. Alternatively, any combination of the delivery request management device 10, the delivery plan device 20, and the delivery plan confirmation terminal 30 may be integrated into one device.
[0013] Next, examples of the configurations of the delivery request management device 10, the delivery plan device 20, and the delivery plan confirmation terminal 30 will be described with reference to Figs. FIG. 2 is a diagram showing an example of the configuration of the delivery planning device 20 according to the present embodiment. FIG. 3 is a diagram showing an example of the configuration of delivery request management device 10 according to the present embodiment. FIG. 4 is a diagram showing an example of the configuration of the delivery plan confirmation terminal 30 according to the present embodiment.
[0014] An example of the configuration of the delivery planning device 20 according to the present embodiment will be described with reference to FIG. The delivery planning device 20 is a computer. The delivery planning device 20 includes a processor 910, and also includes other hardware such as a memory 921, an auxiliary storage device 922, an input interface 930, an output interface 940, and a communication device 950. The processor 910 is connected to the other hardware via signal lines and controls the other hardware.
[0015] The delivery plan device 20 includes, as functional elements, a delivery request receiving unit 201, a delivery plan creating unit 202, an allocation difficulty calculating unit 230, a delivery plan improving unit 203, a delivery plan transmitting unit 204, and a storage unit 205.
[0016] The functions of the delivery request receiving unit 201, the delivery plan creating unit 202, the allocation difficulty calculating unit 230, the delivery plan improving unit 203, and the delivery plan transmitting unit 204 are realized by software. The storage unit 205 is provided in the memory 921. The storage unit 205 may be provided in the auxiliary storage device 922, or may be provided in a distributed manner in the memory 921 and the auxiliary storage device 922.
[0017] The processor 910 is a device that executes a delivery plan program. The delivery plan program is a program that realizes the functions of the delivery request receiving unit 201, the delivery plan creating unit 202, the allocation difficulty calculating unit 230, the delivery plan improving unit 203, and the delivery plan transmitting unit 204. The processor 910 is an integrated circuit (IC) that performs arithmetic processing. Specific examples of the processor 910 include a central processing unit (CPU), a digital signal processor (DSP), and a graphics processing unit (GPU).
[0018] The memory 921 is a storage device that temporarily stores data. Specific examples of the memory 921 include a static random access memory (SRAM) and a dynamic random access memory (DRAM). The auxiliary storage device 922 is a storage device that stores data. A specific example of the auxiliary storage device 922 is a HDD. The auxiliary storage device 922 may also be a portable storage medium such as an SD (registered trademark) memory card, CF, NAND flash, a flexible disk, an optical disk, a compact disk, a Blu-ray (registered trademark) disk, or a DVD. Note that HDD is an abbreviation for Hard Disk Drive. SD (registered trademark) is an abbreviation for Secure Digital. CF is an abbreviation for CompactFlash (registered trademark). DVD is an abbreviation for Digital Versatile Disk.
[0019] The input interface 930 is a port connected to an input device such as a mouse, a keyboard, or a touch panel. Specifically, the input interface 930 is a Universal Serial Bus (USB) terminal. The input interface 930 may be a port connected to a Local Area Network (LAN).
[0020] The output interface 940 is a port to which a cable of an output device such as a display is connected. Specifically, the output interface 940 is a USB terminal or an HDMI (registered trademark) (High Definition Multimedia Interface) terminal. Specifically, the display is an LCD (Liquid Crystal Display). The output interface 940 is also called a display interface.
[0021] The communication device 950 has a receiver and a transmitter. The communication device 950 is connected to a communication network such as a LAN, the Internet, or a telephone line. Specifically, the communication device 950 is a communication chip or a NIC (Network Interface Card).
[0022] The delivery plan program is executed in the delivery plan device 20. The delivery plan program is read into the processor 910 and executed by the processor 910. The memory 921 stores not only the delivery plan program but also an OS (Operating System). The processor 910 executes the delivery plan program while executing the OS. The delivery plan program and the OS may be stored in an auxiliary storage device 922. The delivery plan program and the OS stored in the auxiliary storage device 922 are loaded into the memory 921 and executed by the processor 910. Note that a part or all of the delivery plan program may be incorporated into the OS.
[0023] The delivery planning device 20 may include a plurality of processors that replace the processor 910. These plurality of processors share the execution of the delivery planning program. Each of the processors is a device that executes the delivery planning program, just like the processor 910.
[0024] Data, information, signal values and variable values used, processed or output by the Dispatch Planning program are stored in memory 921, secondary storage device 922, or in registers or cache memory within the processor 910.
[0025] The "parts" of the delivery request receiving unit 201, the delivery plan creating unit 202, the allocation difficulty calculation unit 230, the delivery plan improvement unit 203, and the delivery plan transmission unit 204 may be read as "circuits," "steps," "procedures," "processing," or "circuitry." The delivery plan program causes a computer to execute delivery request receiving processing, delivery plan creating processing, allocation difficulty calculation processing, delivery plan improvement processing, and delivery plan transmission processing. The "processing" of the delivery request receiving processing, delivery plan creating processing, allocation difficulty calculation processing, delivery plan improvement processing, and delivery plan transmission processing may be read as "program," "program product," "computer-readable storage medium storing a program," or "computer-readable recording medium recording a program." The delivery plan method is a method performed by the delivery plan device 20 executing the delivery plan program. The delivery planning program may be provided by being stored in a computer-readable recording medium, or may be provided as a program product.
[0026] An example of the configuration of the delivery request management device 10 according to this embodiment will be described with reference to FIG. The delivery request management device 10 is a computer. The delivery request management device 10 includes a processor 910, and also includes other hardware such as a memory 921, an auxiliary storage device 922, an input interface 930, an output interface 940, and a communication device 950. The processor 910 is connected to the other hardware via signal lines and controls the other hardware. The delivery request management device 10 comprises a delivery request transmitting unit 101 and a storage unit 102 as functional elements.
[0027] An example of the configuration of the delivery plan confirmation terminal 30 according to this embodiment will be described with reference to FIG. The delivery plan confirmation terminal 30 is a computer. The delivery plan confirmation terminal 30 includes a processor 910, as well as other hardware such as a memory 921, an auxiliary storage device 922, an input interface 930, an output interface 940, and a communication device 950. The processor 910 is connected to the other hardware via a signal line and controls the other hardware. The delivery plan confirmation terminal 30 comprises, as functional elements, a delivery plan receiving unit 301, a delivery plan display unit 302, and a storage unit 303.
[0028] For ease of explanation, the same reference numerals are used for hardware having similar functions in the delivery request management device 10, the delivery plan device 20, and the delivery plan confirmation terminal 30. The hardware in the delivery request management device 10 and the delivery plan confirmation terminal 30 is similar to that described for the delivery plan device 20.
[0029] *** Functionality Overview *** Here, an overview of the functions of the delivery request management device 10, the delivery plan device 20, and the delivery plan confirmation terminal 30 will be described.
[0030] In the delivery request management device 10 , a delivery request transmission unit 101 transmits a delivery request 11 to the delivery planning device 20 .
[0031] In the delivery plan confirmation terminal 30, a delivery plan receiving unit 301 receives the delivery plan information 13 from the delivery planning device 20. In addition, a delivery plan display unit 302 displays the delivery plan information 13 received from the delivery planning device 20 on an output device such as a display.
[0032] FIG. 5 is a diagram showing a detailed example of a functional configuration of the delivery planning device 20 according to the present embodiment. The delivery planning device 20 improves the delivery plan 12 for delivering packages using a plurality of vehicles. Note that a vehicle to which a package is assigned in the delivery plan 12 is simply referred to as a vehicle or a delivery vehicle. The delivery planning device 20 outputs the improved delivery plan 12 as delivery plan information 13, which is the final delivery plan.
[0033] In the delivery planning device 20 , a delivery request receiving unit 201 receives a delivery request 11 from the delivery request transmitting unit 101 . The delivery plan creation unit 202 creates a delivery plan 12 based on the delivery request 11 . The allocation difficulty calculation unit 230 calculates the difficulty of allocating a package included in the delivery request 11. The allocation difficulty calculation unit 230 calculates the allocation difficulty indicating the degree of difficulty of allocating the package to a vehicle, based on the physical characteristic amount and the temporal characteristic amount of the package. The delivery plan improvement unit 203 improves the delivery plan 12 that has been created. The delivery plan transmitting unit 204 transmits the improved delivery plan 12 as delivery plan information 13 to the delivery plan confirmation terminal 30 . The storage unit 205 manages various information used by the delivery request receiving unit 201 , the delivery plan creating unit 202 , the allocation difficulty calculating unit 230 , the delivery plan improving unit 203 , and the delivery plan transmitting unit 204 .
[0034] The delivery plan improvement unit 203 includes a vehicle selection unit 240 , an optimization problem generation unit 250 , and an optimization problem solving unit 260 . The vehicle selection unit 240 selects vehicles to be reduced and vehicles for which luggage allocation is changed, which is used to change the allocation of luggage between vehicles. The optimization problem generator 250 generates an optimization problem to be solved based on requirements such as the delivery request 11 and the difficulty level of allocation. The optimization problem solving unit 260 solves the generated optimization problem.
[0035] FIG. 6 is a diagram showing an example of a detailed configuration of the storage unit 205 of the delivery planning device 20 according to the present embodiment. The storage unit 205 stores a delivery request 11, a delivery plan 12, delivery vehicle information 43, cost definition information 44, travel distance definition information 45, travel time definition information 46, and execution parameter definition information 47.
[0036] FIG. 7 is a diagram showing an example of the configuration of the delivery request 11 according to this embodiment. The delivery request 11 is information that the delivery request receiving unit 201 receives from the delivery request sending unit 101. For example, as shown in Fig. 7, the delivery request 11 has information such as the parcel number, the delivery destination name, the delivery destination address, the desired delivery time period, the parcel volume, and the parcel weight. The parcel number is a number for uniquely identifying a parcel to be delivered. The delivery destination name indicates the name of the delivery destination. The delivery destination address indicates the address of the delivery destination. The desired delivery time period indicates the desired delivery time period during which the customer will receive the parcel. The parcel volume indicates the volume of the parcel to be delivered. The parcel weight indicates the weight of the parcel to be delivered.
[0037] FIG. 8 is a diagram showing an example of the configuration of the delivery plan 12 according to the present embodiment. The delivery plan 12 is information output from the delivery plan creation unit 202 or the delivery plan improvement unit 203. For example, as shown in Fig. 8, the delivery plan 12 has information such as a vehicle number, an assigned parcel list, a delivery order, a total travel distance, and overtime. The vehicle number is a number for uniquely identifying a delivery vehicle. The assigned parcel list indicates a list of parcels assigned to a delivery vehicle. The delivery order indicates the order in which the assigned parcels will be delivered. The total driving distance indicates the planned driving distance until all assigned parcels are delivered and the vehicle returns to the base or garage. The overtime hours indicates the overtime hours required for work out of the time it takes to deliver all assigned parcels and return to the base or garage.
[0038] FIG. 9 is a diagram showing an example of the configuration of the delivery vehicle information 43 according to the present embodiment. The delivery vehicle information 43 is information describing the specifications of vehicles that can be used for delivery. For example, as shown in Fig. 9, the delivery vehicle information 43 includes information such as the vehicle number, the loadable capacity, the loadable weight, the available time period, and the garage address. The vehicle number is a number for uniquely identifying a delivery vehicle. The load capacity indicates the load capacity that the delivery vehicle can carry. The load weight indicates the load weight that the delivery vehicle can carry. The available time period indicates the time period during which the delivery vehicle can be used. The garage address indicates the warehouse where the vehicle must be stored at the end of business hours.
[0039] FIG. 10 is a diagram showing an example of the configuration of the cost definition information 44 according to the present embodiment. The cost definition information 44 is information that defines the costs required to create an economical delivery plan. For example, as shown in Fig. 10, the cost definition information 44 has information that defines the unit price and unit for the facility usage cost incurred for vehicle use, the fuel cost per unit travel distance, and the labor cost per unit work time.
[0040] FIG. 11 is a diagram showing an example of the configuration of the mileage definition information 45 according to the present embodiment. The mileage definition information 45 is information that defines the distance required for traveling between points. For example, as shown in Fig. 11, it has information that defines the mileage required for moving from a point such as a delivery base, a delivery destination, or a garage to another point. In the example of Fig. 11, the unit is assumed to be km.
[0041] FIG. 12 is a diagram showing an example of the configuration of the running time definition information 46 according to the present embodiment. The driving time definition information 46 is information that defines the time required for driving between points. For example, as shown in Fig. 12, it has information that defines the driving time required to move from a point such as a delivery base, a delivery destination, or a garage to another point. In the example of Fig. 12, the unit is assumed to be minutes.
[0042] The above-mentioned various definition information may be in other formats as long as the information necessary for defining the delivery plan problem is recorded. The execution parameter definition information 47 is definition information describing various execution parameters necessary for the operation of the delivery planning device 20. For example, it defines information such as the number of vehicles for which cargo allocation is changed, which will be described later.
[0043] ***Explanation of Operation*** Next, an operation of the delivery planning device 20 according to the present embodiment will be described. The operation procedure of the delivery planning device 20 corresponds to a delivery planning method. Moreover, a program for realizing the operation of the delivery planning device 20 corresponds to a delivery planning program.
[0044] FIG. 13 is a flow diagram showing the overall processing of the delivery planning device 20 according to the present embodiment. The overall operation of the delivery planning device 20 according to this embodiment will be described with reference to FIG.
[0045] In step S101, the delivery request receiving unit 201 receives the delivery request 11 sent from the delivery request sending unit 101, and stores it in the storage unit 205. A plurality of delivery requests 11 may be received together.
[0046] In step S102, the delivery plan creation unit 202 creates an executable delivery plan 12 using the delivery request 11 and various information stored in the storage unit 205, and stores the plan in the storage unit 205. The creation of the executable delivery plan 12 may be a method of creating a plan using an appropriate allocation rule, such as allocating a delivery vehicle to each delivery destination. Alternatively, a delivery plan problem may be generated using the delivery request 11 and various information, and the delivery plan 12 may be created using a solver that performs optimization calculations. The delivery plan creation unit 202 aims to create an executable delivery plan 12. It is desirable to obtain a delivery plan that uses fewer vehicles, but it is not necessarily necessary to spend time reducing the number of vehicles, since the created delivery plan 12 is improved in the next steps S103 and S104.
[0047] In step S103, the allocation difficulty calculation unit 230 calculates an allocation difficulty level representing the degree of difficulty of allocating the luggage to the vehicle based on the physical characteristic amount of the luggage and the temporal characteristic amount of the luggage. The allocation difficulty level is calculated for each luggage included in the delivery plan 12.
[0048] In step S104, the delivery plan improvement unit 203 performs processing to improve the delivery plan 12 using the delivery request 11 and various information stored in the memory unit 205, the delivery plan 12 drawn up in step S102, and the package allocation difficulty calculated in step S103. The delivery plan improvement unit 203 stores the improved delivery plan 12 in the memory unit 205. Specifically, the delivery plan improvement unit 203 selects a vehicle to be reduced and a vehicle to change the luggage allocation from among a plurality of vehicles. The delivery plan improvement unit 203 repeats an improvement process to change the luggage allocation between the vehicle to be reduced and the vehicle to change the luggage allocation, so as to improve the reduction ease, by taking the sum of the difficulty of allocation of luggage assigned to the vehicle to be reduced as the reduction ease. The delivery plan improvement unit 203 improves the delivery plan 12 step by step by repeating this improvement process. The improvement process refers to steps S203 to S209 in Fig. 14. The improvement process of repeating steps S203 to S209 in Fig. 14 is also called iterative process. Details of these improvement process steps will be described later.
[0049] Finally, in step S105 , the delivery plan transmitting unit 204 acquires the delivery plan 12 from the storage unit 205 , and transmits it to the delivery plan receiving unit 301 as delivery plan information 13 . Although FIG. 13 shows an example in which this series of processing is performed synchronously, it may be performed asynchronously.
[0050] FIG. 14 is a flow diagram showing the operation of the allocation difficulty level calculation unit 230 and the delivery plan improvement unit 203 according to this embodiment.
[0051] In step S201, the allocation difficulty level calculation unit 230 acquires the delivery plan 12 created in step S102 from the storage unit 205 as a provisional plan 121.
[0052] In step S202, the allocation difficulty calculation unit 230 calculates an allocation difficulty U representing the degree of difficulty of allocating luggage to vehicles, based on the physical characteristic amount and the temporal characteristic amount of the luggage, for the luggage included in the tentative plan 121. For example, the allocation difficulty calculation unit 230 calculates the allocation difficulty U by using the volume and weight of the luggage as the physical characteristic amount and the delivery time zone of the luggage as the temporal characteristic amount. Furthermore, the allocation difficulty level calculation unit 230 may calculate the allocation difficulty level U based on information such as the specifications of the vehicle to which the luggage is allocated, in addition to the physical feature amount and the temporal feature amount. Specifically, the following applies:
[0053] The allocation difficulty calculation unit 230 calculates the allocation difficulty U of all packages included in the provisional plan 121. The allocation difficulty is an index indicating the difficulty of allocating packages to delivery vehicles. This index estimates whether the package can be allocated to a delivery vehicle with available space, taking into account the physical constraints and time constraints of the package. As a physical constraint, the smaller the volume of the package or the lighter the weight of the package, the higher the possibility of it being allocated to available space, so the allocation difficulty is designed to be low. As a time constraint, the longer the delivery time slot permitted by the package, the more delivery time slots that can be allocated will increase, so the allocation difficulty is designed to be low. For example, the difficulty level of allocating luggage is calculated using the following formula 1.
number
[0054] U i is the difficulty of allocating luggage i, and q i is the volume of baggage i, w i represents the weight of baggage i. L i represents the latest time that unloading of luggage i must start. E i represents the earliest time that unloading of luggage i must start. That is, L i -E i represents the length of the time period in which unloading begins. α, β, and γ represent the weights for these.
[0055] Here is a concrete numerical example. For simplicity, α, β, and γ are all set to 1. If the luggage in question has a volume of 50 cm 3 , weight 50kg, no time specified (delivery between 9am and 7pm), q i =50, w i =50, L i -E i = 600 (10 hours x 60 minutes), and the allocation difficulty is U i =0.16. The volume is 300 cm 3 In this case, q i =300, wi =50, L i -E i = 600 (10 hours x 60 minutes), and the allocation difficulty is U i = 0.58. Furthermore, if the time period is 1 hour, then q i =300, w i =50, L i -E i = 60 (1 hour x 60 minutes), and the assigned difficulty is U i =5.83.
[0056] In this way, by calculating the degree of difficulty of allocation based on the volume, weight, and range of time slots of the parcels to be delivered, it is possible to measure the ease of allocating the parcels. In addition, a formula for calculating the difficulty of allocation may be configured using the number of delivery vehicles to which the parcel can be allocated, the number of parcels that overlap with the delivery time slot of the parcel, or features based on the specifications of the parcel to be delivered or the specifications of the delivery vehicle. Note that in this step, in the iterative process of repeating the improvement process from the next step S203 to step S209, if it becomes necessary to recalculate the difficulty of allocation, the flow may be configured to recalculate as necessary.
[0057] Next, in steps S203 and S204, the vehicle selection unit 240 of the delivery plan improvement unit 203 selects, from the plurality of vehicles included in the provisional plan 121, vehicles to be reduced and vehicles for which cargo allocation is to be changed. For example, the vehicle selection unit 240 selects the vehicle to be reduced in order from the vehicle with the lowest sum of the allocation difficulty of the allocated luggage. In addition, the vehicle selection unit 240 selects a plurality of vehicles for which the luggage allocation is changed in order from the vehicle with the lowest total luggage allocation difficulty level. The number of vehicles for which the luggage allocation is changed is defined in, for example, the execution parameter definition information 47. As another specific example, vehicles to be reduced and vehicles for which cargo allocation is changed may be selected as follows.
[0058] In step S203, the vehicle selection unit 240 selects one vehicle to be reduced. The vehicle selection unit 240 may randomly select the vehicle to be reduced, may select a vehicle with a small number of packages assigned to it, or may define priorities in the delivery vehicle information 43 and select the vehicle in order of the priorities. Also, as described above, the vehicle selection unit 240 may select the vehicle in order of lowest total difficulty of allocating packages allocated in the delivery plan 12, which is the provisional plan 121, using the difficulty of allocating packages calculated in the previous step S202.
[0059] In step S204, the vehicle selection unit 240 selects a plurality of vehicles for which the luggage allocation of the luggage is to be changed. The vehicle selection unit 240 selects from among the delivery vehicles to which luggage is allocated in the provisional plan, the number of which is the number defined in the execution parameter definition information 47. The selection method may be a random selection method, or a random selection method according to the ranking of the delivery vehicles. The ranking may be, for example, in order of the amount of free space, or in order of the lowest sum of the allocation difficulty of the allocated luggage. Alternatively, the selection method may be such that all delivery vehicles are selected uniformly in the repetition. In this case, the delivery vehicles may be selected in order, or in order with one vehicle skipped.
[0060] Next, in steps S205 and S206, the optimization problem generation unit 250 of the delivery plan improvement unit 203 generates an optimization problem for improving the delivery plan 12, which is the tentative plan 121. The optimization problem generation unit 250 fixes vehicle allocation conditions that allocate cargo to each of a plurality of vehicles, other than the vehicles to be reduced and the vehicles whose cargo allocation is to be changed, and generates an optimization problem in which the ease of reducing the vehicles to be reduced is used as an evaluation function. Here, the ease of reduction of a vehicle to be reduced is represented by the sum of the difficulty levels of allocation of cargo assigned to the vehicle to be reduced. Specifically, the following applies:
[0061] In step S205, the optimization problem generator 250 generates an optimization problem to be solved in the next step S206.
[0062] The details will be described below. First, the optimization problem generator 250 generates a delivery plan problem using the delivery request 11 and various information stored in the storage unit 205. The optimization problem generated here is a delivery plan problem, and may be a problem defined by any formulation method. Then, the optimization problem generation unit 250 refers to the delivery plan 12, which is the interim plan 121, and generates a subproblem that calculates the reallocation of cargo to vehicles, targeting the vehicle groups selected in steps S203 and S204 and the delivery destinations assigned to these vehicle groups.
[0063] We will explain this by taking the example of formulating it as a mixed integer programming problem. In a mixed integer programming problem, the variable representing the allocation of parcel i to delivery vehicle v is x v,i By expressing it as 0 or 1, we can determine the allocation state of the luggage. First, all variables x v,i to the results obtained in the interim plan 121, and then the variables representing the vehicles selected in steps S203 and S204 and their delivery destinations are unfixed.
[0064] In step S206, the optimization problem generator 250 sets an evaluation function for the optimization problem created in step S205. The evaluation function to be set is the sum of the difficulty levels of allocating luggage assigned to the vehicle to be reduced selected in step S203. As an example, if the mixed integer programming problem formulation shown in step S205 is used, the following formula 2 is obtained.
number
[0065] Here, I represents the set of packages that are the subject of delivery requests, and U i is the difficulty of allocating luggage i ∈ I, x v ̄,i is a variable that indicates whether or not cargo i∈I is assigned to the vehicle v to be reduced. The evaluation function does not need to be in the form of a mixed integer programming problem, and may be defined by any formulation method.
[0066] In step S207, the optimization problem solving unit 260 of the delivery plan improvement unit 203 solves the optimization problem to obtain, as an improved plan 122, the interim plan 121 in which the cargo allocation between the vehicles to be reduced and the vehicles whose cargo allocation is to be changed so as to improve the ease of reduction.
[0067] Specifically, optimization problem solving section 260 solves the optimization problems created in steps S205 and S206. For example, a solver for mixed integer programming problems is used for the solution process. The delivery plan improvement unit 203 creates a new delivery plan 12 as an improved plan 122 based on the solution result. By the process of step S207 and the evaluation function set in the previous step S206, a solution is searched for so that the cargo to be allocated to the vehicle to be reduced is replaced with cargo having a lower allocation difficulty. The solution process is not limited to a solver for mixed integer programming problems, and any algorithm may be used for the solution.
[0068] Next, the delivery plan improvement unit 203 judges whether the end condition is met and whether a reduction in the number of vehicles has been achieved. When the improvement plan 122 does not satisfy a preset end condition and the reduction of vehicles to be reduced in the improvement plan 122 is achieved, the vehicle selection unit 240 newly selects vehicles to be reduced. Then, the delivery plan improvement unit 203 updates the vehicle to be reduced to a newly selected vehicle to be reduced, updates the delivery plan 12 to an improved plan 122, and executes improvement processing from step S204.
[0069] Furthermore, if the improvement plan 122 does not satisfy a preset end condition and the reduction of vehicles to be reduced in the improvement plan 122 is not achieved, the vehicle selection unit 240 newly selects vehicles for which the luggage allocation is to be changed. Then, the delivery plan improvement unit 203 updates the vehicle for which the luggage allocation is to be changed to the newly selected vehicle for which the luggage allocation is to be changed, updates the delivery plan 12 to an improved plan 122, and executes the improvement process from step S205.
[0070] Specifically, the following applies: In step S208, the delivery plan improvement unit 203 judges whether the termination condition is satisfied, and performs step S210 if the termination condition is satisfied. If the termination condition is not satisfied, the next step S209 is performed. An example of the termination condition is when the processing time by the delivery plan improvement unit 203 reaches a default execution time defined in the execution parameter definition information 47. Alternatively, an example of the termination condition is when a relaxation problem of the problem to be solved in step S207 is solved and it is determined that there is no prospect of further reducing the number of vehicles.
[0071] In step S209, the delivery plan improvement unit 203 determines whether vehicle reduction has been achieved, and if vehicle reduction has been achieved, the process returns to step S203 and resumes the improvement process from selecting a new vehicle to be reduced. If vehicle reduction has not been achieved, the process returns to step S204 and resumes the improvement process from selecting a vehicle to change the cargo allocation. The achievement of vehicle reduction is determined by determining that in the tentative plan 121 obtained in step S207, there is no longer any cargo allocated to the vehicle to be reduced selected in step S203.
[0072] In step S210, the optimization problem generating unit 250 of the delivery plan improving unit 203 sets the evaluation function of the optimization problem used in step S207 to one that takes economic efficiency into consideration. Although the delivery plan 12 obtained up to this point uses a small number of vehicles, it does not include factors that should be considered in the original delivery plan planning, such as labor costs or fuel consumption. For this reason, the delivery plan has not been planned from the perspective of economic efficiency. Therefore, based on the delivery plan using a small number of vehicles, the optimization problem to which the original evaluation function is applied is solved in the next step S210, thereby converting it into an economical delivery plan. This evaluation function may be set appropriately depending on the case.
[0073] In step S211, the optimization problem to which the evaluation function that should be used in the previous step S210 is applied is solved using the optimization problem solving unit 260 of the delivery plan improvement unit 203. Note that before solving the optimization problem, the fixed variables representing the allocation of goods to the delivery vehicles are released in advance. In addition, the tentative plan 121 obtained up to step S207 is given as an initial solution. The end condition of the solution finding process may be a condition in which the solution finding time limit defined in the execution parameter definition information 47 is reached or a predetermined accuracy is reached. After the solution finding is completed, the delivery plan improvement unit 203 creates a delivery plan 12 from the obtained solution and stores it in the storage unit 205. As a result, the improved delivery plan 12 is confirmed.
[0074] It should be noted that steps S210 and S211 may be skipped if the purpose is to reduce the number of vehicles.
[0075] ***Other configurations*** In this embodiment, the functions of the delivery request receiving unit 201, the delivery plan creating unit 202, the allocation difficulty level calculation unit 230, the delivery plan improvement unit 203, and the delivery plan transmission unit 204 are realized by software. As a modified example, the functions of the delivery request receiving unit 201, the delivery plan creating unit 202, the allocation difficulty level calculation unit 230, the delivery plan improvement unit 203, and the delivery plan transmission unit 204 may be realized by hardware. Specifically, the delivery planning device 20 includes an electronic circuit 909 instead of the processor 910 .
[0076] FIG. 15 is a diagram showing an example of a configuration of a delivery planning device 20 according to a modified example of the present embodiment. The electronic circuit 909 is a dedicated electronic circuit that realizes the functions of the delivery request receiving unit 201, the delivery plan creating unit 202, the allocation difficulty calculating unit 230, the delivery plan improving unit 203, and the delivery plan transmitting unit 204. Specifically, the electronic circuit 909 is a single circuit, a composite circuit, a programmed processor, a parallel programmed processor, a logic IC, a GA, an ASIC, or an FPGA. GA is an abbreviation for Gate Array. ASIC is an abbreviation for Application Specific Integrated Circuit. FPGA is an abbreviation for Field-Programmable Gate Array.
[0077] The functions of the delivery request receiving unit 201, the delivery plan planning unit 202, the allocation difficulty calculation unit 230, the delivery plan improvement unit 203, and the delivery plan sending unit 204 may be realized by a single electronic circuit, or may be distributed across multiple electronic circuits.
[0078] As another modified example, some of the functions of the delivery request receiving unit 201, the delivery plan creating unit 202, the allocation difficulty calculating unit 230, the delivery plan improving unit 203, and the delivery plan transmitting unit 204 may be realized by electronic circuits, and the remaining functions may be realized by software. Also, some or all of the functions of the delivery request receiving unit 201, the delivery plan creating unit 202, the allocation difficulty calculating unit 230, the delivery plan improving unit 203, and the delivery plan transmitting unit 204 may be realized by firmware.
[0079] Each of the processor and the electronic circuit is also called a processing circuitry. In other words, the functions of the delivery request receiving unit 201, the delivery plan creating unit 202, the allocation difficulty calculating unit 230, the delivery plan improving unit 203, and the delivery plan transmitting unit 204 are realized by the processing circuitry.
[0080] Similarly to the delivery planning device 20, the functional elements of the delivery request management device 10 and the delivery plan confirmation terminal 30 may be realized by hardware.
[0081] ***Explanation of the Effects of the Present Embodiment*** In the delivery planning device according to the present embodiment, the difficulty of allocating a package to a delivery vehicle is calculated as the allocation difficulty based on the physical feature and the temporal feature of the package to be delivered. In addition, the ease of reducing a vehicle designated as a reduction target is evaluated using the package allocation difficulty. Then, in the plan improvement process, an improved plan is searched for to improve the ease of reducing. Therefore, according to the delivery planning device of this embodiment, by repeating the plan improvement process, the cargo of the vehicle designated as the reduction target is replaced with cargo with a lower allocation difficulty, i.e., cargo that is easier to allocate to other delivery vehicles. Therefore, the delivery plan can be improved in stages to a state where a reduction in the number of vehicles is easily realized. This makes it possible to create an economical delivery plan with a small number of vehicles in a short time.
[0082] In addition, in the delivery planning device of this embodiment, the sum of the difficulty levels of allocating cargo assigned to a vehicle that is designated as a reduction target is evaluated as the ease of reduction, and improvement plans can be repeatedly prepared to improve the ease of reduction.
[0083] Furthermore, according to the delivery planning device of this embodiment, the evaluation value (value of the evaluation function) is easily updated by the plan improvement process. This makes it easier to enjoy the benefits of a high-speed solution method that narrows down the solution space based on update information, such as the branch and bound method, and the optimization calculation performed in the plan improvement process can also be accelerated. Therefore, as described above, it is easier to obtain the effect of creating an economical delivery plan with a small number of vehicles in a short time. In addition, since a delivery plan with a small number of vehicles that is difficult to calculate can be calculated in a short time, there is an effect that an optimal solution can be easily obtained even when recalculating with a desired evaluation function that takes economics into consideration.
[0084] Embodiment 2 In this embodiment, differences from the first embodiment and additions to the first embodiment will be mainly described. In this embodiment, components having the same functions as those in the first embodiment are given the same reference numerals, and the description thereof will be omitted.
[0085] Even when the delivery planning device according to the first embodiment is used, there is a possibility that the improvement process of the delivery plan may stagnate. In this embodiment, a method for avoiding such a stagnation of the improvement process of the delivery plan will be described. The overall system configuration is the same as that of the first embodiment.
[0086] ***Configuration Description*** FIG. 16 is a diagram showing a detailed example of a functional configuration of the delivery planning device 20 according to the present embodiment. In this embodiment, the delivery plan improvement unit 203 includes, in addition to the configuration of the first embodiment, an improvement state determination unit 270 that determines the improvement state in the iterative improvement process. The other configurations are the same as those in the first embodiment.
[0087] *** Functionality Overview *** The improvement state determination unit 270 determines whether the improvement state of the delivery plan is stagnating or not. When it is determined that the improvement state of the delivery plan is stagnating, the delivery plan improvement unit 203 changes the allocation of packages so as to improve the ease of reduction in at least any vehicle other than the vehicle to be reduced. Specifically, when the optimization problem generator 250 determines that the improvement of the delivery plan is stagnating, it sets an evaluation function for improving the allocation situation, which enables the allocation of cargo between vehicles to be changed so that the difficulty of allocation is reduced, in order to improve the allocation situation.
[0088] If it is determined that the improvement state of the delivery plan is not stagnating, the delivery plan improvement unit 203 repeats the same improvement processing as in the first embodiment.
[0089] ***Explanation of Operation*** The overall operation of the delivery planning device 20 in this embodiment is similar to that in the first embodiment shown in the flow chart of FIG.
[0090] FIG. 17 is a flow diagram showing the operation of the allocation difficulty level calculation unit 230 and the delivery plan improvement unit 203 according to this embodiment. The detailed operation of the delivery plan improving unit 203 according to this embodiment will be described with reference to FIG. Fig. 17 corresponds to Fig. 14 in the first embodiment, and the processes in steps S205.5, S206a, and S206b are different from those in the first embodiment. The other steps are the same as those in the first embodiment.
[0091] The processes from step S201 to step S205 are the same as those in the first embodiment.
[0092] In step S205.5, the improvement state determination unit 270 of the delivery plan improvement unit 203 determines the improvement state. Specifically, the improvement state determination unit 270 determines whether the improvement state of the delivery plan is stagnant. Depending on the result of the determination, the process proceeds to the next step S206a or S206b.
[0093] In the iterative process from step S203 to step S209 in the flow diagram of FIG. 17, in the first case, the delivery plan improvement unit 203 selects step S206a.
[0094] In the iterative process from step S203 to step S209, if step S206a was selected in the previous process, the delivery plan improvement unit 203 performs the following process. The improvement state determination unit 270 of the delivery plan improvement unit 203 compares the evaluation value of the previous tentative plan with that of the previous tentative plan, and determines that the improvement state is stagnant if the evaluation value has not been updated a prescribed number of times or more. If it is determined that the improvement state is stagnant, the delivery plan improvement unit 203 selects step S206b. Otherwise, that is, if it is not determined that the improvement state is stagnant, the delivery plan improvement unit 203 selects step S206a.
[0095] On the other hand, in the iterative processing from step S203 to step S209, if step S206b was selected in the previous processing, the delivery plan improvement unit 203 performs the following processing. If step S206b has been performed a prescribed number of times or more in the iterative process, the delivery plan improvement unit 203 selects step S206a. Otherwise, that is, if step S206b has not been performed a prescribed number of times or more in the iterative process, the delivery plan improvement unit 203 selects step S206b. The prescribed number of times may be defined in the execution parameter definition information 47. The prescribed number of times may be set for each of step S206a and step S206b.
[0096] The process of step S206a is similar to that of step S206.
[0097] In step S206b, the optimization problem generator 250 of the delivery plan improvement unit 203 sets an evaluation function and constraint conditions for the optimization problem created in step S205. The evaluation function and constraint conditions set here are intended to improve the allocation situation, and minimize the sum of the allocation difficulty of packages allocated to any vehicle other than the vehicle to be reduced. Specifically, the following formula 3 is used.
number
[0098] Here, I represents the set of packages that are the subject of delivery requests, and U i is the difficulty of allocating luggage i ∈ I, x v,i is a variable that indicates whether or not package i∈I is assigned to delivery vehicle v. The target delivery vehicle may be the vehicle selected in step S204, or all vehicles may be specified if calculation is possible.
[0099] By configuring the evaluation function in this way and repeatedly performing the optimization process according to this flow, the luggage allocation state can be improved so that vehicles with a lower sum of the luggage allocation difficulty levels, i.e., vehicles with a large room for loading additional luggage, are generated. As a result, when the number of vehicles is reduced in step S206a, the possibility of moving luggage in the vehicles to be reduced is increased, and the reduction in the number of vehicles can be efficiently achieved.
[0100] ***Explanation of the Effects of the Present Embodiment*** As described above, according to the delivery planning device of the present embodiment, it is possible to apply an evaluation function that improves the allocation situation according to the progress of improvement of the delivery plan, thereby improving the situation. As a result, even if the situation becomes difficult to improve, an attempt is made to improve the situation, so it is possible to escape from the stagnant state early, and it is possible to find a delivery plan with a small number of vehicles early.
[0101] In the above first and second embodiments, each unit of the delivery planning device has been described as an independent functional block. However, the configuration of the delivery planning device does not have to be as in the above-mentioned embodiments. The functional blocks of the delivery planning device may have any configuration as long as they can realize the functions described in the above-mentioned embodiments. In addition, the delivery planning device may not be a single device, but may be a system composed of multiple devices. In addition, it is possible to combine multiple parts of the first and second embodiments. Alternatively, it is possible to implement only one part of these embodiments. In addition, it is possible to implement any combination of these embodiments, either as a whole or in part. That is, in the first and second embodiments, the respective embodiments can be freely combined, or any of the components in each embodiment can be modified, or any of the components in each embodiment can be omitted.
[0102] It should be noted that the above-described embodiment is essentially a preferred example, and is not intended to limit the scope of the present disclosure, the scope of application of the present disclosure, and the scope of use of the present disclosure. The above-described embodiment can be modified in various ways as necessary. [Explanation of symbols]
[0103] 10 Delivery request management device, 11 delivery request, 12 delivery plan, 121 provisional plan, 122 improved plan, 13 delivery plan information, 20 delivery plan device, 30 delivery plan confirmation terminal, 43 delivery vehicle information, 44 cost definition information, 45 driving distance definition information, 46 driving time definition information, 47 execution parameter definition information, 101 delivery request transmission unit, 102, 205, 303 memory unit, 201 delivery request reception unit, 202 delivery plan planning unit, 203 delivery plan improvement unit, 204 delivery plan transmission unit, 301 delivery plan reception unit, 302 delivery plan display unit, 230 allocation difficulty calculation unit, 240 vehicle selection unit, 250 optimization problem generation unit, 260 optimization problem solving unit, 270 improvement state determination unit, 300 network, 500 delivery plan system, 909 electronic circuit, 910 Processor, 921 memory, 922 auxiliary storage device, 930 input interface, 940 output interface, 950 communication device, i luggage, U i Difficulty of allocation, v is a vehicle, and v̂ is a vehicle to be reduced.
Claims
1. A delivery planning device that improves a delivery plan for delivering packages by a plurality of vehicles, an allocation difficulty calculation unit that calculates an allocation difficulty level representing a degree of difficulty of allocating the luggage to a vehicle based on a physical characteristic amount of the luggage and a temporal characteristic amount of the luggage; a delivery plan improvement unit that improves the delivery plan by selecting a vehicle to be reduced and a vehicle for which a luggage allocation is to be changed from the plurality of vehicles, setting a sum of the difficulty levels of allocation of luggage allocated to the vehicle to be reduced as reduction ease, and repeating an improvement process of changing the luggage allocation between the vehicle to be reduced and the vehicle for which a luggage allocation is to be changed so that the reduction ease is improved; A delivery planning device comprising:
2. The delivery plan improvement unit, a vehicle selection unit that selects, from the plurality of vehicles, a vehicle to be reduced and a vehicle to which a cargo allocation is to be changed; an optimization problem generation unit that fixes vehicle allocation conditions under which the luggage is allocated to each of the plurality of vehicles, other than the vehicle to be reduced and the vehicle for which the luggage allocation is to be changed, and generates an optimization problem in which the ease of reduction, which is the sum of the difficulty levels of allocation of luggage allocated to the vehicle to be reduced, is used as an evaluation function; an optimization problem solving unit that obtains, as an improved plan, the delivery plan in which the luggage allocation between the vehicle to be reduced and the vehicle whose luggage allocation is to be changed is changed so that the ease of reduction is improved by solving the optimization problem; The delivery planning device according to claim 1 .
3. The vehicle selection unit: When the improvement plan does not satisfy a preset end condition and the reduction of the vehicles to be reduced in the improvement plan has been achieved, a new vehicle to be reduced is selected; The delivery plan improvement unit, The delivery planning device according to claim 2 , wherein the vehicle to be eliminated is updated to a newly selected vehicle to be eliminated, the delivery plan is updated to the improved plan, and the improvement process is executed.
4. The vehicle selection unit: When the improvement plan does not satisfy a preset end condition and the reduction of the vehicles to be reduced is not achieved in the improvement plan, a new vehicle is selected to change the cargo allocation; The delivery plan improvement unit, 4. The delivery planning device according to claim 2, further comprising: updating the vehicle for which the luggage allocation is to be changed to a newly selected vehicle for which the luggage allocation is to be changed; updating the delivery plan to the improved plan; and executing the improvement process.
5. The vehicle selection unit:
5. The delivery planning device according to claim 2, wherein the vehicles to be reduced are selected in the order of a vehicle having a lower sum of the difficulty levels of allocation of the packages to which the vehicles are assigned.
6. The vehicle selection unit:
6. The delivery planning device according to claim 2, wherein the vehicle for which the cargo allocation is to be changed is selected from the vehicle having a lower sum of the allocation difficulty levels of the allocated cargo.
7. The delivery plan improvement unit, An improvement state determination unit that determines whether an improvement state of the delivery plan is stagnating, The delivery plan improvement unit, A delivery planning device as described in any one of claims 2 to 6, wherein when it is determined that the improvement state of the delivery plan is stagnating, the allocation of cargo is changed so as to improve the ease of reduction in at least any vehicle other than the vehicle to be reduced.
8. The optimization problem generator, 8. The delivery planning device according to claim 7, further comprising an evaluation function for improving an allocation situation, which enables the allocation of cargo between vehicles to be changed so that the degree of difficulty of allocation is reduced, in order to improve the allocation situation.
9. The delivery plan improvement unit, The delivery planning device according to claim 1 , wherein, when it is determined that the improvement state of the delivery plan is not stagnating, the improvement process is repeated.
10. The assignment difficulty calculation unit, The delivery planning device according to claim 1 , further comprising: a step of calculating the degree of difficulty of allocation based on a specification of a vehicle to which the cargo is to be allocated, in addition to the physical feature amount and the temporal feature amount.
11. The assignment difficulty calculation unit, 11. The delivery planning device according to claim 1, wherein the allocation difficulty level is calculated by using the volume and weight of the package as the physical feature amount and the delivery time period of the package as the temporal feature amount.
12. A delivery planning method for use in a delivery planning device that improves a delivery plan for delivering packages by a plurality of vehicles, comprising: calculating an allocation difficulty level representing a degree of difficulty in allocating the luggage to a vehicle based on the physical characteristic amount of the luggage and the temporal characteristic amount of the luggage; A delivery planning method that improves the delivery plan by selecting vehicles to be reduced and vehicles for which luggage allocations are to be changed from the multiple vehicles, defining the sum of the difficulty levels of allocation of luggage assigned to the vehicles to be reduced as the ease of reduction, and repeating an improvement process of changing the luggage allocations of the vehicles to be reduced and the vehicles for which luggage allocations are to be changed so as to improve the ease of reduction.
13. A delivery planning program for improving a delivery plan for delivering packages by a plurality of vehicles, comprising: an allocation difficulty calculation process for calculating an allocation difficulty level representing a degree of difficulty of allocating the luggage to a vehicle based on the physical characteristic amount of the luggage and the temporal characteristic amount of the luggage; a delivery plan improvement process for improving the delivery plan by selecting a vehicle to be reduced and a vehicle for which a luggage allocation is to be changed from the plurality of vehicles, setting a sum of the difficulty levels of allocation of luggage allocated to the vehicle to be reduced as reduction ease, and repeating an improvement process for changing the luggage allocation between the vehicle to be reduced and the vehicle for which a luggage allocation is to be changed so that the reduction ease is improved; A delivery planning program that causes a computer to execute the above.
Citation Information
Patent Citations
Vehicle operating plan preparing device
JP1999245819A
Delivery planning method and program for executing the same
JP2002302257A
Select method and select apparatus for customer candidate
JP2005263367A
System, apparatus, method and program for optimum vehicle assignment
JP2010168205A
