Method for providing service of assigning vehicles

Abstract

The present invention is characterized by comprising: a step of obtaining order information including at least one of customer information, estimated volume, desired time, and dispatch priority, and vehicle information including at least one of origin, destination, maximum volume, vehicle type, and drivable road; a step of matching the order information and vehicle information obtained in the step of obtaining the information; and a step of generating a dispatch plan based on the delivery destination information matched through the matching step.

Description

Technology Field

[0001] The present disclosure relates to a method for a computing device to provide a dispatch service. Specifically, the present disclosure relates to a method for a computing device to provide an optimal dispatch service, wherein the computing device generates an optimal dispatch plan based on data input regarding order information and vehicle information using an interface, and provides a dispatch plan result. Background Technology

[0003] Generally, a consumer’s purchase refers to the process of acquiring ownership of a product after the consumer pays the price, either in person or online, following an inspection. Such purchases can involve physically viewing and receiving the product, or receiving a product later after payment following an online inspection. Among these options, the method of receiving the product later includes using a courier service.

[0004] In the logistics delivery industry utilizing courier services, it is crucial to determine how to allocate a given volume of shipments to a limited number of trucks and which routes to use. This is because efficiently designing a dispatch plan can minimize logistics costs. However, conventional vehicle routing planning has suffered from the problem of being time-consuming and inaccurate, as it is mostly handled by experienced clerks.

[0005] Furthermore, the aforementioned courier service is unfeasible for large products or those requiring installation, so a separate company must be used or the product retailer may provide delivery and installation services. Additionally, there are issues such as the need to meet vehicle requirements for transporting the product and to find a driver capable of installation.

[0006] Furthermore, the dispatch system for shippers capable of product installation using specialized vehicles operated by accessing the logistics center's server via a shipper terminal to receive desired logistics assignments; therefore, from the perspective of the logistics company, it was far from a system that could minimize logistics costs.

[0007] Accordingly, research is ongoing on dispatching methods that enable smooth product delivery and installation while minimizing the workforce of dispatch companies. The problem to be solved

[0009] The objective of the present invention is to provide a method that enables product delivery by forming an efficient optimized route that guarantees the shipper's rest time while strictly adhering to delivery and work times, utilizing vehicle-specific characteristics and product delivery information when a delivery company establishes an efficient delivery plan. means of solving the problem

[0011] An embodiment of the present disclosure for solving the aforementioned problem may include: a step of obtaining order information including at least one of customer information, estimated volume, desired time, and dispatch priority, and vehicle information including at least one of a departure point, destination, maximum volume, vehicle type, and drivable road; a step of matching the order information and vehicle information obtained in the step of obtaining the information; and a step of generating a dispatch plan based on the delivery location information matched through the matching step.

[0012] The step of matching the above information may include a matching information selection step of classifying a delivery address according to deliverable order information among the vehicle information as matching information and selecting the matching information for each vehicle.

[0013] The above order information further includes assigned driver information, and the above vehicle information further includes performable task information. The step of matching the information involves, if installation or collection work is required during the delivery of a product according to the above order information, delivering the product using a driver and vehicle capable of performing the work, wherein the performable task information may further include the estimated time required to perform the work.

[0014] The step of generating the above dispatch plan may include: generating a cluster in which a plurality of delivery locations are grouped according to the matching information; determining a priority among the clusters; and generating a first dispatch plan for each cluster.

[0015] The step of determining priority among the clusters may involve determining the cluster closest to the starting point as the 1st priority cluster, determining the cluster with the shortest straight-line distance from the nth priority cluster as the n+1th priority, and determining the cluster including the destination as the final cluster.

[0016] The step of generating the first dispatch plan above can generate a route that optimizes vehicle operation within the cluster, such that for delivery destinations within the cluster, when driving from the starting delivery destination to the final delivery destination, the route is generated in a direction toward the next-ranked cluster.

[0017] The step of generating the above dispatch plan may further include the step of generating a second dispatch plan that includes preferred zone information and avoided zone information for each vehicle, and excludes delivery destinations included in the avoided zone information from the dispatch plan.

[0018] The above second dispatch plan may add deliveries to delivery destinations that are close to the vehicle travel route among the delivery destinations included in the above avoidance zone information. Effects of the invention

[0020] According to one embodiment of the present disclosure, there is an effect of generating an optimal dispatch plan by utilizing order information and vehicle information required for dispatch using various interfaces.

[0021] In addition, if product installation is required, assigning a driver and vehicle capable of installation before dispatching provides the effect of offering an optimal dispatch plan that enables product transportation, installation, and collection.

[0022] In addition, it has the effect of providing an optimal dispatch plan by forming zones for product delivery by vehicle. Brief explanation of the drawing

[0024] FIG. 1 is a schematic diagram showing the configuration of a method in which a computing device according to one embodiment of the present disclosure provides an optimal dispatch service. FIG. 2 is a schematic diagram illustrating a flowchart of a method in which a computing device according to one embodiment of the present disclosure provides an optimal dispatch service using a dispatch option. FIG. 3 is a schematic diagram showing a dispatch option information selection interface of a method for providing an optimal dispatch service using a dispatch option by a computing device according to one embodiment of the present disclosure. FIG. 4 is a schematic diagram illustrating an example of an order information selection interface of a method for providing an optimal dispatch service using a dispatch option by a computing device according to one embodiment of the present disclosure. FIG. 5 is a schematic diagram illustrating an example of a vehicle information selection interface of a method for a computing device according to one embodiment of the present disclosure to provide an optimal dispatch service using a dispatch option. FIG. 6 is a schematic diagram showing another flowchart of a method for a computing device to provide an optimal dispatch service according to one embodiment of the present disclosure. FIG. 7 is a schematic diagram illustrating an example of a zone dispatching method in which a computing device according to one embodiment of the present disclosure provides an optimal dispatching service. FIG. 8 is a schematic diagram illustrating an example of a cost dispatch plan of a method for a computing device providing an optimal dispatch service according to one embodiment of the present disclosure. FIG. 9 is a schematic diagram illustrating an example of a clustering dispatch plan of a method for a computing device providing an optimal dispatch service according to one embodiment of the present disclosure. FIG. 10 is a schematic diagram illustrating another example of a clustering dispatch plan of a method for a computing device providing an optimal dispatch service according to one embodiment of the present disclosure. FIG. 11 is a schematic diagram showing a result value interface of a method for providing an optimal dispatch service using a bar by a computing device according to one embodiment of the present disclosure. FIG. 12 is a schematic diagram showing a flowchart according to one embodiment of the present disclosure. FIG. 13 is a schematic diagram illustrating another example of a result value interface according to one embodiment of the present disclosure. FIG. 14 is a schematic diagram showing the result value interface bar before movement according to one embodiment of the present disclosure. FIG. 15 is a schematic diagram showing the result value interface bar after movement according to one embodiment of the present disclosure. FIG. 16 is a schematic diagram showing another example of a result value interface before bar movement according to one embodiment of the present disclosure. FIG. 17 is a schematic diagram showing another example of a result value interface after bar movement according to one embodiment of the present disclosure. FIG. 18 is a drawing for explaining a computing device according to one embodiment of the present disclosure. FIG. 19 is a general schematic diagram of an exemplary computing environment in which embodiments of the present disclosure may be implemented. Specific details for implementing the invention

[0025] Various embodiments are now described with reference to the drawings. In this specification, various descriptions are provided to provide an understanding of the present disclosure. However, it is evident that these embodiments can be practiced without such specific descriptions.

[0026] As used herein, terms such as “component,” “module,” “system,” etc. refer to computer-related entities, hardware, firmware, software, combinations of software and hardware, or executions of software. For example, a component may be, but is not limited to, a procedure, processor, object, execution thread, program, and / or computer running on a processor. For example, both an application running on a computing device and the computing device itself may be a component. One or more components may reside within a processor and / or execution thread. A component may be localized within a single computer. A component may be distributed among two or more computers. Additionally, these components may be executed from various computer-readable media having various data structures stored therein. Components may communicate through local and / or remote processes, for example, according to signals having one or more data packets (e.g., data from a component interacting with another component in a local system or distributed system, and / or data transmitted through signals to other systems and networks such as the Internet).

[0027] Furthermore, the term "or" is intended to mean an implicit "or" rather than an exclusive "or." That is, unless otherwise specified or evident from the context, "X uses A or B" is intended to mean one of the natural implicit substitutions. In other words, if X uses A; if X uses B; or if X uses both A and B, "X uses A or B" may apply to any of these cases. Additionally, the term "and / or" as used herein should be understood to refer to and include all possible combinations of one or more of the enumerated related items.

[0028] Additionally, the terms “comprising” and / or “comprising” should be understood to mean that such features and / or components are present. However, the terms “comprising” and / or “comprising” should be understood not to exclude the presence or addition of one or more other features, components and / or groups thereof. Furthermore, unless otherwise specified or clearly evident from the context to indicate a singular form, the singular in this specification and claims should generally be interpreted to mean “one or more.”

[0029] And, the term "at least one of A or B" should be interpreted to mean "a case including only A," "a case including only B," or "a case combined with the composition of A and B."

[0030] Those skilled in the art should recognize that the various exemplary logical blocks, configurations, modules, circuits, means, logics, and algorithmic steps described in connection with the embodiments disclosed herein may be implemented in electronic hardware, computer software, or a combination of both. To clearly exemplify the interchangeability of hardware and software, various exemplary components, blocks, configurations, means, logics, modules, circuits, and steps have been generally described above in terms of their functionality. Whether such functionality is implemented in hardware or software depends on the specific application and design constraints imposed on the overall system. Skilled technicians may implement the described functionality in various ways for each specific application. However, such decisions regarding implementation should not be construed as going beyond the scope of this disclosure.

[0031] The description of the presented embodiments is provided to enable those skilled in the art to use or practice the present invention. Various modifications to these embodiments will be apparent to those skilled in the art. The general principles defined herein may be applied to other embodiments without departing from the scope of the present disclosure. Thus, the present invention is not limited to the embodiments presented herein. The present invention should be interpreted in the broadest possible scope consistent with the principles and novel features presented herein.

[0033] Hereinafter, the present disclosure will be described with reference to the drawings.

[0035] FIG. 1 is a schematic diagram illustrating the configuration of a method for a computing device to provide an optimal dispatch service according to an embodiment of the present disclosure; FIG. 2 is a schematic diagram illustrating a flowchart illustrating a method for a computing device to provide an optimal dispatch service using a dispatch option according to an embodiment of the present disclosure; FIG. 3 is a schematic diagram illustrating a dispatch option information selection interface of a method for a computing device to provide an optimal dispatch service using a dispatch option according to an embodiment of the present disclosure; FIG. 4 is a schematic diagram illustrating an example of an order information selection interface of a method for a computing device to provide an optimal dispatch service using a dispatch option according to an embodiment of the present disclosure; FIG. 5 is a schematic diagram illustrating an example of a vehicle information selection interface of a method for a computing device to provide an optimal dispatch service using a dispatch option according to an embodiment of the present disclosure; FIG. 6 is a schematic diagram illustrating another flowchart illustrating a method for a computing device to provide an optimal dispatch service according to an embodiment of the present disclosure; FIG. 7 is a schematic diagram illustrating an example of zone dispatching of a method for a computing device to provide an optimal dispatch service according to an embodiment of the present disclosure; and FIG. 8 is a diagram illustrating an optimal dispatch service provided by a computing device according to an embodiment of the present disclosure FIG. 9 is a schematic diagram illustrating an example of a cost dispatch plan of a method according to one embodiment of the present disclosure, FIG. 10 is a schematic diagram illustrating another example of a clustering dispatch plan of a method of providing an optimal dispatch service by a computing device according to one embodiment of the present disclosure, FIG. 11 is a schematic diagram illustrating a result value interface of a method of providing an optimal dispatch service by a computing device according to one embodiment of the present disclosure using a bar, FIG. 12 is a schematic diagram illustrating a flowchart according to one embodiment of the present disclosure.FIG. 13 is a schematic diagram illustrating another example of a result value interface according to one embodiment of the present disclosure, FIG. 14 is a schematic diagram illustrating a result value interface bar before movement according to one embodiment of the present disclosure, FIG. 15 is a schematic diagram illustrating a result value interface bar after movement according to one embodiment of the present disclosure, FIG. 16 is a schematic diagram illustrating another example of a result value interface bar before movement according to one embodiment of the present disclosure, FIG. 17 is a schematic diagram illustrating another example of a result value interface bar after movement according to one embodiment of the present disclosure, FIG. 18 is a diagram for explaining a computing device according to one embodiment of the present disclosure, and FIG. 19 is a general schematic diagram of an exemplary computing environment in which embodiments of the present disclosure may be implemented.

[0037] The present disclosure with reference to FIG. 1 may enable a user of a service to receive an interface for dispatch option information, order information, and vehicle information, and to select each piece of information, generate an optimal dispatch plan using an algorithm based on the selected information, and provide the user with an interface for the result of the generated optimal dispatch plan, thereby enabling the user to deliver goods efficiently. Here, the user may be an administrator capable of managing all information, or a shipper terminal included in the dispatch plan. By generating an optimal dispatch plan based on the selected information as described above and transmitting it to a vehicle terminal, an optimal dispatch plan for each delivery location within a region can be generated.

