WO2023199755A1 - 配送計画生成装置、および配送計画生成方法 - Google Patents

配送計画生成装置、および配送計画生成方法 Download PDF

Info

Publication number
WO2023199755A1
WO2023199755A1 PCT/JP2023/013446 JP2023013446W WO2023199755A1 WO 2023199755 A1 WO2023199755 A1 WO 2023199755A1 JP 2023013446 W JP2023013446 W JP 2023013446W WO 2023199755 A1 WO2023199755 A1 WO 2023199755A1
Authority
WO
WIPO (PCT)
Prior art keywords
delivery
plan generation
leveling
generation device
charge
Prior art date
Legal status (The legal status is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the status listed.)
Ceased
Application number
PCT/JP2023/013446
Other languages
English (en)
French (fr)
Japanese (ja)
Inventor
晃一郎 山口
凌大 齋藤
Current Assignee (The listed assignees may be inaccurate. Google has not performed a legal analysis and makes no representation or warranty as to the accuracy of the list.)
Panasonic Intellectual Property Management Co Ltd
Original Assignee
Panasonic Intellectual Property Management Co Ltd
Priority date (The priority date is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the date listed.)
Filing date
Publication date
Application filed by Panasonic Intellectual Property Management Co Ltd filed Critical Panasonic Intellectual Property Management Co Ltd
Priority to EP23788175.0A priority Critical patent/EP4510053A4/en
Priority to US18/856,426 priority patent/US20250259136A1/en
Publication of WO2023199755A1 publication Critical patent/WO2023199755A1/ja
Anticipated expiration legal-status Critical
Ceased legal-status Critical Current

Links

Images

Classifications

    • G—PHYSICS
    • G06—COMPUTING OR CALCULATING; COUNTING
    • G06Q—INFORMATION AND COMMUNICATION TECHNOLOGY [ICT] SPECIALLY ADAPTED FOR ADMINISTRATIVE, COMMERCIAL, FINANCIAL, MANAGERIAL OR SUPERVISORY PURPOSES; SYSTEMS OR METHODS SPECIALLY ADAPTED FOR ADMINISTRATIVE, COMMERCIAL, FINANCIAL, MANAGERIAL OR SUPERVISORY PURPOSES, NOT OTHERWISE PROVIDED FOR
    • G06Q10/00—Administration; Management
    • G06Q10/04—Forecasting or optimisation specially adapted for administrative or management purposes, e.g. linear programming or "cutting stock problem"
    • G06Q10/047—Optimisation of routes or paths, e.g. travelling salesman problem
    • G—PHYSICS
    • G06—COMPUTING OR CALCULATING; COUNTING
    • G06Q—INFORMATION AND COMMUNICATION TECHNOLOGY [ICT] SPECIALLY ADAPTED FOR ADMINISTRATIVE, COMMERCIAL, FINANCIAL, MANAGERIAL OR SUPERVISORY PURPOSES; SYSTEMS OR METHODS SPECIALLY ADAPTED FOR ADMINISTRATIVE, COMMERCIAL, FINANCIAL, MANAGERIAL OR SUPERVISORY PURPOSES, NOT OTHERWISE PROVIDED FOR
    • G06Q10/00—Administration; Management
    • G06Q10/08—Logistics, e.g. warehousing, loading or distribution; Inventory or stock management
    • G06Q10/083—Shipping
    • G06Q10/08355—Routing methods
    • G—PHYSICS
    • G01—MEASURING; TESTING
    • G01C—MEASURING DISTANCES, LEVELS OR BEARINGS; SURVEYING; NAVIGATION; GYROSCOPIC INSTRUMENTS; PHOTOGRAMMETRY OR VIDEOGRAMMETRY
    • G01C21/00—Navigation; Navigational instruments not provided for in groups G01C1/00 - G01C19/00
    • G01C21/26—Navigation; Navigational instruments not provided for in groups G01C1/00 - G01C19/00 specially adapted for navigation in a road network
    • G01C21/34—Route searching; Route guidance
    • G01C21/3407—Route searching; Route guidance specially adapted for specific applications
    • G01C21/343—Calculating itineraries
    • G—PHYSICS
    • G06—COMPUTING OR CALCULATING; COUNTING
    • G06Q—INFORMATION AND COMMUNICATION TECHNOLOGY [ICT] SPECIALLY ADAPTED FOR ADMINISTRATIVE, COMMERCIAL, FINANCIAL, MANAGERIAL OR SUPERVISORY PURPOSES; SYSTEMS OR METHODS SPECIALLY ADAPTED FOR ADMINISTRATIVE, COMMERCIAL, FINANCIAL, MANAGERIAL OR SUPERVISORY PURPOSES, NOT OTHERWISE PROVIDED FOR
    • G06Q10/00—Administration; Management
    • G06Q10/06—Resources, workflows, human or project management; Enterprise or organisation planning; Enterprise or organisation modelling
    • G06Q10/063—Operations research, analysis or management
    • G06Q10/0631—Resource planning, allocation, distributing or scheduling for enterprises or organisations
    • G06Q10/06311—Scheduling, planning or task assignment for a person or group
    • G—PHYSICS
    • G06—COMPUTING OR CALCULATING; COUNTING
    • G06Q—INFORMATION AND COMMUNICATION TECHNOLOGY [ICT] SPECIALLY ADAPTED FOR ADMINISTRATIVE, COMMERCIAL, FINANCIAL, MANAGERIAL OR SUPERVISORY PURPOSES; SYSTEMS OR METHODS SPECIALLY ADAPTED FOR ADMINISTRATIVE, COMMERCIAL, FINANCIAL, MANAGERIAL OR SUPERVISORY PURPOSES, NOT OTHERWISE PROVIDED FOR
    • G06Q10/00—Administration; Management
    • G06Q10/08—Logistics, e.g. warehousing, loading or distribution; Inventory or stock management
    • G—PHYSICS
    • G06—COMPUTING OR CALCULATING; COUNTING
    • G06Q—INFORMATION AND COMMUNICATION TECHNOLOGY [ICT] SPECIALLY ADAPTED FOR ADMINISTRATIVE, COMMERCIAL, FINANCIAL, MANAGERIAL OR SUPERVISORY PURPOSES; SYSTEMS OR METHODS SPECIALLY ADAPTED FOR ADMINISTRATIVE, COMMERCIAL, FINANCIAL, MANAGERIAL OR SUPERVISORY PURPOSES, NOT OTHERWISE PROVIDED FOR
    • G06Q10/00—Administration; Management
    • G06Q10/08—Logistics, e.g. warehousing, loading or distribution; Inventory or stock management
    • G06Q10/083—Shipping

