Method by which computing apparatus provides optimal vehicle dispatch service by using bars

Abstract

The present invention comprises the steps of: providing, in at least a portion, an interface for results of vehicle dispatch plans in the form of bars; moving the bars on the basis of user input received through the interface; acquiring correction information, for the results of vehicle dispatch plans, generated by moving the bars; recalculating the results of vehicle dispatch plans on the basis of the correction information; and providing the final vehicle dispatch plans recalculated in the recalculation step.

Description

A method for providing optimal dispatching services using a computing device.

[0001] The present disclosure relates to a method for providing an optimal dispatch service using a computing device. Specifically, the method comprises enabling the computing device to generate an optimal dispatch plan based on input data regarding order information and vehicle information using an interface, and to provide an interface with the dispatch plan results.

[0002] Generally, a consumer purchase refers to the process of viewing a product in person or online, then paying the price and taking ownership of the product. This process can involve viewing the product in person and then receiving it in person. In other cases, the consumer may view the product online, pay for it, and then receive it later. One method of receiving the product later is through courier service.

[0003] In the logistics and delivery industry, which relies on courier services, determining how to allocate a given shipment volume to a limited number of trucks and which routes to use for delivery is crucial. Efficiently designing a vehicle routing plan can minimize logistics costs. However, conventional vehicle routing, often assigned by experienced staff, has been time-consuming and inaccurate.

[0004] Furthermore, courier services such as the above cannot handle large items or those requiring installation. Therefore, separate companies must be used, or the product retailer must provide delivery and installation services. Furthermore, there are challenges, such as finding a suitable vehicle for transporting the product and a driver capable of installing it.

[0005] In addition, the shipper's dispatch system, which uses special vehicles and allows product installation, was operated by connecting to the logistics center's server using the shipper's terminal to assign the desired logistics delivery, so it was far from a system that could minimize logistics costs from the logistics company's perspective.

[0006] Accordingly, research is ongoing into methods for dispatching vehicles to ensure smooth delivery and installation of products while minimizing the manpower of dispatching companies.

[0007] The purpose of the present invention is to provide a method for enabling product delivery by forming an efficient optimized route that can guarantee a shipper's rest time while strictly observing delivery time and working hours by utilizing vehicle-specific characteristics and product delivery information when a delivery company establishes an efficient delivery plan.

[0008] One embodiment of the present disclosure for solving the above-described problem may include the steps of: providing a dispatch plan result value interface in the shape of a bar at least in part; moving the bar based on a user input received through the interface; obtaining correction information for the dispatch plan result value generated by the movement of the bar; recalculating the dispatch plan result value based on the correction information; and providing a final dispatch plan recalculated through the recalculating step.

[0009] The step of providing the above result value interface may include providing a map interface in which a dispatch plan is displayed on a map at least in part, and providing a bar interface in which a dispatch plan is displayed in a bar shape at least in part, wherein the map interface and the bar interface may each include a maximize button.

[0010] The step of moving the above bar can move the bar to the front of the dispatch order when the automatic optimization function is activated.

[0011] The step of recalculating the above dispatch plan result value can recalculate the optimal dispatch plan for the entire delivery location of the vehicle to which the bar has moved.

[0012] The step of moving the above bar may be performed in such a way that, when the random order change function is activated, the dispatch order corresponding to the position to which the bar is moved is designated when the bar is moved, and when the automatic optimization function is activated, when the bar is moved, the bar may be moved to the front of the dispatch plan of the vehicle to which the bar is moved.

[0013] Before the step of providing the above result value interface, the method further includes a step of generating a result value interface including a bar interface formed by a bar having a thickness according to a dispatch plan and a space between the bar and the bar, wherein the horizontal length of the bar is determined based on a work time, and the space can be determined based on a vehicle travel time and a waiting time until the next work.

[0014] The above blank space includes a solid line indicating the vehicle's travel time and a dotted line indicating the waiting time until the next operation, and the above bar can display dispatch order information at least in part.

[0015] In the case where the dispatch time of the above bar becomes very short, it is provided in the shape of a thin bar, and the above bar interface can display the number of times the delivery location is moved due to the movement of the delivery location vehicle when the movement of the bar occurs.

[0016] The above bar interface may further include an automatic optimization tab that positions the bar at the front of the moved vehicle and a random order change tab that positions the bar in a dispatch order according to the moved position.

[0017] The above map interface includes at least one pin formed at the departure point, destination point, and delivery point location of each vehicle on the map, and the pin may have a different color for each dispatched vehicle.

[0018] According to one embodiment of the present disclosure, there is an effect of being able to create an optimal dispatch plan using order information and vehicle information required for dispatch using various interfaces.

[0019] Additionally, if product installation is required, it has the effect of providing an optimal dispatch plan that enables product transport, installation, and collection by designating a driver and vehicle capable of product installation and then dispatching them.

[0020] Additionally, it has the effect of providing an optimal dispatch plan by forming a zone for the delivery of products by vehicle.

[0021] FIG. 1 is a schematic diagram illustrating a configuration of a method for providing an optimal dispatch service by a computing device according to one embodiment of the present disclosure.

[0022] FIG. 2 is a schematic diagram illustrating a flowchart of a method for providing an optimal dispatch service using dispatch options by a computing device according to one embodiment of the present disclosure.

[0023] FIG. 3 is a schematic diagram illustrating a dispatch option information selection interface of a method for providing an optimal dispatch service using dispatch options by a computing device according to one embodiment of the present disclosure.

[0024] 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 dispatch options by a computing device according to one embodiment of the present disclosure.

[0025] FIG. 5 is a schematic diagram illustrating an example of a vehicle information selection interface of a method for providing an optimal dispatch service using dispatch options by a computing device according to one embodiment of the present disclosure.

[0026] FIG. 6 is a schematic diagram illustrating another flowchart of a method for providing an optimal dispatch service by a computing device according to one embodiment of the present disclosure.

[0027] FIG. 7 is a schematic diagram illustrating an example of a regional dispatch method for providing an optimal dispatch service by a computing device according to one embodiment of the present disclosure.

[0028] FIG. 8 is a schematic diagram illustrating an example of a cost dispatch plan of a method for providing an optimal dispatch service by a computing device according to one embodiment of the present disclosure.

[0029] FIG. 9 is a schematic diagram illustrating an example of a clustering dispatch plan of a method for providing an optimal dispatch service by a computing device according to one embodiment of the present disclosure.

[0030] FIG. 10 is a schematic diagram illustrating another example of a clustering dispatch plan of a method for providing an optimal dispatch service by a computing device according to an embodiment of the present disclosure.

[0031] FIG. 11 is a schematic diagram illustrating a result 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.

[0032] FIG. 12 is a schematic diagram illustrating a flowchart according to one embodiment of the present disclosure.

[0033] FIG. 13 is a schematic diagram illustrating another example of a result value interface according to one embodiment of the present disclosure.

[0034] FIG. 14 is a schematic diagram illustrating a movement of a result value interface bar according to one embodiment of the present disclosure.

[0035] FIG. 15 is a schematic diagram illustrating the movement of the result value interface bar according to one embodiment of the present disclosure.

[0036] FIG. 16 is a schematic diagram illustrating another example of a result value interface before moving the bar according to one embodiment of the present disclosure.

[0037] FIG. 17 is a schematic diagram illustrating another example of a result value interface after moving the bar according to one embodiment of the present disclosure.

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

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

[0040] Various embodiments are now described with reference to the drawings. In this specification, various descriptions are provided to facilitate understanding of the present disclosure. However, it will be apparent that these embodiments may be practiced without these specific details.

[0041] As used herein, the terms "component," "module," "system," and the like refer to computer-related entities, hardware, firmware, software, a combination of software and hardware, or an execution of software. For example, a component may be, but is not limited to, a procedure running on a processor, a processor, an object, a thread of execution, a program, and / or a computer. For example, both an application running on a computing device and the computing device may be a component. One or more components may reside within a processor and / or a thread of execution. A component may be localized within a single computer. A component may be distributed between two or more computers. Furthermore, these components may execute from various computer-readable media having various data structures stored therein. Components may communicate via local and / or remote processes, for example, by signals comprising one or more data packets (e.g., data from one component interacting with another component in a local system, a distributed system, and / or data transmitted to another system via a network such as the Internet via signals).

[0042] Furthermore, the term "or" is intended to mean an inclusive "or" rather than an exclusive "or." That is, unless otherwise specified or clear from context, "X employs A or B" is intended to mean either of the natural inclusive permutations. That is, if X employs A; X employs B; or X employs both A and B, "X employs A or B" can apply to any of these cases. Furthermore, the term "and / or" as used herein should be understood to refer to and include all possible combinations of one or more of the associated items listed.

[0043] Additionally, the terms "comprises" and / or "comprising" should be understood to imply the presence of the features and / or components in question. However, it should be understood that the terms "comprises" and / or "comprising" do not exclude the presence or addition of one or more other features, components, and / or groups thereof. Furthermore, unless otherwise specified or clear from the context to refer to the singular form, the singular in the specification and claims should generally be construed to mean "one or more."

[0044] And, the term "at least one of A or B" should be interpreted to mean "if it includes only A", "if it includes only B", or "if it is combined in the composition of A and B".

[0045] Those skilled in the art should further appreciate that the various illustrative logical blocks, configurations, modules, circuits, means, logics, and algorithm steps described in connection with the embodiments disclosed herein may be implemented as electronic hardware, computer software, or combinations of both. To clearly illustrate the interchangeability of hardware and software, various illustrative components, blocks, configurations, means, logics, modules, circuits, and steps have been described above generally in terms of their functionality. Whether such functionality is implemented as hardware or software depends upon the particular application and design constraints imposed on the overall system. Skilled artisans may implement the described functionality in varying ways for each particular application. However, such implementation decisions should not be interpreted as causing a departure from the scope of the present disclosure.

[0046] The description of the disclosed embodiments is provided to enable those skilled in the art to make or use 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. Therefore, the present invention is not limited to the embodiments disclosed herein. The present invention is to be construed in the widest scope consistent with the principles and novel features disclosed herein.

[0047]

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

[0049]