[0039] A method for providing an optimal dispatch service using a dispatch option in a computing device according to a first embodiment of the present disclosure with reference to FIG. 2 may include: a step of providing a dispatch option selection interface (S100); a step of providing an order information selection interface (S200); a step of providing a vehicle information selection interface (S300); and a step of generating an optimal dispatch plan based on the dispatch option, the order information and the vehicle information, and providing the generated dispatch plan result value interface (S400).

[0040] Here, the interface may refer to a part or connection device that connects two different systems, devices, and software, and may refer to a medium that connects a user and a computer device, and in the present disclosure, it may be displayed on a computing device so that a user can verify it.

[0041] In addition, dispatch options can be broadly classified into equal dispatch options and zone dispatch options. An equal dispatch option may allow the selection of equal work hours, in which the work hours of multiple drivers are evenly distributed, and equal order counts, in which the number of orders of multiple drivers are evenly distributed, and the equal work hours and equal order counts may be selected individually or in combination.

[0042] Additionally, the zone dispatch option may allow you to select between dispatching without a zone, which ignores zone settings even if they exist, and basic zone dispatching, which dispatches based on the set zones. One zone dispatch option may be mandatory to select.

[0043] Additionally, the dispatch options may include both equal dispatch and zone dispatch options, or neither may be selected. For example, if neither is selected, a dispatch plan may be generated by a default algorithm, and if either the equal dispatch or zone dispatch option is selected, a dispatch plan that meets the selected conditions may be generated. Among these, duplicate selection of the zone dispatch option may not be possible.

[0044] Additionally, the dispatch option selection interface may be for setting a drive name and a drive date. The drive date is intended to ensure that the dispatch plan is executed on that date, and the drive name may be for identification purposes by assigning a name to each vehicle. Additionally, it may provide an interface for selecting an equal dispatch option and a zone dispatch option.

[0045] Here, if only equal working hours are selected, a dispatch plan may be generated so that working hours are applied equally to multiple vehicles. In addition, if equal order counts are selected together, a dispatch plan may be generated so that working hours are equal and the number of delivery orders according to the dispatch plan is equal. The dispatch plan may be generated after all selections according to the interface are completed.

[0046] Additionally, an interface for selecting zone dispatch options may be provided. While the equal dispatch option and zone dispatch option can be selected in combination, the dispatch without zones or basic zone dispatch option within the zone dispatch option may only be selectable as a single option. This may be because these are options that cannot be combined, as they are selected based on whether to divide the zones or proceed as a single unit.

[0047] After selecting the dispatch option as described above, you can proceed to the next step via the button that moves to the next step. The next step will be explained in detail below.

[0048] Additionally, the step of providing an order information selection interface (S200) may involve providing an interface for selecting order information. Specifically, a consumer may purchase a product and configure order information as information regarding the purchase. In this case, details regarding the order information may be stored in a computing device. For example, information such as the consumer's personal information for the order and delivery address information may be pre-stored, and an interface may be provided that allows selecting at least one piece of information from each order. For example, order information may be searched using an order number, driver, customer name, etc., and in addition, it may be searched based on the delivery date. Furthermore, order requests including delivery, installation, and collection, as well as dispatch priorities, may be selected, but are not limited thereto. When search result information based on the selected information is listed, the order information to be delivered may be selected from among them. Additionally, the step of providing an order information selection interface (S200) may involve partially exposing information regarding previously selected dispatch option information. After proceeding with the selection of order information, the user may enter the next step through a button to move to the next step.

[0049] Additionally, the step of providing a vehicle information selection interface (S300) may provide an interface that allows selecting a vehicle and a driver. Specifically, information regarding the vehicle may be stored in a computing device. For example, vehicle information including information such as vehicle number, driver name, driving time, vehicle type, and vehicle load may be stored in a computing device. Accordingly, information regarding the vehicle and driver may be listed in a part of the vehicle information selection interface, and the user may be able to select the necessary driver and vehicle through a search. For example, information regarding the vehicle and driver may be listed horizontally in a part of the interface, and a checkbox for selection may be formed at the very front; if this is selected, the driver and vehicle of the corresponding information may be selected and included in the dispatch plan. Additionally, a checkbox that allows selecting or deselecting all checkboxes may be located in a part. Finally, information regarding previously selected dispatch option information and order information may be formed on one side.

[0050] When the selection of dispatch options, order information, and vehicle information is finalized in the manner described above, it is possible to generate a dispatch plan based on each of the selected information.

[0051] For example, if equal work hours and basic zone dispatch are selected as dispatch options, orders with high priority and delivery only are selected as order information, and the first driver is selected as vehicle information, the result of a dispatch plan is provided in which the first driver performs equal work on high priority orders within the basic zone for the delivery destinations in that area. The method of providing the dispatch plan result will be described later.

[0052] As described above, the first embodiment allows for the selection of order information by first selecting a dispatch option, thereby making it easy to identify the number of orders and delivery destinations based on the order information by region, and subsequently, by selecting vehicle information, vehicles capable of delivering by region can be selected to finally generate a dispatch plan.

[0054] According to the first embodiment of the present disclosure with reference to FIG. 3, the step (S100) of providing the dispatch option selection interface may provide at least one of a driving date, an equal dispatch option, and a zone dispatch option selection area (I330) in at least a portion thereof, and may be capable of moving to the next step when at least one of the driving date, the equal dispatch option, and the zone dispatch option is selected.

[0055] Here, the driving date is mandatory information and may be provided along with the driving name. Additionally, the button for moving to the next step may be activated only when the driving date and driving name are entered. For example, a driving date area (I310) for entering the driving name and driving date may be provided, and the area for entering the driving date may be provided in a calendar format when activated.

[0056] In addition, an equal dispatch option selection area (I320) may be provided. For example, the equal work time option selection area may include an image of an analog clock or a digital clock related to time. In addition, the equal order quantity may include an image of a loaded product.

[0057] Additionally, a zone dispatch option selection area (I330) may be provided. For example, the zone for selecting the basic zone dispatch option may provide an image in which a vehicle image is inserted into a map background divided into zones. Alternatively, it may provide an image in which a vehicle image is inserted into a map that is not divided into zones. Accordingly, it may be possible to select between basic zone dispatch and dispatch without zones.

[0058] Here, the equal dispatch option and the zone dispatch option may each be required to be selected to provide the next step. For example, when a driving name and driving date are entered, a selection area for the equal dispatch option and the zone dispatch option is activated, and selecting the equal dispatch option and the zone dispatch option may allow moving to the next step. Here, moving to the next step may involve a first input information area (I340) separately formed to outline the steps and input information of the provided interface. Additionally, the first input information area (I340) may additionally provide a dispatch result view button, and a detailed explanation will be provided later.

[0059] As described above, by allowing the user to move to the next page with at least one of the driving date, equal dispatch option, and zone dispatch option selected, it is possible to select all essential information when creating a dispatch plan.

[0061] According to the first embodiment of the present disclosure, the equal dispatch option includes at least one of an equal work time option and an equal number of orders, and the zone dispatch option includes at least one of dispatch without zone and basic zone dispatch, and at least one selected among the equal dispatch option and the zone dispatch option can be spotlighted.

[0062] Here, "spotlight" may refer to an activated state distinct from the provided image, and may signify a noticeable change in the image compared to other unselected images. For example, when selecting equal work hours in the equal dispatch option selection area (I320), the corresponding image may be activated, colored, and include a check mark along with a border highlighting effect. Additionally, when selecting the zone dispatch option, the corresponding image may be colored and include a check mark and a border highlighting effect. The spotlighted image is easily visible to the user, allowing for a quick determination of whether a selection has been made, thereby making it easy to identify any missing selections when moving to the next page or the results page later.

[0063] When the selection of the dispatch option is completed as described above, the next selection interface can be provided through the next button located in the first input information area (I340).

[0065] According to the first embodiment of the present disclosure with reference to FIG. 4, the step (S200) of providing the order information selection interface may provide at least one of a search period, an order type, a dispatch priority, and an order listing column (I420) in at least a portion thereof, and may provide order information searched using at least one of the search period, order type, and dispatch priority to be listed in the order listing column (I420), and may provide at least one of the orders listed in the order listing column (I420) to be selected.

[0066] As described above, by selecting the driving date, equal dispatch option, and zone dispatch option through the dispatch option selection interface, the next option, the order information input interface, can be provided. The order information input interface may be a selection interface for order information. Order information may include, for example, the product purchased by the consumer, the size and weight of the product, the delivery address, whether installation is required, etc., and may provide an interface that allows selection of some of the various information. As a specific example, the order selection area (I410) may provide options for selecting the order ID, search period, order type, and dispatch priority. The order ID may be searchable through the order number used at the time of ordering, customer name, driver, etc. Additionally, the search period may allow searching for the order acceptance date. Furthermore, the order type may allow selection of whether the product simply requires delivery or requires installation and collection. Additionally, the dispatch priority may determine the priority when creating a dispatch plan by delivery address based on the order information. For example, when creating a dispatch plan, products with a higher priority may be included in the dispatch plan first.

[0067] Additionally, the order listing section (I420) may be a section where order information searched based on the information selected in the order selection section (I410) is listed. For example, it may list order information that has information matching the search period, order type, dispatch priority, and order ID selected in the order selection section (I410). Accordingly, the order information in the order listing section (I420) may include the order ID, order receipt date, customer name, delivery address, item name, etc. Along with this, at least one order information listed in the order listing section (I420) may be selected. A checkbox may be provided to enable single selection or multiple selections. When order information is selected via the checkbox and the next button of the second input information section (I430) is pressed, a vehicle information selection interface, which is the next selection interface, may be provided.

[0068] Specifically, the second input information section (I430) schematically represents the previous stage of the dispatch option and order information selection interface, and together with this, may schematically represent the previous selection information. For example, if dispatch without zones and equal work hour dispatch are selected, information regarding this may be formed on one side. In addition, unlike the first input information section (I340), the second input information section (I430) further includes a back button, which allows returning to the previous stage of receiving the dispatch option selection interface. For example, if one wishes to select a dispatch option again, one may return to modify it.

[0069] By granting autonomy to the selection as described above, it is possible to make it easy and simple to correct incorrect inputs, and to enable the efficient generation of dispatch plans by selecting order information along with dispatch options.

[0071] According to the first embodiment of the present disclosure, the step (S300) of providing the vehicle information selection interface comprises providing a vehicle listing column (I520) including vehicle and driver information according to the selected dispatch option and the order information in at least a portion thereof, wherein the vehicle listing column (I520) includes status information regarding whether the vehicle is capable of performing a task and listed vehicle information, and may be provided to select at least one of the vehicle information according to the status information among the listed vehicle information.

[0072] Here, the vehicle listing section (I520) may be a section that lists vehicle information. For example, it may list all previously stored vehicle information (vehicle status, driver name, vehicle number, operation type, assigned area, driving name, route status, etc.). Among these, it may allow selecting vehicle information that matches data based on order information and dispatch options. For instance, the vehicle information listed in the vehicle listing section (I520) may basically display all vehicle information. Among these, when a search is performed in the vehicle selection section (I510), it may display vehicle information that matches the searched vehicle information. Here, the vehicle information section may further include vehicle status information, which may include whether the vehicle's current state allows for delivery or not. For example, delivery may be impossible if the vehicle is broken down, or if the size of the product exceeds the vehicle's load capacity.

[0073] Additionally, the vehicle selection area (I510) can search for a suitable vehicle through vehicle information and list it in the vehicle listing column (I520). For example, vehicle information can be searched by entering an order number, customer name, driver, etc. Along with this, the vehicle can be searched through its status and operation type. The operation type may be selectable as a fixed vehicle or a chartered vehicle. A fixed vehicle may be a hired vehicle that is always on standby, and a chartered vehicle may be a rental vehicle.

[0074] It may be possible to generate an optimized dispatch plan by querying vehicle information through the search described above and selecting all suitable vehicles to create a dispatch plan.

[0076] According to the first embodiment of the present disclosure, the step of providing the order information selection interface (S200) may display at least some of the information selected through the step of providing the dispatch option selection interface (S100) on at least some of the left side.

[0077] As previously explained, the order information selection interface may include a first input information area (I340) on one side. The first input information area (I340) may include various information. For example, it may include dispatch options, order information, the progress of the vehicle information selection interface, driving date, zone dispatch selection result, equal dispatch selection result, selected order information, etc.

[0078] By briefly including the dispatch, order, and vehicle information as described above, users can easily check the details and enable quick responses based on the progress.

[0080] According to the first embodiment of the present disclosure, the step of providing the vehicle information selection interface (S300) may display at least some of the information selected through the dispatch option selection and the order information selection interface (S200) on at least some of the left side.

[0081] Here, the step (S300) of providing a vehicle information selection interface can basically be searched based on information about the vehicle, and the searched vehicle can be listed in the vehicle listing column (I520) along with various information.

