KR102035864B1 - Method for providing multiple shortest-way finding service - Google Patents

Abstract

Provided is a shortest transport path search service providing method in a multi- delivery platform. The method comprises the steps of: receiving a starting address of a delivery terminal and replacing the starting address with starting coordinates; extracting a plurality of delivery addresses assigned to the delivery terminal or receiving input from the delivery terminal and storing the delivery addresses by mapping the delivery addresses with the delivery terminal; replacing the plurality of delivery addresses with at least one delivery coordinate; calculating a lead time in accordance with the total number of cases via the plurality of delivery addresses from a starting place by using real-time transportation information and navigation; and extracting a combination of calculating a shortest lead time among the calculated lead times to transmit the combination to the delivery terminal.

Description

How to provide the shortest route search service on multiple delivery platforms {METHOD FOR PROVIDING MULTIPLE SHORTEST-WAY FINDING SERVICE}

The present invention relates to a method for providing a shortest route search service in a multiple delivery platform, and provides a method of searching for an optimal route to be delivered to a plurality of destinations in the shortest time.

Recently, the GPS Car Navigation System (GPS Car Navigation System) is becoming more popular as a vehicle driving aid, and the navigation system generally provides the shortest route (Shortest Path, SP) from the departure to the destination by using the road length information. Algorithms are being used. The algorithm for finding the shortest path is Dijkstra, Bellman Ford, Topological Ordering and A-Star (A *). These algorithms generally use length information as the weight of an arc, and the Dijkstra algorithm is the most widely used. It is becoming. Dijkstra's algorithm finds a single-source shortest path from a single starting node to all other nodes for a direction graph of positively weighted arcs.

At this time, the navigation route search method has been researched and disclosed a method for searching the driving route consisting of a link corresponding to the driving speed selected by the driver using the law of limit utility haptic. In this regard, Korean Patent Publication No. 2018-0026111 (published on March 12, 2018), which is a prior art, searches for a route of priority based on a driving speed preset by a driver, The driver enters the driving speed, changes the priority of the link search according to the driving speed entered in the navigation path, and navigates the navigation path so that the driving path is configured to correspond to the driving speed selected by the driver. Receive real-time traffic information of My Links, select a link that corresponds to a priority based on its utility value in the navigation path, calculate the total travel time that the link is connected to, and calculate the total travel time and travel time for the shortest time path A configuration comparing the is disclosed.

However, the problem of commercialized navigation is that it does not reflect real-time traffic flow information because it searches for the shortest route based on the length, and it is received by users. In order to solve this problem, recently, TPEG (Transport Protocol Expert Group) navigation using real-time traffic information service has been commercialized, and as a result, traffic has been developed to bypass the road as smoothly as possible, but navigation with TPEG is superior to general navigation. It does not show performance. This may be due to the lack of real-time accurate traffic information, but due to the performance dissatisfaction of the shortest path search algorithm of the navigation itself.

One embodiment of the present invention, by introducing the concept of driving time instead of the existing length information to easily find the route to reach the destination in the shortest time by using the real-time traffic information, to simplify the algorithm execution process and to modify the real-time route Provides a method of providing the shortest route search service in a multi-shipment platform that can be easily and can consider both a steady-state traffic flow and a sudden occurrence, and can easily and quickly re-search for a route that can reach its destination within the shortest time. can do. However, the technical problem to be achieved by the present embodiment is not limited to the technical problem as described above, and other technical problems may exist.

As a technical means for achieving the above-described technical problem, an embodiment of the present invention, the step of receiving the address of the departure point of the delivery terminal and replacing the address of the departure point with the departure coordinates, a plurality of delivery addresses assigned to the delivery terminal Extracting or receiving input from a delivery terminal, mapping and storing the delivery terminal, substituting a plurality of delivery addresses with at least one delivery coordinate, and all cases of passing through a plurality of delivery addresses at a departure point using real-time traffic information and navigation; Calculating a time required according to the number of times, and extracting a combination of calculating the shortest time required among the calculated time required and transmitting the same to the delivery terminal.