[0050] FIG. 1 is a schematic diagram 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 of a flowchart of a method for a computing device to provide an optimal dispatch service using dispatch options according to an embodiment of the present disclosure, FIG. 3 is a schematic diagram of a dispatch option information selection interface of a method for a computing device to provide an optimal dispatch service using dispatch options according to an embodiment of the present disclosure, FIG. 4 is a schematic diagram of an example of an order information selection interface of a method for a computing device to provide an optimal dispatch service using dispatch options according to an embodiment of the present disclosure, FIG. 5 is a schematic diagram of an example of a vehicle information selection interface of a method for a computing device to provide an optimal dispatch service using dispatch options according to an embodiment of the present disclosure, FIG. 6 is a schematic diagram of another flowchart of 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 of an example of a regional dispatch 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 schematic diagram of a method for a computing device to provide an optimal dispatch service according to an embodiment of the present disclosure. A drawing schematically showing an example of a cost dispatch plan of a method for providing a service, FIG. 9 is a drawing schematically showing an example of a clustering dispatch plan of a method for providing an optimal dispatch service by a computing device according to an embodiment of the present disclosure, FIG. 10 is a drawing schematically showing another example of a clustering dispatch plan of a method for providing an optimal dispatch service by a computing device according to an embodiment of the present disclosure, FIG. 11 is a drawing schematically showing a result value interface of a method for providing an optimal dispatch service by using a bar by a computing device according to an embodiment of the present disclosure, and FIG. 12 is a drawing schematically showing a flowchart according to an embodiment of the present disclosure,FIG. 13 is a diagram schematically illustrating another example of a result value interface according to an embodiment of the present disclosure, FIG. 14 is a diagram schematically illustrating a result value interface bar before moving according to an embodiment of the present disclosure, FIG. 15 is a diagram schematically illustrating a result value interface bar after moving according to an embodiment of the present disclosure, FIG. 16 is a diagram schematically illustrating another example of a result value interface bar before moving according to an embodiment of the present disclosure, FIG. 17 is a diagram schematically illustrating another example of a result value interface bar after moving according to an embodiment of the present disclosure, FIG. 18 is a diagram for explaining a computing device according to an 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 can be implemented.

[0051]

[0052] The present disclosure, referring to FIG. 1, may be such that a user using a service is provided with an interface for dispatch option information, order information, and vehicle information, and when the user selects each piece of information, an optimal dispatch plan is generated using an algorithm based on the selected information, and an interface with the resulting values ​​of the generated optimal dispatch plan is provided to the user, thereby enabling efficient product delivery. 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 the vehicle terminal, an optimal dispatch plan for each delivery location within a region can be generated.

[0053]

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

[0055] Here, an interface may mean a part or connecting device that connects two different systems, devices, software, etc., and may mean a medium that connects a user and a computer device, and in the present disclosure, may mean something displayed on a computing device so that the user can check it.

[0056] Furthermore, dispatch options can be broadly categorized into equal dispatch and regional dispatch options. The equal dispatch option allows drivers to select equal working hours, which evenly distributes the work hours of multiple drivers, and equal order count, which evenly distributes the number of orders handled by multiple drivers. Equal working hours and equal order count can be selected singly or in combination.

[0057] Additionally, the zone dispatch option may allow for the selection of either a default zone dispatch, which dispatches vehicles based on the zones set, or a zone-less dispatch, which ignores zone settings and dispatches vehicles based on the zones set. The zone dispatch option may be mandatory.

[0058] Additionally, dispatch options can include both the even dispatch and the zone dispatch options, or they can be neither selected. For example, if neither option is selected, the default algorithm may generate dispatch plans. However, if either the even dispatch or zone dispatch options are selected, dispatch plans that meet the selected conditions may be generated. Of these, the zone dispatch option may not be selected multiple times.

[0059] Additionally, the dispatch option selection interface may allow for setting a trip name and trip date. The trip date is intended to ensure that the dispatch plan is executed on that date, and the trip name may be used to identify each vehicle. Furthermore, the interface may provide options for selecting equal dispatch and regional dispatch options.

[0060] Here, if only equal business hours are selected, the dispatch plan can be created so that the same business hours are applied to multiple vehicles. Furthermore, if equal order count is also selected, the dispatch plan can be created so that the same business hours are applied and the same number of delivery orders are delivered according to the dispatch plan. The dispatch plan can be created after all interface selections have been completed.

[0061] Additionally, an interface for selecting a regional dispatch option may be provided. While the equal dispatch option and the regional dispatch option can be selected in duplicate or combined, the option for dispatching without a region or using the default regional dispatch option within the regional dispatch option can only be selected singly. This may be due to the fact that these options cannot be combined, as they are chosen based on whether to split or consolidate regions.

[0062] After selecting a dispatch option as described above, you can proceed to the next step by clicking the button. The next step is described in detail below.

[0063] Furthermore, the step (S200) of providing an order information selection interface may provide an interface for selecting order information. Specifically, a consumer may purchase a product and configure order information as purchase information. At this time, the order information may be stored on a computing device. For example, information such as the consumer's personal information for ordering and the delivery address information may be pre-stored, and an interface may be provided for selecting at least one piece of information for each order. For example, order information may be searched using order number, driver, customer name, etc., and search may also be performed based on delivery date. Furthermore, order requests, including delivery, installation, and pickup, and dispatch priorities may be selected, but are not limited thereto. When search results based on the selected information are listed, order information for delivery may be selected. Furthermore, the step (S200) of providing an order information selection interface may partially display information regarding previously selected dispatch options. After selecting order information, the user may proceed to the next step by clicking a button.

[0064] In addition, the step (S300) of providing a vehicle information selection interface may provide an interface for selecting a vehicle and driver. Specifically, vehicle information may be pre-stored in a computing device. For example, vehicle information including vehicle number, driver name, operating hours, vehicle type, vehicle load capacity, etc. may be stored in the computing device. Accordingly, a portion of the vehicle information selection interface may list information about vehicles and drivers, allowing selection through a search for desired drivers and vehicles. For example, a portion of the interface may list information about vehicles and drivers horizontally, with a checkbox formed at the front for selection. When selected, the driver and vehicle with the corresponding information may be selected and included in the dispatch plan. In addition, a checkbox may be positioned in a portion of the interface for selecting or deselecting all checkboxes. Finally, information about previously selected dispatch options and order information may be formed on one side.

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

[0066] For example, if you select the Equal Business Hours and Default Zone dispatching options, select only deliveries for order information, select high-priority orders, and select the Primary Driver for vehicle information, you may receive the results of a dispatch plan that assigns the Primary Driver equal work to high-priority orders for the default zone for delivery destinations in that area. The method for providing the dispatch plan results is described later.

[0067] As described above, the first embodiment allows selection of dispatch options in advance, so that order information can be selected, making it easy to determine the number of orders and delivery locations based on order information by region, and then selecting vehicle information to select vehicles available for delivery by region, thereby finally generating a dispatch plan.

[0068]

[0069] 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 regional dispatch option selection area (I330) in at least some cases, and when at least one of the driving date, the equal dispatch option, and the regional dispatch option is selected, moving to the next step may be possible.

[0070] Here, the driving date is required information, and may be provided along with the driving name. Furthermore, the button for moving to the next step may be activated only when the driving date and driving name are entered. For example, the driving date field (I310) for entering the driving date and driving name may be provided to allow entry of the driving name and driving date. The field for entering the driving date may be displayed in calendar format upon activation.

[0071] Additionally, an equal distribution option selection area (I320) can be provided. For example, the equal business hours option selection area may provide an image of an analog or digital clock related to the time. Furthermore, the equal order quantity option may provide an image of the loaded product.

[0072] Additionally, a zone dispatch option selection area (I330) may be provided. For example, the zone for selecting the default zone dispatch option may provide an image with a vehicle image inserted into a zoned map background. Alternatively, an image with a vehicle image inserted into a map without zones may be provided. Accordingly, the option may allow for selection of both default zone dispatch and zone-free dispatch.

[0073] Here, the equal dispatch option and the zone dispatch option may be required to be selected to provide the next step. For example, when a trip name and trip date are entered, the selection areas for the equal dispatch option and the zone dispatch option may be activated, and selecting either the equal dispatch option or the zone dispatch option may allow the user to move to the next step. Here, the next step may be provided by a separate first input information area (I340) that outlines the steps and input information of the provided interface. In addition, the first input information area (I340) may additionally provide a button for viewing dispatch results, which will be described in detail later.

[0074] As described above, each of the driving date, equal dispatch option, and regional dispatch option can be selected at least once to move to the next page, allowing all required information to be selected when creating a dispatch plan.

[0075]

[0076] According to a first embodiment of the present disclosure, the equal dispatch option includes at least one of an equal business hours option and an equal number of orders, the zone dispatch option includes at least one of dispatch without zone and basic zone dispatch, and at least one selected from the equal dispatch option and the zone dispatch option can be spotlighted.

[0077] Here, the "spotlight" can refer to an activated state, different from the image provided, and can also refer to a noticeable change in the image compared to other unselected images. For example, if "Equal Business Hours" is selected in the "Equal Dispatch Option Selection Area (I320), the image can be activated, colored, and include a check mark and a border highlight effect. Furthermore, if the "Regional Dispatch Option" is selected, the image can be colored and include a check mark and border highlight effect. Spotlighted images are easily identifiable by users, allowing them to quickly determine whether a selection has been made, making it easier to identify any missing selections when moving to the next page or the results page.

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

[0079]

[0080] 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 an inquiry period, an order type, a dispatch priority, and an order listing box (I420) for at least some of the information, and may provide order information searched using at least one of the inquiry period, the order type, and the dispatch priority to be listed in the order listing box (I420), and may provide that at least one of the orders listed in the order listing box (I420) be selected.

[0081] As described above, when selecting the driving date, equal dispatch option, and regional dispatch option through the dispatch option selection interface, the user is presented with the next option, the order information input interface. 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, its size, weight, delivery location, and installation status. It may also provide an interface for selecting a portion of various information. For example, the order selection area (I410) may provide options for selecting order ID, inquiry period, order type, and dispatch priority. The order ID may be searchable by order number, customer name, driver, etc. used when placing the order. The inquiry period may also allow for searching based on the order receipt date. The order type may simply allow for selection of whether the product requires delivery or installation and pickup. Furthermore, the dispatch priority may determine the priority when generating a dispatch plan for each delivery location based on order information. For example, when generating a dispatch plan, products with higher priorities may be included first in the dispatch plan.

[0082] In addition, the order listing box (I420) may be an area where order information searched based on the information selected in the order selection box (I410) is listed. For example, it may list order information that matches the search period, order type, dispatch priority, and order ID selected in the order selection box (I410). Accordingly, the order information in the order listing box (I420) may include the order ID, order receipt date, customer name, delivery address, item name, etc. In addition, the order information listed in the order listing box (I420) may be selected at least once. Check boxes may be provided to enable single selection or multiple selection. When order information is selected through a check box and the next button in the second input information box (I430) is pressed, a vehicle information selection interface, which is the next selection interface, may be provided.

[0083] Specifically, the second input information area (I430) outlines the steps of the previous step, the dispatch option and order information selection interface, and may also outline the previously selected information. For example, if dispatch without a zone and equal business hours dispatch are selected, information about this may be formed on one side. Furthermore, unlike the first input information area (I340), the second input information area (I430) further includes a return button, which allows the user to return to the previous step, the step where the dispatch option selection interface is provided. For example, if the user wishes to reselect a dispatch option, the user may return to edit it.