[0082] Additionally, a third input information section (I530) may be included in a portion of the left side. For example, the third input information section (I530) may be formed identically to the second input information section (I430), and since this is a step for inputting vehicle information after the input of dispatch options and order information is completed, previously selected information may be listed. Specifically, it may include a step for selecting the current interface, driving date, zone dispatch, equal dispatch, and selection of order information. Also, since this is the final input interface, there is no next button, but there may be buttons for moving to the previous and viewing dispatch results.

[0084] According to a first embodiment of the present disclosure, a method for providing an optimal dispatch service using the dispatch option may be provided in the order of providing the dispatch option selection interface, providing the order information selection interface, providing the vehicle information selection interface, and providing the dispatch plan result value interface.

[0085] Specifically, when a user receives the optimal dispatch service, they first select a dispatch option. Depending on the selected option (default zone dispatch or dispatch without a zone), it may be possible to generate a dispatch plan for each delivery location based on order information. Subsequently, the user can make selections regarding order information. At this stage, preparations for generating a dispatch plan can be made after classifying multiple delivery locations based on the selected order information by vehicle. Next, vehicle information can be selected. When generating a dispatch plan for each delivery location based on the dispatch option and order information, selecting a vehicle allows multiple vehicles to deliver multiple orders using optimized routes.

[0087] According to the first embodiment of the present disclosure, the step (S400) of providing the dispatch plan result value interface comprises generating an optimal dispatch plan based on order information and vehicle information stored in the computing device, and providing result values ​​for the generated dispatch plan to a user terminal and a vehicle terminal, wherein the terminal may be able to modify the dispatch plan result values.

[0088] As explained above, when the final selection is completed through the vehicle information input interface, the dispatch plan result value can be provided using that information.

[0089] Specifically, a dispatch plan can be generated using each piece of information entered through the dispatch option, order information, and vehicle information input interfaces. A specific method for generating a dispatch plan may utilize the method of the second embodiment described below. The generated dispatch plan may be provided as a result value to each terminal. The result value relates to the dispatch plan and may be provided as a delivery execution plan displayed on a map. A detailed explanation will be provided later.

[0090] The result value interface provided as described above can be modified on each terminal. Specifically, the result value interface provided to the administrator terminal can be modified for the entire dispatch plan, whereas if provided to the vehicle terminal (shipper terminal), it can be modified only for the dispatch plan of the corresponding vehicle.

[0091] For example, if dispatch plans are created for vehicles 1 through 10, the administrator can modify all of them, and for vehicle 1, modifications may be made only within the dispatch plan for vehicle 1. Here, modifications can be made selectively among various information such as delivery order, final destination, delivery time, and break time.

[0092] As explained above, by providing an input interface and a result value interface, information for generating a dispatch plan is received, and an efficient dispatch plan is generated based on the provided information and delivered to each terminal, thereby preventing the consumption of personnel for dispatch distribution, establishing an accurate and efficient dispatch plan and providing result values, and allowing individuals to modify the provided result values, it becomes possible to generate and provide an optimal dispatch plan.

[0094] A method for a computing device providing an optimal dispatch service according to a second embodiment of the present disclosure with reference to FIG. 6 may include: a step of obtaining order information including at least one of customer information, estimated volume, desired time, and dispatch priority, and vehicle information including at least one of a departure point, a destination, a maximum volume, a vehicle type, and a road where operation is possible; a step of matching the order information and the vehicle information obtained in the step of obtaining the information; and a step of generating a dispatch plan based on the delivery location information matched through the matching step.

[0095] In addition, it may further include a step of recommending the above-mentioned dispatch plan.

[0096] Here, the method for providing an optimal dispatch service may be a service that provides an optimal dispatch plan result value based on each piece of information using order information and vehicle information.

[0097] In addition, order information may include customer information, desired time, dispatch priority, designated vehicle information, estimated volume, and estimated work time.

[0098] Here, customer information may include details of the purchased product, address, customer name, contact information, etc., and may include all information necessary for delivery.

[0099] Additionally, the desired time may be the time when delivery is wanted to be completed. For example, if the desired time is set between 6 PM and 7 PM, it may be to ensure that delivery is completed within that timeframe. As another example, for products requiring installation (such as air conditioners, boilers, and computers), it may be the time when installation begins. These desired times allow the customer to remain present at the installation location.

[0100] Additionally, dispatch priority can be the importance of a dispatch when creating a dispatch plan, and the higher the priority, the higher the importance. For example, if there are products with priority 5 and products with priority 8, the product with priority 8 may be dispatched first.

[0101] Additionally, designated vehicle information may be used to specify a particular vehicle during dispatch. For example, this could include information regarding refrigerated trucks, passenger cars, cargo trucks, and motorcycles. Designating a vehicle allows customers to specify it when they desire fast delivery or when the product is large, thereby facilitating smooth delivery.

[0102] In addition, the estimated volume may be the amount loaded onto a vehicle calculated based on the size and weight of the goods, the quantity of the goods, etc. The size of the vehicle may be specified using the volume.

[0103] In addition, the estimated work time may be the time to start the installation work in the case of a product that requires installation. For example, if the work time is 1 hour, when creating a dispatch plan, it may be created by adding 1 hour of work time after arrival.

[0104] In addition, vehicle information may include vehicle type, maximum capacity, origin, destination, break time, start time of work, and roads available for operation.

[0105] Here, vehicle type can be a type of vehicle. For example, it can be a type of passenger car, a type of van, a type of truck, etc.

[0106] In addition, the maximum volume may be the maximum volume of the vehicle. For example, in the case of a cargo truck, the volume of the open cargo compartment and the volume of the cargo compartment protected by a tarpaulin or roof may be formed differently.

[0107] In addition, the origin may be information about the origin of the delivery vehicle. For example, it may be the first delivery destination from which goods are loaded at a logistics warehouse, or it may be the location where the vehicle is located.

[0108] Additionally, the destination can be information regarding the location where the delivery is completed. For example, it could be the final delivery address, such as a vehicle garage or a logistics warehouse.

[0109] Additionally, break time may be the driver's break time. For example, if 2:00 PM to 3:00 PM is designated as break time, it may be excluded from dispatching so that deliveries do not take place during that time.

[0110] Additionally, the work start time may be the driver's work start time. For example, if 9:00 AM is set as the start time, it may be to create a dispatch plan that excludes delivery locations at 8:00 AM.

[0111] Additionally, the operable roads may refer to information regarding roads permissible for each vehicle type. For example, in the case of motorcycles, highways may be excluded because they cannot enter them, and in the case of large cargo trucks, they may be excluded from the operable roads because they cannot enter narrow alleyways.

[0112] In addition, the information matching step may involve comparing order information with vehicle information. For example, large products (order information), such as large refrigerators, may be matched with large cargo trucks weighing 5 tons or more (vehicle information). As another example, products requiring freezing (order information) may be matched with refrigerated vehicles (vehicle information). Furthermore, matching may involve comparing working hours, vehicle types, and available roads.

[0113] As described above, by going through the step of matching orders and vehicles according to each piece of information, a dispatch plan can be generated for vehicles capable of delivering products based on the order information, and the dispatch plan can achieve maximum efficiency in product delivery by generating an optimal dispatch plan for each delivery location.

[0115] According to a second embodiment of the present disclosure, the step of matching the information may include a matching information selection step of classifying a delivery location according to deliveryable order information among the vehicle information as matching information and selecting the matching information for each vehicle.

[0116] Here, the matching information may be information about ordered products where the order information and vehicle information match. For example, all order information requiring the delivery of refrigerated goods within the operating hours of the refrigerated truck may be selected as matching information.

[0118] According to a second embodiment of the present disclosure, the order information further includes assigned driver information, and the vehicle information further includes performable task information. The step of matching the information involves, when an installation or collection task is required during the delivery of a product according to the order information, delivering the product using a driver and vehicle capable of performing the task, wherein the performable task information may further include an estimated time required to perform the task.

[0119] Here, the assigned driver information may refer to a driver capable of delivering the ordered product and performing additional tasks. For example, in the case of an air conditioner, since the installation of both the air conditioner and the outdoor unit is required, this may involve assigning a technician capable of installation. Additionally, in the case of a boiler, this may involve assigning a technician capable of installing and connecting the boiler. In such cases, the driver may be assigned regardless of the type or size of the vehicle used for delivery.

[0120] In addition, the information on available tasks may refer to tasks that can be performed during product delivery based on the order information. For example, this could be information regarding a vehicle driver's ability to install air conditioners or boilers.

[0121] Accordingly, the product delivery address may be selected based on the vehicle-specific order information according to the above order information and the above vehicle information.

[0122] However, if product installation and collection are required, time may be needed to perform these tasks. For example, additional installation work may be necessary after delivering an air conditioner. This requires additional time to execute the task. While the duration of the work may vary depending on the product, the time required for the work can be managed so that delivery or vehicle movement does not occur. Accordingly, the overall dispatch plan can be created by summing up the vehicle movement and delivery times, as well as the estimated work time, to form the total working time.

[0124] According to a second embodiment of the present disclosure, the step of generating the dispatch plan may include: a first step of setting a maximum travel time of a dispatched vehicle; a second step of generating a dispatch plan considering the maximum travel time and order information, wherein the dispatch plan includes a travel time according to a travel route; a third step of performing verification of the dispatch plan; and a fourth step of changing the maximum travel time and searching for a value at which the maximum travel time is minimized by repeating the second step and the third step for the changed maximum travel time.

[0125] Here, the maximum operating time of a dispatched vehicle may be the maximum operating time for multiple dispatched vehicles, which is the sum of the maximum operating times that each dispatched vehicle can have. Additionally, it may be the maximum operating time per vehicle.

[0126] In addition, order information may be information regarding a consumer's purchase of a product. Specifically, it may be information such as the product to be shipped, the product collection center (origin), and the product delivery address (destination), and may be information obtained through a consumer terminal. Furthermore, the dispatch plan may be a plan to deliver the product to the delivery address based on the order information.

[0127] Additionally, the first step may involve the computing device specifying the maximum operating time for each dispatched vehicle. Here, the maximum operating time may mean that the maximum operating time is specified for each individual vehicle, or it may be the sum of all respective maximum operating times.

[0128] Additionally, the second step may be to generate a route that can be operated within the maximum operating time per vehicle. For example, it may be to generate a dispatch plan that utilizes the shortest route to be moved within the maximum operating time.

[0129] Additionally, the third step may involve verifying the dispatch plan generated in the second step. For example, this may involve verifying whether the delivery according to the dispatch plan is carried out via the shortest distance and shortest time.

[0130] Additionally, Step 4 may involve exploring ways to achieve maximum efficiency by modifying the maximum travel time for the dispatch plan verified through Step 3. Specifically, this may involve modifying the maximum travel time so that the dispatch plan can be executed in the shortest time using the shortest route.

[0132] According to a second embodiment of the present disclosure, the first step may be such that the maximum operating time is arbitrarily set by a computing device for each of the dispatched vehicles.

[0133] For example, the computing device may be in the step of arbitrarily specifying a maximum operating time and calculating a travel route and travel time based on the specified maximum operating time. The arbitrarily specified maximum operating time may be set to 12 hours or less per day. This may be a case where personnel are deployed when a vehicle is in operation, and the maximum operating time is set within an environment where personnel can work.

[0135] According to a second embodiment of the present disclosure, the second step may be to generate a dispatch plan having a maximum travel route movable during the maximum travel time of each of the dispatch vehicles.

[0136] Here, the movable route is formed by roads that are movable and roads that are not, depending on the characteristics of each vehicle, and may be a route that travels on the movable roads. For example, it may be a maximum route that travels on movable roads during a pre-set maximum operating time. Additionally, the dispatch plan may be a plan that calculates the route for the maximum operating time of each vehicle and assembles the entire calculated route. The route may be the route of delivery vehicles based at each delivery destination.

[0138] According to a second embodiment of the present disclosure, the order information of the third step is delivery information including a departure point and a destination, and the dispatch plan may be classified as a possible dispatch plan if it enables delivery for the entire order information.

[0139] Here, a feasible dispatch plan refers to a case where a route is calculated within the maximum operating time for each vehicle, and all deliveries within the order information are completed along the entire calculated route. For example, if classified as a feasible dispatch plan, it means that all orders required for delivery according to the order information are deliverable.

[0140] However, the generated possible dispatch plan may allow the entire delivery to be completed using the full maximum operating time, or it may be completed within a time that falls short of the maximum operating time. For example, a possible dispatch plan may refer to a case where delivery is possible without exceeding the maximum operating time.

[0142] According to a second embodiment of the present disclosure, the third step may classify the dispatch plan as an impossible dispatch plan if delivery of the entire order information is impossible.

[0143] Here, an impossible dispatch plan refers to a case where the delivery of all order information cannot be completed within the maximum operating time of each vehicle. For example, it means that a dispatch plan was established with a route that utilizes the full maximum operating time of each vehicle, but there are still extra deliveries remaining. In cases classified as an impossible dispatch plan, additional dispatching is required for the extra deliveries, and this will be explained later.