According to any one of the problem solving means of the present invention described above, by introducing the concept of driving time instead of the existing length information, by using the real-time traffic information to easily find the route to reach the destination within the shortest time, the algorithm execution process is simplified It is easy to modify ships and real-time routes, can consider both steady-state traffic flows and accidents, and can quickly and easily search for routes that can reach their destination in the shortest time.

FIG. 1 is a diagram illustrating a system for providing a shortest path search service in a multi-delivery platform according to an exemplary embodiment of the present invention.
FIG. 2 is a block diagram illustrating a server for providing a shortest transportation route search service included in the system of FIG. 1.
3 is a diagram illustrating an embodiment in which a shortest path search service is implemented in a multi-delivery platform according to an embodiment of the present invention.
FIG. 4 is a diagram illustrating a process in which data is transmitted and received between components included in the system for providing the shortest transportation route search service in the multiple delivery platform of FIG. 1 according to an embodiment of the present invention.
5 is a flowchart illustrating a method for providing a shortest path search service in a multi-delivery platform according to an exemplary embodiment of the present invention.

DETAILED DESCRIPTION Hereinafter, exemplary embodiments of the present invention will be described in detail with reference to the accompanying drawings so that those skilled in the art may easily implement the present invention. As those skilled in the art would realize, the described embodiments may be modified in various different ways, all without departing from the spirit or scope of the present invention. In the drawings, parts irrelevant to the description are omitted in order to clearly describe the present invention, and like reference numerals designate like parts throughout the specification.

Throughout the specification, when a part is "connected" to another part, this includes not only "directly connected" but also "electrically connected" with another element in between. . In addition, when a part is said to "include" a certain component, which means that it may further include other components, except to exclude other components, unless specifically stated otherwise, one or more other features It is to be understood that the present disclosure does not exclude the possibility of the presence or the addition of numbers, steps, operations, components, parts, or combinations thereof.

As used throughout the specification, the terms "about", "substantially", and the like, are used at, or in close proximity to, numerical values when manufacturing and material tolerances inherent in the meanings indicated are intended to aid the understanding of the invention. Accurate or absolute figures are used to assist in the prevention of unfair use by unscrupulous infringers. As used throughout the specification of the present invention, the term "step of" or "step of" does not mean "step for".

In the present specification, the term 'unit' includes a unit realized by hardware, a unit realized by software, and a unit realized by both. In addition, one unit may be realized using two or more pieces of hardware, or two or more units may be realized by one piece of hardware.

Some of the operations or functions described as being performed by the terminal, the apparatus, or the device may be performed instead in the server connected to the terminal, the apparatus, or the device. Similarly, some of the operations or functions described as being performed by the server may be performed by the terminal, apparatus or device connected to the server.

In the present specification, some of the operations or functions described as mapping or matching with a terminal mean that a unique number of a terminal or identification information of an individual, which is identification data of the terminal, is mapped or matched. Can be interpreted as

Hereinafter, the present invention will be described in detail with reference to the accompanying drawings.

FIG. 1 is a diagram illustrating a system for providing a shortest path search service in a multi-delivery platform according to an exemplary embodiment of the present invention. Referring to FIG. 1, the shortest path search service providing system 1 in a multi-delivery platform may include at least one customer terminal 100, a shortest path search service providing server 300, and at least one delivery terminal 400. ) May be included. However, since the shortest transportation route search service providing system 1 in the multiple delivery platform of FIG. 1 is only an embodiment of the present invention, the present invention is not limitedly interpreted through FIG. 1.