[0084] By granting autonomy to selection as above, corrections to incorrect inputs can be made easily and simply, and by selecting order information along with dispatch options, dispatch plans can be generated efficiently.

[0085]

[0086] According to the first embodiment of the present disclosure, the step (S300) of providing the vehicle information selection interface may provide at least a portion of a vehicle listing box (I520) including vehicle and driver information according to the selected dispatch option and the order information, wherein the vehicle listing box (I520) includes status information on whether the vehicle can perform work and listed vehicle information, and may provide for selecting at least one of the vehicle information according to the status information among the listed vehicle information.

[0087] Here, the vehicle listing section (I520) may be a section listing vehicle information. For example, it may list all previously stored vehicle information (vehicle status, driver name, vehicle number, operation type, area in charge, driving name, route status, etc.). Among these, vehicle information matching the order information and dispatch options may be selected. For example, the vehicle information listed in the vehicle listing section (I520) may be displayed for all vehicle information by default. Among these, when a search is performed in the vehicle selection section (I510), vehicle information matching the searched vehicle information may be displayed. Here, the vehicle information section may further include vehicle status information, which may include whether the vehicle's current status is capable of delivery or not. For example, delivery may be impossible if the vehicle is broken, or delivery may be impossible if the size of the product exceeds the vehicle's loading capacity.

[0088] Additionally, the vehicle selection area (I510) can search for suitable vehicles based on vehicle information and list them in the vehicle listing area (I520). For example, vehicle information can be searched by entering order number, customer name, driver, etc. Additionally, vehicle status and operation type can be searched. Operation type can be either fixed or leased. Fixed vehicles can be hired vehicles that are always on standby, while leased vehicles can be rental vehicles.

[0089] An optimized dispatch plan can be created by searching for vehicle information through the above search and selecting all suitable vehicles to create a dispatch plan.

[0090]

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

[0092] As previously described, 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, progress status of the vehicle information selection interface, driving dates, regional dispatch selection results, equal dispatch selection results, and selected order information.

[0093] By briefly including dispatch, order, and vehicle information as above, users can easily check it and respond quickly according to the progress.

[0094]

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

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

[0097] Additionally, a third input information area (I530) may be included on the left side. For example, the third input information area (I530) may be formed in the same manner as the second input information area (I430). Since it is a step for entering vehicle information after inputting dispatch options and order information, it may list previously selected information. Specifically, it may include a step for selecting the current interface, selection of driving date, area dispatch, equal dispatch, and order information. Furthermore, since it is the final input interface, there is no move to next button, but buttons for move to previous and view dispatch results may be present.

[0098]

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

[0100] Specifically, when a user receives an optimal dispatch service, they first select a dispatch option. Depending on the dispatch option (basic area dispatch or non-area dispatch), a dispatch plan can be generated for each delivery location based on order information. Afterwards, they can select order information. At this time, the dispatch plan can be prepared by categorizing multiple delivery locations by vehicle based on the selected order information. Next, they can select vehicle information. When generating a dispatch plan for each delivery location based on the dispatch option and order information, selecting a vehicle allows multiple orders to be delivered by multiple vehicles using optimized routes.

[0101]

[0102] According to the first embodiment of the present disclosure, the step (S400) of providing the dispatch plan result value interface generates an optimal dispatch plan based on order information and vehicle information pre-stored in the computing device, and provides a result value for the generated dispatch plan to each user terminal and vehicle terminal, wherein the terminal may be capable of modifying the dispatch plan result value.

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

[0104] Specifically, a dispatch plan can be generated using the information entered through the dispatch option, order information, and vehicle information input interface. A specific dispatch plan generation method can utilize the method described in the second embodiment below. The generated dispatch plan may be provided as a result value to each terminal. The result value may be a dispatch plan, and may be provided by displaying the delivery execution plan on a map. A detailed description will be provided later.

[0105] The result interface provided as described above can be modified on each terminal. Specifically, the result interface provided to the administrator terminal can be modified for the entire dispatch plan, while the interface provided to the vehicle terminal (shipper terminal) can be modified only for the dispatch plan of the specific vehicle.

[0106] For example, if a dispatch plan is created for vehicles 1 through 10, the administrator can edit all of them. For vehicle 1, the administrator can edit only the dispatch plan for vehicle 1. Modifications can be selective, including changes to delivery order, final destination, delivery time, and break times.

[0107] As described above, by providing an input interface and a result value interface, information for generating a dispatch plan is provided, and an efficient dispatch plan is generated based on the provided information and provided to each terminal, thereby preventing the exhaustion of manpower for distributing dispatches, establishing an accurate and efficient dispatch plan and providing a result value, and enabling individuals to modify the provided result value, thereby generating and providing an optimal dispatch plan.

[0108]

[0109] A method for providing an optimal dispatch service by a computing device according to a second embodiment of the present disclosure with reference to FIG. 6 may include: acquiring order information including at least one of customer information, expected capacity, desired time, and dispatch priority, and vehicle information including at least one of a departure point, a destination point, maximum capacity, vehicle type, and drivable road; matching the order information acquired in the step of acquiring the information with the vehicle information; and generating a dispatch plan based on the delivery location information matched through the step of matching.

[0110] In addition, the step of recommending the above dispatch plan may be further included.

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

[0112] Additionally, order information may include customer information, desired time, dispatch priority, designated vehicle information, expected capacity, and expected work time.

[0113] Here, customer information may include information on the purchased product, address, customer name, contact information, etc., and may include any information necessary for delivery.

[0114] Additionally, the desired delivery time can be the time the customer wishes the delivery to be completed. For example, if the desired time is between 6:00 PM and 7:00 PM, the customer can ensure delivery is completed within that time frame. Another example is the time when installation of products requiring installation (such as air conditioners, boilers, and computers) begins. This desired time ensures that the customer remains present at the installation location.

[0115] Additionally, dispatch priority can be a measure of importance for dispatching when creating dispatch plans, with higher priority indicating greater importance. For example, if there are two products with priority 5 and 8, the product with priority 8 may be dispatched first.

[0116] Additionally, designated vehicle information can be used to designate specific vehicles for dispatch. For example, this could include information on refrigerated trucks, passenger cars, trucks, and motorcycles. Designated vehicles are used when customers require expedited delivery or have large items, ensuring smooth delivery.

[0117] Additionally, the estimated volume may be the amount loaded on a vehicle, calculated based on the size and weight of the product, the quantity of the product, etc. The volume may be used to specify the size of the vehicle.

[0118] Additionally, the estimated work time may be the time when installation begins for products requiring installation. For example, if the work time is one hour, the dispatch plan may be created by adding one hour of work time after arrival.

[0119] Additionally, vehicle information may include vehicle type, maximum capacity, departure point, destination, break time, work start time, and drivable roads.

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

[0121] Additionally, the maximum cargo capacity may be the maximum capacity of the vehicle. For example, in the case of a truck, the capacity of the open cargo compartment may be different from the capacity of the cargo compartment protected by a roof or other structure.

[0122] Additionally, the origin can be the departure point of a delivery vehicle. For example, it could be the first delivery point from which goods are loaded into a logistics warehouse, or the location where the vehicle is located.

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

[0124] Additionally, break times can be driver rest periods. For example, if break times are designated as 2:00 PM to 3:00 PM, that time may be excluded from dispatch to prevent deliveries.

[0125] Additionally, the work start time can be the driver's work start time. For example, if you specify 9:00 AM as the start time, you can create a dispatch plan that excludes 8:00 AM delivery locations.

[0126] Additionally, drivable roads can include information on the roads available for each vehicle. For example, highways may be excluded because motorcycles cannot access them, and large trucks may be excluded because they cannot access narrow alleys.

[0127] Additionally, the information matching step may involve comparing order information with vehicle information. For example, a large product (order information) such as a large refrigerator may be matched with a large truck (vehicle information) weighing 5 tons or more. Another example is a product requiring refrigeration (order information) may be matched with a refrigerated vehicle (vehicle information). Furthermore, matching may involve comparing operating hours, vehicle type, and available roads.

[0128] By going through the steps of matching orders and vehicles according to each piece of information as described above, a dispatch plan can be created for vehicles that can deliver products according to order information, and the dispatch plan can be used to create an optimal dispatch plan for each delivery location, thereby ensuring the highest efficiency in product delivery.

[0129]

[0130] 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 deliverable order information among the vehicle information into matching information and selecting the matching information for each vehicle.

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

[0132]

[0133] According to a second embodiment of the present disclosure, the order information further includes information on the driver in charge, the vehicle information further includes information on work that can be performed, and the step of matching the information includes, when an installation or collection work is required upon delivery of a product according to the order information, delivery is made using a driver and vehicle capable of performing the work, and the information on work that can be performed may further include an expected time required to perform the work.

[0134] Here, the assigned driver information may be specific to a driver capable of delivering the ordered product and performing additional tasks. For example, in the case of air conditioners, a technician capable of installing the air conditioner and outdoor unit may be assigned, as installation is required. Similarly, in the case of boilers, a technician capable of installing and connecting the boiler may be assigned. In these cases, the driver may be designated regardless of the type or size of the vehicle being delivered.

[0135] Additionally, the available work information may include information about tasks that can be performed upon delivery of a product based on order information. For example, this information may include information about the vehicle driver's ability to install air conditioners and boilers.

[0136] Accordingly, the product delivery location may be selected based on the vehicle-specific order information based on the above order information and the vehicle information.

[0137] However, if a product requires installation or pickup, additional time may be required to perform this work. For example, an air conditioner may require additional installation after delivery. This requires additional time to complete. While the required time may vary depending on the product, the work can be performed during this time without any delivery or vehicle movement. Accordingly, the overall dispatch plan can be created by adding the vehicle movement and delivery time, along with the expected work time, as business hours.

[0138]

[0139] 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 operating time of a dispatched vehicle, a second step of generating a dispatch plan considering the maximum operating time and order information, wherein the dispatch plan includes an operating time according to an operating route, a third step of performing verification on the dispatch plan, and a fourth step of changing the maximum operating time and repeatedly performing the second step and the third step for the changed maximum operating time, thereby searching for a value at which the maximum operating time is minimized.

[0140] Here, the maximum operating time of a dispatched vehicle may be the maximum operating time for multiple dispatched vehicles, the sum of the maximum operating times each dispatched vehicle can have. It may also be the maximum operating time for each vehicle.