[0145] According to the second embodiment of the present disclosure, the fourth step involves repeating the second and third steps by reducing the maximum operating time when the dispatch plan is classified as a possible dispatch plan, and when the changed maximum operating time is classified as an impossible dispatch plan, the dispatch plan for the maximum operating time before the change may be determined as the first modified dispatch plan.

[0146] Here, the first modified dispatch plan may be a dispatch plan in which the maximum travel time has a minimum value by proceeding through steps 1 to 4.

[0147] Furthermore, a feasible dispatch plan is one in which all order information can be delivered among dispatch plans based on arbitrary maximum operation times specified by the computing device; however, conversely, this implies that the number of delivery orders is low relative to the number of vehicles. For example, if the number of deliveries is too low, there may be vehicles that do not proceed with transportation at all. This can lead to a waste of manpower and vehicles.

[0148] Accordingly, the computing device may go through an additional step by adjusting the maximum operation time. Specifically, since delivery is completed within the maximum operation time, this may involve reducing the maximum operation time to recalculate the dispatch plan. For example, this could be to find the maximum operation time that maximizes efficiency while minimizing vehicle and operation time usage.

[0149] If the maximum operating time is reduced as described above, the feasibility or impossibility of the dispatch plan based on the changed maximum operating time is classified by going through the second and third stages again.

[0150] Here, if it is classified as a possible dispatch plan once again, the maximum travel time is reduced again, and the second and third stages can be performed using the reduced maximum travel time.

[0151] If the resulting dispatch plan is classified as an unusable dispatch plan, it is unusable as such, and a possible dispatch plan using the maximum operating time prior to the previous change may be classified as the first modified dispatch plan.

[0152] For example, when dispatching four vehicles, a dispatch plan is generated by setting the arbitrary maximum travel time to 8, 8, 8, 8. If the result is classified as a feasible dispatch plan, the dispatch plan may be regenerated by changing the arbitrary maximum travel time to 7, 7, 7, 7. Subsequently, if the dispatch plan based on the changed maximum travel time is classified as a feasible dispatch plan, the dispatch plan may be regenerated by changing the arbitrary maximum travel time to 6, 6, 6, 6. Furthermore, if the dispatch plan based on the changed maximum travel time is classified as an unfeasible dispatch plan, the dispatch plan using the previous maximum travel time of 7, 7, 7, 7 before the change may be determined as the first modified dispatch plan. Accordingly, it is possible to search for the value that minimizes the maximum travel time and maximize the operational efficiency of each vehicle.

[0154] According to a second embodiment of the present disclosure, in the fourth step, if the dispatch plan is classified as an impossible dispatch plan, the maximum operating time is extended and the second and third steps are repeated, and the dispatch plan for the changed maximum operating time can be determined as a second modified dispatch plan.

[0155] Here, an impossible dispatch plan implies that a dispatch plan based on an arbitrary maximum operation time specified by the computing device is impossible, so measures are taken to make dispatching possible. For example, the computing device extends and modifies the maximum operation time to proceed with additional steps 2 and 3. Accordingly, if the generated dispatch plan is classified as a possible dispatch plan, that possible dispatch plan may be determined as a second modified dispatch plan.

[0156] For example, if the server initially sets the maximum driving time to 7, 7, 7, 7 for 4 vehicles and generates a dispatch plan through Steps 2 and 3, but the dispatch plan is classified as an impossible dispatch plan, the maximum driving time is changed to 8, 8, 8, 8, and Steps 2 and 3 are additionally performed. If the subsequently generated dispatch plan is classified as an impossible dispatch plan, the maximum driving time is further changed to 9, 9, 9, 9, and Steps 2 and 3 are performed. If the subsequently generated dispatch plan is classified as a possible dispatch plan, that dispatch plan may be determined as the second modified dispatch plan. For example, a dispatch plan created by specifying the maximum driving time as 9, 9, 9, 9 may be determined as the second modified dispatch plan. Accordingly, this has the effect of ensuring maximum efficiency in dispatches where delivery is impossible with 4 vehicles.

[0158] According to a second embodiment of the present disclosure, if the maximum daily operating time of each of the dispatched vehicles in the modified dispatch plan exceeds a first preset value, additional vehicles may be assigned, and if the maximum daily operating time of each of the dispatched vehicles in the modified dispatch plan is less than a second threshold value, the number of vehicles may be reduced.

[0159] Here, the modified dispatch plan may include both the first modified dispatch plan and the second modified dispatch plan.

[0160] In addition, the first preset value may be a preset time value. For example, it may be 15 hours or less per day.

[0161] In addition, the second preset value may be a preset time value. For example, it may be 1 hour or more per day.

[0162] Additionally, adding vehicles may increase the number of vehicles used in the same area. For example, it could enable deliveries in cases where they are impossible. Conversely, it could reduce the number of vehicles if there are too many in the same area.

[0163] For example, if one or more vehicles among the maximum operating hours per vehicle according to the modified dispatch plan require operation exceeding the first preset value of 10 hours per day, the computing device may assign additional vehicles and regenerate them when specifying the initial arbitrary maximum operating hours. Additionally, if one or more vehicles among the maximum operating hours per vehicle according to the modified dispatch plan operate for less than the second preset value of 4 hours per day, the computing device may reduce the number of vehicles and regenerate them when specifying the initial arbitrary maximum operating hours. By establishing a dispatch plan using the number of vehicles and the maximum operating hours per vehicle as described above, the computing device can enable delivery within the same area to be carried out with the minimum number of vehicles and the minimum operating hours.

[0165] The step of generating a dispatch plan according to a second embodiment of the present disclosure may include: obtaining first zone information (610) including zone designation for each of a plurality of dispatch vehicles; generating second zone information (620) associated with the specified plurality of zones; registering the first zone information (610) and the second zone information (620) for the dispatch vehicles; and generating a zone dispatch plan using the registered first zone information (610) and the second zone information (620).

[0166] Here, the step of generating a dispatch plan may involve designating zones by vehicle, registering information for the designated zones, and generating a dispatch plan based on the registered zone information.

[0168] According to a second embodiment of the present disclosure with reference to FIG. 7, the first zone information (610) is a delivery zone for the dispatch vehicle, and the second zone information (620) may be an overlapping zone among a plurality of the first zone information (610).

[0169] Specifically, the zone information is information acquired by the computing device, which may be information entered by each vehicle, information stored in the computing device, or information acquired from the web. Additionally, the first zone information (610) may be information regarding a delivery zone for each vehicle, or a zone for multiple vehicles. Additionally, the second zone information (620) may be information regarding an overlapping area between the area according to the first zone information (610) and another area according to the first zone information (610). By managing the first zone information (610) and the second zone information (620) separately, the computing device can maximize the efficiency of product delivery.

[0170] The first zone information (610) obtained as described above is assigned to each vehicle, and the first zone information (610) assigned to each vehicle may represent different regions. Additionally, the second zone information (620) may separately manage information regarding the overlapping area between the area according to the first zone information (610) and the area according to a different first zone information (610). Accordingly, the first zone information (610) and the second zone information (620) can be registered for each dispatched vehicle to maximize management efficiency.

[0171] Here, the second zone information (620) may refer to a portion where multiple first zone information (610) overlap. For example, the second zone information (620) may be the first zone information (610) of the first vehicle (711), and may also be the first zone information (610) of the second vehicle (712).

[0173] According to a second embodiment of the present disclosure, the step of generating the dispatch plan generates a zone dispatch primary plan using the minimum travel path within the first zone information (610) that each of the dispatch vehicles has.

[0174] Here, each dispatch vehicle may have first zone information (610). The first zone information (610) is information about the zone to which the dispatch vehicle delivers, and when creating a plan for delivery in the zone, it may be used to search for the shortest route within the zone where delivery can be made. For example, it may be used to ensure delivery is made using the shortest time and shortest distance. However, the first zone dispatch plan is not a plan that uses the shortest time and shortest distance, and delivery can be made to the shortest time and shortest distance through additional steps. A detailed explanation will be provided later.

[0176] According to a second embodiment of the present disclosure, the step of generating the zone dispatch plan generates a zone dispatch second plan in which delivery for the second zone information (620) is excluded from the zone dispatch first plan for vehicles whose driving time is greater than or equal to a first threshold value.

[0177] Here, the threshold value may be a value arbitrarily set by the server, a value entered by a user using a computing device, or a value of a typical dispatch time. Additionally, it may be a value stored in the computing device or a value obtained by the computing device.

[0178] In addition, the first threshold value may generally be the daily operating time of the dispatched vehicle. For example, 8 hours per day is preferred but is not limited thereto, and various hours such as 10 hours or 12 hours can be set.

[0179] In addition, the primary zone dispatch plan may be for the shortest delivery route within each vehicle's zone, and accordingly, the driving time for each vehicle may differ. Among them, for vehicles whose driving time exceeds the first threshold value, the dispatch plan may be regenerated by excluding the delivery corresponding to the second zone information (620) from the primary zone dispatch plan.

[0180] For example, if the operating time of the first vehicle (711) is 8 hours or more, the existing route may have a path a-1 -> a-2 -> b-1 -> b-2 to deliver a and b, but the delivery of a and b corresponding to the second zone information (620) may be excluded and delivery may be made via a-3 and b-3, and the dispatch plan generated accordingly may be a second zone dispatch plan. In this second zone dispatch plan, the number of delivery destinations for the first vehicle (711) is reduced, and the delivery time is reduced. A detailed explanation of a and b excluded from delivery will be provided later.

[0182] According to the second embodiment of the present disclosure, among the second zone dispatch plans, the first zone containing vehicles with an operating time greater than or equal to a first threshold value may allow the dispatch of external vehicles.

[0183] Here, even though the second zone dispatch plan excludes deliveries corresponding to the second zone information (620), there may be cases where the operating time of the first vehicle (711) exceeds the first threshold, and accordingly, there may be surplus delivery destinations (P) that are canceled or excluded for deliveries within the first zone. Further details will be described later.

[0185] According to a second embodiment of the present disclosure, the step of generating the zone dispatch plan involves generating a zone dispatch third plan by additionally dispatching the order information of the second zone for vehicles in the zone dispatch first plan whose driving time is less than a first threshold value.

[0186] Here, the second vehicle (712) can make additional deliveries for deliveries outside the first zone if the operating time according to the zone dispatch first plan is less than the first threshold and there are no additional deliveries within the first zone of the second vehicle (712).

[0187] For example, delivery of a and b is excluded from the first vehicle (711), and additional dispatch for a and b becomes necessary. Additional dispatch can be carried out by the second vehicle (712). If the second vehicle (712) has a dispatch plan created through c-1 but the travel time for it is less than the first threshold of 8 hours, additional dispatch for a and b can be made. That is, the c-1 route is excluded, and a third zone dispatch plan is created, which is a dispatch plan that allows delivery of a and b to be made through the c-2 -> c-3 -> c-4 travel route. According to the third zone dispatch plan, delivery can be made without any gaps in the delivery destinations within the second zone information (620).

[0189] According to the second embodiment of the present disclosure, a vehicle whose operating time is less than the second threshold within the third zone dispatch plan may be additionally dispatched to the first zone by another vehicle.

[0190] Here, the second threshold value may be a value for the minimum daily operating time of a single vehicle. Specifically, it may be a general minimum daily operating time, or an arbitrary value entered by the server and the user. Preferably, it may be 4 hours, but is not limited thereto.

[0191] Here, vehicles with an operating time below the first threshold according to the third regional dispatch plan may result in a waste of vehicles and operating time. Accordingly, additional dispatching may be made.

[0192] Specifically, in the second phase of zone dispatching, which is the operation within the first zone for each vehicle, if the maximum operating time is exceeded, there may be delivery destinations where delivery is not made. Accordingly, delivery to such destinations may be assigned to an external vehicle.

[0193] For example, if a surplus delivery location (P) is generated because the first vehicle (711) is assigned but the driving time is exceeded, the operation of the surplus delivery location may be carried out by the third vehicle (713), whose driving time is less than the second threshold value of 4 hours. The operation of the first vehicle (711), which has excessive delivery and driving time, may be distributed to the third vehicle (713), which has poor delivery and driving time, thereby maximizing delivery efficiency per vehicle.

[0195] According to the second embodiment of the present disclosure, a first zone containing vehicles with an operating time of less than a second threshold value within the third zone dispatch plan may restrict the dispatch of external vehicles.

[0196] Specifically, even if the dispatch plan creation is completed within the first zone (710), which is a vehicle zone, if a vehicle with an operating time less than the second threshold value is included, it may be possible to restrict external vehicles from entering the first zone (710).

[0197] For example, the entry of external vehicles (E) into a first zone (710) that includes a second vehicle (712) with an operating time of less than 4 hours, which is a second threshold, and a third vehicle (713) that is a normal vehicle may be restricted. This means that dispatching to a delivery destination within the first zone that includes the second vehicle and the third vehicle has been completed, and there is a vehicle with an operating time of less than 4 hours, which is a second threshold. Accordingly, delivery of external vehicles to an internal delivery destination may be restricted.

[0198] Additionally, the computing device may be able to dispatch vehicles from a first zone (710) containing a second vehicle (712) with an operating time less than a second threshold value and a third vehicle (713) that is a normal vehicle to a first zone containing a first vehicle with an operating time greater than or equal to a first threshold value.