In this case, each component of FIG. 1 is generally connected through a network 200. For example, as shown in FIG. 1, at least one customer terminal 100 may be connected to the shortest path search service providing server 300 through the network 200. In addition, the shortest route search service providing server 300 may be connected to at least one customer terminal 100 and at least one delivery terminal 400 through the network 200. In addition, the at least one delivery terminal 400 may be connected to the shortest transportation route search service providing server 300 through the network 200.

Here, the network refers to a connection structure capable of exchanging information between respective nodes such as a plurality of terminals and servers. Examples of such a network include RF, 3rd Generation Partnership Project (3GPP) network, and long term (LTE). Evolution network, 5th Generation Partnership Project (5GPP) network, World Interoperability for Microwave Access (WIMAX) network, Internet, Local Area Network (LAN), Wireless Local Area Network (WLAN), Wide Area Network (WAN) , PAN (Personal Area Network), Bluetooth (Bluetooth) network, NFC network, satellite broadcasting network, analog broadcasting network, DMB (Digital Multimedia Broadcasting) network and the like, but is not limited thereto.

In the following description, the term “at least one” is defined as a singular and plural term, and each component may exist in the singular or plural, even though the term “at least one” does not exist, and may mean the singular or plural. It will be self explanatory. In addition, the singular or plural elements may be changed according to embodiments.

The at least one customer terminal 100 may be a terminal of a customer or a recipient who requested a delivery to receive a delivery arrival time using a web page, an app page, a program, or an application related to the shortest path search service in a multi-delivery platform. have. The at least one customer terminal 100 may be a terminal providing a receivable time to the shortest transportation route search service providing server 300.

Here, the at least one customer terminal 100 may be implemented as a computer that can access a server or terminal in a remote place through a network. Here, the computer may include, for example, a navigation, a laptop equipped with a web browser, a desktop, a laptop, and the like. In this case, the at least one customer terminal 100 may be implemented as a terminal that can be connected to a server or terminal in a remote place through a network. The at least one customer terminal 100 is, for example, a wireless communication device that ensures portability and mobility, and includes, for example, navigation, a personal communication system (PCS), a global system for mobile communications (GSM), a personal digital cellular (PDC), Personal Handyphone System (PHS), Personal Digital Assistant (PDA), International Mobile Telecommunication (IMT) -2000, Code Division Multiple Access (CDMA) -2000, W-Code Division Multiple Access (W-CDMA), Wireless Broadband Internet A handheld-based wireless communication device such as a terminal, a smartphone, a smart pad, a tablet PC, etc. may be included.

The shortest path search service providing server 300 may be a server providing a shortest path search service web page, an app page, a program, or an application in a multiple delivery platform. The shortest route search service providing server 300 receives shipping information from the delivery terminal 400 or receives shipping information from at least one shopping mall server (not shown) or a shipping logistics information providing server (not shown). It can be a server. In addition, the shortest transport route search service providing server 300 may be a server that collects at least one delivery information and selects and provides an optimal or shortest delivery route to the delivery terminal 400. In addition, the shortest route search service providing server 300 may collect the available time from the at least one customer terminal 100, collects the absent data from the delivery terminal 400 to build a database for the customer It can be a server. In addition, the shortest transport route search service providing server 300 may be a server to modify the delivery route of the delivery according to the delivery situation, such as emergency, delay, backlog, to the delivery terminal 400, and to change according to traffic conditions Can be. In this case, the configuration of the shortest route search service providing server 300 may be performed in the delivery terminal 400. The computing terminal or the networking resource of the delivery terminal 400 is insufficient or integrated or separated according to the embodiment. The process may be implemented, which is not limited to the above-described embodiments.

Here, the shortest route search service providing server 300 may be implemented as a computer that can access a server or a terminal in a remote place through a network. Here, the computer may include, for example, a navigation, a laptop equipped with a web browser, a desktop, a laptop, and the like.