[0141] Additionally, order information may be information about a consumer's purchase of a product. Specifically, it may include information about the product being shipped, the product's collection point (origin), and the product's delivery location (destination). This information may be obtained through the consumer's terminal. Furthermore, the dispatch plan may be a plan for delivering the product to the delivery location based on order information.

[0142] Additionally, the first step may involve the computing device designating a maximum operating time for each dispatched vehicle. The maximum operating time may refer to a maximum operating time for each vehicle, or may be the sum of the maximum operating times for each vehicle.

[0143] Additionally, the second step may involve generating routes that can be operated within the maximum travel time for each vehicle. For example, this could involve generating a dispatch plan that utilizes the shortest route possible within the maximum travel time.

[0144] Additionally, the third step may involve verifying the dispatch plan generated in the second step. For example, this could involve verifying whether deliveries made according to the dispatch plan are delivered via the shortest route and in the shortest time.

[0145] Additionally, the fourth step may explore ways to maximize efficiency by changing the maximum travel time for the dispatch plan verified in the third step. Specifically, the maximum travel time may be changed to ensure that the dispatch plan utilizes the shortest distance and takes the shortest time.

[0146]

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

[0148] For example, a computing device may arbitrarily set a maximum operating time and calculate a travel route and travel time based on that maximum operating time. The arbitrarily set maximum operating time may be 12 hours or less per day. This may involve specifying the maximum operating time within the work environment for personnel, who are required to operate a single vehicle.

[0149]

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

[0151] Here, a movable route is defined by both movable and inaccessible roads, depending on the vehicle's characteristics. It can be a route that travels on a movable road. For example, it can be a maximum route that travels on movable roads within a preset maximum travel time. Furthermore, the dispatch plan can be a plan that calculates a route for each vehicle's maximum travel time and assembles the entire calculated route. The route can be a route for delivery vehicles based on each delivery location.

[0152]

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

[0154] Here, a feasible dispatch plan calculates a route within the maximum operating time for each vehicle, and refers to a case where all deliveries within the order information are made for the entire calculated route. For example, a classification as a feasible dispatch plan means that all orders required by the order information are available for delivery.

[0155] However, the generated feasible dispatch plan may allow for all deliveries to be made within the maximum travel time, or it may allow all deliveries to be made within a time period that falls short of the maximum travel time. For example, a feasible dispatch plan may mean that deliveries can be made without exceeding the maximum travel time.

[0156]

[0157] According to the 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.

[0158] Here, an impossible dispatch plan refers to a situation where all order information cannot be delivered within the maximum operating time for each vehicle. For example, a dispatch plan may be established to fully utilize the maximum operating time for each vehicle, but there may still be some deliveries left over. In cases where a dispatch plan is classified as impossible, additional dispatching is required to accommodate the remaining deliveries, as described below.

[0159]

[0160] According to the second embodiment of the present disclosure, in the fourth step, if the dispatch plan is classified as the possible dispatch plan, the second and third steps are repeated by reducing the maximum operating time, but if the changed maximum operating time is classified as an impossible dispatch plan, the dispatch plan for the maximum operating time before the change can be determined as the first modified dispatch plan.

[0161] Here, the first modified dispatch plan may be a dispatch plan in which the maximum operation time has a minimum value by performing steps 1 to 4.

[0162] Furthermore, a feasible dispatch plan is one that allows for the delivery of all order information among dispatch plans based on an arbitrary maximum operating time specified by the computing device. However, this also means that there are fewer delivery orders per vehicle. For example, if there are too few deliveries, some vehicles may not perform any transport. This can lead to waste of manpower and vehicles.

[0163] Accordingly, the computing device can adjust the maximum operating time to take additional steps. Specifically, since deliveries are completed within the maximum operating time, the maximum operating time can be reduced and the dispatch plan can be recalculated. For example, this could be done to find the maximum operating time that maximizes efficiency while minimizing vehicle and operating time usage.

[0164] As the maximum operating time is reduced as above, the possibility or impossibility of scheduling dispatch according to the changed maximum operating time is classified by going through the second and third steps again.

[0165] Here, if it is classified as a possible dispatch plan again, the maximum operating time can be reduced again, and the second and third steps can be performed using the reduced maximum operating time.

[0166] If the resulting dispatch plan is classified as an impossible dispatch plan, the dispatch plan is unusable and therefore unusable, and a possible dispatch plan using the maximum operating time before the previous change may be classified as the first modified dispatch plan.

[0167] For example, when performing dispatch for 4 vehicles, a dispatch plan is generated by specifying an arbitrary maximum operating time as 8,8,8,8, and if the result is classified as a possible dispatch plan, the arbitrary maximum operating time can be changed to 7,7,7,7 and a dispatch plan can be generated again. Afterwards, if the dispatch plan according to the changed maximum operating time is classified as a possible dispatch plan, the arbitrary maximum operating time can be changed to 6,6,6,6 and a dispatch plan can be generated again. And if the dispatch plan according to the changed maximum operating time is classified as an impossible dispatch plan, the dispatch plan using the maximum operating time before the previous change of 7,7,7,7 can be determined as the first modified dispatch plan. Accordingly, it is possible to search for a value that minimizes the maximum operating time, and the operational efficiency of each vehicle can be maximized.

[0168]

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

[0170] Here, an impossible dispatch plan means that a dispatch plan based on an arbitrary maximum operating time specified by the computing device is impossible, so measures are taken to make dispatching possible. For example, the computing device may extend the maximum operating time and perform additional steps 2 and 3. Accordingly, if the generated dispatch plan is classified as a possible dispatch plan, the possible dispatch plan may be determined as the second modified dispatch plan.

[0171] For example, for 4 vehicles, the server initially sets the maximum operating time to 7,7,7,7 and generates a dispatch plan through steps 2 and 3. However, if the dispatch plan is classified as an impossible dispatch plan, the maximum operating time is changed to 8,8,8,8 and steps 2 and 3 are additionally performed. If the generated dispatch plan is subsequently classified as an impossible dispatch plan, the maximum operating time is further changed to 9,9,9,9 and steps 2 and 3 are additionally performed. If the generated dispatch plan is subsequently classified as a possible dispatch plan, the dispatch plan may be determined as the second modified dispatch plan. For example, a dispatch plan generated by setting the maximum operating time to 9,9,9,9 may be determined as the second modified dispatch plan. Accordingly, there is an effect of ensuring that delivery is delivered with maximum efficiency in dispatches that are impossible with 4 vehicles.

[0172]

[0173] According to a second embodiment of the present disclosure, if the maximum daily operating time of each of the dispatched vehicles of 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 of the modified dispatch plan is less than a second threshold value, the number of vehicles may be reduced.

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

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

[0176] Additionally, the second preset value may be a preset time value, for example, one hour or more per day.

[0177] Additionally, adding additional vehicles can increase the number of vehicles available in the same area. For example, if delivery is unavailable, adding additional vehicles can facilitate delivery. Conversely, if there are too many vehicles available in the same area, adding additional vehicles can reduce the number of vehicles available.

[0178] For example, if one or more vehicles require operation exceeding the first preset value of 10 hours per day during the maximum operating hours per vehicle according to the modified dispatch plan, the computing device may assign additional vehicles and then regenerate them when specifying the initial arbitrary maximum operating hours. Furthermore, if one or more vehicles require operation less than the second preset value of 4 hours per day during the maximum operating hours per vehicle according to the modified dispatch plan, the computing device may reduce the number of vehicles and regenerate them when specifying the initial arbitrary maximum operating hours. As described above, the computing device may establish a dispatch plan using the number of vehicles and the maximum operating hours per vehicle, thereby enabling delivery to be made with the minimum number of vehicles and the minimum operating hours in the same area.

[0179]

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

[0181] Here, the step of creating a dispatch plan may be to designate a zone for each vehicle, register information for the designated zone, and create a dispatch plan based on the registered zone information.

[0182]

[0183] According to the second embodiment of the present disclosure with reference to FIG. 7, the first region information (610) is a region in which the dispatch vehicle can deliver, and the second region information (620) may be an overlapping region among a plurality of first region information (610).

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

[0185] The first region information (610) acquired as described above is assigned to each vehicle, and the first region information (610) assigned to each vehicle may each represent a different region. In addition, the second region information (620) may separately manage information regarding the overlapping portion between the region according to the first region information (610) and the region according to another first region information (610). Accordingly, management efficiency can be maximized by registering the first region information (610) and the second region information (620) for each dispatched vehicle.

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

[0187]

[0188] According to the second embodiment of the present disclosure, the step of generating the dispatch plan generates a primary regional dispatch plan using the minimum movement path within the first regional information (610) of each dispatch vehicle.

[0189] Here, each dispatch vehicle may have first region information (610). The first region information (610) refers to the region within which the dispatch vehicle delivers. When generating a delivery plan for the region, the plan may search for the shortest route within the region for delivery. For example, the plan may be designed to ensure delivery using the shortest time and distance. However, the primary region dispatch plan does not utilize the shortest time and distance. Additional steps may be taken to ensure delivery using the shortest time and distance. A detailed explanation will be provided later.

[0190]

[0191] According to the second embodiment of the present disclosure, the step of generating the regional dispatch plan generates a regional dispatch second plan in which, for vehicles whose operating time is greater than or equal to a first threshold value among the regional dispatch first plans, delivery for the second region information (620) is excluded from the vehicle 1 regional dispatch plan.

[0192] Here, the threshold value can be a value arbitrarily set by the server, a value entered by a user using a computing device, or a value representing a typical dispatch time. It can also be stored on the computing device or acquired by the computing device.

[0193] Additionally, the first threshold value can typically be the daily operating hours of the dispatched vehicle. For example, 8 hours per day is preferred, but is not limited to this. Various times, such as 10 or 12 hours, can be set.

[0194] Additionally, the primary regional dispatch plan may be for the shortest delivery route within each vehicle's region. Accordingly, the vehicle's operating time may vary. For vehicles whose operating time exceeds the first threshold, the primary regional dispatch plan may exclude deliveries corresponding to the second region information (620) and re-generate the dispatch plan.

[0195] For example, if the operation time of the first vehicle (711) is 8 hours or more, the existing route has a-1 -> a-2 -> b-1 -> b-2 as the path to deliver a and b, but the delivery of a and b corresponding to the second region information (620) may be excluded, and delivery may be made through a-3 and b-3, and the dispatch plan generated accordingly may be a secondary region dispatch plan. In the secondary region dispatch plan according to this, the delivery time is reduced because the delivery locations of the first vehicle (711) are reduced. A detailed description of a and b excluded from delivery will be provided later.

[0196]

[0197] According to the second embodiment of the present disclosure, among the second zone dispatch plans, a first zone including a vehicle whose operating time is greater than or equal to a first threshold value can allow dispatch of external vehicles.