Definitions

  • the present disclosure relates to a delivery plan generation device and a delivery plan generation method that support delivery of multiple packages to be delivered.
  • Patent Document 1 discloses a method of generating an optimal delivery route by dividing a delivery range into meshes using a mesh method and connecting the meshes with a single stroke using a shortest distance condition.
  • An object of the present invention is to provide a delivery plan generation device and a delivery plan generation method that generate a delivery plan that suppresses the above.
  • the present disclosure is a delivery plan generation device that divides a delivery range into predetermined unit areas and generates delivery routes for each of a plurality of persons to whom delivery destinations of goods are assigned, the device including one or more delivery destinations.
  • a delivery plan generating device is provided, which includes a providing unit that provides a setting screen that allows a user to input setting items used when generating each delivery route.
  • the present disclosure also provides a delivery plan generation method that divides a delivery range into predetermined unit areas and generates delivery routes for each of a plurality of personnel to whom delivery destinations of goods are assigned, in which a processor and a memory cooperate. process to generate a delivery route for each of the plurality of persons in charge specified by connecting unit areas including one or more delivery destinations, and to equalize the deliveries included in each of the delivery routes of the plurality of persons in charge.
  • the present invention provides a delivery plan generation method that provides a setting screen that allows a user to input setting items to be used when generating delivery routes for each of the plurality of persons in charge by repeatedly performing the above steps.
  • a block diagram showing an example of a system configuration according to Embodiment 1 of the present invention Conceptual diagram for explaining the mesh according to Embodiment 1 of the present invention
  • Conceptual diagram for explaining aggregation of delivery plans according to Embodiment 1 of the present invention An explanatory diagram for explaining the delivery planning method according to Embodiment 1 of the present invention
  • An explanatory diagram for explaining the delivery planning method according to Embodiment 1 of the present invention An explanatory diagram for explaining the delivery planning method according to Embodiment 1 of the present invention
  • Flowchart of delivery plan generation processing according to Embodiment 1 of the present invention Flowchart of delivery plan calculation processing according to Embodiment 1 of the present invention
  • a diagram showing an example of the configuration of a UI screen of the delivery plan generation device according to Embodiment 1 of the present invention A diagram showing an example of the configuration of a UI screen of the delivery plan generation device according to Embodiment 1 of the present invention.
  • a diagram showing an example of the configuration of a UI screen of the delivery plan generation device according to Embodiment 1 of the present invention A diagram showing an example of the configuration of a UI screen of the delivery plan generation device according to Embodiment 1 of the present invention.
  • a diagram showing an example of the configuration of a UI screen of the delivery plan generation device according to Embodiment 1 of the present invention A diagram showing an example of the configuration of a UI screen of the delivery plan generation device according to Embodiment 1 of the present invention.
  • Patent Document 1 reduces delivery costs and improves delivery efficiency by automatically determining delivery routes and determining the type and number of delivery vehicles required for a unit area using a mesh method. It has been realized. However, uneven workloads occur among multiple delivery personnel, and no consideration is given to leveling out the workloads. In actual sites, the delivery of a huge amount of goods is shared among multiple delivery personnel (drivers), and it is not possible to determine the delivery route for each driver and the delivery schedule for each driver. It was not possible to level out the quantities. In particular, the number of delivery destinations included in a mesh unit area varies depending on the situation, which reduces the accuracy of leveling. Further, Patent Document 1 does not take into consideration the convenience of UI screens and the like that each delivery person can use when actually making a delivery.
  • Patent Document 1 is unable to realize work sharing that reflects past work results.
  • a delivery plan that can generate a delivery plan that equalizes the work of delivery personnel and suppresses the overall execution time of delivery while suppressing the imbalance in the workload of delivery personnel.
  • a delivery plan is a delivery plan that uses at least one delivery vehicle (for example, a truck) to deliver from a base to multiple delivery destinations within a predetermined period (for example, one day).
  • This is a delivery route plan for delivering cargo (goods) to.
  • the delivery route corresponds to the running order of multiple delivery destinations.
  • Delivery plan generation device 100 is communicably connected to one or more client terminals 200 via network 300 .
  • the delivery plan generation device 100 may be configured as an on-premise server device at a delivery company's base, or may be configured as a cloud type on a network.
  • the delivery plan generation device 100 is configured to include a processing section 110, a storage section 120, a UI (User Interface) section 130, and a communication section 140.
  • the processing unit 110 includes, for example, a CPU (Central Processing Unit), a GPU (Graphical Processing Unit), an MPU (Micro Processing Unit), and a DSP (Digital Processing Unit). It is configured using a Signal Processor) or an FPGA (Field-Programmable Gate Array).
  • the processor may be
  • the processing unit 110 realizes various functions described below by, for example, referring to various databases (hereinafter referred to as DB) stored in the storage unit 120 or reading programs.
  • the storage unit 120 is a storage unit for storing various data and programs, and includes volatile/nonvolatile storage such as RAM (Random Access Memory), ROM (Read Only Memory), and HDD (Hard Disk Drive). It may consist of a storage device.
  • the UI unit 130 is a unit for accepting operations by the user of the delivery plan generation device 100 and outputting various information.
  • the UI unit 130 may include a display, a mouse, a keyboard, and the like.
  • the communication unit 140 is an interface for communicating with an external device via the network 300.
  • the communication standards that can be supported by the communication unit 140 are not particularly limited, and may be wired or wireless. Further, it may be possible to support multiple communication standards.
  • the client terminal 200 is a terminal device that can be used by a delivery person during delivery work, and may be, for example, a mobile terminal such as a smartphone, a tablet terminal, or a POS terminal. Further, the client terminal 200 may be installed in a delivery vehicle (hereinafter also simply referred to as a "vehicle") used for delivery.
  • the client terminal 200 includes a processing section 201, a storage section 202, a communication section 203, a UI section 204, and a sensor section 205.
  • the processing unit 201 may be configured using, for example, a CPU, GPU, MPU, DSP, or FPGA.
  • the processing unit 201 realizes various functions described below by, for example, referring to various data stored in the storage unit 202 and reading programs.
  • the storage unit 202 is a storage unit for storing various data and programs, and is configured from a volatile/nonvolatile storage device such as RAM, ROM, HDD, flash memory, or SSD (Solid State Drive). It's okay to be.
  • the communication unit 203 is an interface for wirelessly communicating with an external device via the network 300.
  • the communication standards compatible with the communication unit 203 are not particularly limited.
  • the sensor unit 205 is composed of one or more sensors for detecting status information of the client terminal 200, and includes, for example, a position sensor based on a GNSS (Global Navigation Satellite System) represented by a GPS (Global Positioning System), and a magnetic sensor. , an acceleration sensor, a camera as a photographing device, and the like.
  • GNSS Global Navigation Satellite System
  • GPS Global Positioning System
  • the processing unit 110 of the delivery plan generation device 100 includes a road cost calculation unit 111, a delivery cost generation unit 112, a delivery plan calculation unit 113, a screen generation unit 114, a DB management unit 115, and a data linkage unit 116.
  • a road cost calculation unit 111 a delivery cost generation unit 112
  • a delivery plan calculation unit 113 a delivery plan calculation unit 113
  • a screen generation unit 114 a DB management unit 115
  • a data linkage unit 116 a data linkage unit 116.
  • the road cost calculation unit 111 calculates the cost of a road used as a delivery route.
  • the delivery cost generation unit 112 calculates the delivery cost based on the road cost, the size of the package to be delivered, and the like.
  • the delivery plan calculation unit 113 calculates a delivery plan for the package based on the delivery cost and road cost.
  • the screen generation unit 114 generates various UI screens to be provided to the delivery plan generation device 100 and the client terminal 200.
  • the DB management unit 115 updates and manages various DBs configured in the storage unit 120.
  • the data cooperation unit 116 acquires various information necessary for the delivery plan from an external device (client terminal 200 and other external devices) and provides it.
  • the storage unit 120 of the delivery plan generation device 100 includes a road information DB 121, a delivery information DB 122, and a person in charge information DB 123.
  • the configuration of the DB is an example, and one DB may be divided into more detailed sections, or a plurality of DBs may be configured together.
  • the road information DB 121 is a database for managing road information and map information of the delivery area. Road information and map information may be updated, for example, by accessing an external map server (not shown) and acquiring the latest information. In addition to the shape of the road, the road information may also include information on traffic congestion, passability, past driving history, and the like. Based on this information, the cost of each road is defined.
  • the delivery information DB 122 is a database for managing delivery information of packages to be delivered. The delivery information may include the delivery destination, delivery source, delivery base, delivery date and time, and the like.
  • the person in charge information DB 123 is a database for managing information on persons in charge of delivery. The person in charge information may include assigned deliveries, the person's delivery history, work schedule, current position during delivery, delivery skills of the person in charge, and the like.
  • the delivery plan generation device 100 may be accessed using a web browser (not shown) included in the client terminal 200, or a web browser installed on the client terminal 200 may be used. It may also be used by activating an application corresponding to the delivery plan generation device 100.
  • the division of functions between the delivery plan generation device 100 and the client terminal 200 is not limited to the configuration shown in FIG. There may be.
  • FIG. 2 is a diagram for explaining aggregation using a mesh according to this embodiment.
  • the mesh 210 in FIG. 2(a) shows the state before aggregation
  • the mesh in FIG. 2(b) shows the state after aggregation.
  • 6 ⁇ 6 mesh 36 unit areas in total
  • the vertical and horizontal sizes of one unit area of the mesh are not particularly limited, and any rectangular value may be set.
  • one circle indicates one delivery destination.
  • the unit area 211 includes three delivery destinations.
  • the unit area 212 includes two delivery destinations.
  • the delivery destinations are grouped (aggregated) for each unit area.
  • the unit area 211 in FIG. 2(a) becomes the unit area 221 in FIG. 2(b) by aggregating three delivery destinations.
  • aggregated delivery destinations are indicated by squares.
  • the unit area 212 in FIG. 2(a) becomes the unit area 222 in FIG. 2(b) by aggregating two delivery destinations. This makes it possible to simplify the handling during route generation and reduce the processing load.
  • FIG. 3 is a diagram showing an example of mesh and route generation according to this embodiment. Similar to FIG. 2, an example of a 6 ⁇ 6 mesh set on a map is shown.
  • FIG. 3(a) shows the state before aggregation. The position indicated by the black triangle in FIG. 3 indicates the delivery base (hereinafter also simply referred to as "base") of the package.
  • base the delivery base
  • multiple delivery destinations are indicated by circles around it.
  • the classification is performed using three types of circles (solid line, thick line, and broken line), and an example is shown in which there are 6 solid line circles, 5 thick line circles, and 5 broken line circles. These three types of circles indicate the division status (assignment) of each of the three delivery personnel.
  • FIG. 3(b) shows an example in which the mesh in FIG. 3(a) is adjusted in a 2 ⁇ 2 unit area. In this case, it becomes a 3 ⁇ 3 mesh.
  • FIG. 3(b) the number of delivery destinations belonging to each 2 ⁇ 2 unit area is shown.
  • FIG. 3(c) shows a state where delivery destinations are aggregated in a 2 ⁇ 2 unit area from the state of FIG. 3(b).
  • the aggregated state is shown by a white triangle.
  • the position on the map when aggregated here may be the center position of each delivery destination or the center position of a unit area.
  • arrows indicate delivery routes from the delivery base to the consolidated locations. Here, the return route from the final delivery destination to the delivery base is omitted.
  • Fig. 3(d) shows the state of Fig. 3(a), in which delivery destinations are aggregated in a 1 x 1 unit area in a 6 x 6 mesh, and further, starting from the delivery base, the aggregated locations are The delivery route is indicated by an arrow. Here, the return route from the final delivery destination to the delivery base is omitted.
  • a more appropriate delivery plan is determined by deriving an initial solution of the delivery plan and then applying three types of improvement methods and delivery cost optimization to the initial solution. Optimization of delivery costs includes, for example, reducing delivery costs by changing the travel route between two delivery destinations. More specifically, since the cost (road cost) differs depending on the road, the delivery cost differs depending on which road the vehicle travels when traveling from one delivery destination to another. Which road to drive on may be determined, for example, by performing machine learning based on the driving history of an experienced driver, or may be determined by the well-known Dijkstra method based on a preset road cost. Good too.
  • Replacement is a process of changing the order of delivery destinations.
  • Exchange is a process of exchanging delivery destinations between multiple delivery routes.
  • Transfer is a process of moving the delivery destination to another delivery route. Specific examples of substitution, exchange, and transfer will be described below based on the explanatory diagram of FIG. 4. Note that when there are two routes from each delivery destination, the route with higher cost is represented by a dotted line, and the route with lower cost is represented by a solid line.
  • a delivery plan is set in which delivery is performed by one delivery vehicle in the order of base S ⁇ delivery destination D1 ⁇ delivery destination D2 ⁇ delivery destination D3 ⁇ delivery destination D4.
  • the delivery cost in other words, distance
  • a delivery plan is set in which deliveries are performed in the order of base S ⁇ delivery destination D1 ⁇ delivery destination D3 ⁇ delivery destination D2 ⁇ delivery destination D4 using one delivery vehicle.
  • a delivery plan is set in which delivery is performed by one delivery vehicle in the order of base S ⁇ delivery destination D1 ⁇ delivery destination D2 ⁇ delivery destination D3 ⁇ delivery destination D4.
  • a delivery plan is set in which deliveries are performed in the order of base S ⁇ delivery destination D1 ⁇ delivery destination D3 ⁇ delivery destination D2 ⁇ delivery destination D4 using one delivery vehicle.
  • a delivery plan is set for the first delivery vehicle in which deliveries are made in the order of base S ⁇ delivery destination D1 ⁇ delivery destination D2 ⁇ delivery destination D3 ⁇ delivery destination D4. Furthermore, a delivery plan is set for the second delivery vehicle in which deliveries are made in the order of base S ⁇ delivery destination D5 ⁇ delivery destination D6 ⁇ delivery destination D7 ⁇ delivery destination D8.
  • a delivery plan is set for the first delivery vehicle in which deliveries are made in the order of base S ⁇ delivery destination D1 ⁇ delivery destination D6 ⁇ delivery destination D3 ⁇ delivery destination D4. Furthermore, a delivery plan is set for the second delivery vehicle in which deliveries are made in the order of base S ⁇ delivery destination D5 ⁇ delivery destination D2 ⁇ delivery destination D7 ⁇ delivery destination D8.
  • a delivery plan is set for the first delivery vehicle in which deliveries are made in the order of base S ⁇ delivery destination D1 ⁇ delivery destination D2 ⁇ delivery destination D3 ⁇ delivery destination D4. Furthermore, a delivery plan is set for the second delivery vehicle in which deliveries are made in the order of base S ⁇ delivery destination D5 ⁇ delivery destination D6 ⁇ delivery destination D7 ⁇ delivery destination D8.
  • a delivery plan is set for the first delivery vehicle in which deliveries are made in the order of base S ⁇ delivery destination D1 ⁇ delivery destination D6 ⁇ delivery destination D3 ⁇ delivery destination D4. Furthermore, a delivery plan is set for the second delivery vehicle in which deliveries are made in the order of base S ⁇ delivery destination D5 ⁇ delivery destination D2 ⁇ delivery destination D7 ⁇ delivery destination D8.
  • a delivery plan is set for the first delivery vehicle in which deliveries are made in the order of base S ⁇ delivery destination D1 ⁇ delivery destination D2 ⁇ delivery destination D3 ⁇ delivery destination D4. Furthermore, a delivery plan is set for the second delivery vehicle in which deliveries are made in the order of base S ⁇ delivery destination D5 ⁇ delivery destination D6 ⁇ delivery destination D7 ⁇ delivery destination D8.
  • a delivery plan is set for the first delivery vehicle in which deliveries are made in the order of base S ⁇ delivery destination D1 ⁇ delivery destination D3 ⁇ delivery destination D4. Furthermore, a delivery plan is set for the second delivery vehicle in which deliveries are made in the order of base S ⁇ delivery destination D5 ⁇ delivery destination D6 ⁇ delivery destination D2 ⁇ delivery destination D7 ⁇ delivery destination D8.
  • a delivery plan is set for the first delivery vehicle in which deliveries are made in the order of base S ⁇ delivery destination D1 ⁇ delivery destination D2 ⁇ delivery destination D3 ⁇ delivery destination D4. Furthermore, a delivery plan is set for the second delivery vehicle in which deliveries are made in the order of base S ⁇ delivery destination D5 ⁇ delivery destination D6 ⁇ delivery destination D7 ⁇ delivery destination D8.
  • a delivery plan is set for the first delivery vehicle in which deliveries are made in the order of base S -> delivery destination D1 -> delivery destination D3 -> delivery destination D4. Furthermore, a delivery plan is set for the second delivery vehicle in which deliveries are made in the order of base S ⁇ delivery destination D5 ⁇ delivery destination D6 ⁇ delivery destination D2 ⁇ delivery destination D7 ⁇ delivery destination D8.
  • FIG. 5 is a conceptual diagram for explaining the flow of mesh improvement (here, transfer) using a conventional method. The description will be made assuming that the processing proceeds sequentially from the left in FIG.
  • Vehicle A is assigned a delivery destination with a mesh number of 3 ("1" to "3")
  • vehicle B is assigned a delivery destination with a mesh number of 5 ("1" to "3”).
  • "4" to "8" are assigned.
  • each delivery destination is shown as being aggregated in a unit area of the mesh. Further, the arrows indicate the order of delivery.
  • FIG. 6 is a conceptual diagram for explaining the flow of mesh transfer using the method according to the present embodiment.
  • Delivery vehicle A is assigned a delivery destination with a mesh number of 3 ("1" to “3")
  • vehicle B is assigned a delivery destination with a mesh number of 5.
  • the destination (“4” to “8”) is assigned.
  • each delivery destination is shown as being aggregated in a unit area of the mesh. Further, the arrows indicate the order of delivery.
  • the number of delivery destinations before aggregation is shown. Therefore, in reality, vehicle A is assigned three delivery destinations, and vehicle B is assigned seven delivery destinations.
  • delivery destination "7" and delivery destination “8" are transferred from vehicle B to vehicle A.
  • the delivery order is set so that delivery destination "3" is followed by delivery destination "7” and then delivery destination "8".
  • vehicle A is assigned a mesh number of 5 delivery destinations
  • vehicle B is assigned a mesh number of 3 delivery destinations, and it may seem that leveling is not being performed.
  • the actual number of deliveries (total number of delivery destinations) in this example is equalized, with vehicles A and B both having 5 delivery destinations.
  • FIG. 7 is a flowchart of the delivery plan generation process executed by the delivery plan generation device 100 according to the present embodiment. This processing flow may be realized by the processing unit 110 of the delivery plan generation device 100 reading and executing programs and data stored in the storage unit 120. Here, in order to simplify the explanation, the processing entity of each process will be collectively described as the delivery plan generation device 100.
  • the delivery plan generation device 100 receives and inputs information regarding the delivery range (step S701).
  • the information regarding the delivery range may specify a region on a map or the area in charge, or may specify a list of delivery destinations. Furthermore, information regarding the delivery range may be received from the client terminal 200 or may be input via the UI unit 130.
  • the delivery plan generation device 100 refers to road information from the road information DB 121 based on the information input in step S701 (step S702).
  • the road information DB 121 is updated from time to time, and the latest road information may be referred to.
  • the delivery plan generation device 100 calculates road costs corresponding to the road information referenced in step S702 and a plurality of roads included in the delivery range input in step S701 (step S703).
  • the road cost may be defined in advance, or may be changed depending on conditions such as traffic congestion and construction. Furthermore, the road cost may be set depending on the shape and characteristics of the road, traffic regulations, and the like.
  • the delivery plan generation device 100 Based on the road information referenced in step S702, the delivery plan generation device 100 sequentially identifies nodes of two delivery destinations (including bases) for which delivery routes are to be determined (step S704).
  • the delivery plan generation device 100 uses a predetermined algorithm to determine a delivery route having the two delivery destination nodes identified in sequence, and calculates the delivery cost corresponding to the determined delivery route (step S705).
  • the well-known Dijkstra method may be used as an algorithm for determining the delivery route.
  • the delivery route is determined in such a manner that it is drawn in one stroke for each unit area assigned to each of a plurality of persons in charge, as shown in FIGS. 3(c) and 3(d).
  • the delivery plan generation device 100 calculates a delivery plan based on the delivery cost determined in step S705 (step S706). Details of this step will be described later using FIG. 8. Then, this processing flow ends.
  • FIG. 8 is a flowchart of the delivery plan calculation process according to this embodiment. This processing flow corresponds to step S706 in FIG.
  • the delivery plan generation device 100 determines an initial solution of the delivery plan using the delivery cost determined in step S705 of FIG. 7 (step S801).
  • the initial solution of the delivery plan is a delivery plan that includes the delivery route and delivery cost determined in step S705.
  • the initial solution may be a delivery plan manually formulated by the user of the delivery plan generation device 100 or the client terminal 200 based on the delivery route and delivery cost determined in step S705 described above.
  • the delivery plan generation device 100 sequentially performs the above-mentioned improvement method for all combinations of delivery destinations based on the delivery plan that is the current solution (step S802).
  • the current solution is the initial solution determined in step S801 or the improved solution obtained in the subsequent step S804.
  • the delivery plan generation device 100 calculates the actual number of deliveries in the mesh to be delivered (that is, the number of deliveries before aggregation) for each improvement candidate vehicle (step S803).
  • the delivery plan generation device 100 determines whether the leveling condition is satisfied for the number of deliveries calculated in step S803 (step S804).
  • the leveling condition is set in advance, and may be set, for example, such that the difference in the number of deliveries of each vehicle is within a predetermined value (for example, "1"). An example of setting the leveling conditions will be described later. If the leveling condition is satisfied (step S804; YES), the process of the delivery plan generation device 100 proceeds to step S805. On the other hand, if the leveling condition is not satisfied (step S804; NO), the process of the delivery plan generation device 100 returns to step S802 and repeats the process.
  • the delivery plan generation device 100 determines whether the delivery plan could be improved as a result of applying the three types of improvement methods to all combinations of delivery destinations in step S802 (step S805). The determination here is made based on whether the delivery cost could be reduced as described above. If the improvement has been achieved (step S805; YES), the process of the delivery plan generation device 100 proceeds to step S806. On the other hand, if the improvement has not been achieved (step S805; NO), the process of the delivery plan generation device 100 proceeds to step S807.
  • the delivery plan generation device 100 sets the improved solution as the current solution (step S806). Then, the process of the delivery plan generation device 100 returns to step S802 and repeats the process.
  • the delivery plan generation device 100 outputs the current solution as the final delivery plan (step S807).
  • the output here may be performed by generating a delivery plan screen and outputting it on the UI unit 130 of the delivery plan generation device 100, or by notifying the client terminal 200. Then, this processing flow ends.
  • Each UI screen is generated, for example, by the screen generation unit 114 of the delivery plan generation device 100, and displayed and provided by the UI unit 130 of the delivery plan generation device 100 or the UI unit 204 of the client terminal 200.
  • FIG. 9 shows a configuration example of a settings screen 900 used when making a delivery plan.
  • the setting screen 900 is displayed, for example, in step S701 of FIG.
  • the input form 901 is an item for specifying delivery destination data.
  • the input form 901 may be configured to accept a list of delivery destination data that can be input, or may be accepted by specifying a predetermined storage location.
  • the delivery destination data is, for example, list data including delivery destination information, package information, etc., and corresponds to the information regarding the delivery range in step S701.
  • the delivery person setting button 902 is a button for making settings regarding each delivery person. When the delivery person setting button 902 is pressed, the screen changes to a setting screen 1100 shown in FIG. 11.
  • the default setting button 903 is a button for setting default values of various parameters used when making a delivery plan. When the default setting button 903 is pressed, the screen changes to a setting screen 1000 shown in FIG. 10.
  • FIG. 10 shows a configuration example of a settings screen 1000 for setting various parameters used when making a delivery plan.
  • the input form 1001 is an item for setting the maximum calculation time based on the current time.
  • a delivery plan is generated with the maximum time specified in the input form 1001. Normally, it takes a certain amount of processing time to generate a delivery plan, so set an upper limit here. If the upper limit is exceeded, the delivery plan generation process will be aborted and the processing at that point will be stopped. Let the solution be the delivery plan.
  • the input form 1002 is an item for setting the maximum mesh width of a unit area (ie, unit area) in a mesh. In this embodiment, a rectangular unit area with the same size in both length and width is used.
  • Input forms 1001 and 1002 may be configured to allow text input, for example.
  • the input form 1003 is an item for specifying parameters to be leveled.
  • the "number of deliveries” was used as an example of the leveling target.
  • the target of leveling is not limited to this.
  • “number of deliveries”, “number of deliveries (unit area)”, “delivery distance”, “delivery time”, etc. may be used as the leveling target.
  • “delivery distance”, “delivery time”, etc. may be used in combination with “number of deliveries” or “number of deliveries (unit area)”. Therefore, the input form 1003 may be configured to display these as a list and accept them.
  • Number of deliveries refers to the case where the number of deliveries before aggregation is the target of leveling
  • “Number of deliveries (unit area)” refers to the case where the number of deliveries after aggregation is the target of leveling. Point.
  • the input form 1004 is an item for specifying the allowable value of the difference (shift) of each allocation when leveling is performed, and the selectable values are switched according to the settings specified in the input form 1003. It will be done. For example, if “number of deliveries” or “number of deliveries (unit area)" is specified in the input form 1003, the input form 1004 displays a list of "5 items,” “10 items,” “15 items,” etc. It may be configured so that it can be accepted. Similarly, when “delivery distance” is specified in the input form 1003, the input form 1004 may be configured to display a list of "5 km,” “10 km,” “15 km,” etc., and accept the request.
  • the input form 1004 may be configured to display a list of "5 minutes,” “10 minutes,” “15 minutes,” etc., so that it can be accepted. .
  • the allowable value may be configured to be settable as a ratio (such as “5%”, “10%”, “15%”, etc.).
  • the allowable value may be the difference between the delivery person with the maximum allocation and the delivery person with the smallest allocation.
  • the enter button 1005 is a button for confirming each setting value input on the setting screen 1000 as a default setting.
  • a cancel button 1006 is a button for canceling each setting value input on the setting screen 1000. When the enter button 1005 and the cancel button 1006 are pressed, the screen may be configured to transition to the setting screen 900.
  • FIG. 11 shows a configuration example of a setting screen 1100 for performing leveling.
  • the input form 1101 is an item for specifying the delivery start time in the delivery plan.
  • Input form 1102 specifies the execution time for creating the delivery plan. Similar to the input form 1001 in FIG. 10, the delivery plan generation process is executed using the time specified here as the maximum processing time.
  • the input form 1103 is an item that displays the number of people to be delivered, that is, the number of people to whom leveling is to be performed.
  • the delivery person list 1104 displays information regarding delivery persons in a list format, and is configured so that input can be made for each item.
  • the item "No.” indicates identification information for uniquely identifying the person in charge of delivery.
  • the item "person in charge” indicates the name of the person in charge of delivery.
  • the item “Delivery Skill” indicates the delivery skill of the delivery person, and here it is set that the larger the value is, the more skilled the delivery person is. Furthermore, the item “Delivery Skill” may be configured to be switchable between display and non-display.
  • the item “Shift” indicates the time period in which each delivery person works. Although shown here in units of one hour, it may be configured so that it can be displayed in larger or smaller periods. Furthermore, the item “shift” may be configured to display additional time periods by switching the display range using a slide bar or the like.
  • the item “Delivery” is an item for specifying the person in charge of delivery who is to be leveled, and is checked if selected. The number of delivery personnel selected here is displayed on an input form 1103.
  • the item “delivery ratio” is an item for specifying the delivery ratio to be assigned to each of the selected delivery persons. The total delivery ratio is 100 (%).
  • the setting item 1105 is an item for displaying the delivery forecast period as the leveling result.
  • “delivery”, “today”, “this week”, “this month”, and any period can be set.
  • the "number of deliveries”, “working hours”, and “delivery distance” for each delivery person this month are displayed in a graph as a result of the leveling. Displayed at 1107, 1108, and 1109. If the period includes the past, a portion of it will be aggregated as actual results.
  • leveling processing and graph 1107 are performed only for the delivery destination data specified in the input form 901 of the setting screen 900. , 1108, and 1109 are displayed. In this case, only the delivery persons selected in the delivery persons list 1104, that is, those who are the targets of leveling, may be displayed in the graph.
  • FIG. 12 shows an example of the configuration of data related to delivery by each delivery person.
  • the data here includes the items “ID”, “delivery start time”, “delivery end time”, “person in charge”, “delivery time”, “distance”, and “number of items”.
  • This data may be historical data if the item has been delivered, or may be configured as scheduled data if the item has not been delivered. When “today”, “this week”, “this month”, or any period is selected in the setting item 1105, it is used when tabulating the graph as the result.
  • This data may be updated at appropriate times, such as when a delivery destination is assigned or when delivery is completed, and may be managed in the delivery information DB 122, the person in charge information DB 123, or the like.
  • the structure of the history data is an example, and is not limited to this. For example, other items may be included as long as the data is necessary for generating a graph.
  • FIG. 13 shows a configuration example of a UI screen showing the result of the leveling process according to this embodiment when "Delivery" is selected in the setting item 1105 and the leveling button 1106 is pressed.
  • FIG. 13A shows an example of a UI screen 1300 that is displayed when the leveling is successfully performed as a result of the leveling process.
  • FIG. 13(b) shows an example of a UI screen 1310 that is displayed when leveling is not performed normally as a result of the leveling process.
  • Leveling target Number of cases (actual number of deliveries) Delivery person: 2 people (Delivery person A, Delivery person B) Maximum calculation time: 30 minutes Mesh width: 100m Error: 2 items
  • the error in the number of cases leveled and assigned to each delivery person is 1 case, which is less than 2 cases, which is the parameter for leveling. There is. Therefore, the leveling is displayed as having been performed normally.
  • a decision button 1302 is a button that is pressed when the current leveling result is adopted.
  • a recalculation button 1303 is a button that is pressed to perform the leveling process again.
  • the error in the number of cases leveled and assigned to each delivery person is 4 cases, which is the parameter for leveling 2 or more cases. It has become. Therefore, the leveling is displayed as not being performed normally. Furthermore, the calculation time is 30 minutes, which is the same value as the leveling parameter of 30 minutes, indicating that the leveling process was aborted midway.
  • a decision button 1312 is a button that is pressed when the current leveling result is adopted.
  • the recalculation button 1313 is a button that is pressed to perform the leveling process again.
  • UI screen 1400 for displaying the results of the leveling process, and are, for example, screens displayed on the UI unit 130 of the delivery plan generation device 100 operated by the administrator. .
  • the OK button is pressed on any of the UI screens in FIG. 13, the screen may transition to the UI screen 1400.
  • FIG. 14 shows a display example (normal mode) in which delivery destinations are individually shown in a mesh unit area.
  • a broken line 1402 indicating the unit area of the set mesh is superimposed on a map 1401.
  • Assignment information 1403 indicates the result of the leveling process for each delivery person (in this example, two delivery persons A and B).
  • the confirm button 1404 is a button that is pressed when confirming the leveling result and notifying each delivery person.
  • a recalculation button 1405 is a button that is pressed to perform the leveling process again.
  • the mode switching button 1406 is a button for switching to the display example (mesh mode) shown in FIG. 15.
  • an icon 1407 indicates the location of the delivery person.
  • the position of the icon 1407 may also change as the delivery person (more specifically, the client terminal 200) moves.
  • Icon 1408 indicates the location of the delivery destination and is displayed with hatching. For example, by operating the icon 1408, corresponding more detailed delivery information (eg, delivery address, etc.) may be displayed. The numbers within the icon 1408 indicate the order of delivery.
  • Icon 1409 like icon 1408, indicates the location of the delivery destination, and since it is assigned to a different delivery person here, it has a display format different from hatching (in this example, it is outlined).
  • FIG. 15 shows a display example (mesh mode) in which the mesh is aggregated for each unit area. Totalizes and shows the delivery destinations belonging to each unit area.
  • a solid line 1502 indicating the set mesh is shown superimposed on a map 1501.
  • Assignment information 1503 indicates the results of the leveling process for each delivery person (in this example, two delivery persons A and B).
  • a confirm button 1504 is a button that is pressed when confirming the leveling result and notifying each delivery person.
  • a recalculation button 1505 is a button that is pressed to perform the leveling process again.
  • the mode switching button 1506 is a button for switching to the display example (normal mode) shown in FIG. 14.
  • an icon 1507 indicates the location of the delivery person.
  • the position of the icon 1507 may also change as the delivery person (more specifically, the client terminal 200) moves.
  • Icon 1508 indicates the total result of delivery destinations belonging to the unit area (indicated by "(x)") and delivery order, and is displayed with hatching. For example, by operating the icon 1508, a list of corresponding more detailed delivery information (eg, delivery address, etc.) may be displayed.
  • the icon 1509 indicates the location of the delivery destination, and since it is assigned to a different delivery person here, it has a different display format (in this example, it is outlined).
  • 16 and 17 are configuration examples of UI screens for displaying the results of the leveling process, and are, for example, screens displayed on the UI section 204 of the client terminal 200 operated by delivery person A.
  • the UI screen 1600 shown in FIG. 16 is also referred to as a first screen
  • the UI screen 1700 shown in FIG. 17 is also referred to as a second screen.
  • first and second are only used to distinguish and explain different components, and should not be interpreted to be limited to specific components. is not intended.
  • the OK button is pressed on any of the UI screens in FIG. 13, the UI screen 1600 is displayed by notifying the client terminal 200 owned by delivery person A of the delivery plan as the leveling result. It's okay to be.
  • FIG. 16 shows an example (normal mode) in which delivery destinations assigned to delivery person A are individually displayed.
  • a broken line 1602 indicating the set mesh is shown superimposed on a map 1601.
  • Assignment information 1603 indicates information regarding delivery assigned to delivery person A. The information here includes the number of deliveries, mileage, estimated time required for delivery, etc.
  • the mode switching button 1604 is a button for switching to the display example (mesh mode) shown in FIG. 17.
  • an icon 1605 indicates the position of delivery person A.
  • the position of the icon 1605 may also change as the delivery person A (more specifically, the client terminal 200) moves.
  • Icon 1606 indicates the location of the delivery destination. For example, by operating the icon 1606, corresponding more detailed delivery information (eg, delivery address, etc.) may be displayed.
  • the numbers within the icon 1606 indicate the order of delivery.
  • Delivery route 1607 indicates a delivery route for each assigned delivery destination. This route is derived based on the delivery cost as described above.
  • FIG. 17 shows a display example (mesh mode) in which the mesh is aggregated for each unit area. Totalizes and shows the delivery destinations belonging to each unit area.
  • a solid line 1702 indicating the set mesh is shown superimposed on a map 1701.
  • Assignment information 1703 indicates information regarding delivery assigned to delivery person A. The information here includes the number of deliveries, mileage, estimated time required for delivery, etc.
  • the mode switching button 1704 is a button for switching to the display example (normal mode) shown in FIG. 16.
  • an icon 1705 indicates the position of delivery person A.
  • the position of the icon 1705 may also change as the delivery person A (more specifically, the client terminal 200) moves.
  • Icon 1706 indicates the total result of delivery destinations belonging to the unit area (indicated by "(x)") and the order of delivery. For example, by operating the icon 1706, a list of corresponding more detailed delivery information (eg, delivery address, etc.) may be displayed.
  • the delivery plan generation device 100 is capable of generating delivery routes for each of a plurality of persons in charge identified by connecting unit areas including one or more delivery destinations, and for each of the plurality of persons in charge.
  • a settings screen (for example, settings screen 900, settings screen) that allows the user to input setting items used when generating delivery routes for each of multiple personnel by repeatedly performing the process of leveling the deliveries included in the delivery route 1000 and a setting screen 1100).
  • the setting screen 1000 is configured to allow specification of the maximum calculation time for repeating the process of generating a delivery route and leveling the delivery.
  • the setting screen 1000 is configured to allow the size of the unit area to be specified.
  • the setting screen 1000 is configured to allow designation of targets for delivery leveling.
  • the target of delivery leveling is the number of deliveries, delivery distance, or delivery time.
  • the setting screen 1000 is configured to allow specification of a tolerance value for the difference in delivery leveling.
  • the screen generation unit 114 further provides a setting screen 1100 on which at least the person in charge to whom the delivery destination is assigned and the period can be set.
  • the setting screen 1100 is configured to be able to display the total value of the leveling results for each of the plurality of persons in charge for each leveling item.
  • the screen generation unit 114 further provides a UI screen 1600 that displays delivery routes for multiple delivery destinations assigned to the person in charge, superimposed on a map of the delivery range.
  • the screen generation unit 114 further provides a UI screen 1700 that displays the total number of delivery destinations assigned to the person in charge for each unit area superimposed on a map of the delivery range.
  • the present disclosure also applies to programs and storage media that are supplied to the device via a network or various storage media to realize the functions of the device of the embodiments described above, and that are read and executed by a computer in the device. range.
  • the present disclosure effectively supports the formulation of an optimal package delivery plan according to the road conditions to the delivery destination when delivering multiple packages, and significantly reduces the burden on the delivery personnel who deliver each package. It is useful as a delivery plan generation device and a delivery plan generation method that reduce the amount of money.

Landscapes

  • Business, Economics & Management (AREA)
  • Engineering & Computer Science (AREA)
  • Economics (AREA)
  • Human Resources & Organizations (AREA)
  • Strategic Management (AREA)
  • General Physics & Mathematics (AREA)
  • Entrepreneurship & Innovation (AREA)
  • Physics & Mathematics (AREA)
  • Tourism & Hospitality (AREA)
  • Quality & Reliability (AREA)
  • Operations Research (AREA)
  • Marketing (AREA)
  • General Business, Economics & Management (AREA)
  • Development Economics (AREA)
  • Theoretical Computer Science (AREA)
  • Radar, Positioning & Navigation (AREA)
  • Remote Sensing (AREA)
  • Game Theory and Decision Science (AREA)
  • Automation & Control Theory (AREA)
  • Educational Administration (AREA)
  • Management, Administration, Business Operations System, And Electronic Commerce (AREA)
PCT/JP2023/013446 2022-04-15 2023-03-30 配送計画生成装置、および配送計画生成方法 Ceased WO2023199755A1 (ja)

Priority Applications (2)

Application Number Priority Date Filing Date Title
EP23788175.0A EP4510053A4 (en) 2022-04-15 2023-03-30 DELIVERY PLAN GENERATION DEVICE AND DELIVERY PLAN GENERATION METHOD
US18/856,426 US20250259136A1 (en) 2022-04-15 2023-03-30 Delivery plan generation device and delivery plan generation method

Applications Claiming Priority (2)

Application Number Priority Date Filing Date Title
JP2022-067717 2022-04-15
JP2022067717A JP2023157662A (ja) 2022-04-15 2022-04-15 配送計画生成装置、および配送計画生成方法

Publications (1)

Publication Number Publication Date
WO2023199755A1 true WO2023199755A1 (ja) 2023-10-19

Family

ID=88329506

Family Applications (1)

Application Number Title Priority Date Filing Date
PCT/JP2023/013446 Ceased WO2023199755A1 (ja) 2022-04-15 2023-03-30 配送計画生成装置、および配送計画生成方法

Country Status (4)

Country Link
US (1) US20250259136A1 (https=)
EP (1) EP4510053A4 (https=)
JP (1) JP2023157662A (https=)
WO (1) WO2023199755A1 (https=)

Families Citing this family (1)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
JP2026002635A (ja) * 2024-06-21 2026-01-08 パナソニックＩｐマネジメント株式会社 配送計画装置、配送計画方法、及び、配送計画プログラム

Citations (7)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
JPH08161404A (ja) * 1994-12-09 1996-06-21 Tadashi Yamamoto フレキシブル配送計画装置
JPH10134300A (ja) * 1996-11-05 1998-05-22 Nagoya Joho Syst Kk 最適配送ルート・配送車両決定装置および方法、並びに最適配送ルート・配送車両を決定するプログラムを記録した媒体
JPH1131177A (ja) * 1997-07-10 1999-02-02 Akabou Yamaguchi Pref Gov Keijidoushiya Unso Kyodo Kumiai 宅配システム
JP2004062363A (ja) * 2002-07-26 2004-02-26 Riosu Corp:Kk 経路調整装置
JP2004210413A (ja) * 2002-12-26 2004-07-29 Japan Tobacco Inc コース作成システムおよびコース作成方法
JP2020004181A (ja) * 2018-06-29 2020-01-09 株式会社日立製作所 配送計画装置、配送計画システムおよび配送計画方法
JP2022067717A (ja) 2020-10-21 2022-05-09 共立精機株式会社 刃具交換装置

Family Cites Families (5)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US20180260878A1 (en) * 2017-03-09 2018-09-13 Microsoft Technology Licensing, Llc Item delivery fulfillment plan determination
US10565543B1 (en) * 2019-03-01 2020-02-18 Coupang, Corp. Systems, apparatuses, and methods of efficient route planning for e-commerce fulfillment
JP7001657B2 (ja) * 2019-11-25 2022-01-19 株式会社日立製作所 配送計画作成装置及び配送計画作成方法
JP7248613B2 (ja) * 2020-02-21 2023-03-29 株式会社日立製作所 配送計画立案装置、及び配送計画立案方法
US20230133816A1 (en) * 2021-10-29 2023-05-04 Aisin Corporation Information processing apparatus, information processing method, and computer program product

Patent Citations (7)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
JPH08161404A (ja) * 1994-12-09 1996-06-21 Tadashi Yamamoto フレキシブル配送計画装置
JPH10134300A (ja) * 1996-11-05 1998-05-22 Nagoya Joho Syst Kk 最適配送ルート・配送車両決定装置および方法、並びに最適配送ルート・配送車両を決定するプログラムを記録した媒体
JPH1131177A (ja) * 1997-07-10 1999-02-02 Akabou Yamaguchi Pref Gov Keijidoushiya Unso Kyodo Kumiai 宅配システム
JP2004062363A (ja) * 2002-07-26 2004-02-26 Riosu Corp:Kk 経路調整装置
JP2004210413A (ja) * 2002-12-26 2004-07-29 Japan Tobacco Inc コース作成システムおよびコース作成方法
JP2020004181A (ja) * 2018-06-29 2020-01-09 株式会社日立製作所 配送計画装置、配送計画システムおよび配送計画方法
JP2022067717A (ja) 2020-10-21 2022-05-09 共立精機株式会社 刃具交換装置

Non-Patent Citations (1)

* Cited by examiner, † Cited by third party
Title
See also references of EP4510053A4

Also Published As

Publication number Publication date
EP4510053A1 (en) 2025-02-19
JP2023157662A (ja) 2023-10-26
US20250259136A1 (en) 2025-08-14
EP4510053A4 (en) 2025-07-23

Similar Documents

Publication Publication Date Title
US20250012578A1 (en) Dynamic route recommendation for service providers
US9921070B1 (en) System for planning trips with estimated time of arrival (ETA) and projected time of availability (PTA) calculated for each stop
US10012998B2 (en) Transportation management system with route optimization tools using non-work stops to generate trip plans
US11162803B2 (en) Providing alternative routing options to a rider of a transportation management system
US10260893B2 (en) System for integrating hours of service (HOS) with a vehicle's navigation system
US10528062B2 (en) Computerized vehicle control system for fleet routing
JP6790103B2 (ja) 評価装置、評価方法、および評価プログラム
US11392861B2 (en) Systems and methods for managing a vehicle sharing facility
US11132626B2 (en) Systems and methods for vehicle resource management
JP2014526072A (ja) 複数車両資源配分および経路指定解決策のためのシステムおよび方法
CA2876204A1 (en) Vehicle fleet routing system
JP2020067677A (ja) 配送管理システム
KR20210106445A (ko) 운송 관련 서비스에 대한 요청을 관리하기 위한 통신 서버 장치, 방법, 및 통신 시스템
JP2020057050A (ja) 情報処理装置及び情報処理プログラム
WO2023199755A1 (ja) 配送計画生成装置、および配送計画生成方法
JP7454926B2 (ja) 集配業務管理装置、集配業務管理方法及びプログラム
JP3911225B2 (ja) エリア分割システム
JP7407395B2 (ja) 情報処理装置、情報処理システム及び情報処理方法
JP2021149829A (ja) ロードサービスのサービス拠点配置システムおよびサービス拠点配置方法
JP4451622B2 (ja) 業務支援システム
JP2002183264A (ja) 配送／配車計画装置、配送／配車計画方法、及び記録媒体
WO2024241667A1 (ja) 配送計画生成装置、および配送計画生成方法
JP7643376B2 (ja) 情報処理装置、情報処理方法、およびプログラム
JP4945794B2 (ja) 配車支援システム
JP2023090094A (ja) 計画立案支援方法、計画立案支援プログラム及び計画立案支援システム

Legal Events

Date Code Title Description
121 Ep: the epo has been informed by wipo that ep was designated in this application

Ref document number: 23788175

Country of ref document: EP

Kind code of ref document: A1

WWE Wipo information: entry into national phase

Ref document number: 18856426

Country of ref document: US

WWE Wipo information: entry into national phase

Ref document number: 2023788175

Country of ref document: EP

NENP Non-entry into the national phase

Ref country code: DE

ENP Entry into the national phase

Ref document number: 2023788175

Country of ref document: EP

Effective date: 20241115

WWP Wipo information: published in national office

Ref document number: 18856426

Country of ref document: US