The at least one delivery terminal 400 may be a shipper's terminal using a web page, an app page, a program, or an application related to the shortest path search service in a multi-delivery platform. In this case, the at least one delivery terminal 400 may be a terminal that transmits data to the shortest transport route search service providing server 300 and receives only the result in order to calculate the shortest transport route as described above. It may be a terminal for inputting information and calculating a result. The at least one delivery terminal 400 may manually input a plurality of delivery addresses, but may also be a terminal that may use information input from the distribution server or the shortest transportation route search service providing server 300. In addition, the at least one delivery terminal 400 transmits its location to the shortest transportation route search service providing server 300 in real time or periodically, so that at least one customer terminal 100 can check information about the delivery situation. It may be a terminal. The at least one delivery terminal 400 may be a terminal that transmits the absent data to the shortest transportation route search service providing server 300. The at least one delivery terminal 400 transmits its GPS data to the shortest transport route search service providing server 300 until the delivery is completed, thereby comparing the time according to the shortest transport path with the actual time taken. It may be a terminal.

Here, the at least one delivery terminal 400 may be implemented as a computer that can access a server or a terminal in a remote place through a network. Here, the computer may include, for example, a navigation, a laptop equipped with a web browser, a desktop, a laptop, and the like. In this case, the at least one delivery terminal 400 may be implemented as a terminal that can access a remote server or terminal through a network. At least one delivery terminal 400 is, for example, a wireless communication device that ensures portability and mobility, navigation, PCS (Personal Communication System), GSM (Global System for Mobile communications), PDC (Personal Digital Cellular), Personal Handyphone System (PHS), Personal Digital Assistant (PDA), International Mobile Telecommunication (IMT) -2000, Code Division Multiple Access (CDMA) -2000, W-Code Division Multiple Access (W-CDMA), Wireless Broadband Internet A handheld-based wireless communication device such as a terminal, a smartphone, a smart pad, a tablet PC, etc. may be included.

FIG. 2 is a block diagram illustrating a server for providing a shortest path search service included in the system of FIG. 1, and FIG. 3 is a diagram showing a shortest path search service in a multiple delivery platform according to an embodiment of the present invention. A diagram for describing one embodiment.

Referring to FIG. 2, the shortest transportation route search service providing server 300 may include a substitution unit 310, a storage unit 320, a conversion unit 330, a calculation unit 340, a transmission unit 350, and a notification unit. 360, the verification unit 370 may be included.

According to an embodiment of the present invention, the shortest route search service providing server 300 or another server (not shown) operating in conjunction with at least one customer terminal 100 and at least one delivery terminal 400 may be multiplied. At least one customer terminal 100 and at least one delivery terminal 400 are the shortest in the multiple delivery platform when transmitting the shortest route routing service application, program, app page, web page, etc. in the delivery platform. You can install or open a route navigation service application, program, app page, or web page. In addition, the service program may be driven in at least one customer terminal 100 and at least one delivery terminal 400 using a script executed in a web browser. Here, the web browser is a program that enables the use of the World Wide Web (WWW) service, and refers to a program that receives and displays hypertext described in HTML (hyper text mark-up language), for example, Netscape. , Explorer, chrome and the like. In addition, an application means an application on a terminal, and includes, for example, an app running on a mobile terminal (smartphone).

Referring to FIG. 2, the substitution unit 310 may receive an address of a starting point of the delivery terminal 400 and replace the starting address with a starting point coordinate. In this case, the coordinates may be coordinates set in any notation or may be coordinates of a common standard, for example, GPS.

The storage unit 320 may extract a plurality of delivery addresses allocated to the delivery terminal 400 or receive the input from the delivery terminal 400 and map the same to the delivery terminal 400 and store the mapping. At this time, it may be input directly from the delivery terminal 100 or may be input from the distribution center, it can be input in various ways will be apparent.

The conversion unit 330 may replace the plurality of delivery addresses with at least one delivery coordinate. Similarly, the conversion unit 330 may be a coordinate set to a preset notation or standard for the delivery destination. At this time, any of the coordinates of the origin and destination may be used, but the two notations should be the same to be unified.