[0199] As described above, when a dispatch plan is generated according to the respective situations of the dispatch plans for zones 1 through 3, the corresponding dispatch plan is generated as the final dispatch plan. The generated final dispatch plan can be recommended to each vehicle.

[0201] The step of generating a dispatch plan according to a second embodiment of the present disclosure may include: registering zone information for a dispatch vehicle, wherein the zone information includes information on a preferred zone (810) or an avoided zone (820); generating a cost matrix using the zone information; adjusting the cost of the cost matrix using the zone information on the preferred zone (810) or the avoided zone (820); and generating a cost dispatch plan using the adjusted cost matrix.

[0202] Here, the preferred zone (810) may be information about the zone preferred by each vehicle, and the avoided zone (820) may be information about the zone avoided by each vehicle. For example, when creating a dispatch plan for Gangnam-gu, the first vehicle may set Gaepo-dong, Ilwon-dong, and Segok-dong as the avoided zone (820), and Daechi-dong, Yeoksam-dong, Nonhyeon-dong, and Cheongdam-dong as the preferred zone (810).

[0203] In addition, the server (100) where the zone information is registered may specify the cost for movement according to the delivery location and generate a dispatch plan for each cost.

[0205] According to a second embodiment of the present disclosure with reference to FIG. 8, the area information is designated by vehicle by a computing device, and the cost matrix can designate costs proportional to the distance traveled from any delivery location to an adjacent delivery location.

[0206] Here, the computing device designates the preferred zone (810) and the avoided zone (820), which are zone information, for each vehicle. Additionally, the cost matrix is ​​formed by a path (H) connecting multiple delivery destinations (M), and each path (H) has a cost value. The cost may be formed in proportion to the travel distance on the path moving from the first delivery destination to the second delivery destination.

[0207] The cost matrix described above is formed during the step of generating the cost matrix. Specifically, a cost matrix may be generated in which the cost based on the distance for each delivery location is specified.

[0209] According to a second embodiment of the present disclosure, the step of adjusting the cost may assign weights to the cost within the avoidance zone (820).

[0210] Here, the cost within the avoidance zone (820) of the cost adjustment step is assigned per route (H) including the delivery destination (M), and weights may be assigned to differentiate the avoidance zone (820) for each vehicle.

[0211] Here, the weight may be applied to the entire route (H) connected to a delivery destination located in the avoidance zone (820) within the entire cost matrix. In this case, the cost may be applied proportionally to the distance. For example, if a cost of 5 per 1 km is applied to a route within the preferred zone (810), a cost of 25 per 1 km is applied to a route within the avoidance zone (820), thereby applying five times the cost. Thus, when the computing device generates a dispatch plan based on the cost, it can distinguish between the preferred zone (810) and the avoidance zone (820) for each vehicle and prioritize the selection of a delivery destination in the preferred zone (810).

[0213] According to a second embodiment of the present disclosure, the step of adjusting the cost may reduce the cost for the overlapping area by 50% when the preferred area (810) and the avoided area (820) overlap.

[0214] Here, the matrix of the overlapping zone (y1) of the preferred zone (810) and the avoided zone (820) is a matrix formed separately from the matrix (z1) of the preferred zone (810) and the matrix of the avoided zone (x1). Specifically, the overlapping zone (y1) is an avoided zone (820), but since it is adjacent to the preferred zone (810), it may be a zone where delivery is possible flexibly, unlike the matrix of the avoided zone (x1).

[0215] Accordingly, it is possible to make some deliveries possible by having a lower cost compared to the matrix of the avoidance area (820). For example, if the cost of the avoidance area is 25 per 1 km, the cost of the overlapping area (y1) can be 12.5, which is 50% lower than the cost of the avoidance area.

[0217] According to a second embodiment of the present disclosure, the step of adjusting the cost may designate the group of delivery locations as low-cost delivery locations when a number of delivery locations having a value less than or equal to the average of the costs are grouped together.

[0218] Specifically, the low-cost delivery destination (w1) may be designated as a preferred zone matrix (z1), an overlapping zone matrix (y1), and an undesirable zone matrix (x1), respectively. This is because when the average of the weighted undesirable zone matrix (x1) and the unweighted preferred zone matrix (z1) is calculated, the cost of the preferred zone matrix (z1) can be designated as significantly lower.

[0219] Accordingly, if multiple delivery locations with a cost of 1 or less are generated within the preferred zone matrix (z1), they may be designated as separate low-cost delivery locations (w1), and costs may be assigned based on the travel path between the low-cost delivery location (w1) and other adjacent delivery locations (M). Such low-cost delivery locations (w1) can increase delivery efficiency (reduction of travel distance, saving of travel time, etc.) by grouping very close delivery locations (e.g., apartment complexes or shared living spaces), and can reduce the overload when the computing device calculates the dispatch plan. Subsequently, the low-cost delivery location (w1) may be used when establishing a dispatch plan with the same criteria (cost value per delivery location) as the existing other delivery locations (M).

[0221] According to a second embodiment of the present disclosure, the step of adjusting the cost can recover the cost weight for the overlapping area (y1) when the dispatch vehicle enters the overlapping area (y1) from the preferred area (810) according to the dispatch plan and delivers.

[0222] Specifically, in the step of generating a dispatch plan for a vehicle departing from a preferred zone (810), there may be cases where the vehicle enters an overlapping zone (y1) because the cost of entering the preferred zone (810) is lower. In such cases, when calculating the cost for the next delivery destination of the vehicle that entered the overlapping zone, the weight may be adjusted so that the cost for the overlapping zone is equal to the cost for the preferred zone (810). For example, a cost of 5 per km was assigned in the preferred zone (810) and a cost of 12.5 per km was assigned in the overlapping zone (y1), but when a dispatched vehicle enters the overlapping zone (y1), the cost in the overlapping zone (y1) may be changed to 5 per km to generate the dispatch plan. In this case, delivery can be made from a delivery location within the preferred area (810) to a delivery location in an overlapping area (y1) that is very close, and additional dispatch to adjacent delivery locations can be made, thereby maximizing delivery efficiency in the overall dispatch plan.

[0224] According to a second embodiment of the present disclosure, the step of generating the cost dispatch plan generates a dispatch plan that minimizes the cost, wherein, if the costs are the same, the dispatch plan is generated by selecting priority in order of shortest travel time.

[0225] As described above, the step of generating a dispatch plan according to the present disclosure may generate a dispatch plan based on cost. In this case, multiple dispatch plans may be generated, and the most efficient dispatch plan among the multiple dispatch plans must be selected. To this end, a computing device may select dispatch plans with the same cost and select priority among the selected dispatch plans in order of shortest vehicle operation time.

[0226] Here, travel time may be the sum of travel times required when executing a dispatch plan generated using cost for each vehicle. Specifically, the cost per vehicle may be minimized through cost values ​​based on travel distance, thereby minimizing the sum of the time required for operation.

[0227] Such dispatching at the same cost may involve various variables, such as travel distance or movement within a specific zone. Among these, cases with shorter travel times can maximize efficiency for each vehicle.

[0228] For example, among a z-dispatch plan and an x-dispatch plan having the same cost, the z-dispatch plan is formed so that delivery takes place only within the preferred zone (810), and when the x-dispatch plan enters an overlapping zone from the preferred zone (810), the x-dispatch plan that enters an overlapping zone having a higher cost compared to the preferred zone (810) may have a much shorter travel time compared to the z-dispatch plan that moves only within the preferred zone (810). Specifically, when entering an overlapping zone from the preferred zone (810), since the comparative cost is high, the travel distance between delivery destinations must be very short to enter. Accordingly, the travel time can be very short. By using this method, it may be possible to create a dispatch plan with a short travel distance between delivery destinations and a short travel time.

[0230] According to a second embodiment of the present disclosure, the step of adjusting the cost involves setting obstruction paths (including rivers, construction sites, and roads with heavy traffic) that hinder the movement of vehicles within the area, and the step of generating the dispatch plan involves generating the highest priority dispatch plan among the dispatch plans that exclude the dispatch plan containing the obstruction path from the dispatch plans having the priority as the final dispatch plan.

[0231] Here, obstruction paths include rivers, construction sites, and heavily congested roads. In other words, they can be any factor that hinders vehicle movement.

[0232] In addition, the highest priority dispatch plan can be the highest priority among the priority dispatch plans. For example, it could be a dispatch plan with the lowest cost, shortest travel time, and eliminated obstruction routes.

[0233] For example, since Cost lacks information regarding obstruction routes, it may have travel times that are not proportional to the delivery distance. To prevent this, obstruction routes are set separately, and by utilizing this, delivery time and distance can be minimized.

[0234] Finally, the highest priority dispatch plan with obstruction paths excluded ultimately generates a dispatch plan, which can then be recommended for each vehicle.

[0236] According to a second embodiment of the present disclosure, the step of generating the dispatch plan may include: generating a cluster in which a plurality of delivery locations are grouped according to the matching information; determining a priority among the clusters; and generating a first dispatch plan for each cluster.

[0237] Here, the matching information may be order information that can be delivered by vehicle as described above, and may refer to information including the delivery address by vehicle.

[0238] Accordingly, delivery destinations are separated by vehicle, and clustering of these destinations may be possible. Here, examples of clustering can be based on areas where multiple delivery destinations are clustered together, or on specific regions (districts, cities, etc.). Additionally, multiple delivery destinations may be selected for each vehicle, and multiple vehicles may exist for each delivery destination. For instance, 100 items requiring freezing may be selected for five refrigerated vehicles. Consequently, as multiple vehicles deliver goods to multiple destinations, an optimal dispatch plan may be required.

[0239] In addition, priorities can be determined among clusters. For example, optimal dispatching can be performed by forming clusters for multiple delivery locations and selecting priorities for each formed cluster to generate a first dispatch plan.

[0241] According to a second embodiment of the present disclosure, the step of determining priority among the clusters may be to determine the cluster closest to the starting point as the first priority cluster, determine the cluster with the shortest straight-line distance from the n-th priority cluster as the n+1-th priority, and determine the cluster including the destination as the final cluster.

[0242] Here, the starting point may vary by vehicle, may be the place where the vehicle's work begins, or may be the place where the vehicle is currently located. Accordingly, the cluster closest to the starting point of each vehicle can be formed as the first-priority cluster.

[0243] For example, as shown in FIG. 9 (a), clusters a1, b1, c1, and d1 may be formed, and their priorities may be determined. Specifically, referring to FIG. 9 (b), if the vehicle's starting point is close to a1, a1 may be designated as the first priority cluster, then cluster b1, which is close to the first priority cluster (a1), may be designated as the second priority cluster, cluster d1, which is close to the second priority cluster (b1), may be designated as the third priority cluster, and the remaining c1 cluster may be formed as the fourth priority cluster. Accordingly, a dispatch plan can be generated in the order of clusters a1 -> b1 -> d1 -> c1, in the order of first priority to fourth priority clusters.

[0244] By generating the first dispatch plan as described above, the delivery destination closest to the vehicle's origin (vehicle location and logistics warehouse, etc.) can become the first delivery destination, thereby enabling the generation of an optimal dispatch plan.

[0246] According to a second embodiment of the present disclosure, the step of generating the first dispatch plan can be generated for a delivery destination within the cluster in a direction toward the next priority cluster when driving from the starting delivery destination to the final delivery destination, and can generate a route as the dispatch plan that optimizes vehicle operation within the cluster.

[0247] Here, the delivery destinations within a cluster may be delivery destinations within each priority-selected cluster. For example, this may refer to delivery destinations within each cluster, such as a delivery destination within cluster a1, a delivery destination within cluster b1, etc.

[0248] The method of the present disclosure may proceed with delivery according to cluster priority, but may generate a separate plan for delivery destinations within the cluster. For example, with reference to FIG. 9 (c), clusters a1, b1, c1, and d1 each have multiple delivery destinations formed therein, and may generate a dispatch plan for the respective delivery destinations. Here, the dispatch plan may preferably be generated to utilize the shortest distance, but is not limited thereto, and may be generated to have the shortest travel time.

[0249] As described above, if priorities are selected between clusters and a dispatch plan is created for delivery destinations within a cluster, a first dispatch plan may be created to integrate them. For example, referring to FIG. 9 (d), a first dispatch plan may be created according to cluster priorities from the first delivery destination of cluster a1 to the last delivery destination of cluster c1 a1. Such a dispatch plan is designed to have the shortest distance or shortest time, which allows for the recommendation of an optimal dispatch plan.

[0251] The step of generating the dispatch plan according to the second embodiment of the present disclosure may further include the step of generating a second dispatch plan that includes preferred zone information and avoided zone information for each vehicle, and excludes delivery destinations included in the avoided zone information from the dispatch plan.

[0252] Here, the preferred zone information and the avoided zone information may be information regarding the zones preferred and the zones that each vehicle wishes to avoid. For example, with reference to FIG. 8, clusters a1, b1, c1, and d1 are formed, but if there is an avoided zone (S1) passing through the center, delivery (N1) for the avoided zone (S1) may be excluded. Accordingly, the delivery vehicle can travel in a straight line (M1) from the last delivery destination of cluster b1 to the first delivery destination of cluster d1. Accordingly, the first dispatch plan may generate a second dispatch plan in which delivery for N1 is excluded.