[0198] Here, although the second regional dispatch plan excludes deliveries corresponding to the second region information (620), there may be cases where the operating time of the first vehicle (711) exceeds the first threshold, and thus, a surplus delivery location (P) may be created for deliveries within the first region that are canceled or excluded. This will be described in detail later.

[0199]

[0200] According to a second embodiment of the present disclosure, the step of generating the regional dispatch plan generates a regional dispatch 3rd plan by additionally dispatching order information of the second region to vehicles whose operating time is less than a first threshold among the regional dispatch 1st plan.

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

[0202] For example, the delivery of a and b is excluded from the first vehicle (711), and additional dispatch for a and b is required. The additional dispatch can be performed by the second vehicle (712). If the second vehicle (712) has a dispatch plan created through c-1, but the operation time for this is less than the first threshold of 8 hours, additional dispatch for a and b can be performed. That is, the c-1 route is excluded, and a regional dispatch 3rd plan may be created, which is a dispatch plan that enables delivery of a and b through the c-2 -> c-3 -> c-4 route. According to the regional dispatch 3rd plan, delivery can be performed without any gaps in the delivery location within the second region information (620).

[0203]

[0204] 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 added to the dispatch of other vehicles to the first zone.

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

[0206] Here, vehicles whose operating time falls below the first threshold according to the third regional dispatch plan may result in wasted vehicles and operating time. Therefore, additional dispatches may be required.

[0207] Specifically, if the maximum operating time for each vehicle within the first zone exceeds the second zone dispatch plan, there may be some delivery locations where deliveries cannot be made. Consequently, deliveries to these locations may be dispatched to external vehicles.

[0208] For example, if a surplus delivery location (P) is created due to an excess of operating hours assigned to the first vehicle (711), the operation of the surplus delivery location may be performed by the third vehicle (713) whose operating hours are less than the second threshold of 4 hours. By distributing the operation of the first vehicle (711) with excessive delivery and operating hours to the third vehicle (713) with insufficient delivery and operating hours, the delivery efficiency of each vehicle may be maximized.

[0209]

[0210] According to a second embodiment of the present disclosure, a first zone including vehicles whose operating time is less than a second threshold value within the zone dispatch plan 3 can restrict dispatch of external vehicles.

[0211] Specifically, even if the dispatch plan creation within the first zone (710), which is a zone for each vehicle, is completed, if a vehicle whose operating time is less than the second threshold value is included, external vehicles entering the first zone (710) may be restricted.

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

[0213] Additionally, the computing device may be capable of dispatching a vehicle from a first zone (710) that includes a second vehicle (712) whose operating time is less than a second threshold value and a third vehicle (713) that is a normal vehicle to a first zone that includes a first vehicle whose operating time is greater than or equal to the first threshold value.

[0214] When dispatch plans are generated for each of the first to third zone dispatch plans as described above, the corresponding dispatch plans are generated as the final dispatch plan. The generated final dispatch plan can be recommended to each vehicle.

[0215]

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

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

[0218] Additionally, the server (100) where the region information is registered can specify the cost according to movement by delivery location and can create a dispatch plan according to the cost.

[0219]

[0220] According to a second embodiment of the present disclosure with reference to FIG. 8, the area information may be designated for each vehicle by a computing device, and the cost matrix may designate a cost proportional to the travel distance from an arbitrary delivery location to an adjacent delivery location.

[0221] Here, the computing device designates preferred zones (810) and avoided zones (820), which are regional information, for each vehicle. Furthermore, the cost matrix is ​​formed by paths (H) connecting multiple delivery locations (M), and each path (H) has a cost value. The cost may be proportional to the travel distance along the path from the first delivery location to the second delivery location.

[0222] The above cost matrix is ​​formed during the cost matrix generation step. Specifically, a cost matrix may be generated that specifies costs based on distance for each delivery location.

[0223]

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

[0225] Here, the cost within the avoidance zone (820) of the cost adjustment step is assigned for each route (H) including the delivery location (M), and a weight can be assigned to differentiate the avoidance zone (820) for each vehicle.

[0226] Here, the weight may be assigned to the entire route (H) connected to a delivery location located in an avoided area (820) among the entire cost matrix. In this case, the cost may be assigned in proportion to the distance. For example, if a route within a preferred area (810) is assigned a cost of 5 per km, a route within an avoided area (820) may be assigned a cost of 25 per km, which is five times the cost. Accordingly, when a computing device generates a dispatch plan based on costs, it can distinguish between preferred areas (810) and avoided areas (820) for each vehicle and preferentially select a delivery location within the preferred area (810).

[0227]

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

[0229] Here, the matrix of the region (y1) where the preferred region (810) and the avoided region (820) overlap is a matrix formed separately from the matrix (z1) of the preferred region (810) and the avoided region matrix (x1). Specifically, the overlapped region (y1) is an avoided region (820), but since it is adjacent to the preferred region (810), it can be a region that can be flexibly delivered, unlike the avoided region matrix (x1).

[0230] Accordingly, some deliveries can be made possible by having a lower cost compared to the matrix of the avoided area (820). For example, if the avoided area cost is 25 per kilometer, the cost of the overlapping area (y1) can be 12.5, which is 50% less than the avoided area cost.

[0231]

[0232] According to a second embodiment of the present disclosure, the step of adjusting the cost may, if there are multiple delivery destinations having values ​​lower than the average of the costs, designate the group of delivery destinations as low-cost delivery destinations.

[0233] Specifically, the low-cost delivery location (w1) may be designated by each of the preferred zone matrix (z1), the overlapping zone matrix (y1), and the avoided zone matrix (x1). This is because, when calculating the average of the weighted avoided zone matrix (x1) and the unweighted preferred zone matrix (z1), the cost of the preferred zone matrix (z1) can be designated significantly lower.

[0234] Accordingly, if multiple delivery destinations with a cost of 1 or less are generated within the preferred zone matrix (z1), they may be designated as separate low-cost delivery destinations (w1), and costs may be assigned based on the movement path from the low-cost delivery destination (w1) to other adjacent delivery destinations (M). These low-cost delivery destinations (w1) can increase delivery efficiency (reduced travel distance, reduced travel time, etc.) by grouping very close delivery destinations (e.g., apartment complexes or shared living spaces), and can reduce overload on computing devices when calculating dispatch plans. Thereafter, the low-cost delivery destination (w1) may be used when establishing a dispatch plan with the same criteria (cost value per delivery destination) as other existing delivery destinations (M).

[0235]

[0236] According to the second embodiment of the present disclosure, the step of adjusting the cost may 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.

[0237] Specifically, in the step of generating a dispatch plan for a vehicle departing from a preferred zone (810), there may be a case where the entry cost into the overlapping zone (y1) is lower than that of entering the preferred zone (810). In this case, when calculating the cost for the next delivery destination of a vehicle that has entered the overlapping zone, the weight may be recovered so that the cost for the overlapping zone has the same cost as that of the preferred zone (810). For example, if a cost of 5 per km is assigned in the preferred zone (810) and a cost of 12.5 per km is assigned in the overlapping zone (y1), but when the dispatched vehicle enters the overlapping zone (y1), the cost in the overlapping zone (y1) may be changed to 5 per km to generate a dispatch plan. In this case, delivery is possible from a delivery location within a preferred zone (810) to a delivery location in a very close overlapping zone (y1), and as additional dispatch is made to an adjacent delivery location, delivery efficiency can be maximized in the overall dispatch plan.

[0238]

[0239] 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, and if the costs are the same, generates a dispatch plan by selecting a priority in order of shortest travel time.

[0240] As described above, the step of generating a dispatch plan of the present disclosure can generate a dispatch plan based on cost. At this time, multiple dispatch plans may be generated, and the most efficient dispatch plan must be selected from among them. To this end, the computing device may select dispatch plans with equal costs and prioritize the selected dispatch plans based on the shortest vehicle travel time.

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

[0242] These same cost-effective dispatches may be affected by various variables, such as travel distance or regional travel. Among these, shorter travel times can maximize vehicle efficiency.

[0243] For example, among the z dispatch plan and the x dispatch plan having the same cost, the z dispatch plan is formed so that delivery is made 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 entered the overlapping zone with a high cost compared to the preferred zone (810) may have a much shorter travel time than the z dispatch plan that only moves 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 per delivery location must be very close to enter. Accordingly, the travel time can be very short. Using this method, it may be possible to create a dispatch plan with a short travel distance per delivery location and a short travel time.

[0244]

[0245] According to a second embodiment of the present disclosure, the step of adjusting the cost sets an obstruction path (including a river, a construction site, and a road with heavy traffic congestion) that obstructs the movement of vehicles within the area, and the step of generating the dispatch plan generates a dispatch plan with the highest priority among dispatch plans excluding dispatch plans including the obstruction path from dispatch plans having the above priorities as a final dispatch plan.

[0246] Here, obstruction paths include rivers, construction sites, and heavily congested roads—anything that impedes vehicle movement.

[0247] Additionally, the highest-priority dispatch plan can be the highest-priority dispatch plan among the prioritized dispatch plans. For example, it could be the dispatch plan with the lowest cost, shortest travel time, and no obstructed routes.

[0248] For example, because Costco lacks information about obstructed routes, it may have travel times disproportionate to the delivery distance. To prevent this, separate obstructed routes can be set, which can be used to minimize delivery time and distance.

[0249] Finally, the highest priority dispatch plan excluding obstructed routes is finally generated and can be recommended for each vehicle.

[0250]

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

[0252] Here, the matching information may be information that selects order information that can be delivered by vehicle as described above, and may mean information that includes a delivery location by vehicle.

[0253] Accordingly, each vehicle has a separate delivery location, and clustering of these locations is possible. Clustering can be based on a region with multiple delivery locations, or on a specific region (e.g., district or city). Furthermore, multiple delivery locations may be selected for each vehicle, and multiple vehicles may exist for each delivery location. For example, 100 items requiring refrigeration may be selected for five refrigerated vehicles. Therefore, multiple vehicles may deliver products to multiple delivery locations, requiring optimal dispatch planning.

[0254] Additionally, priorities can be determined between clusters. For example, clusters can be formed for multiple delivery locations, and priorities can be assigned to each cluster to generate a first dispatch plan, ensuring optimal dispatch.

[0255]

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

[0257] Here, the starting point can vary for each vehicle. It can be the location where the vehicle begins its work or the vehicle's current location. Accordingly, the cluster closest to the vehicle's starting point can be designated as the top-ranked cluster.