The calculation unit 340 may calculate the time required according to the number of all cases via the plurality of delivery addresses at the departure point using real-time traffic information and navigation. In this case, the number of all cases may be calculated by a formula of n! (Factorial) for the plurality of delivery addresses n. For example, assuming that the number of delivery addresses is n, the numbers in all cases may be nx (n-1) x (n-2) x ...... x2x1.

In this case, the shortest path search algorithm should not spend excessive time calculating the path length in order to reach the destination in consideration of the road speed. In addition, it is necessary to calculate the path length only for the path to be set to the destination without calculating the path length for all nodes of the graph. This requires the prior removal of unnecessary nodes that are not on the path from the source to the destination. However, the Dijkstra algorithm cannot satisfy this condition because it calculates the shortest path of all nodes. Accordingly, an embodiment of the present invention may not calculate the shortest path length of all nodes, such as the Dijkstra algorithm, so as to be able to arrive at the shortest time to the destination, even for nodes existing on the path to the destination. A method that does not go through the process of calculating the shortest path length may be used. In addition, a method of searching for the shortest bypass route by calculating vehicle driving time for each road based on road driving speed information provided in real time rather than length information may be used, but is not limited thereto. Embodiments may be used.

Dijkstra's algorithm selects nodes with the minimum path length one at a time, starting from a particular node, and finds the node with the minimum path length among the nodes adjacent to the specific node and previously calculated nodes. Accordingly, the present invention may generate a path in consideration of both a node having a minimum path length by the Dijkstra algorithm and a node having a shortest transportation time by the above-described method. If the navigation system intends to provide the shortest route to the destination in real time by reflecting traffic flow situation information, the existing length information cannot be utilized as the weight of the call, and the concept of driving time divided by the length can be applied.

Alternatively, an embodiment of the present invention may use an algorithm that can easily obtain the shortest path without calculating the path length of any node, such as the Dijkstra algorithm. At this time, the vehicle driving speed is applied as the weight of the call, and the vehicle driving speed may use TPEG speed information of DMB broadcasting, vehicle speed information of road traffic information collecting CCTV, and road speeds in which these information cannot be used. In this case, in order to reach the destination from the navigation, the reverse road (the reverse road) must be ignored. To this end, the pretreatment process may be performed as follows. In order to remove the reverse-direction road of the directional graph and to quickly search for the shortest point-to-point, the nodes of the graph are classified into groups. Here, all route nodes in the graph except for the departure node, the destination node, the departure and the destination node are defined, and in order to find the shortest path from the navigation to the departure to the destination, the reverse road from the destination to the origin must not be considered. The same applies to both length-based and travel-based algorithms and should also be applied to the Dijkstra algorithm. The technique of deleting the reverse road may be performed as follows.

First, set the level of the graph, sequentially increase the level starting from the departure node until reaching the destination node, deleting the reverse-traveling arcs, and the path lengths for all nodes from the departure node to the destination node. The Shortest Time Path (STP) algorithm can be used to simply determine the shortest path without calculating. This may be applied to the concept of cut property of MST in a modified form of selecting a minimum weight edge at each vertex.

The transmitter 350 may extract a combination of the shortest required time from the calculated required time and transmit the extracted combination to the delivery terminal 400. In this case, the combination of calculating the shortest required time may include a sequence of a plurality of delivery addresses. When the combination of calculating the shortest time required from the time calculated by the transmission unit 350 is extracted and transmitted to the delivery terminal 400, when a receivable time is input from the customer terminal 100 included in the plurality of delivery addresses. The combination may be changed to be able to arrive at the delivery address of the customer terminal 100 at the time of receipt.