[0254] According to a second embodiment of the present disclosure, the second dispatch plan may additionally dispatch deliveries to delivery destinations (N2 and N3) that are close to the vehicle's travel route among the delivery destinations included in the vehicle's avoidance zone information (S1).

[0255] Here, the vehicle travel route may be a route for the avoidance zone in the first dispatch plan. For example, as shown in FIG. 10, delivery to nearby delivery destinations (N2, N3) may be added to the straight route (M1) in the avoidance zone.

[0257] According to a second embodiment of the present disclosure with reference to FIG. 11, the step of recommending the dispatch plan provides a dispatch plan result value interface for the optimal dispatch plan generated through the step of generating the dispatch plan, for each manager terminal and vehicle terminal, and the manager terminal and the vehicle terminal may be able to modify the dispatch plan result value.

[0258] Here, the dispatch plan result value interface may provide the result value of the generated second dispatch plan. For example, referring to FIG. 10, a map may be provided on at least a portion (right side), and the dispatch plan may be displayed on the map. By displaying it on the map, it can be easily verified by the viewer. Additionally, at least a portion (upper left side) may display information regarding the number of orders, number of drivers, estimated work time, total estimated travel distance, and total estimated volume for the dispatch plan. Additionally, at least a portion (lower left side) may display summary information regarding the vehicle drivers (number of orders, travel time, travel distance, volume, etc. for each driver).

[0259] In addition, after the result value interface is transmitted to each terminal, it may be possible to modify it using the terminal. For example, when Driver 1 performs deliveries for delivery destinations 1 through 5, it may perform operations such as changing the delivery order of 2 and 3, excluding or including deliveries, or handing them over to another driver.

[0260] In addition, the entire dispatch plan can be modified on the administrator terminal, while each vehicle terminal allows modifications within the dispatch plan of the corresponding vehicle.

[0261] In addition, various tasks can be performed, and the step of recommending a dispatch plan may utilize the method according to the third embodiment and / or the fourth embodiment described below.

[0263] A method for a computing device to provide an optimal dispatch service using a bar, according to a third embodiment of the present disclosure, may provide a dispatch plan result value interface generated according to a second embodiment based on information obtained through a first embodiment. This will be described in detail below.

[0265] According to a third embodiment of the present disclosure with reference to FIG. 12, the method may include: a step (D100) of providing a dispatch plan result value interface in the shape of a bar (I1322) to at least a portion; a step (D200) of moving the bar (I1322) based on user input received through the interface; a step (D300) of obtaining modification information for the dispatch plan result value generated by the movement of the bar (I1322); a step (D400) of recalculating the dispatch plan result value based on the modification information; and a step (D400) of providing a final dispatch plan recalculated through the recalculation step.

[0266] Here, the dispatch plan may be information already stored in the computing device, but is not limited thereto; it may be a dispatch plan generated by the computing device using an algorithm, or an optimal dispatch plan provided. For example, it may be a dispatch plan generated according to the first embodiment or the second embodiment.

[0267] Additionally, the bar (I1322) may be a horizontally formed bar-shaped icon. For example, the horizontal length may represent work time, and the thickness may represent the presence or absence of a delivery operation. Additionally, by establishing a dispatch plan for multiple vehicles, one bar may represent one delivery operation, and accordingly, the dispatch plan may include multiple bars.

[0268] Additionally, the modification information may be information changed through the dispatch plan result value interface. For example, if a delivery operation of a bar (I1322) shape is moved to a different time or a different vehicle, the modification information may be for a vehicle from which the bar is excluded or a vehicle to which the bar is added. Additionally, the modification information may be information modified by user input through the interface provided to the user. For example, if the dispatch order and time are modified due to the movement of the bar (I1322), the dispatch order and time may be the modification information.

[0269] In addition, the dispatch plan can be recalculated using the modification information. Specifically, the operation of recalculating the dispatch plan may follow the dispatch plan generation method according to the first or second embodiment, but is not limited thereto. Furthermore, the step of recalculating the dispatch plan may differ depending on whether the above bar is fixed or freely changed. Further details will be described later.

[0270] The dispatch plan result value recalculated as described above may be provided to the user as the final dispatch plan. In this case, an interface for the final dispatch plan may be provided. For example, it may be provided in the same form as the dispatch plan result value interface.

[0272] According to a third embodiment of the present disclosure with reference to FIG. 13, the step of providing the result value interface may include providing a map interface (I1310) in which a dispatch plan is displayed on a map in at least a portion, and providing a bar interface (I1320) in which a dispatch plan is displayed in the shape of a bar (I1322) in at least a portion, and the map interface (I1310) and the bar interface (I1320) may each include a maximize button.

[0273] Here, the result interface may be provided to include both a map interface (I1310) and a bar interface (I1320). For example, by providing the map interface (I1310) on the right and the bar interface (I1320) on the left, the route (including sequence) and dispatch time on the map can be grasped at a glance. In addition, a summary interface (I1330) may be included in addition to the map and bar interfaces (I1320). The summary interface (I1330) may include information regarding the total number of vehicles, number of orders, number of drivers, total time, and total travel distance, which are the results of the dispatch plan.

[0274] Additionally, the map interface (I1310) and the bar interface (I1320) may each include a map maximize button (I1311) and a bar maximize button (I1321). For example, the buttons may be located in at least a portion of the interface area, and when input is confirmed in which a user clicks the button, the interface may be activated to be displayed across the entire screen. Specifically, the map interface (I1310) may be displayed across the entire screen when activated, and the bar interface (I1320) may be provided so that its horizontal length fills the entire screen when activated. Since length implies time, the bar interface (I1320) may have a length greater than a certain amount and may include a scroll function to allow movement to the left and right. The scroll may vary depending on the proportion of the screen occupied by the bar interface (I1320), and if the bar interface (I1320) has a long length, the scroll may be shorter.

[0275] Additionally, in the bar interface (I1320), the bar may be a single delivery operation. Additionally, the length of the bar (I1322) may be a work time. The work time may include the work time for moving the vehicle for delivery, as well as for installation and collection.

[0277] According to a third embodiment of the present disclosure, the step (D200) of moving the bar may be to move to the very front of the dispatch order when the automatic optimization function is activated.

[0278] Here, the automatic optimization function maintains the same order of the bars when the position of the bars is moved by user input, and the moved bar may be moved to the very front of the dispatch plan for the corresponding vehicle. For example, with reference to FIGS. 14 and 15, FIGS. 14 and 15 may be windows in which the bar interface (I1320) is activated, FIG. 14 may be after the movement of bar number 7, FIG. 15 may be after the movement of bar number 2, and a single horizontal line of the bar interface (I1320) may be summary information for a single vehicle. For example, the first horizontal line may be the dispatch plan for vehicle number 1 and may include related information such as vehicle name, number of orders, work hours, and travel distance, and may be provided so that the dispatch plan can be checked at a glance through the bars.

[0279] For a specific example, the vehicles in FIGS. 14 and FIGS. 15 may be vehicles 1 through 5 in order from top to bottom. In the vehicle-specific dispatch plan provided in FIGS. 14, delivery address 7 (bar 7) of vehicle 1 may be moved to vehicle 2. Accordingly, delivery address 7 is moved to the very front of vehicle 2. In this case, the dispatch plan for vehicle 2 remains the same, and delivery address 7 information may be added to vehicle 2.

[0280] In addition, in the vehicle-specific dispatch plan provided in FIG. 15, delivery location 2 (bar 2) of vehicle 1 may be moved to vehicle 2. Accordingly, delivery location 2 is moved to the very front of vehicle 2. As described above, the user may have completed inputting the movement of delivery location 7 and delivery location 2 to vehicle 2.

[0282] According to a third embodiment of the present disclosure, the step (D400) of recalculating the dispatch plan result value may be to recalculate the optimal dispatch plan for the entire delivery location of the vehicle to which the bar (I1322) has moved.

[0283] Here, the recalculation may be a recalculation for vehicles modified from the existing dispatch plan. For example, as previously explained, delivery destinations 2 and 7 of vehicle 1 were moved to vehicle 2, and accordingly, the dispatch plan for vehicle 1 and vehicle 2 may be recalculated.

[0284] Additionally, the recalculation step may involve recalculating the dispatch using an existing algorithm when recalculating the dispatch plan. For example, it may involve generating a dispatch plan for delivery destinations 1, 3, 4, 5, 6, 8, and 9, excluding delivery destinations 2 and 7 from vehicle 1. Accordingly, the existing delivery destinations 1, 3, 4, 5, 6, 8, and 9 may be assigned a new order, and the existing order may also be reversed. Specifically, the dispatch order may be reversed to 3, 1, 5, 4, 6, 8, and 9, and along with this, new delivery destination names may be assigned according to the dispatch order. The above order may be generated as an optimal dispatch plan by the algorithm. Here, the optimal dispatch plan may be a plan where the vehicle's travel distance is the shortest distance and the travel time is the shortest time.

[0286] According to the third embodiment of the present disclosure, the step (D200) of moving the bar (I1322) includes an arbitrary order change function, and when the arbitrary order change function is activated, the bar (I1322) can be moved to a dispatch order corresponding to the position to which the bar was moved.

[0287] Here, the arbitrary order change function may specify the dispatch order based on the drop position when the user drags and drops the bar, when the dispatch plan is modified due to the movement of the bar. For example, referring to FIGS. 16 and 17, the vehicles in FIGS. 16 and 17 may be vehicles 1 through 5 in order from top to bottom. As shown in FIG. 16, vehicles 3 and 4 may have a dispatch order determined by delivery location according to the dispatch plan. Here, if delivery location 9 of vehicle 4 is placed between delivery locations 4 and 5 of vehicle 3, delivery location 9 of vehicle 4 is located between delivery locations 4 and 5 of vehicle 3, and accordingly, the dispatch order of vehicle 3 may be fixed in the order of 1, 2, 3, 4, 9 (delivery location 9 of vehicle 4), 5, and 6. In addition, the dispatch order of vehicle 4 may be fixed in the order of delivery destinations 1, 2, 3, 4, 5, 6, 7, 8, and 10.

[0289] According to the third embodiment of the present disclosure, the step (D400) of recalculating the dispatch plan result value may be to recalculate the dispatch time while maintaining the dispatch order according to the moved bar (I1322).

[0290] Here, the recalculation step may be performed based on information with an arbitrary change in order. For example, the recalculation may be performed using an existing algorithm, but the entire dispatch order may be fixed, or the order may be fixed only for delivery destinations where the movement of the bar (I1322) has been confirmed. As a specific example, the dispatch order of vehicle 3 may be 1, 2, 3, 4, 9 (delivery destination 9 of vehicle 4), 5, and 6, and delivery destination 9 may be delivered in the middle, while the work time for delivery destinations after delivery destination 9 is modified. Additionally, while the 5th delivery to delivery destination 9 is fixed, a new dispatch plan may be generated for all remaining delivery destinations.

[0292] According to the third embodiment of the present disclosure, the step of recalculating the dispatch plan result value (D300) is recalculated based on the user's recalculation input, and the step of providing the final dispatch plan (D400) may provide the initial dispatch plan and the recalculated dispatch plan separately by distinguishing between them.

[0293] Here, the final dispatch plan, which is a recalculated dispatch plan, may be provided to the user terminal. For example, it may utilize the dispatch plan result interface format as is. It may provide an interface in which the dispatch plan on the map is displayed on the right and the dispatch plan in bar form is displayed on the left in chronological order.

[0294] In addition, for example, the initial dispatch plan result value and the recalculated dispatch plan result value may be provided in a way that distinguishes them. Specifically, while displaying the recalculated dispatch plan result value, the user may be able to select and verify a desired result value from among the initially calculated dispatch plan result value or the previously recalculated result value. Furthermore, the recalculation of the dispatch plan may be performed using a method according to an embodiment of the present disclosure.

[0295] Additionally, the recalculation step may be based on the user's recalculation input. For example, it is preferable to obtain modification information based on user input and perform recalculation when the user presses the recalculation button after the input of the modification information is completed, but this is not limited thereto, and recalculation may be performed immediately upon the input of the modification information.

[0297] According to a third embodiment of the present disclosure, the step of providing the result value interface further includes a summary interface (I1330), and the summary interface (I1330) may further include a dispatch plan tab (I1331) capable of verifying an initial dispatch plan and a recalculated dispatch plan.

[0298] Here, the summary interface (I1330) is an interface that outlines a summary of the dispatch plan and may include information regarding orders and vehicle movements as previously described. In addition, it may include a plurality of dispatch plan tabs (I1331). Here, the dispatch plan tabs (I1331) may include both the initial dispatch plan result and the multiple recalculated dispatch plan result. For example, the dispatch plan tabs (I1331) may include the optimization result, which is the initial dispatch plan result, and the first recalculated provisional result (2), the second recalculated provisional result (3), the third recalculated provisional result (4), and the fourth recalculated provisional result (5). Here, each of the multiple provisional results generates a dispatch plan and is provided in an interface format, and the dispatch plan for the corresponding tab can be checked by clicking one of the multiple tabs.