[0258] For example, if clusters a1, b1, c1, and d1 are formed as in Fig. 9 (a), the priorities for these may be determined. Specifically, referring to Fig. 9 (b), if the vehicle's departure point is close to a1, a1 may be designated as a 1st-priority cluster, then cluster b1, which is close to the 1st-priority cluster (a1), may be designated as a 2nd-priority cluster, cluster d1, which is close to the 2nd-priority cluster (b1), may be designated as a 3rd-priority cluster, and the remaining c1 cluster may be formed as a 4th-priority cluster. Accordingly, a dispatch plan may be generated in the order of clusters a1 -> b1 -> d1 -> c1 in the order of clusters 1st to 4th.

[0259] By creating the first dispatch plan as described above, the closest delivery location to the vehicle's departure point (vehicle location, logistics warehouse, etc.) can be the first delivery location, which allows for the creation of an optimal dispatch plan.

[0260]

[0261] According to a second embodiment of the present disclosure, the step of generating the first dispatch plan may generate a dispatch plan in a direction toward the next priority cluster when driving from a starting delivery location to a final delivery location within the cluster, and may generate a route for optimal vehicle operation within the cluster.

[0262] Here, the delivery location within a cluster can be an internal delivery location for each cluster with a prioritized priority. For example, it can refer to a delivery location within cluster a1, a delivery location within cluster b1, and so on.

[0263] The method of the present disclosure may perform deliveries based on cluster priorities, while generating separate plans for delivery destinations within a cluster. Referring to Fig. 9 (c), for example, clusters a1, b1, c1, and d1 each have multiple delivery destinations, and dispatch plans may be generated for these delivery destinations. While the dispatch plan may preferably utilize the shortest distance, it is not limited thereto, and may generate a dispatch plan that provides the shortest travel time.

[0264] As described above, if priorities are determined between clusters and dispatch plans are generated for delivery locations within the clusters, a first dispatch plan can be generated that integrates these. Referring to Figure 9 (d), for example, the first dispatch plan can be generated based on cluster priorities from the first delivery location in cluster a1 to the last delivery location in cluster c1 a1. This dispatch plan ensures the shortest distance or time, allowing for the recommendation of an optimal dispatch plan.

[0265]

[0266] 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 including preferred area information and avoided area information for each vehicle, and excluding from the dispatch plan delivery locations included in the avoided area information.

[0267] Here, preferred and avoided zone information may be information about the preferred and avoided zones for each vehicle. Referring to Figure 8, for example, if clusters a1, b1, c1, and d1 are formed, but an avoided zone (S1) exists that runs through the center, deliveries (N1) to the avoided zone (S1) may be excluded. Accordingly, delivery vehicles can travel in a straight line (M1) from the last delivery location in cluster b1 to the first delivery location in cluster d1. Accordingly, the first dispatch plan may generate a second dispatch plan that excludes deliveries to N1.

[0268]

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

[0270] Here, the vehicle movement route may be a route for a region of interest within the first dispatch plan. For example, as shown in Figure 10, a straight route (M1) within a region of interest may include additional deliveries to nearby delivery locations (N2, N3).

[0271]

[0272] According to the 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 of the administrator terminal and the vehicle terminal, and the administrator terminal and the vehicle terminal can modify the dispatch plan result value.

[0273] Here, the dispatch plan result interface may provide the result of the generated second dispatch plan. Referring to Fig. 10, for example, at least a portion (right) may provide a map, and the dispatch plan may be displayed on the map. Displaying the map may facilitate easy identification by the viewer. Furthermore, at least a portion (upper left) may display information regarding the number of orders for the dispatch plan, the number of drivers, the expected work time, the total expected travel distance, and the total expected capacity. Furthermore, at least a portion (lower left) may display summary information about the vehicle drivers (such as the number of orders per driver, travel time, travel distance, and capacity).

[0274] Additionally, after the result interface is transmitted to each terminal, modifications can be made using the terminal. For example, when driver 1 is performing deliveries to destinations 1 through 5, the order of deliveries 2 and 3 can be changed, or deliveries can be excluded, included, or transferred to another driver.

[0275] Additionally, the administrator terminal can modify the entire dispatch plan, and each vehicle terminal can modify the dispatch plan for that vehicle.

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

[0277]

[0278] According to a third embodiment of the present disclosure, a method for providing an optimal dispatch service using a computing device may include providing an interface for dispatch planning results generated according to the second embodiment based on information acquired through the first embodiment. This will be described in detail below.

[0279]

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

[0281] Here, the dispatch plan may be information previously stored on the computing device, but is not limited thereto. The computing device may generate the dispatch plan using an algorithm, or may be provided with an optimal dispatch plan. For example, the dispatch plan may be generated according to the first or second embodiment.

[0282] Additionally, the bar (I1322) may be an icon in the shape of a horizontal bar. For example, the horizontal length may indicate the work time, and the thickness may indicate the presence or absence of a delivery task. Furthermore, when scheduling dispatches for multiple vehicles, one bar may represent one delivery task, and thus, the dispatch plan may include multiple bars.

[0283] Additionally, the revised information may be information changed through the dispatch planning result interface. For example, if a delivery task in the shape of bar (I1322) is moved to a different time or vehicle, the revised information may be for the vehicle from which the bar was removed or for the vehicle to which the bar was added. Furthermore, the revised information may be provided to the user through the interface and may be information modified by the user's input. For example, if the dispatch order and time are modified due to the movement of bar (I1322), the dispatch order and time may be the revised information.

[0284] Additionally, the dispatch plan can be recalculated using the revised information. Specifically, the task of recalculating the dispatch plan can follow the dispatch plan generation method according to the first or second embodiment, but is not limited thereto. Furthermore, the steps for recalculating the dispatch plan may vary depending on whether the bar is fixed or freely modifiable. Further details will be provided below.

[0285] The dispatch plan results recalculated as described above can be provided to the user as a final dispatch plan. An interface for the final dispatch plan may be provided. For example, the interface may be provided in the same format as the dispatch plan result interface.

[0286]

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

[0288] Here, the result interface may be provided to include both a map interface (I1310) and a bar interface (I1320). For example, by providing a map interface (I1310) on the right and a bar interface (I1320) on the left, the route (including order) and dispatch time on the map can be viewed at a glance. Furthermore, in addition to the map and bar interfaces (I1320), a summary interface (I1330) may be included. The summary interface (I1330) may include information on dispatch planning results, such as the total number of vehicles, the number of orders, the number of drivers, the total time, and the total travel distance.

[0289] In addition, the map interface (I1310) and the bar interface (I1320) may include a map maximize button (I1311) and a bar maximize button (I1321), respectively. For example, the button may be located at least in a portion of the interface area, and when a user clicks the button, the corresponding interface may be activated to be displayed on the entire screen. Specifically, the map interface (I1310) may be displayed on the entire screen when activated, and the bar interface (I1320) may be provided so that its horizontal length fills the entire screen when activated. The bar interface (I1320) may have a length greater than a certain length, since the length represents time, and may include a scroll to allow left and right movement. The scroll may vary depending on the proportion of the bar interface (I1320) on the screen, and the scroll may be shortened when the bar interface (I1320) has a long length.

[0290] Additionally, in the bar interface (I1320), a bar may represent a single delivery task. Furthermore, the length of the bar (I1322) may represent a work time. The work time may include the time required to move the vehicle for delivery, as well as the time required for installation and collection.

[0291]

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

[0293] Here, the automatic optimization function maintains the order of the bars in the event that the position of the bars is moved by the user's input, and the moved bar may be the one moved to the front of the dispatch plan for the corresponding vehicle. For example, referring to FIGS. 14 and 15, FIGS. 14 and 15 may be windows in which the bar interface (I1320) is activated, and FIG. 14 may be after the movement of bar number 7, and 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 one 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, business hours, and travel distance, and the dispatch plan may be provided so that it can be checked at a glance through the bar.

[0294] For example, the vehicles in FIGS. 14 and 15 may be numbered 1 through 5 from top to bottom. In the vehicle-specific dispatch plan provided in FIG. 14 , delivery location 7 (bar 7) of vehicle 1 may be moved to vehicle 2. Accordingly, delivery location 7 moves to the front of vehicle 2. In this case, vehicle 2's dispatch plan remains the same, and delivery location 7 information may be added to vehicle 2.

[0295] Additionally, in the vehicle-specific dispatch plan provided in Figure 15, the second delivery location (second bar) of vehicle 1 may have been moved to vehicle 2. Accordingly, delivery location 2 moves to the front of vehicle 2. As described above, the user may have completed inputting the movement of delivery locations 7 and 2 to vehicle 2.

[0296]

[0297] According to the 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.

[0298] Here, the recalculation may refer to a vehicle whose dispatch schedule has been modified. For example, as described above, if the delivery locations 2 and 7 of Vehicle 1 were moved to Vehicle 2, the dispatch schedules for Vehicles 1 and 2 may need to be recalculated accordingly.

[0299] Additionally, the recalculating step may involve recalculating the dispatch plan using an existing algorithm. For example, a dispatch plan may be generated for delivery locations 1, 3, 4, 5, 6, 8, and 9, excluding delivery locations 2 and 7 from vehicle 1. Accordingly, the existing delivery locations 1, 3, 4, 5, 6, 8, and 9 may be assigned a new order, and their existing order may also be reversed. Specifically, the dispatch order may be reversed to 3, 1, 5, 4, 6, 8, and 9, and new delivery location 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 dispatch plan that achieves the shortest vehicle travel distance or a dispatch plan that achieves the shortest travel time.

[0300]

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

[0302] Here, the random order change function may be to specify the dispatch order according to the dropped 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, in FIGS. 16 and 17, the vehicles may be numbered 1 to 5 from the top. As shown in FIG. 16, the dispatch order for vehicles 3 and 4 may be determined by delivery location according to the dispatch plan. Here, if the delivery location 9 of vehicle 4 is located between the delivery locations 4 and 5 of vehicle 3, the delivery location 9 of vehicle 4 is located between the delivery locations 4 and 5 of vehicle 3, and accordingly, the dispatch order for vehicle 3 may be fixed to 1, 2, 3, 4, 9 (delivery location 9 of vehicle 4), 5, and 6. Additionally, the dispatch order of vehicle number 4 may be fixed to delivery locations numbered 1, 2, 3, 4, 5, 6, 7, 8, and 10.

[0303]

[0304] 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).