The notification unit 360 extracts a combination that calculates the shortest time required from the time calculated by the transmission unit 350, transmits the combination to the delivery terminal 400, and then calculates a plurality of estimated arrival times according to the extracted combination. It may be transmitted to a plurality of customer terminal 100 having a shipping address of. And, the notification unit 360, the plurality of customer terminal 100, based on the delivery status of the delivery terminal 400, the current location and traffic conditions, the delivery schedule data, including delivery delay, smooth delivery, and delivery fast Can transmit

The verification unit 370 extracts the combination that calculates the shortest time required from the time calculated by the transmission unit 350, transmits the combination to the delivery terminal 400, and then completes delivery to the delivery address from the delivery terminal 400. You can check whether or not. In addition, when the delivery unit 400 does not complete the delivery to the delivery address, the verification unit 370 may collect the time when the delivery terminal 400 arrives at the delivery address, and the delivery address and the collected time to be shipped except the collected time. Can be mapped and stored. For example, before shipper arrives, A shipper (deliveryer) scans all the items today and calculates the route according to the shortest lead time, and at each estimated time of arrival of at least one destination included in the route, Assume that the expected time of arrival is sent to the recipient's terminal. In this case, if the estimated arrival time is not corrected or corrected in real time, the delivery person may not arrive at the expected arrival time, and at this time, the recipient may not be at home. Or, if the recipient cannot be at home at the expected time of arrival, for example, if the worker delivers the goods home, the recipient may not be able to receive it. Accordingly, in the case of collecting a pattern roughly when the recipient B is at home, the route is set so that it is not delivered to the recipient B at the time when he is not at home so that the shipper does not miss. For example, a delivery driver will have a profit of 500 won per case, but if he comes to a time without B and presses the bell and calls B, the delivery driver wastes fuel costs, phone costs, and labor. Done. Therefore, in order to efficiently use the labor force of the delivery driver, it is possible to accurately deliver based on real-time data updates, the recipient's home time, the estimated time of arrival according to traffic conditions, and the like.

In addition, an embodiment of the present invention may further consider a method of searching for the real-time shortest path on a directional dynamic road when generating the shortest time path. For example, a one-way arrow means a one-way road, and a two-way arrow means a road capable of two-way traffic. One-way roads have speed information only in one direction, and two-way roads have bidirectional speed information. At this time, Dijkstra search is based on distance and driving time. Here, in order to distinguish the directionality, it is possible to distinguish whether or not the basic speed can be put in the edge information. For example, if the basic speed is 0, it may be defined as a road that cannot be used. In an embodiment of the present invention, a method of changing a situation to a constant value in order to reflect the shortest path in real time on a dynamic road, and updating the shortest path to a vehicle satisfying a condition when the change is made. In addition to the above-described method, the shortest path may be calculated in various ways and may be changed according to embodiments.

Hereinafter, an operation process according to the configuration of the shortest transportation route search service providing server of FIG. 2 will be described in detail with reference to FIG. 3. However, the embodiment is only any one of various embodiments of the present invention, but is not limited thereto.

Referring to FIG. 3, (a) the shortest transportation route search service providing server 300 receives or automatically collects a shipper's starting address (post address or road name address), and coordinates the starting address of the shipper with starting coordinates. (B) the shipper receives or automatically collects the values of the first to nth destinations (address number or road name address) to be transported, and converts the values of the corresponding destinations to the delivery destination coordinates. And, (c) the shortest route route service providing server 300 calculates the number of cases connecting each node (shipping destination) using the navigation platform and real-time traffic information system, and calculates the time required in each case In this case, the route that takes the least time among the calculated time is extracted and transmitted to the delivery terminal 400. Of course, the above-described process may be driven in the delivery terminal 400 as described above. And, (d) when receiving a non-acceptable message from the customer terminal 100, the shortest transport route search service providing server 300 to set the delivery route again and send to the delivery terminal 400 can be delivered without the recipient. Make sure you don't go through your shipping address.

2 and 3 described above with respect to the method for providing the shortest transport route search service in the multi-delivery platform described above with respect to the description of the method for providing the shortest transport route search service in the multi-delivery platform Since it can be easily inferred from the same or described content it will be omitted.