[0300] According to a fourth embodiment of the present disclosure, a method for a computing device to provide a bar-type interface for a dispatch plan by delivery location comprises: a step of generating a result value interface including a bar interface formed by a bar having a thickness according to the dispatch plan and a gap between the bar; and a step of providing the result value interface, wherein the horizontal length of the bar is determined based on the time required for the work, and the gap may be determined based on the vehicle's travel time and the waiting time until the next work.

[0301] Here, the dispatch plan may be generated by creating a dispatch plan for each delivery location based on multiple vehicles and multiple order information. Additionally, the dispatch plan may be generated using the method according to the second embodiment. Furthermore, when generating a result value interface using the dispatch plan, the size of the bar may be determined based on the dispatch time, delivery location, work time, etc., according to the dispatch plan.

[0302] Additionally, the bar may represent a delivery task during the dispatch plan and may be a rod-shaped bar having a certain length.

[0303] In addition, the result value is a result value according to the generated dispatch plan, for example, it may indicate that vehicle number 1 moves 50km for 10 hours to complete 10 delivery jobs. Along with this, the result value interface may be an interface for displaying the result value on a monitor so that the user can easily check it.

[0304] The result value interface generated as described above may be provided to the user.

[0305] Additionally, the user can easily check the dispatch plan using the provided result interface and modify the dispatch plan by moving the bar in a drag-and-drop manner. Here, the computing device may recognize the movement of the bar to acquire the modified dispatch plan and generate it as modification information.

[0307] According to a fourth embodiment of the present disclosure, the method may further include: a step of obtaining modification information through the movement of the bar based on user input after the step of providing the result value interface; and a step of providing a final dispatch plan that recalculates the dispatch plan according to the user input based on the modification information.

[0308] Here, a dispatch plan may be recalculated based on the delivery destination per vehicle according to the modification information. This recalculated dispatch plan may be provided back to the user as the final dispatch plan.

[0309] Additionally, a recalculation may be performed when the user finishes inputting the modification information and confirms the user's input for the recalculation. The recalculated final dispatch plan may be finally provided to the user.

[0311] According to a fourth embodiment of the present disclosure, the result value interface further includes a map interface that displays the dispatch plan on a map, and the blank space may include a solid line representing the vehicle's travel time and a dotted line representing the waiting time until the next operation.

[0312] Here, the bar interface may display delivery tasks according to the vehicle's dispatch plan in a bar format. The bar may be a rod shape having a length.

[0313] In addition, the map interface may display delivery tasks by vehicle according to the dispatch plan on a map. Further details will be described later.

[0314] Additionally, the bar may be in the shape of a rod with a horizontal length and may have a fixed length. Here, the length may correspond to the work time required for each delivery location according to the dispatch plan. For example, if the length of the bar for a delivery location requiring 1 hour of work is 1 cm, the length of the bar for a delivery location requiring 2 hours of work may be 2 cm. If the time required is doubled, the length of the bar may be doubled. Furthermore, the bar may have a fixed thickness; while the thickness of all bars may be the same, it is not limited to this, and it may have a size that does not exceed the horizontal axis interface of the vehicle. This may have the effect of forming a physical object that the user can easily verify.

[0315] In addition, a line may be formed between the bars. The line may represent the travel time of the vehicle, and its length may represent time. Also, the length may be equal to the length of the bars. For example, if the length of the bars is 1 cm and represents 1 hour, the length of the line may represent 1 cm and represent 1 hour.

[0316] Additionally, the lines may include solid and dotted lines. Here, the solid and dotted lines may be determined based on time. Specifically, the solid line may represent the vehicle's travel time, and the dotted line may represent the waiting time until the estimated delivery time or the start of the work. For example, if the vehicle travels for one hour to the next delivery location and starts the work after waiting for one hour, the line between the delivery locations may be formed by a solid line of 1 cm and a dotted line of 1 cm, and a bar for the next delivery location may be formed after the dotted line.

[0317] As described above, the dispatch plan and vehicle movement can be formed using bars and lines so that the user can easily check them.

[0319] According to the fourth embodiment of the present disclosure, the bar of the bar interface can display dispatch order information on at least a portion.

[0320] Here, the bar has a length and, as it also has a thickness, the user can easily verify it.

[0321] In addition, the bar may display order information in at least a portion of it. For example, referring to FIG. 13, the dispatch order may be displayed in the middle of the bar (I1322). Accordingly, this has the effect of allowing the dispatch order to be checked via the bar without having to search for it. As another example, if the delivery time is short, the length of the bar may be very short. Accordingly, if the bar becomes smaller than the number corresponding to the dispatch order, the number may not be displayed. In such cases, due to the very short bar, the number of bars displayed on the entire bar interface increases, and the order can be checked by the number written on the adjacent bar among the increased number of bars.

[0323] According to the fourth embodiment of the present disclosure, when the dispatch time of the bar becomes very short, it is provided in the shape of a bar with a thin width, and the bar interface can display the number of times the dispatch vehicle moves to the delivery location due to the movement when the movement of the bar causes the dispatch vehicle to move to the delivery location.

[0324] Here, the number of moves can be formed, for example, in the space between the vehicle information and the bar in the bar interface. Accordingly, the vehicle and the number of moves can be easily identified.

[0325] Additionally, the bar interface may include a bar area, a movement count area, and a vehicle summary information area. The bar area is the part where multiple bars are formed according to the dispatch plan, and this part may be movable to the side screen via scrolling. The movement count area may have the smallest area in the bar interface and may display the number of movements per vehicle. The vehicle summary information area may include the number of orders, travel distance, travel time, and load capacity of the corresponding vehicle.

[0326] As described above, only the bar area can be moved via scrolling, while the summary information and movement count areas are fixed so that the user can always check them, thereby enabling easy verification of the dispatch plan.

[0328] According to a fourth embodiment of the present disclosure, the bar interface may further include an automatic optimization tab that positions the bar at the very front of the vehicle to which it has been moved, and an arbitrary order change tab that has a dispatch order according to the position to which the bar has been moved.

[0329] Here, the Auto Optimization tab and the Random Reorder tab may be activated when user input is detected. For example, if input for Auto Optimization is detected, the corresponding tab may be spotlighted and the feature applied.

[0330] More specifically, automatic optimization may involve positioning the moved vehicle's dispatch plan at the very front when the bar moves based on user input. For example, if delivery destination (bar) 3 of vehicle 2 moves to vehicle 1, it may be placed at the very front of vehicle 1, and the vehicle's movement count may increase by one. Additionally, delivery destination 3 (bar) at the front undergoes optimization through a subsequent recalculation step.

[0331] Additionally, the arbitrary order change tab may maintain the dispatch order of the moved position when the bar is moved according to user input. For example, if the 3rd delivery location (bar) of vehicle 2 moves between the 5th delivery location (bar) and the 6th delivery location (bar) of vehicle 1, the 3rd delivery location may become the 6th delivery location of vehicle 1 in the final dispatch plan generated through a subsequent recalculation step.

[0333] According to a fourth embodiment of the present disclosure, the map interface includes at least one pin formed at a vehicle-specific departure point, destination point, and delivery point location on a map, and the pin may have a different color for each dispatched vehicle.

[0334] Here, the map interface displays the dispatch plan on a map, allowing users to easily check the travel route according to the dispatch plan. Additionally, it may include pins to check the delivery destination according to the dispatch plan.

[0335] Here, the pin may be located at the shipping address and may indicate the delivery order for that shipping address.

[0336] Here, the pins can have different forms for the origin, destination, and delivery locations, respectively. For example, the pin corresponding to the delivery location could be an inverted teardrop shape with a number displayed inside. Additionally, the origin pin could have 'Start' written in the location where the number is written, and the destination pin could have 'End' written in the location where the number is written.

[0337] In addition, pins may have different colors depending on the vehicle. For example, if vehicle 1 delivers to delivery locations 1 through 10 and vehicle 2 delivers to delivery locations 11 through 20, the dispatch plan for delivery locations 1 through 10 may be displayed in red, and the dispatch plan for delivery locations 11 through 20 may be displayed in yellow.

[0339] According to a fourth embodiment of the present disclosure, the step of generating the result value interface may further generate a summary interface comprising at least one of an initial dispatch plan and a modified dispatch plan in at least a portion.

[0340] Here, the summary interface may include information such as the number of vehicles, number of orders, total travel time, total travel distance, and volume according to the dispatch plan.

[0341] Additionally, the initial dispatch plan may be displayed, but the dispatch plan recalculated based on modification information may also be displayed. For example, it may include an initial dispatch plan tab and multiple recalculated temporary result tabs. If the user selects the optimal result tab based on the initial dispatch plan, a result value interface for the initial dispatch result may be displayed; if the user selects a recalculated temporary result, a result value interface corresponding to that result may be displayed. Here, the result value interface may include a bar interface based on the dispatch plan, a map interface, and a summary interface.

[0342] Accordingly, you can compare and verify the initial dispatch plan and the modified dispatch plan by selecting a tab.

[0344] FIG. 18 is a drawing for explaining a computing device (100) according to one embodiment of the present disclosure.

[0345] This is merely an example showing a simplified configuration of the computing device (100) illustrated in FIG. 18. In the first to fourth embodiments of the present disclosure, the computing device (100) may include other configurations for performing the computing environment of the computing device (100), and only some of the disclosed configurations may constitute the computing device (100).

[0346] The computing device (100) may include a processor (110), memory (130), and a network unit (150).

[0347] The processor (110) may be composed of one or more cores and may include processors for data analysis and deep learning, such as a central processing unit (CPU) of a computing device, a general purpose graphics processing unit (GPGPU), and a tensor processing unit (TPU). The processor (110) may read a computer program stored in memory (130) and perform data processing for machine learning according to one embodiment of the present disclosure. According to one embodiment of the present disclosure, the processor (110) may perform calculations for learning a neural network. The processor (110) may perform calculations for learning a neural network, such as processing input data for learning in deep learning (DL), extracting features from input data, calculating errors, and updating the weights of the neural network using backpropagation. At least one of the CPU, GPGPU, and TPU of the processor (110) may process the learning of a network function. For example, a CPU and a GPGPU can work together to process the learning of a network function and data classification using the network function. Additionally, in one embodiment of the present disclosure, processors of a plurality of computing devices can be used together to process the learning of a network function and data classification using the network function. Furthermore, a computer program executed on a computing device according to one embodiment of the present disclosure may be a CPU, GPGPU, or TPU executable program.

[0348] According to one embodiment of the present disclosure, the memory (130) can store any form of information generated or determined by the processor (110) and any form of information received by the network unit (150).

[0349] According to one embodiment of the present disclosure, the memory (130) may include at least one type of storage medium among a flash memory type, a hard disk type, a multimedia card micro type, a card type memory (e.g., SD or XD memory), RAM (Random Access Memory), SRAM (Static Random Access Memory), ROM (Read-Only Memory), EEPROM (Electrically Erasable Programmable Read-Only Memory), PROM (Programmable Read-Only Memory), magnetic memory, a magnetic disk, and an optical disk. The computing device (100) may operate in conjunction with web storage that performs the storage function of the memory (130) on the internet. The description of the memory described above is merely an example and the present disclosure is not limited thereto.

[0350] A network unit (150) according to one embodiment of the present disclosure can use various wired communication systems such as a public switched telephone network (PSTN), xDSL (x Digital Subscriber Line), RADSL (Rate Adaptive DSL), MDSL (Multi Rate DSL), VDSL (Very High Speed ​​DSL), UADSL (Universal Asymmetric DSL), HDSL (High Bit Rate DSL), and a local area network (LAN).

[0351] In addition, the network unit (150) presented in this specification may use various wireless communication systems such as CDMA (Code Division Multi Access), TDMA (Time Division Multi Access), FDMA (Frequency Division Multi Access), OFDMA (Orthogonal Frequency Division Multi Access), SC-FDMA (Single Carrier-FDMA), and other systems.

[0352] In the present disclosure, the network unit (150) can be configured regardless of the communication mode, such as wired and wireless, and can be configured as various communication networks, such as a Personal Area Network (PAN) or a Wide Area Network (WAN). In addition, the network may be a known World Wide Web (WWW) and may utilize wireless transmission technology used for short-range communication, such as Infrared Data Association (IrDA) or Bluetooth.

[0354] FIG. 19 is a general schematic diagram of an exemplary computing environment in which embodiments of the present disclosure may be implemented.

[0355] Although the present disclosure has been described as generally being implementable by a computing device, those skilled in the art will understand that the present disclosure may be implemented in combination with computer-executable instructions and / or other program modules that can be executed on one or more computers, and / or as a combination of hardware and software.

[0356] Generally, a program module includes routines, programs, components, data structures, etc., that perform a specific task or implement a specific abstract data type. Furthermore, those skilled in the art will be well aware that the method of the present disclosure may be implemented in other computer system configurations, including single-processor or multi-processor computer systems, minicomputers, mainframe computers, as well as personal computers, handheld computing devices, microprocessor-based or programmable consumer electronics, etc. (each of which may be connected to and operated with one or more associated devices).