[0305] Here, the recalculation step can be based on information with an arbitrary reorder. For example, the existing algorithm can be used to recalculate, but the entire dispatch order can be fixed, or the order can be fixed only for delivery locations where movement of bar (I1322) has been confirmed. For example, the dispatch order for vehicle 3 is 1, 2, 3, 4, 9 (vehicle 4's delivery location 9), 5, and 6. While delivery to delivery location 9 can be made in the middle, the work time for delivery locations after delivery location 9 can be modified. Alternatively, the fifth delivery to delivery location 9 can be fixed, while a new dispatch plan can be generated for all remaining delivery locations.

[0306]

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

[0308] Here, the final dispatch plan, which is the recalculated dispatch plan, can be provided to the user terminal. For example, the dispatch plan result interface format can be used as is. An interface could be provided where the dispatch plan on the map on the right and the dispatch plan in bar form on the left are listed in chronological order.

[0309] Additionally, for example, the initial dispatch plan results and the recalculated dispatch plan results may be provided separately. Specifically, while the recalculated dispatch plan results are displayed, the user can select and view the desired result from either the initially calculated dispatch plan results or the previously recalculated results. Furthermore, the recalculation of the dispatch plan may utilize a method according to an embodiment of the present disclosure.

[0310] Additionally, the recalculation step may be based on the user's recalculation input. For example, it is preferable to obtain correction information based on the user's input, and then recalculate by pressing the "Recalculate" button after the user has completed entering the correction information. However, this is not limited to this, and recalculation may occur immediately upon entering the correction information.

[0311]

[0312] According to a third embodiment of the present disclosure, the step of providing the result value interface may further include a summary interface (I1330), and the summary interface (I1330) may further include a dispatch plan tab (I1331) that enables confirmation of the initial dispatch plan and the recalculated dispatch plan.

[0313] Here, the summary interface (I1330) is an interface that roughly summarizes the dispatch plan and may include information on orders and vehicle movements, as described above. In addition, it may include multiple dispatch plan tabs (I1331). Here, the dispatch plan tab (I1331) may include both the initial dispatch plan result value and multiple recalculated dispatch plan result values. For example, the dispatch plan tab (I1331) may include the optimization result, which is the initial dispatch plan result value, and the first recalculated temporary result (2), the second recalculated temporary result (3), the third recalculated temporary result (4), and the fourth recalculated temporary result (5). Here, each of the multiple temporary results generates a dispatch plan and is provided in the form of an interface, and the dispatch plan for the corresponding tab can be confirmed by clicking on one of the multiple tabs.

[0314]

[0315] According to a fourth embodiment of the present disclosure, a method for providing a bar-type interface for a dispatch plan by a computing device for each delivery location includes the steps of: generating a result interface including a bar interface formed by a bar having a thickness according to the dispatch plan and a space between the bar; and providing the result interface; wherein the horizontal length of the bar is determined based on a work time, and the space can be determined based on a vehicle travel time and a waiting time until the next work.

[0316] Here, the dispatch plan may be generated based on multiple vehicles and multiple order information, with each delivery location being a dispatch plan. Furthermore, the dispatch plan may be generated using the method according to the second embodiment. Furthermore, when generating a result interface using the dispatch plan, the size of the bar may be determined based on the dispatch time, delivery location, and work hours according to the dispatch plan.

[0317] Additionally, a bar may represent a single delivery task during a dispatch plan, and may be a bar-shaped object of a certain length.

[0318] Additionally, the result value may be a result based on the generated dispatch plan, for example, indicating that vehicle 1 traveled 50 km over 10 hours to complete 10 delivery tasks. Furthermore, the result interface may be an interface for displaying the result value on a monitor so that the user can easily check it.

[0319] The result value interface generated as above can be provided to the user.

[0320] Additionally, users can easily check the dispatch plan using the provided result interface, and may modify the dispatch plan by moving the bar by dragging and dropping. Here, the computing device may recognize the movement of the bar, obtain the modified dispatch plan, and generate this as modified information.

[0321]

[0322] According to a fourth embodiment of the present disclosure, the method may further include: a step of obtaining correction information through 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 correction information.

[0323] Here, the dispatch plan may be recalculated based on the vehicle-specific delivery location based on the revised information. This recalculated dispatch plan may then be provided to the user as the final dispatch plan.

[0324] Additionally, recalculation may occur after the user completes inputting the modification information and confirms the user's input for recalculation. The recalculated final dispatch plan may be provided to the user.

[0325]

[0326] 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 indicating the travel time of the vehicle and a dotted line indicating the waiting time until the next operation.

[0327] Here, the bar interface may be a bar-shaped representation of delivery tasks according to the vehicle's dispatch plan. The bar may be a bar-shaped bar with a length.

[0328] Additionally, the map interface may display vehicle-specific delivery tasks on a map according to the dispatch schedule. This will be further detailed later.

[0329] Additionally, the bar may be a bar-shaped bar with a horizontal length and may have a fixed length. Here, the length may be the length corresponding 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 with a work time of 1 hour is 1 cm, the length of the bar for a delivery location with a work time of 2 hours may be 2 cm. If it takes twice as long, the bar may be twice as long. Additionally, the bar may have a fixed thickness, and although all bars may have the same thickness, this is not limited to the above, and may have a size that does not exceed the horizontal axis interface of the corresponding vehicle. This may have the effect of forming a solid structure so that the user can easily check it.

[0330] Additionally, a line may be formed between the bars. The line may represent the vehicle's travel time, and its length may represent time. Furthermore, the length may be the same as the bar. For example, if a 1cm bar represents 1 hour, a 1cm line may represent 1 hour.

[0331] Additionally, 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, while the dotted line may represent the expected delivery time or the waiting time until the start of work. For example, if a vehicle travels one hour to the next delivery location and waits one hour before starting work, the line between the delivery locations may be formed by a 1-cm solid line and a 1-cm dotted line, with a bar indicating the next delivery location formed after the dotted line.

[0332] As described above, the dispatch plan and vehicle movement can be formed into bars and lines so that users can easily check them.

[0333]

[0334] According to the fourth embodiment of the present disclosure, the bar of the bar interface can display dispatch order information at least in part.

[0335] Here, the bar has a length, and along with it a thickness, which can be easily identified by the user.

[0336] In addition, the bar may display order information at least in part. For example, referring to FIG. 13, the middle of the bar (I1322) may display the dispatch order. This allows the dispatch order to be confirmed through the bar without having to search for it. Another example is that if the delivery work time is short, the bar may be very short. Accordingly, if the bar is smaller than the number corresponding to the dispatch order, the number may not be displayed. In this case, due to the very short bar, the number of bars displayed on the entire bar interface increases, and the order can be confirmed by the numbers written on adjacent bars among the increased number of bars.

[0337]

[0338] 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 thin bar, and the bar interface can display the number of times the delivery location is moved due to the movement of the delivery location vehicle when the movement of the bar occurs.

[0339] Here, the number of moves can be formed, for example, in the space between the vehicle information and the bar in the bar interface. This makes it easy to identify the vehicle and the number of moves.

[0340] Additionally, the bar interface may include a bar area, a movement count area, and a vehicle summary information area. The bar area is where multiple bars are formed according to the dispatch plan, and this area may be scrollable to the next screen. The movement count area may be the smallest area in the bar interface and may display the number of movements for each vehicle. The vehicle summary information area may include the number of orders for the vehicle, travel distance, travel time, and load capacity.

[0341] As mentioned above, only the bar area can be moved through scrolling on the screen, and the summary information and movement count areas can be fixed so that the user can always check them, allowing for easy confirmation of the dispatch plan.

[0342]

[0343] 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 front of the moved vehicle and a random order change tab that positions the bar in a dispatch order according to the moved position.

[0344] Here, the Auto Optimize tab and the Random Order Change tab can be activated when user input is confirmed. For example, if input for Auto Optimize is confirmed, the corresponding tab can be highlighted and the function applied.

[0345] Specifically, automatic optimization can be implemented by ensuring that the moved vehicle is positioned at the front of the dispatch schedule when a bar is moved based on user input. For example, if the third delivery location (bar) of vehicle 2 is moved to vehicle 1, it would be positioned at the front of vehicle 1, increasing the vehicle's movement count by one. Furthermore, the third delivery location (bar) at the front will undergo optimization through a subsequent recalculation step.

[0346] Additionally, the random order change tab can be used to maintain the dispatch order of the moved locations when the bars are moved based on user input. For example, if delivery location 3 (bar) of vehicle 2 is moved between delivery locations 5 (bar) and 6 (bar) of vehicle 1, delivery location 3 can be changed to delivery location 6 of vehicle 1 in the final dispatch plan generated through a subsequent recalculation step.

[0347]

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

[0349] Here, the map interface displays the dispatch schedule on a map, allowing users to easily check the route according to the dispatch schedule. Pins may also be included to allow users to check the delivery location according to the dispatch schedule.

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

[0351] Here, the PINs can have different shapes for the origin, destination, and shipping locations. For example, a PIN for the shipping location might be an inverted water droplet with a number inside. Furthermore, the origin could be a "start" icon with a number inside. The destination could also be a "end" icon with a number inside.

[0352] Additionally, pins can have different colors for each vehicle. For example, if vehicle 1 delivers to destinations 1-10 and vehicle 2 delivers to destinations 11-20, the dispatch schedule for destinations 1-10 could be displayed in red, and the dispatch schedule for destinations 11-20 could be displayed in yellow.

[0353]

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

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

[0356] Additionally, the initial dispatch plan may be displayed, but the dispatch plan may be recalculated based on the revised information. For example, the system may include an initial dispatch plan tab and multiple recalculated provisional result tabs. When the user selects the optimal result tab based on the initial dispatch plan, the result interface for the initial dispatch results may be displayed. When the user selects the recalculated provisional results tab, the corresponding result interface may be displayed. Here, the result interface may include a bar interface, a map interface, and a summary interface based on the corresponding dispatch plan.

[0357] Accordingly, it may be possible to compare and check the initial dispatch plan and the modified dispatch plan by selecting the tab.

[0358]

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

[0360] The configuration of the computing device (100) illustrated in FIG. 18 is merely an example that is simplified. 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).

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

[0362] The processor (110) may be configured with one or more cores, and may include a processor for data analysis and deep learning, such as a central processing unit (CPU), a general purpose graphics processing unit (GPGPU), and a tensor processing unit (TPU) of a computing device. The processor (110) may read a computer program stored in the memory (130) and perform data processing for machine learning according to an embodiment of the present disclosure. According to an embodiment of the present disclosure, the processor (110) may perform operations 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 weights of a neural network using backpropagation. At least one of the CPU, GPGPU, and TPU of the processor (110) may process learning of a network function. For example, a CPU and a GPGPU can jointly process network function learning and data classification using network functions. Furthermore, in one embodiment of the present disclosure, processors of multiple computing devices can be jointly used to process network function learning and data classification using network functions. 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.

[0363] 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).

[0364] 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, etc.), a random access memory (RAM), a static random access memory (SRAM), a read-only memory (ROM), an electrically erasable programmable read-only memory (EEPROM), a programmable read-only memory (PROM), a magnetic memory, a magnetic disk, and an optical disk. The computing device (100) may also operate in relation to web storage that performs the storage function of the memory (130) on the internet. The description of the above-described memory is merely an example, and the present disclosure is not limited thereto.