FIG. 4 is a diagram illustrating a process in which data is transmitted and received between components included in the system for providing the shortest transportation route search service in the multiple delivery platform of FIG. 1 according to an embodiment of the present invention. Hereinafter, an example of a process in which data is transmitted and received between each component will be described with reference to FIG. 4, but the present disclosure is not limited to the above-described embodiments, and is illustrated in FIG. 4 according to the various embodiments described above. It is apparent to those skilled in the art that the process of transmitting and receiving data may be changed.

Referring to FIG. 4, the shortest transportation route search service providing server 300 receives an order and a delivery address from a customer terminal 100 or a distribution center (S4100), confirms a current departure point from a delivery terminal 400, and delivers a shipper. If it is confirmed that the charge of (S4200), using the address corresponding to the goods in charge of the carrier to generate a path for calculating the shortest time (S4300 ~ S4500).

At this time, the shortest transportation route search service providing server 300 extracts the path of the shortest time (S4600) and transmits it to the delivery terminal 400 (S4700), and the customer of each node (shipping address) included in the path of the shortest time. The scheduled arrival time is transmitted to the terminal 100 (S4730), and the delivery terminal 400 allows the navigation to be driven by the path of the shortest time (S4710). In addition, when the shortest transportation route search service providing server 300 receives a missed notification from the customer terminal 100 (S4750), the route is modified (S4800) and the modified route is transmitted to the delivery terminal 400. And (S4810), the navigation is driven to the modified path (S4900). On the other hand, when the shortest route route service providing server 300 receives an out-of-office notification indicating that the customer failed to ship because the customer is absent from the delivery terminal (400) (S4910), and updates the data of the customer to the corresponding time for future delivery Used to set the route to exclude (S4920).

The order between the above-described steps S4100 to S4920 is merely an example, and the present invention is not limited thereto. That is, the order between the above-described steps S4100 to S4920 may be mutually changed, and some of the steps may be executed or deleted at the same time.

Such a short description of the method for providing the shortest transportation route search service in the multi-delivery platform of FIG. 4 is described above with reference to the description of the method for providing the shortest transportation route search service in the multi-delivery platform through FIGS. 1 to 3. Since it can be easily inferred from the same or described content it will be omitted.

5 is a flowchart illustrating a method for providing a shortest path search service in a multi-delivery platform according to an exemplary embodiment of the present invention. Referring to FIG. 5, the shortest transportation route search service providing server receives an address of a departure point of a delivery terminal, replaces an address of a departure point with a departure point coordinate (S5100), and extracts or delivers a plurality of delivery addresses assigned to the delivery terminal. It receives the input from the terminal and stores the mapping with the delivery terminal (S5200).

In addition, the shortest transportation route search service providing server substitutes at least one delivery coordinate with a plurality of delivery addresses (S5300), and uses the real-time traffic information and navigation in all cases of passing through the plurality of delivery addresses at the starting point. Calculate the time required according to (S5400). Finally, the shortest transportation route search service providing server extracts a combination of calculating the shortest required time from the calculated required time and transmits it to the delivery terminal (S5500).

Such a short description of the method for providing the shortest transportation route search service in the multi-delivery platform of FIG. 5 is described above with reference to the description of the method for providing the shortest transportation route search service in the multi-delivery platform through FIGS. 1 to 4. Since it can be easily inferred from the same or described content it will be omitted.

The method for providing a shortest route search service in a multi-delivery platform according to an embodiment described with reference to FIG. 5 is in the form of a recording medium including instructions executable by a computer, such as an application or a program module executed by a computer. May also be implemented. Computer readable media can be any available media that can be accessed by a computer and includes both volatile and nonvolatile media, removable and non-removable media. In addition, computer readable media may include all computer storage media. Computer storage media includes both volatile and nonvolatile, removable and non-removable media implemented in any method or technology for storage of information such as computer readable instructions, data structures, program modules or other data.