[0357] The embodiments described in this disclosure may also be implemented in a distributed computing environment in which tasks are performed by remote processing devices connected via a communication network. In a distributed computing environment, program modules may be located in both local and remote memory storage devices.

[0358] Computers typically include various computer-readable media. Any medium accessible by a computer may be a computer-readable medium, and such computer-readable media include volatile and non-volatile media, transitory and non-transitory media, and removable and non-removable media. By example, but not limiting, computer-readable media may include computer-readable storage media and computer-readable transmission media. Computer-readable storage media include volatile and non-volatile media, transitory and non-transitory media, and removable and non-removable media implemented by any method or technique for storing information such as computer-readable instructions, data structures, program modules, or other data. Computer-readable storage media include, but are not limited to, RAM, ROM, EEPROM, flash memory or other memory technologies, CD-ROM, DVD (digital video disk) or other optical disk storage devices, magnetic cassettes, magnetic tapes, magnetic disk storage devices or other magnetic storage devices, or any other media that can be accessed by a computer and used to store desired information.

[0359] Computer-readable transmission media typically include all information transmission media that implement computer-readable instructions, data structures, program modules, or other data, etc., on a modulated data signal, such as a carrier wave or other transport mechanism. The term modulated data signal means a signal in which one or more of the characteristics of the signal are set or modified to encode information within the signal. By example, not limiting, computer-readable transmission media include wired media, such as wired networks or direct-wired connections, and wireless media, such as acoustic, RF, infrared, and other wireless media. Any combination of the media described above is also considered to be within the scope of computer-readable transmission media.

[0360] An exemplary environment (1100) for implementing various aspects of the present disclosure, including a computer (1102), is shown, wherein the computer (1102) includes a processing unit (1104), system memory (1106), and a system bus (1108). The system bus (1108) connects system components, including system memory (1106) (but not limited thereto), to the processing unit (1104). The processing unit (1104) may be any processor among various commercial processors. Dual processor and other multiprocessor architectures may also be used as the processing unit (1104).

[0361] The system bus (1108) may be any of several types of bus structures that can be additionally interconnected to a local bus using any of the memory bus, peripheral bus, and various commercial bus architectures. System memory (1106) includes read-only memory (ROM) (1110) and random access memory (RAM) (1112). The basic input / output system (BIOS) is stored in non-volatile memory (1110), such as ROM, EPROM, EEPROM, etc., and this BIOS includes basic routines that help transfer information between components within the computer (1102) at times such as during startup. The RAM (1112) may also include high-speed RAM, such as static RAM, for caching data.

[0362] The computer (1102) also includes an internal hard disk drive (HDD) (1114) (e.g., EIDE, SATA)—this internal hard disk drive (1114) may also be configured for external use within a suitable chassis (not shown)—a magnetic floppy disk drive (FDD) (1116) (e.g., for reading from or writing to a removable diskette (1118)), and an optical disk drive (1120) (e.g., for reading from a CD-ROM disk (1122) or reading from or writing to other high-capacity optical media such as a DVD). The hard disk drive (1114), the magnetic disk drive (1116), and the optical disk drive (1120) may each be connected to the system bus (1108) by a hard disk drive interface (1124), a magnetic disk drive interface (1126), and an optical drive interface (1128). The interface (1124) for implementing an external drive includes at least one or both of USB (Universal Serial Bus) and IEEE 1394 interface technologies.

[0363] These drives and associated computer-readable media provide non-volatile storage of data, data structures, computer-executable instructions, etc. In the case of a computer (1102), the drives and media correspond to storing any data in a suitable digital format. Although the description of computer-readable media above refers to HDDs, removable magnetic disks, and removable optical media such as CDs or DVDs, those skilled in the art will know that other types of computer-readable media, such as zip drives, magnetic cassettes, flash memory cards, cartridges, etc., may also be used in exemplary operating environments and that any of these media may contain computer-executable instructions for performing the methods of the present disclosure.

[0364] A number of program modules, including an operating system (1130), one or more application programs (1132), other program modules (1134), and program data (1136), may be stored in the drive and RAM (1112). All or part of the operating system, application, module and / or data may also be cached in RAM (1112). It will be well known that the present disclosure may be implemented in various commercially available operating systems or combinations of operating systems.

[0365] The user can input commands and information into the computer (1102) through one or more wired / wireless input devices, such as a pointing device like a keyboard (1138) and a mouse (1140). Other input devices (not shown) may include a microphone, an IR remote control, a joystick, a game pad, a stylus pen, a touch screen, etc. These and other input devices are often connected to the processing unit (1104) via an input device interface (1142) connected to the system bus (1108), but may also be connected via other interfaces such as a parallel port, an IEEE 1394 serial port, a game port, a USB port, an IR interface, etc.

[0366] A monitor (1144) or other type of display device is also connected to the system bus (1108) via an interface such as a video adapter (1146). In addition to the monitor (1144), the computer generally includes other peripheral output devices (not shown), such as speakers, a printer, and so on.

[0367] The computer (1102) may operate in a networked environment using a logical connection to one or more remote computers, such as remote computer(s) (1148), via wired and / or wireless communication. The remote computer(s) (1148) may be a workstation, a computing device computer, a router, a personal computer, a portable computer, a microprocessor-based entertainment device, a peer device, or other conventional network node, and generally include many or all of the components described for the computer (1102), but for brevity, only the memory storage device (1150) is illustrated. The illustrated logical connection includes a wired / wireless connection to a local area network (LAN) (1152) and / or a larger network, e.g., a wide area network (WAN) (1154). Such LAN and WAN networking environments are common in offices and companies and facilitate enterprise-wide computer networks, such as intranets, all of which can be connected to a global computer network, e.g., the Internet.

[0368] When used in a LAN networking environment, the computer (1102) is connected to a local network (1152) via a wired and / or wireless communication network interface or adapter (1156). The adapter (1156) may facilitate wired or wireless communication to the LAN (1152), and the LAN (1152) may also include a wireless access point installed therein to communicate with the wireless adapter (1156). When used in a WAN networking environment, the computer (1102) may include a modem (1158), be connected to a communication computing device on the WAN (1154), or have other means to establish communication through the WAN (1154), such as through the Internet. The modem (1158), which may be an internal or external and a wired or wireless device, is connected to the system bus (1108) via a serial port interface (1142). In a networked environment, the program modules described for the computer (1102) or parts thereof may be stored in a remote memory / storage device (1150). It will be well known that the illustrated network connection is exemplary and that other means of establishing a communication link between computers may be used.

[0369] The computer (1102) operates to communicate with any wireless device or object that is deployed and operated via wireless communication, for example, a printer, scanner, desktop and / or portable computer, PDA (portable data assistant), communication satellite, any equipment or place associated with a wireless detectable tag, and a telephone. This includes at least Wi-Fi and Bluetooth wireless technologies. Accordingly, the communication may be a predefined structure as in a conventional network, or simply ad hoc communication between at least two devices.

[0370] Wi-Fi (Wireless Fidelity) enables connectivity to the Internet and other sources without wires. Wi-Fi is a wireless technology, similar to a cell phone, that allows devices, such as computers, to transmit and receive data indoors and outdoors—that is, anywhere within the coverage area of ​​a base station. Wi-Fi networks use a wireless technology called IEEE 802.11 (a, b, g, etc.) to provide secure, reliable, and high-speed wireless connections. Wi-Fi can be used to connect computers to each other, to the Internet, and to wired networks (using IEEE 802.3 or Ethernet). Wi-Fi networks can operate in unlicensed 2.4 and 5 GHz wireless bands, for example, at data rates of 11 Mbps (802.11a) or 54 Mbps (802.11b), or in products that include both bands (dual band).

[0371] Those skilled in the art of the present disclosure will understand that information and signals may be represented using any various different technologies and techniques. For example, data, instructions, commands, information, signals, bits, symbols, and chips that may be referenced in the above description may be represented by voltages, currents, electromagnetic waves, magnetic fields or particles, optical fields or particles, or any combination thereof.

[0372] Those skilled in the art will understand that the various exemplary logic blocks, modules, processors, means, circuits, and algorithm steps described in connection with the embodiments disclosed herein may be implemented by electronic hardware, various forms of programs or design code (referred to herein as software for convenience), or a combination of all such. To clearly illustrate this interoperability between hardware and software, various exemplary components, blocks, modules, circuits, and steps have been generally described above in relation to their functions. Whether such functions are implemented as hardware or software depends on the design constraints imposed on the specific application and the overall system. Those skilled in the art may implement the functions described in various ways for each specific application, but such implementation decisions should not be interpreted as being outside the scope of this disclosure.

[0373] The various embodiments presented herein may be implemented as methods, devices, or articles manufactured using standard programming and / or engineering techniques. The term "article manufactured" includes a computer program, a carrier, or a medium accessible from any computer-readable storage device. For example, computer-readable storage media include, but are not limited to, magnetic storage devices (e.g., hard disks, floppy disks, magnetic strips, etc.), optical discs (e.g., CDs, DVDs, etc.), smart cards, and flash memory devices (e.g., EEPROMs, cards, sticks, key drives, etc.). Additionally, the various storage media presented herein include one or more devices and / or other machine-readable media for storing information.

[0374] It should be understood that the specific order or hierarchy of steps in the presented processes is an example of exemplary approaches. It should be understood that the specific order or hierarchy of steps in the processes may be rearranged within the scope of this disclosure based on design priorities. The appended method claims provide elements of various steps in a sample order, but do not imply being limited to the specific order or hierarchy presented.

[0375] Description of the presented embodiments is provided so that a person skilled in the art may use or practice the present disclosure. Various modifications to these embodiments will be apparent to a person skilled in the art, and the general principles defined herein may be applied to other embodiments without departing from the scope of the present disclosure. Thus, the present disclosure is not limited to the embodiments presented herein, but should be interpreted in the broadest possible scope consistent with the principles and novel features presented herein.

Claims

Claim 1 A step of obtaining order information including at least one of customer information, estimated volume, desired time, and dispatch priority, and vehicle information including at least one of origin, destination, maximum volume, vehicle type, and drivable roads; a step of matching the order information and vehicle information obtained in the step of obtaining the information; and a step of generating a dispatch plan based on the delivery destination information matched through the matching step. A method for a computing device to provide an optimal dispatch service, comprising: a step of recommending the dispatch plan; wherein the step of recommending the dispatch plan provides a result value interface of the dispatch plan to a manager terminal and a vehicle terminal, and the manager terminal and the vehicle terminal are capable of modifying at least a portion of the delivery orders of the dispatch plan to be transferred from one vehicle to another based on matched delivery destination information; the result value interface of the dispatch plan includes a bar interface formed by a bar having a thickness according to the dispatch plan and a space between the bar; the horizontal length of the bar is determined based on the time required for the operation, and the space is determined based on at least one of the vehicle's travel time and the waiting time until the next operation; and the modification of the manager terminal and the vehicle terminal transferring at least a portion of the delivery orders of the dispatch plan to another vehicle based on matched delivery destination information is performed by obtaining modification information through the movement of the bar between vehicles based on user input, and further comprising a step of providing a final dispatch plan based on the modification information. Claim 2 A method for a computing device to provide an optimal dispatch service, wherein, in claim 1, the step of matching the information comprises: a matching information selection step of classifying a delivery address according to deliverable order information among the vehicle information as matching information, and selecting the matching information for each vehicle. Claim 3 In paragraph 2, the order information further includes assigned driver information, the vehicle information further includes performable task information, and the step of matching the information is to deliver using a driver and vehicle capable of performing the installation or collection task when an installation or collection task is required during delivery of a product according to the order information, wherein the performable task information further includes the estimated time required to perform the task. A method in which a computing device provides an optimal dispatch service. Claim 4 A method for a computing device to provide an optimal dispatch service, wherein the step of generating the dispatch plan comprises: generating a cluster in which a plurality of delivery locations are grouped according to the matching information; determining a priority among the clusters; and generating a first dispatch plan for each cluster. Claim 5 A method for a computing device to provide an optimal dispatch service, wherein, in paragraph 4, the step of determining priority among the clusters comprises determining the cluster closest to the starting point as the 1st priority cluster, determining the cluster with the shortest straight-line distance from the nth priority cluster as the n+1th priority, and determining the cluster including the destination as the final cluster. Claim 6 In claim 5, the step of generating a first dispatch plan for each cluster comprises generating, for a delivery destination within the cluster, a direction toward the next priority cluster when driving from a departure delivery destination to a final delivery destination, and generating a route within the cluster that is optimal for vehicle operation as a dispatch plan, wherein a computing device provides an optimal dispatch service. Claim 7 A method for a computing device to provide an optimal dispatch service, wherein, in claim 6, the step of generating the dispatch plan includes, for each vehicle, a preferred zone information and an avoided zone information, and further comprises the step of generating a second dispatch plan in which delivery destinations included in the avoided zone information are excluded from the dispatch plan. Claim 8 In claim 7, the second dispatch plan is a method in which a computing device provides an optimal dispatch service by adding a delivery to a delivery location that is close to the vehicle travel route among the delivery locations included in the avoidance zone information.

Images