[0365] The 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).

[0366] In addition, the network unit (150) presented in this specification can 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.

[0367] In the present disclosure, the network unit (150) may be configured regardless of the communication mode, such as wired or wireless, and may be configured as various communication networks, such as a personal area network (PAN) and a wide area network (WAN). In addition, the network may be the well-known World Wide Web (WWW), and may also utilize a wireless transmission technology used for short-distance communication, such as infrared (IrDA: Infrared Data Association) or Bluetooth.

[0368]

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

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

[0371] Generally, program modules include routines, programs, components, data structures, and the like that perform particular tasks or implement particular abstract data types. Furthermore, those skilled in the art will appreciate that the methods of the present disclosure can be implemented with other computer system configurations, including single-processor or multiprocessor computer systems, minicomputers, mainframe computers, as well as personal computers, handheld computing devices, microprocessor-based or programmable consumer electronics, and the like, each of which may be operatively connected to one or more associated devices.

[0372] The described embodiments of the present disclosure can also be practiced in distributed computing environments, where certain tasks are performed by remote processing devices that are connected through a communications network. In a distributed computing environment, program modules may be located in both local and remote memory storage devices.

[0373] Computers typically include a variety of computer-readable media. Computer-readable media can be any media that can be accessed by a computer, and includes both volatile and nonvolatile media, transitory and non-transitory media, removable and non-removable media. By way of example, and not limitation, computer-readable media can include computer-readable storage media and computer-readable transmission media. Computer-readable storage media includes both volatile and nonvolatile media, transitory and non-transitory media, removable and non-removable media implemented in any method or technology for storing information such as computer-readable instructions, data structures, program modules, or other data. Computer-readable storage media includes, but is not limited to, RAM, ROM, EEPROM, flash memory or other memory technology, CD-ROM, digital video disks (DVD) or other optical disk storage, magnetic cassettes, magnetic tape, magnetic disk storage or other magnetic storage devices, or any other medium that can be accessed by a computer and used to store the desired information.

[0374] Computer-readable transmission media typically includes any information delivery media that embodies computer-readable instructions, data structures, program modules, or other data in a modulated data signal, such as a carrier wave or other transport mechanism. The term modulated data signal means a signal that has one or more of its characteristics set or changed so as to encode information in the signal. By way of example, and not limitation, computer-readable transmission media includes wired media, such as a wired network or direct-wired connection, and wireless media, such as acoustic, RF, infrared, or other wireless media. Combinations of any of the above are also intended to be included within the scope of computer-readable transmission media.

[0375] An exemplary environment (1100) implementing various aspects of the present disclosure is illustrated, including a computer (1102) comprising a processing unit (1104), system memory (1106), and a system bus (1108). The system bus (1108) connects system components, including but not limited to the system memory (1106), to the processing unit (1104). The processing unit (1104) may be any of a variety of commercially available processors. Dual processors and other multiprocessor architectures may also be utilized as the processing unit (1104).

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

[0377] The computer (1102) also includes an internal hard disk drive (HDD) (1114) (e.g., EIDE, SATA) - which 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 or writing to a CD-ROM disk (1122) or 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 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), respectively. The interface (1124) for implementing an external drive includes at least one or both of Universal Serial Bus (USB) and IEEE 1394 interface technologies.

[0378] These drives and their associated computer-readable media provide non-volatile storage of data, data structures, computer-executable instructions, and the like. In the case of the computer (1102), the drives and media correspond to storing any data in a suitable digital format. While 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 appreciate that other types of media readable by a computer, such as zip drives, magnetic cassettes, flash memory cards, cartridges, and the like, may also be used in the exemplary operating environment, and that any such media may contain computer-executable instructions for performing the methods of the present disclosure.

[0379] 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 portions of the operating system, applications, modules, and / or data may also be cached in RAM (1112). It will be appreciated that the present disclosure may be implemented in various commercially available operating systems or combinations of operating systems.

[0380] A user may enter commands and information into the computer (1102) via one or more wired / wireless input devices, such as a keyboard (1138) and a pointing device such as 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, and the like. These and other input devices are often connected to the processing unit (1104) via an input device interface (1142) that is connected to the system bus (1108), but may be connected by other interfaces such as a parallel port, an IEEE 1394 serial port, a game port, a USB port, an IR interface, and the like.

[0381] 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 typically includes other peripheral output devices (not shown), such as speakers, a printer, and so on.

[0382] The computer (1102) may operate in a networked environment using logical connections to one or more remote computers, such as remote computer(s) (1148), via wired and / or wireless communications. 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), although for simplicity, only the memory storage device (1150) is shown. The logical connections shown include wired / wireless connections to a local area network (LAN) (1152) and / or a larger network, such as 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 may be connected to a worldwide computer network, such as the Internet.

[0383] 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 communications to the LAN (1152), which may also include a wireless access point installed therein for communicating with the wireless adapter (1156). When used in a WAN networking environment, the computer (1102) may include a modem (1158), be connected to a communications computing device on the WAN (1154), or have other means of establishing communications over the WAN (1154), such as via the Internet. The modem (1158), which may be internal or external and wired or wireless, is connected to the system bus (1108) via a serial port interface (1142). In a networked environment, program modules or portions thereof described for the computer (1102) may be stored in a remote memory / storage device (1150). It will be appreciated that the network connections depicted are exemplary and other means of establishing a communications link between the computers may be used.

[0384] The computer (1102) operates to communicate with any wireless device or object that is arranged and operates via wireless communication, such as a printer, a scanner, a desktop and / or portable computer, a portable data assistant (PDA), a communication satellite, any equipment or location associated with a radio-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 may simply be an ad hoc communication between at least two devices.

[0385] Wi-Fi (Wireless Fidelity) enables connections to the Internet and other devices without wires. Wi-Fi is a wireless technology that allows devices, such as computers, to send and receive data anywhere within the coverage area of ​​a base station, both indoors and outdoors, similar to cell phones. Wi-Fi networks use wireless technologies 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 the unlicensed 2.4 and 5 GHz radio bands, at data rates of, for example, 11 Mbps (802.11a) or 54 Mbps (802.11b), or in products that include both bands (dual-band).

[0386] Those skilled in the art will appreciate that information and signals may be represented using any of a variety of different technologies and techniques. For example, the data, instructions, commands, information, signals, bits, symbols, and chips 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.

[0387] Those skilled in the art will appreciate that the various illustrative logical blocks, modules, processors, means, circuits, and algorithm steps described in connection with the embodiments disclosed herein may be implemented as electronic hardware, various forms of programs or design code (referred to herein, for convenience, as software), or a combination of both. To clearly illustrate this interchangeability of hardware and software, various illustrative components, blocks, modules, circuits, and steps have been described above generally in terms of their functionality. Whether such functionality is implemented as hardware or software depends upon the particular application and design constraints imposed on the overall system. Those skilled in the art may implement the described functionality in varying ways for each particular application, but such implementation decisions should not be interpreted as causing a departure from the scope of the present disclosure.

[0388] The various embodiments presented herein can be implemented as a method, apparatus, or article of manufacture using standard programming and / or engineering techniques. The term article of manufacture includes a computer program, carrier, or media 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 disks (e.g., CDs, DVDs, etc.), smart cards, and flash memory devices (e.g., EEPROMs, cards, sticks, key drives, etc.). Furthermore, various storage media presented herein include one or more devices and / or other machine-readable media for storing information.

[0389] It should be understood that the specific order or hierarchy of steps in the presented processes is merely 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 the present disclosure based on design priorities. The appended method claims provide elements of various steps in a sample order, but are not intended to be limited to the specific order or hierarchy presented.

[0390] The description of the disclosed embodiments is provided to enable any person skilled in the art to make or use the present disclosure. Various modifications to these embodiments will be readily apparent to those 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. Therefore, the present disclosure is not intended to be limited to the embodiments disclosed herein, but is to be construed in the broadest scope consistent with the principles and novel features disclosed herein.

Claims

1. A step of providing an interface for a dispatch plan result value in the form of a bar at least in part; A step of moving the bar based on user input received through the interface; A step of obtaining modification information for the dispatch plan result value generated by the movement of the above bar; A step of recalculating the dispatch plan result value based on the above modification information; and A step of providing a final dispatch plan recalculated through the above recalculating step; including; A method for providing optimal dispatching service using a computing device.

2. In the first paragraph, the step of providing the result value interface is: At least some of them provide a map interface that displays dispatch schedules on the map, At least some of them provide a bar interface where the dispatch plan is displayed in a bar shape, The above map interface and the above bar interface each include a maximize button, A method for providing optimal dispatching service using a computing device.

3. In the second paragraph, the step of moving the bar comprises: If the automatic optimization feature is enabled, When moving the above bar, it moves to the front of the dispatch order. A method for providing optimal dispatching service using a computing device.

4. In the third paragraph, the step of recalculating the dispatch plan result value is: The above bar recalculates the optimal dispatch plan for the entire delivery location of the moved vehicle. A method for providing optimal dispatching service using a computing device.

5. In the second paragraph, the step of moving the bar comprises: When the random order change feature is enabled, When the above bar is moved, the dispatch order corresponding to the position to which the above bar is moved is specified, If the automatic optimization feature is enabled, When the above bar moves, the vehicle to which the above bar has moved moves to the front of the dispatch plan. A method for providing optimal dispatching service using a computing device.

6. In paragraph 1, Before the step of providing the above result value interface, Further comprising a step of generating a result interface including a bar interface formed by a space between the bar and the bar having a thickness according to the dispatch plan, The horizontal length of the above bar is determined based on the work time, and the gap is determined based on the vehicle's travel time and the waiting time until the next work. A method for providing optimal dispatching service using a computing device.

7. In paragraph 6, The above space is, Includes a solid line indicating the vehicle's travel time and a dotted line indicating the waiting time until the next operation. The above bar is, At least some of the dispatch order information is displayed, A method for providing optimal dispatching service using a computing device.

8. In paragraph 7, If the dispatch time of the above bar becomes very short It is equipped with a thin bar shape, The above bar interface is, If the movement of the above bar causes movement of the dispatched vehicle at the delivery location, Displaying the number of times the delivery location has been moved due to the above movement. A method for providing optimal dispatching service using a computing device.

9. In paragraph 2, The above bar interface is, An automatic optimization tab that positions the above bar at the very front of the moved vehicle. Further comprising a random order change tab that allows the above bars to have a dispatch order according to the moved position. A method for providing optimal dispatching service using a computing device.

10. In paragraph 9, The above map interface is, Includes at least one pin formed at the departure, arrival and delivery location of each vehicle on the map; The above pins have different colors for each dispatched vehicle. A method for providing optimal dispatching service using a computing device.

Images