The above-described method for providing a shortest route search service in a multi-delivery platform according to an exemplary embodiment of the present invention may include an application basically installed in a terminal (this may include a program included in a platform or an operating system basically installed in the terminal). ), Or may be executed by an application (ie, a program) that is directly installed on the master terminal by an application providing server such as an application store server, an application, or a web server associated with the corresponding service. In this sense, the above-described method for providing the shortest route search service in a multi-delivery platform according to an embodiment of the present invention is implemented as an application (ie, a program) basically installed in a terminal or directly installed by a user, and the like. Can be recorded on a computer readable recording medium.

The foregoing description of the present invention is intended for illustration, and it will be understood by those skilled in the art that the present invention may be easily modified in other specific forms without changing the technical spirit or essential features of the present invention. will be. Therefore, it should be understood that the embodiments described above are exemplary in all respects and not restrictive. For example, each component described as a single type may be implemented in a distributed manner, and similarly, components described as distributed may be implemented in a combined form.

The scope of the present invention is shown by the following claims rather than the above description, and all changes or modifications derived from the meaning and scope of the claims and their equivalents should be construed as being included in the scope of the present invention. do.

Claims (6)

In the shortest transport route search service providing server, the shortest transport route search service providing method,
Receiving an address of a departure point of a delivery terminal and replacing an address of the departure point with a departure point coordinate;
Extracting a plurality of delivery addresses allocated to the delivery terminal or receiving an input from the delivery terminal and mapping and storing the delivery addresses;
Replacing the plurality of shipping addresses with at least one shipping coordinate;
Calculating time required according to the number of all cases via the plurality of delivery addresses at the departure point using real-time traffic information and navigation, wherein the number of all cases is n! For the plurality of delivery addresses n! Calculated by the formula of-;
Extracting a path of a combination that calculates the shortest required time out of the calculated time durations; the path of the combination that calculates the shortest required time is a node having a minimum path length by a Dijkstra algorithm and a node having a shortest transportation time; All paths, including a sequence of a plurality of shipping addresses;
Transmitting a path of the combination of calculating the extracted shortest required time to the delivery terminal;
Transmitting the estimated arrival time calculated according to the extracted combination path to a plurality of customer terminals having the plurality of delivery addresses;
Transmitting scheduled delivery data including delivery delays, smooth delivery, and fast delivery based on the delivery status, the current location, and the traffic situation of the delivery terminal to the plurality of customer terminals;
Confirming whether or not the delivery is completed to a certain delivery address from the delivery terminal;
Collecting a time when the delivery terminal arrives at the arbitrary delivery address when the delivery is not completed at the arbitrary delivery address; And
Mapping and storing the arbitrary delivery address and the collected time to be delivered except the collected time,
Extracting the path of the combination of calculating the shortest required time from the calculated required time,
Removing information about the reverse-direction road of the direction graph of the navigation;
Changing a route of the combination such that when a receivable time is input from the customer terminals included in the plurality of delivery addresses, the arrival time is received at the receivable time of the customer terminal; And
Searching for the shortest path in the directional dynamic road information when extracting the path of the combination that calculates the shortest required time;
In the directional dynamic road information, the one-way arrow indicates a one-way road, the two-way arrow indicates a two-way road, the one-way road has speed information in only one direction, and the two-way road has two-way speed information. Each exists,
The step of removing the information on the reverse-direction road of the direction graph of the navigation may include setting a level of the direction graph, sequentially increasing the levels starting from the departure node until reaching the destination node, and reverse-driving direction The shortest transport path in a multiple delivery platform is characterized by deleting the calls and applying the shortest time path (STP) algorithm to determine the shortest path without calculating the path length for all nodes from the departure node to the destination node. How to provide navigation services.
delete delete delete delete delete

Images