Method, apparatus, and recording medium for managing route information

Abstract

The present disclosure relates to a method performed by an electronic device, to an apparatus, and to a recording medium. A method, according to one embodiment of the present disclosure, may comprise the steps of: identifying basic data; identifying a plurality of sub-routes corresponding to a first group; generating a plurality of candidate routes corresponding to the first group on the basis of the plurality of sub-routes corresponding to the first group; identifying at least one first objective function and at least one first constraint on the basis of the first group; calculating at least one first parameter corresponding to the first objective function and the at least one first constraint on the basis of the basic data and the plurality of candidate routes corresponding to the first group; and calculating a first selection vector for selecting at least a portion of the plurality of candidate routes corresponding to the first group on the basis of the at least one first objective function, the at least one first constraint, and the at least one first parameter.

Description

Method, device and recording medium for managing path information

[0001] The present disclosure relates to a technology for managing route information. More specifically, it relates to a technology for generating route information for each transportation mode, which visits each location and processes tasks.

[0002] Fulfillment services involve various tasks, such as collecting and transporting products on behalf of the seller for resale to a warehouse, transporting these products to various hubs, or shipping products from hubs to individual customers based on customer orders. Therefore, they can generate significantly higher transport volumes than traditional e-commerce services. Furthermore, the advancement of logistics and the growing demand for fulfillment services are driving the need for optimized product transport.

[0003] A technical problem to be solved through one embodiment of the present disclosure is to provide a technology for generating optimal route information in route information management.

[0004] Another technical challenge to be solved through one embodiment of the present disclosure is to provide a technique for reducing the problem size of optimal path generation by combining various optimization techniques.

[0005] Another technical challenge to be solved through one embodiment of the present disclosure is to provide a technology for searching for an optimal route while satisfying various conditions related to a transportation route.

[0006] The technical problems of the present disclosure are not limited to the technical problems mentioned above, and other technical problems not mentioned will be clearly understood by those skilled in the art of the present disclosure from the description below.

[0007] A method performed by an electronic device according to one embodiment of the present disclosure may include: a step of identifying basic data; a step of identifying a plurality of sub-paths corresponding to a first group; a step of generating a plurality of candidate paths corresponding to the first group based on the plurality of sub-paths corresponding to the first group; a step of identifying one or more first objective functions and one or more first constraints based on the first group; a step of calculating one or more first parameters corresponding to the first objective function and the one or more first constraints based on the basic data and the plurality of candidate paths corresponding to the first group; and a step of calculating a first selection vector for selecting at least some of the plurality of candidate paths corresponding to the first group based on the one or more first objective functions, the one or more first constraints, and the one or more first parameters.

[0008] In an embodiment, the method may further include the step of: identifying a remaining request among one or more requests for transport of an item based on the first selection vector and the basic data; and the step of generating an entire route corresponding to a second group based on the remaining request.

[0009] In an embodiment, the step of generating a full path corresponding to the second group may further include: generating a plurality of candidate paths corresponding to the second group based on the remaining requests and the basic data; identifying one or more second objective functions and one or more second constraints based on the second group; calculating one or more second parameters based on the basic data and the plurality of candidate paths corresponding to the second group; and calculating a second selection vector that selects at least some of the plurality of candidate paths corresponding to the second group based on the one or more second objective functions, the one or more second constraints, and the one or more second parameters.

[0010] In an embodiment, the one or more second objective functions may be different from the one or more first objective functions.

[0011] In an embodiment, the step of identifying a plurality of sub-paths corresponding to the first group may include: identifying basic data including information about a plurality of candidate locations corresponding to the first group; and selecting at least some of the plurality of candidate locations based on the basic data to generate a plurality of sub-paths corresponding to the first group.

[0012] In an embodiment, the step of identifying a plurality of sub-paths corresponding to the first group may include a step of generating a plurality of sub-paths corresponding to the types of the transportation means based on at least some types of the transportation means among the types of one or more transportation means included in the first group.

[0013] In an embodiment, the method may include: a step of determining whether each candidate path among the plurality of candidate paths satisfies a path condition; and a step of calculating a first selection vector based on the plurality of candidate paths if each candidate path satisfies the path condition.

[0014] In an embodiment, the method may further include a step of removing the candidate path if the candidate path does not satisfy the path condition.

[0015] In an embodiment, at least some of the one or more first objective functions may be generated based on workload parameters calculated based on the plurality of candidate paths and the basic data.

[0016] In an embodiment, at least some of the one or more first objective functions may be generated based on cost parameters calculated based on the plurality of candidate paths and the basic data.

[0017] In an embodiment, the method may further include a step of generating an entire path corresponding to the first group based on the first selection vector.

[0018] An electronic device according to one embodiment of the present disclosure comprises one or more processors, one or more memories storing instructions to be executed by the one or more processors, and when the instructions are executed by the one or more processors, the one or more processors may be configured to execute a method according to the present disclosure.

[0019] A non-transitory computer-readable recording medium according to one embodiment of the present disclosure is a non-transitory computer-readable recording medium having recorded thereon instructions that, when executed by one or more processors, cause the one or more processors to perform operations, wherein the instructions can be configured to cause the one or more processors to perform a method according to the present disclosure.

[0020] According to the present disclosure, optimal route information can be generated in route information management.

[0021] According to the present disclosure, more efficient path planning can be provided by combining various optimization techniques to reduce the problem size for generating an optimal path.

[0022] According to the present disclosure, a technology is provided for automatically searching for an optimal route while satisfying various conditions related to a transportation route.

[0023] The effects according to the technical idea of ​​the present disclosure are not limited to the effects mentioned above, and other effects not mentioned will be clearly understood by those skilled in the art from the description of the specification.

[0024] FIG. 1 illustrates an environment in which an electronic device according to one embodiment of the present disclosure can be applied.

[0025] FIG. 2 is a block diagram of an electronic device according to one embodiment of the present disclosure.

[0026] FIG. 3 is a diagram illustrating a sub-path according to one embodiment of the present disclosure.

[0027] Figure 4 is a flowchart illustrating a method according to one embodiment of the present disclosure.

[0028] Figures 5a and 5b are drawings for explaining candidate locations and sub-paths.

[0029] Figure 6 is a drawing for explaining the operation of producing a selection vector.

[0030] Figure 7 is a flowchart illustrating a method according to one embodiment of the present disclosure.

[0031] The various embodiments described in this disclosure are exemplified for the purpose of clearly explaining the technical concept of this disclosure and are not intended to be limited to specific embodiments. The technical concept of this disclosure includes various modifications, equivalents, alternatives, and embodiments selectively combined from all or part of the embodiments described in this disclosure. Furthermore, the scope of the technical concept of this disclosure is not limited to the various embodiments presented below or the specific descriptions thereof.

[0032] Terms used in this disclosure, including technical or scientific terms, unless otherwise defined, may have the meaning commonly understood by a person of ordinary skill in the art to which this disclosure belongs.

[0033] The expressions "includes," "may include," "comprises," "may have," "have," and "may have" used in this disclosure indicate the presence of a target feature (e.g., a function, operation, or component), but do not exclude the presence of other additional features. In other words, such expressions should be understood as open-ended terms that imply the possibility of including other embodiments.

[0034] The singular expressions used in this disclosure may include the plural meaning unless the context clearly indicates otherwise, and the same applies to the singular expressions set forth in the claims.

[0035] The expressions "first," "second," or "first", "second", etc. used in this document, unless the context indicates otherwise, are used to refer to multiple similar objects and to distinguish one object from another, and do not limit the order or importance among the objects.

[0036] As used herein, the expressions "A, B, and C", "A, B, or C", "A, B, and / or C", or "at least one of A, B, and C", "at least one of A, B, or C", "at least one of A, B, and / or C", etc., may refer to each of the listed items or to all possible combinations of the listed items. For example, "at least one of A or B" may refer to (1) at least one A, (2) at least one B, (3) at least one A and at least one B.

[0037] The expression "based on" as used in this disclosure is used to describe one or more factors that influence a decision, act of judgment, or action described in a phrase or sentence containing this expression, and this expression does not exclude additional factors that influence the decision, act of judgment, or action.

[0038] As used herein, the expression that a component (e.g., a first component) is “connected” or “connected” to another component (e.g., a second component) may mean that the component is directly connected or connected to the other component, as well as connected or connected via a new other component (e.g., a third component).

[0039] The expression "configured to" used in the present disclosure may have the meanings of "set to", "having the ability to", "modified to", "made to", "capable of", etc., depending on the context. This expression is not limited to the meaning of "specifically designed in hardware", and for example, a processor configured to perform a specific operation may mean a general purpose processor that can perform the specific operation by executing software, or a special purpose computer that is structured through programming to perform the specific operation.

[0040] Hereinafter, various embodiments of the present disclosure will be described with reference to the attached drawings. In the attached drawings and the description of the drawings, identical or substantially equivalent components may be assigned the same reference numerals. Furthermore, in the description of various embodiments below, duplicate descriptions of identical or corresponding components may be omitted, but this does not mean that such components are not included in the embodiments.

[0041] Figure 1 illustrates an environment in which an electronic device according to one embodiment of the present disclosure can be applied. An electronic device (101) and a user terminal (102) are connected via a network and can communicate with each other.

[0042] The electronic device (101) may be a server device that manages route information according to one embodiment of the present disclosure. That is, the electronic device (101) may be a server device that operates under the management of a route information management entity.

[0043] The route information managed by the electronic device (101) may include route information regarding the transportation of goods. The route information may include information regarding one or more visited locations. In one embodiment, the route information may be managed by unit schedule. For example, if the unit schedule is daily, the route information may be information managed by date. The electronic device (101) may generate route information for each unit schedule. The route information may be assigned to each transportation method within the unit schedule. For example, the route information may include information regarding multiple visited locations to be visited within the unit schedule for each transportation method. The route information may include information regarding at least some of the multiple visited locations to be included in the route, the order between the visited locations, the visiting time for each visited location, the distance between visited locations, the time required between visited locations, and the time required for each visited location. The time required for each visited location may be understood as the time required to load or unload items corresponding to the visited location onto the transportation method. The electronic device (101) may generate, modify, and store the route information.

[0044] The electronic device (101) can manage basic data. Basic data may include raw data for generating route information. Basic data may include at least some of item information, seller information, location information, information regarding transportation requests, and transportation means information. In one embodiment, basic data may be managed by unit schedule. The electronic device (101) may generate, receive, classify, or store basic data by unit schedule.

[0045] Item information may include information about one or more items to be transported within a unit schedule. Item information may include at least some of the following: item type, item quantity, item volume, item weight, and item packaging unit. Item information may be mapped to seller information and / or location information. In one embodiment, the packaging unit may indicate how each item is or is to be packaged. For example, the packaging unit may be distinguished based on at least some of the following packaging methods: individual packaging, pallet packaging, and box packaging.

[0046] Location information may include information regarding the location of each seller. In one embodiment, the location information may be mapped to seller information and item information corresponding to each location. Based on the location information, the electronic device (101) may identify at least some of the information regarding the type, quantity, volume, weight, and packaging unit of the item corresponding to each location.

[0047] Information regarding a transportation request may include information regarding the seller's request for the transportation of an item. The transportation request information may include location information, seller information, item information, information regarding the request time, and information regarding the scheduled transportation date and time. Depending on the scheduled transportation date and time, a transportation request may be assigned to a specific schedule. One or more transportation requests may correspond to each schedule. That is, one or more transportation requests may require transportation on the corresponding schedule. The electronic device (101) may identify one or more transportation requests corresponding to each schedule.

[0048] Transportation information may include information about one or more transportation means for transporting items. The transportation information may include information about the type of transportation means. The types of transportation means may be classified by loading capacity. The types of transportation means by loading capacity may be classified based on the maximum amount each transportation means can transport at one time. For example, transportation means may be classified by loading capacity type, such as 14 tons (tons), 10 tons, 5 tons, and 3.5 tons. The transportation information may include information about groups of transportation means. The information about groups of transportation means may be classified based on how the transportation means are used. In other words, the information about groups may be classified based on how each transportation means is operated. For example, transportation means may be classified into a fixed vehicle group (e.g., Group 1) that is managed and used on a fixed basis and a rental vehicle group (e.g., Group 2) that is additionally rented. The transportation means information may include, for each type of transportation means, at least some of the following: maximum loading capacity, number of transportation means of each type, and unit cost of transportation means of each type. The transportation means information may include, for each group of transportation means, at least some of the following: maximum loading capacity of each of one or more transportation means included in each group, number of transportation means of each group, and unit cost of transportation means of each group. The unit cost of transportation means may include at least some of the cost per unit time corresponding to the time of use of the transportation means and the cost per unit distance corresponding to the driving distance. In one embodiment, the unit cost of a rental vehicle group may have a higher value than the unit cost of a fixed vehicle group.

[0049] In this way, path information and / or basic data can be managed by the electronic device (101). Information management by the electronic device (101) can collectively refer to a series of actions involving controlling and processing the information. For example, information management can include acquiring, storing, updating, or modifying the information.

[0050] The electronic device (101) described above may be implemented as one or more computing devices. For example, all functions of the electronic device (101) may be implemented in a single computing device. For another example, a first function of the electronic device (101) may be implemented in a first computing device, and a second function may be implemented in a second computing device. As another example, multiple computing devices may be used, each of which implements all or specific functions of the electronic device (101). The computing devices described above may be, but are not limited to, a desktop computer, a laptop computer, an application server, a proxy server, or a cloud server, and any type of device equipped with computing functions may be a computing device.

[0051] The user terminal (102) may be a device used by a transportation worker or seller to receive route information from an electronic device (101). The user terminal (102) may be implemented as a terminal capable of transmitting and receiving various information with the electronic device (101) via a network. For example, the user terminal (102) may be one of a computer, a laptop, a portable communication terminal (such as a smartphone), a portable multimedia device, a wearable device, or an HMD. However, the type of the user terminal (102) is not limited thereto, and the user terminal (102) may be any device that includes an input / output interface capable of receiving information from a user or outputting information to a user, and that can communicate with the electronic device (101) or other devices via a network.

[0052] The user terminal (102) can provide information received from the electronic device (101) to the user, and can receive input from the user and transmit it to the electronic device (101). Specifically, the user terminal (102) can obtain inputs from the user to call various pages, and generate commands to call various pages in response to the obtained inputs. The user terminal (102) can transmit commands to the electronic device (101) to instruct the calling of various pages. The inputs obtained from the user can include various forms of input, such as clicking using a mouse, touching using a touchpad or a touch screen, voice recognition, and other electronic inputs. The user terminal (102) can receive various pages from the electronic device (101) and output the received various pages.

[0053] In one embodiment, the user terminal (102) may be implemented as a terminal capable of transmitting and receiving various information with the electronic device (101) via a network. For example, the user terminal (102) may be one of a computer, a laptop, a portable communication terminal (such as a smartphone), a portable multimedia device, a wearable device, or an HMD. However, the type of the user terminal (102) is not limited thereto, and the user terminal (102) may be any device that includes an input / output interface capable of receiving information from a user or outputting information to a user, and that can communicate with the electronic device (101) or other devices via a network.

[0054] A network may serve to connect an electronic device (101) with a user terminal (102) or other external devices. For example, the network may provide a connection path so that a user terminal (102) can be connected to the electronic device (101) and transmit and receive packet data with the electronic device (101). The network may be implemented as any type of wired or wireless network, such as a local area network (LAN), a wide area network (WAN), a mobile radio communication network, or Wibro (Wireless Broadband Internet).

[0055] In one embodiment, the electronic device (101) and the user terminal (102) may operate as a single device. The user terminal (102) may be included in the electronic device (101) as a component of all or part of the electronic device (101). In this case, for example, various types of information exchanged between the electronic device (101) and the user terminal (102) over a network may be various types of information exchanged between components within a single device.

[0056] FIG. 2 is a block diagram of an electronic device according to one embodiment of the present disclosure. The electronic device (200) can process information regarding an e-commerce service. In one embodiment, the electronic device (200) may include one or more processors (210), one or more memories (220), and a communication interface (230) as components. In one embodiment, at least one of the components of the electronic device (200) may be omitted, or another component may be added to the electronic device (200). In one embodiment, additionally or alternatively, some of the components may be implemented in an integrated manner or implemented as a single or multiple entities. In the present disclosure, one or more processors (210) may be referred to as a processor (210). The expression “processor (210)” may mean a set of one or more processors, unless the context clearly indicates otherwise. In the present disclosure, one or more memories (220) may be referred to as a memory (220). The expression "memory (220)" may mean a set of one or more memories, unless the context clearly indicates otherwise. In one embodiment, at least some of the components inside / outside the electronic device (200) may be connected to each other via a bus, a General Purpose Input / Output (GPIO), a Serial Peripheral Interface (SPI), or a Mobile Industry Processor Interface (MIPI), and may exchange information (data, signals, etc.).

[0057] The processor (210) may control at least one component of an electronic device (200) connected to the processor (210) by running software (e.g., commands, programs, etc.). In addition, the processor (210) may perform various operations such as calculations, processing, data generation, and processing related to the present disclosure. In addition, the processor (210) may load data, etc. from the memory (220) or store data in the memory (220). In one embodiment, the processor (210) may control the communication interface (230) to request various information from the user terminal (102) or the administrator device (103), and receive various information from the user terminal (102) or the administrator device (103).

[0058] The memory (220) can store various information (data). The information stored in the memory (220) is information acquired, processed, or used by at least one component of the electronic device (200), and may include software (e.g., commands, programs, etc.). The memory (220) may include volatile and / or non-volatile memory. In the present disclosure, the commands or programs are software stored in the memory (220), and may include an operating system for controlling the resources of the electronic device (200), an application, and / or middleware for providing various functions to the application so that the application can utilize the resources of the electronic device (200). In one embodiment, the memory (220) may store commands that, when executed by the processor (210), cause the processor (210) to perform operations. The memory (220) may store at least a portion of information received from a database via the communication interface (230) and / or information transmitted to the database via the communication interface (230). Specifically, the memory (220) can store information regarding e-commerce or delivery order services and commands executed by the processor (210).

[0059] The communication interface (communication interface, 230) can perform wireless or wired communication between the electronic device (200) and a database or other external electronic device. For example, the communication interface (230) can perform wireless communication according to a method such as eMBB (enhanced Mobile Broadband), URLLC (Ultra Reliable Low-Latency Communications), MMTC (Massive Machine Type Communications), LTE (Long-Term Evolution), LTE-A (LTE Advance), NR (New Radio), UMTS (Universal Mobile Telecommunications System), GSM (Global System for Mobile communications), CDMA (Code Division Multiple Access), WCDMA (Wideband CDMA), WiBro (Wireless Broadband), WiFi (Wireless Fidelity), Bluetooth (Bluetooth), NFC (Near Field Communication), GPS (Global Positioning System), or GNSS (Global Navigation Satellite System). For example, the communication interface (230) may perform wired communication according to a method such as Universal Serial Bus (USB), High Definition Multimedia Interface (HDMI), Recommended Standard-232 (RS-232), or Plain Old Telephone Service (POTS). In one embodiment, the electronic device (200) may be implemented by being integrated with another device. In this case, the communication interface (230) may function as a connection circuit or interface connecting the electronic device (200) and the other device.

[0060] Hereinafter, the operations described as being performed by the electronic device in FIGS. 3 to 7 can be understood as being performed by the processor (210) of the electronic device (200) described in FIG. 2.

[0061] FIG. 3 is a diagram illustrating a sub-path according to one embodiment of the present disclosure.

[0062] Referring to FIG. 3, a sub-route (S1) may include one or more visited locations (330, 340). The visited locations (330, 340) may refer to locations selected from among a plurality of candidate locations to be included in the sub-route. In one example referring to FIG. 3, the sub-route (S1) may include a first visited location (330) and a second visited location (340). For convenience of explanation, FIG. 3 shows the order between each visited location included in the sub-route (S1), but is not limited thereto. In one embodiment, a sub-route may not include order information between one or more visited locations included in the sub-route. In other words, a sub-route may be understood as a set including all visited locations that a transportation means must visit in a single operation. The operation of determining the visit order between the visited locations included in the sub-route will be described later.

[0063] Referring to FIG. 3, one or more visit locations (330, 340) included in a sub-path (S1) may each correspond to one or more items (331). The items (331) may represent objects to be loaded onto a transportation means at each visit location (330, 340). The seller may transmit a request for transportation of one or more items (331) to the electronic device (101). The request for transportation, i.e., the transportation request, may include information about the location (330) corresponding to the transportation request, the transportation date, and the items (331) corresponding to the transportation request.

[0064] Based on the entire route, when performing transportation corresponding to a sub-route (S1) included in the entire route, the transportation means can depart from the center (300), visit all of one or more visiting locations (330, 340) included in the sub-route (S1), load items (331) of each visiting location (330, 340), and return to the center (300).

[0065] Referring to FIG. 3, one or more means of transportation may perform transportation. Each means of transportation may be classified into one or more groups (310, 320). Each group may be classified based on the operating method of one or more means of transportation included in the group. For example, the first group (310) may be a group of fixed vehicles assigned to perform transportation on a fixed basis, and the second group (320) may be a group of rental vehicles used when all transportation requests cannot be processed by the fixed vehicles on a certain date. The one or more means of transportation included in each group (310, 320) may be classified by type. That is, each group (310, 320) may be classified into one or more types (311, 312, 313). Each type (311, 312, 313) may be classified based on the maximum loading capacity of the means of transportation. For example, the first type (311), the second type (312), and the third type (313) may correspond to different loading capacities. One or more transport means included in each type (311, 312, 313) may have the same loading capacity.

[0066] Figure 4 is a flowchart illustrating a method according to one embodiment of the present disclosure.

[0067] The method disclosed in FIG. 4 can be understood as a series of operations related to generating path information. The operations illustrated in FIG. 3 will now be described in detail.

[0068] The electronic device (101) can check basic data (S410).

[0069] The basic data may include at least some of item information, seller information, location information, and transportation information. In one embodiment, the basic data may be managed by unit schedule. The electronic device (101) may check the basic data by unit schedule. In one embodiment, the electronic device (101) may check information regarding multiple candidate locations included in the basic data. A candidate location may refer to a candidate visited location that may be included in a sub-route among one or more location pieces of information. The candidate location may be checked based on the location information. For example, the electronic device (101) may check the location information based on the basic data corresponding to the unit schedule. In one embodiment, the electronic device (101) may also check the location information based on the item information corresponding to the unit schedule.

[0070] The electronic device (101) can check multiple sub-paths corresponding to the first group (S420).

[0071] A subpath may contain one or more visited locations.

[0072] In one embodiment, the electronic device (101) can identify multiple sub-paths corresponding to a first group based on the underlying data. For example, the underlying data may include information regarding multiple sub-paths corresponding to the first group. For example, the multiple sub-paths corresponding to the first group may be predetermined.

[0073] In one embodiment, the electronic device (101) may generate multiple sub-routes corresponding to a group of transportation means based on the underlying data and the group of transportation means. In this case, the sub-route may include one or more visited locations. A visited location may refer to a location selected from among the multiple candidate locations for inclusion in the sub-route.

[0074] In an embodiment where the electronic device (101) generates a sub-route, the electronic device (101) may select one or more visiting locations based on the type of transportation means among a plurality of candidate locations.

[0075] In one embodiment, the plurality of candidate locations may be determined based on the type of a given vehicle. In one embodiment, the electronic device (101) may determine the plurality of candidate locations based on at least some of the types included in the first group. For example, some of the locations to be visited corresponding to the corresponding unit schedule may not be accessible by certain types of vehicles. For example, information regarding the largest vehicle capable of entering the corresponding location may be included in the location information. For another example, if the largest vehicle capable of entering the first location corresponds to a type corresponding to a loading capacity of 10T, the first location may not be included among the candidate locations corresponding to a type of vehicle with a maximum loading capacity of 14T. The electronic device (101) may identify the plurality of candidate locations based on the type of vehicle. The electronic device (101) may identify the plurality of candidate locations among the locations corresponding to the corresponding unit schedule.

[0076] In one embodiment, one or more visited locations included in a subpath may be unordered or ordered. The order may refer to the visit order among one or more visited locations.

[0077] In one embodiment, the order of the visited locations for a sub-route may not be specified, but both the starting and ending locations of each sub-route may be the center. That is, the vehicle can be understood as departing from the center, visiting one or more visited locations included in the sub-route, and then returning to the center.

[0078] In one embodiment, the electronic device (101) may select one visiting location to be included in the sub-route when generating a sub-route. The electronic device (101) may determine whether a sub-route generation condition is satisfied in response to selecting a visiting location to be included in the sub-route from among a plurality of candidate locations. The sub-route generation condition may be determined based on the type of the designated transportation means. That is, depending on the type of transportation means with regard to loading capacity, whether the sub-route generation condition is satisfied may be determined in response to the total amount of items to be loaded at all visiting locations selected to be included in the sub-route. For example, when generating a sub-route corresponding to a type of transportation means with a loading capacity of 14T, each time a visiting location is added to the sub-route, the total amount of items corresponding to each visiting location and the loading capacity are compared, and if the total amount of items corresponding to each visiting location included in the sub-route is equal to or exceeds the loading capacity in response to adding a visiting location to the sub-route, the sub-route generation condition is determined to be satisfied, and the sub-route generation may be terminated. That is, when adding each visited location to a sub-route, the total amount of items corresponding to each added visited location is accumulated, and if the total amount exceeds the loading capacity, the sub-route generation can be terminated. The electronic device (101) can check the item information corresponding to the visited location newly selected to be included in the sub-route based on the basic data, add the accumulated amount to the total amount of items in the sub-route, and check whether the sub-route generation condition is satisfied based on the total amount and the type of transportation means. The total amount of items can be determined based on at least some of the volume, weight, and packaging unit corresponding to each item.For example, in response to adding a certain visited location to a sub-route, if the total amount of items corresponding to all added visited locations exceeds any one of the weight-based loading capacity corresponding to the designated means of transportation, the volume-based loading capacity, or the loading capacity calculated based on the packaging unit, the sub-route creation condition is satisfied, and the creation of the corresponding sub-route may be terminated. Subsequently, the electronic device (101) may create the next sub-route. At this time, if there are remaining items in the previously created sub-route that cause the loading capacity to be exceeded, that is, the loading capacity for the last added visited location is exceeded, the electronic device (101) may add the corresponding visited location to the newly created sub-route.

[0079] In one embodiment, if the sub-route creation condition is satisfied, the electronic device (101) may complete the sub-route creation and create another sub-route. If the sub-route creation condition is not satisfied, a visit location to be included in the sub-route may be selected from among a plurality of candidate locations and added to the sub-route. In one embodiment, the visit location to be added to the sub-route may be determined based on the previous visit location last added to the sub-route. For example, when adding a first visit location to the sub-route and then selecting a second visit location from among a plurality of candidate locations, the electronic device (101) may select the second visit location based on the first visit location. For example, the electronic device (101) may select the candidate location closest to the first visit location as the second visit location. In one embodiment, the closest candidate location may be understood as the candidate location with the shortest expected travel time based on the expected travel time from the first visit location, but the criteria for selecting the closest candidate location are not limited thereto.

[0080] In one embodiment, the electronic device (101) may preferentially generate a sub-route that includes only one visited location based on a group of transportation means and a sub-route generation condition. For example, the electronic device (101) may preferentially select a visited location among multiple candidate locations based on the total quantity of items. When generating a sub-route based on at least some types among one or more types included in a group of transportation means, the electronic device (101) may select the first visited location to be included in the sub-route based on the total quantity of items corresponding to each candidate location when selecting the first visited location to be included in the sub-route. However, the criteria for selecting the first visited location are not limited thereto. In one embodiment, the electronic device (101) may randomly select the first visited location to be included in the sub-route. In one embodiment, the electronic device (101) may select the closest or furthest visited location among the visited locations that have items to be processed as the first visited location.

[0081] In one embodiment, the electronic device (101) may determine whether a sub-route generation condition is satisfied based on the total number of visited locations included in the sub-route. For example, in the case of a vehicle included in a specific group or a specific type of vehicle, there may be a case where the number of stops is specified when performing a single sub-route. For example, a vehicle corresponding to the type 14T may only make a maximum of four stops per sub-route, that is, from once departing from a center to returning to the center. In this case, if four visited locations are selected to be included in the sub-route, the sub-route generation condition may be satisfied.

[0082] The electronic device (101) can generate one or more candidate paths corresponding to the first group based on a plurality of sub-paths corresponding to the first group (S430).

[0083] A candidate path may include one or more sub-paths. The electronic device (101) may select at least some of the multiple sub-paths corresponding to the first group and generate a candidate path.

[0084] In one embodiment, the electronic device (101) may generate a candidate route by selecting one or more sub-routes, each of which includes different visit locations, from among a plurality of sub-routes. The candidate route may include a combination of all visit locations that a single vehicle visits during a unit schedule. In other words, the candidate route may include all sub-routes to be visited by a single vehicle, i.e., may include one or more visit locations corresponding to each of the sub-routes. The candidate route may include order information for each of the one or more sub-routes included.

[0085] In one embodiment, the electronic device (101) may determine the order of one or more visited locations included in each sub-route for each of one or more sub-routes included in a candidate route. The electronic device (101) may determine the order between visited locations for each of one or more sub-routes included in the candidate route based on various methods. For example, the electronic device (101) may determine the order of visited locations so that all visited locations are visited in the shortest path for each sub-route based on a TSP (Traveling Salesman Problem) algorithm. The electronic device (101) may determine the order between one or more visited locations for each sub-route based on a time zone condition. For example, the electronic device (101) may calculate the expected time zone for each sub-route in the candidate route based on the order of each sub-route. For example, in the case of a first sub-route included in a first candidate route, the electronic device (101) may calculate the expected time zone in which a transportation means will perform transportation work for the first sub-route based on the order of the first sub-route. At this time, if the expected time zone corresponds to a peak time, the electronic device (101) can calculate the expected time required between visited locations corresponding to the peak time, and determine the order in which all visited locations are visited along the shortest route for each sub-route based on the expected time required corresponding to the peak time. The electronic device (101) can determine the peak time corresponding to each visited location included in the sub-route. For example, for the first visited location, the peak time can be set to 3:00-4:00 PM, and for the second visited location, the peak time can be set to 5:00-6:00 PM. The electronic device (101) can determine the order of visited locations for each sub-route based on the actual time required for transportation.For example, the electronic device (101) may calculate an estimated time between one or more visited locations included in each sub-route based on historical information regarding actual transport times, and determine an order to visit all visited locations along the shortest route based on the estimated time. The electronic device (101) may also determine an order between visited locations based on the estimated time required for each visited location. The time required for each visited location may be understood as the time required to load or unload items at each visited location, and may be calculated based on item information corresponding to each visited location.

[0086] In one embodiment, the electronic device (101) can calculate the shortest travel time corresponding to each of one or more candidate paths. The electronic device (101) can calculate the shortest travel time for each of one or more sub-paths included in each candidate path. The electronic device (101) can calculate the shortest travel time corresponding to the candidate path based on the shortest travel time for each sub-path.

[0087] In one embodiment, the electronic device (101) can determine whether a candidate path satisfies a path condition. The path condition may include one or more conditions regarding the feasibility of each candidate path.

[0088] In one embodiment, the electronic device (101) can determine whether a candidate route satisfies the route conditions based on a specified time limit. The specified time limit may correspond, for example, to the working hours of workers corresponding to each means of transportation. For example, if the shortest travel time corresponding to a candidate route exceeds the specified time limit, the electronic device (101) can determine that the candidate route does not satisfy the route conditions.

[0089] In one embodiment, the electronic device (101) can identify the expected visit time corresponding to each visited location included in each of one or more sub-paths included in the candidate route. The electronic device (101) can determine whether the route condition is satisfied based on information about each visited location and the expected visit time corresponding to each visited location. Based on the information about the visited locations, the electronic device (101) can identify information about the available visit times for each visited location. For example, if the expected visit time corresponding to a second visited location is 3 PM and the available visit time corresponding to the second visited location is 4 PM to 6 PM, the candidate route can be determined to not satisfy the route condition.

[0090] In one embodiment, the electronic device (101) can remove candidate paths that do not satisfy path conditions among one or more candidate paths.

[0091] In one embodiment, a candidate path may be generated by sampling (extracting) a plurality of sub-paths. The electronic device (101) may generate the candidate path by sampling at least some of the plurality of sub-paths based on various sampling algorithms. For example, the electronic device (101) may sample one or more sub-paths by assigning a higher weight to a sub-path that is not included in a previously generated candidate path among the plurality of sub-paths than to a sub-path included in a previously generated candidate path based on a negative sampling algorithm, and generate a candidate path including the one or more sampled sub-paths.

[0092] The electronic device (101) can check one or more first objective functions and one or more first constraints based on the first group (S440).

[0093] The first objective function may include at least some of an objective function regarding workload and an objective function regarding cost.

[0094] The objective function for the workload may be a maximizing condition function that maximizes the sum of the workload to be performed by each of one or more candidate paths that will be selected as the overall path among multiple candidate paths. For example, the objective function for the workload may be expressed by mathematical equation 1 as follows. In this case, Q i is a parameter vector regarding the workload corresponding to each candidate path i, and x i can be a binary vector regarding the selection of candidate path i. For example, if candidate path i is selected to be included in the overall path, x i has the value 1, otherwise it can have the value 0.

[0095]

[0096] An objective function for workload can be generated based on workload parameters derived from candidate routes and underlying data. The workload parameters can include vector information about one or more workloads. The workloads can correspond to the number of items to be transported for each candidate route. For example, the workload vector Q i can be calculated based on the transport requests performed by candidate route i and the quantity of items included in each transport request. That is, the workload vector Q i can be calculated based on the parameters of whether to perform a transport request for each candidate route, whether to perform a transport request, and the quantity of items included in each transport request.

[0097] The transport request execution parameter may include a binary matrix of transport requests corresponding to each of one or more visiting locations included in the candidate route. For example, the transport request execution parameter R ircan be expressed as a binary matrix having a value of 1 if transport request r is performed by candidate path i, i.e., if candidate path i includes a visit location corresponding to transport request r, and a value of 0 otherwise. The parameter of whether transport request is performed can be calculated based on one or more visit locations corresponding to the candidate path and the transport request corresponding to each visit location. Workload vector Q i and parameter R for whether to perform transport request i The relationship can be expressed as mathematical formula 2 below. At this time, q r corresponds to the quantity of items corresponding to the transport request r, I corresponds to a set of multiple candidate routes i, and R can correspond to a set of multiple transport requests r.

[0098]

[0099] The objective function for cost may be a minimizing condition function that minimizes the sum of costs incurred by each of one or more candidate paths to be selected as the overall path among multiple candidate paths. For example, the objective function for cost may be expressed by mathematical formula 3 as follows. In this case, C i is a parameter vector regarding the cost corresponding to each candidate path i, and x i can be a binary vector regarding the selection of candidate path i.

[0100]

[0101] An objective function regarding cost can be generated based on cost parameters calculated based on candidate routes and basic data. The cost parameters can include vector information regarding one or more costs. The cost can be calculated based on the total travel distance corresponding to each candidate route. For example, the electronic device (101) can calculate the travel distance corresponding to each of one or more sub-routes included in the candidate route, and calculate the travel distance corresponding to each candidate route based on the travel distance corresponding to each sub-route. The electronic device (101) can determine the unit cost based on a group of transportation means or a type of transportation means. The unit cost corresponding to a group of transportation means can include information regarding the cost per travel distance for each group of transportation means. The unit cost corresponding to a type of transportation means can include information regarding the cost per travel distance for each type of transportation means. The electronic device (101) can calculate the cost of each of the plurality of candidate routes based on the unit cost of the transportation means and the total travel distance of the candidate routes. The cost parameter can be calculated based on the cost incurred by candidate route i. That is, the cost vector C i can be calculated by the total cost to be incurred by candidate path i.

[0102] The electronic device (101) can identify an objective function corresponding to the first group. In one embodiment, the objective functions corresponding to each group may be different. For example, the first group may correspond to multiple objective functions (multi-objective functions), including an objective function related to workload and an objective function related to cost. In one embodiment, the second group may correspond to an objective function related to cost. That is, while the first group must search for the entire route that maximizes workload, the second group must search for the entire route that carries out all remaining transport requests, and therefore, only the objective function related to cost may be considered.

[0103] In one embodiment, priorities may be established among multiple objective functions. For example, an objective function relating to workload may have a higher priority than an objective function relating to cost.

[0104] The electronic device (101) can identify one or more first constraints corresponding to the first group. The constraints may include one or more conditions that must be satisfied when selecting at least some candidate paths to be included in the overall path among a plurality of candidate paths.

[0105] In one embodiment, one or more first constraints may include conditions regarding the total number of vehicles of the first group to be assigned to the entire route. For example, the total number of vehicles to be assigned to each of one or more candidate routes included in the entire route corresponding to the first group may be less than or equal to the total number of vehicles corresponding to the first group. The electronic device (101) may determine the total number of vehicles corresponding to each group based on the underlying data.

[0106] In one embodiment, one or more first constraints may include conditions regarding the total number of vehicles corresponding to a type of vehicle to be assigned to the entire route. For example, the total number of vehicles to be assigned to each of one or more candidate routes included in the entire route corresponding to the first type may be less than or equal to the total number of vehicles corresponding to the first type. The electronic device (101) may determine the total number of vehicles corresponding to each type based on the underlying data.

[0107] In one embodiment, one or more first constraints may include a condition regarding the number of times each of a plurality of transport requests is performed by a candidate route, i.e., the number of times a transport request is performed. Each transport request may be performed one or zero times by each candidate route. The first constraint regarding the number of transport request executions may include a parameter R that determines whether a transport request is performed. i can be calculated based on. For example, the first constraint on the number of transport requests can be expressed as in mathematical expression 4 below.

[0108]

[0109] The electronic device (101) can identify constraints corresponding to the first group. In one embodiment, the constraints corresponding to each group may be different. For example, the first group may correspond to at least some of the conditions regarding the total number of transportation means of the first group to be assigned to the entire route and the conditions regarding the number of transportation requests to be performed. In one embodiment, the second group may correspond to constraints regarding the number of transportation requests to be performed. That is, in the first group, not all transportation requests may be performed along the entire route, but in the second group, the entire route for performing all transportation requests may need to be searched. Therefore, the second group may correspond to different constraints regarding the number of transportation requests to be performed from the first group. For example, the second constraint regarding the number of transportation requests to be performed corresponding to the second group may be expressed by mathematical equation 5 below.

[0110]

[0111] The electronic device (101) can calculate a first parameter based on basic data and multiple candidate paths (S450).

[0112] The electronic device (101) can generate one or more first parameters corresponding to the first group. The electronic device (101) can generate one or more first parameters based on the basic data and each of the plurality of candidate paths. The one or more first parameters can include parameters corresponding to one or more first objective functions and each of the first constraints corresponding to the first group. For example, the one or more first parameters can include at least some of a workload parameter, a cost parameter, and a parameter indicating whether to perform a transport request.

[0113] The electronic device (101) can produce a first selection vector (S460).

[0114] The electronic device (101) can generate a first selection vector for selecting at least some of a plurality of candidate paths based on one or more first objective functions, one or more first constraints, and one or more first parameters. Selection vector x i can be a binary vector regarding the selection of candidate path i. For example, if candidate path i is selected to be included in the overall path, x i has a value of 1, and otherwise has a value of 0. The electronic device (101) can produce a first selection vector according to a mixed integer problem algorithm based on one or more first objective functions and one or more first constraints, and a first parameter corresponding to each objective function and each contract condition.

[0115] In one embodiment, the electronic device (101) can generate an entire route based on a workload condition. In one embodiment, the electronic device (101) can determine a first constraint that ensures that the workload of the entire route corresponding to a group of transportation means is greater than or equal to a specified workload.

[0116] The electronic device (101) can generate an entire route based on cost conditions. In one embodiment, the electronic device (101) can select one or more candidate routes such that the cost of the entire route corresponding to the type of transportation means is less than or equal to a specified cost. In one embodiment, the electronic device (101) can determine a first constraint that ensures that the cost of the entire route corresponding to the type of transportation means is minimized.

[0117] In one embodiment, the electronic device (101) may generate an entire route based on cost efficiency. Cost efficiency may be calculated based on the total distance traveled corresponding to a unit of work. Alternatively, cost efficiency may be calculated based on the amount of work corresponding to a unit cost. The electronic device (101) may identify a maximization objective function that selects one or more candidate routes that combine to maximize cost efficiency.

[0118] The electronic device (101) can generate an entire path corresponding to a group of transportation means based on the selection vector.

[0119] The entire path may include at least a portion selected from among one or more candidate paths. The electronic device (101) may identify a candidate path to be selected from among the plurality of candidate paths for the entire path based on a selection vector.

[0120] In one embodiment, the electronic device (101) may generate a selection vector corresponding to each of one or more types included in the first group. That is, the electronic device (101) may identify a plurality of sub-paths corresponding to any one of the one or more types included in the first group, generate a plurality of candidate paths corresponding to the type, and perform operations S440 to S460 based on the generated plurality of candidate paths.

[0121] In one embodiment, the electronic device (101) may sequentially generate a selection vector corresponding to each type for each of one or more types included in the first group. For example, the electronic device (101) may generate a selection vector corresponding to the first type, and thereafter, identify a plurality of sub-paths corresponding to the second type, generate a plurality of candidate paths corresponding to the second type, and perform operations S440 to S460 based on the generated plurality of candidate paths.

[0122] In one embodiment, the electronic device (101) can determine the order of the types of transportation means for which the selection vector is to be derived. For example, the electronic device (101) can determine the first type based on cost-effectiveness. That is, the electronic device (101) can first generate the full route for the more cost-effective type of transportation means (e.g., the first type) and then generate the full route for the less cost-effective type of transportation means (e.g., the second type).

[0123] Figures 5a and 5b are drawings for explaining candidate locations and sub-paths.

[0124] Referring to FIG. 5A, the electronic device (101) may generate a plurality of sub-paths based on location information (500). The location information (500) may include information regarding a plurality of candidate locations (501, 502, 503, 504, 505, 506). The location information (500) may further include location information of a center (510). The electronic device (101) may select at least one candidate location among the plurality of candidate locations as a visited location. In the example of FIG. 5A, the first location (501) may be selected as the visited location. The electronic device (101) may select the visited location (501) and include it in a sub-path. At this time, each of the plurality of sub-paths (S1, S2, S3, S4, S5) described with reference to FIG. 5B may include one or more visited locations, and may be sub-paths corresponding to any one of a plurality of groups or sub-paths corresponding to any one of a plurality of transportation means types. For example, the plurality of sub-paths (S1, S2, S3, S4, S5) may be sub-paths generated corresponding to the first type of transportation means. For example, referring to FIGS. 5A and 5B , the electronic device (101) may select the first location (501) as the initial visiting location to generate the first sub-path (S1) corresponding to the first type. Subsequently, the electronic device (101) may check whether the first sub-path (S1) satisfies the sub-path generation condition. In FIG. 5A , the electronic device (101) may select the first location (501) as a visiting location to be included in the first sub-path (S1) and check whether the sub-path generation condition is satisfied. If the sub-path generation condition is not satisfied, one of the plurality of candidate locations may be further selected to be included in the first sub-path (S1). For example, in FIG. 5A, the electronic device (101) can further select the second location (502) closest to the first location (501) as the visited location based on the distance condition.After selecting the second location (502), the electronic device (101) can check whether the first sub-route (S1) satisfies the sub-route generation condition. Thereafter, in response to the fact that the first sub-route (S1) still does not satisfy the sub-route generation condition, the electronic device (101) can further select a visit location to be included in the first sub-route (S1) among the candidate locations. For example, the electronic device (101) may not select the sixth location (506) based on the type of the transportation means. For example, the sixth location (506) may correspond to a location that cannot be visited by the transportation means corresponding to the first type. The electronic device (101) can check whether the sixth location (506) is a location that can be visited by the transportation means corresponding to the first type based on the information about the first type and the information about the sixth location (506).

[0125] Referring to FIG. 5A, the electronic device (101) may select a visiting location among other candidate locations based on the distance between the pre-selected second location (502) and the other candidate locations or the expected time required for movement. For example, in the examples of FIGS. 5A and 5B, the distance between the second location (502) and the third location (503) or the fourth location (504) may be compared to select the third location (503) as a visiting location to be included in the first sub-route (S1). Subsequently, the electronic device (101) may again determine whether the first sub-route (S1) satisfies the sub-route generation condition and complete generation of the first sub-route (S1). Referring to FIGS. 5A and 5B , a first sub-path (S1) includes a first location (501), a second location (502), and a third location (503). When a first type of transportation means performs transportation work according to the first sub-path (S1), it departs from a center (510), visits the visiting locations (501, 502, 503) included in the first sub-path (S1), and then performs a transportation request corresponding to each visiting location, that is, loads or unloads an item corresponding to each visiting location, and returns to the center (510). At this time, the visiting order for each of one or more visiting locations (501, 502, 503) included in the first sub-path (S1) may not be determined. Subsequently, the electronic device (101) may further generate a plurality of sub-paths (S2, S3, S4, S5) corresponding to the first type of transportation means in a similar manner as described above.

[0126] Figure 6 is a drawing for explaining the operation of producing a selection vector.

[0127] Referring to FIG. 6, the electronic device (101) can identify the entire sub-route generated in response to the type of transportation means (610). The electronic device (101) can identify a plurality of sub-routes (610), including a first sub-route (S1) and a second sub-route (S2).

[0128] The electronic device (101) may generate one or more candidate routes corresponding to the type of transportation means (620). Referring to FIG. 6, the electronic device (101) may generate one or more candidate routes, including, for example, candidate routes I1 arranged in the order of sub-routes S5, S3, S2, .... In this case, candidate route I3 that does not satisfy the route conditions may be removed (630).

[0129] Next, one or more parameters (640) corresponding to one or more objective functions and constraints can be calculated. The electronic device (101) can calculate one or more parameters (640) based on the basic data and candidate paths. The electronic device (101) can identify the objective function and constraints based on the corresponding group, identify one or more parameters corresponding to the identified objective functions and constraints, and identify parameter values ​​corresponding to each of the identified one or more parameters based on the basic data and candidate paths. At this time, F t may be a parameter regarding the total number of means of transport per group or type.

[0130] Next, a selection vector x is used to select at least some candidate paths among one or more candidate paths (630) that satisfy path conditions including candidate paths I1, I2, I4, etc. based on one or more parameters (640) and objective functions and constraints produced. i can be confirmed (650).

[0131] Figure 7 is a flowchart illustrating a method according to one embodiment of the present disclosure.

[0132] The electronic device (101) can check the remaining requests based on the first selection vector and basic data (S710).

[0133] The remaining requests may include one or more transport requests that are not fulfilled by the entire route corresponding to the first group among the entire transport requests regarding the transport of items.

[0134] In one embodiment, the electronic device (101) can identify one or more transport requests to be performed by the entire route corresponding to the first group, which is identified based on the entire request and the first selection vector, which is identified based on the basic data, and can identify remaining requests that are not performed by the entire route corresponding to the first group among the entire requests.

[0135] In one embodiment, the electronic device (101) may perform operation S720 if there is a remaining request, and may not perform operation S720 if there is no remaining request.

[0136] The electronic device (101) can generate the entire path corresponding to the second group based on the remaining requests (S720).

[0137] The operation of generating the entire path corresponding to the second group by the electronic device (101) can be performed similarly to operations S410 to S460 described with reference to FIG. 4. That is, the electronic device (101) can identify a plurality of sub-paths corresponding to the second group, generate a plurality of candidate groups corresponding to the second group, identify a second objective function and a second constraint condition corresponding to the second group, calculate a second parameter regarding the second objective function and the second constraint condition based on the basic data and the plurality of candidate paths, and calculate a second selection vector. The electronic device (101) can generate the entire path corresponding to the second group based on the second selection vector.

[0138] In one embodiment, the corresponding objective functions for each group may be different. For example, the first group may correspond to multiple objective functions (multi-objective functions), including an objective function related to workload and an objective function related to cost. In one embodiment, the second group may correspond to an objective function related to cost. That is, the first group may need to search for the entire route that maximizes workload, while the second group may need to search for the entire route that fulfills all transport requests.

[0139] In one embodiment, the second group may accommodate constraints regarding the number of transport requests to be executed. Specifically, while the first group may not be able to execute all transport requests along the entire route, the second group may require searching the entire route to execute all transport requests. Therefore, the second group may accommodate different constraints regarding the number of transport requests to be executed compared to the first group.

[0140] In the flowcharts according to the present disclosure, each step of the method or algorithm is described in a sequential order. However, the steps may be performed in any order that can be arbitrarily combined, in addition to being performed sequentially. The description of the flowcharts or flowcharts of the present disclosure does not exclude changes or modifications to the method or algorithm, and does not imply that any step is essential or desirable. In one embodiment, at least some of the steps may be performed in parallel, iteratively, or heuristically. In another embodiment, at least some of the steps may be omitted, or other steps may be added.

[0141] Various embodiments according to the present disclosure may be implemented as software on a machine-readable storage medium. The software may be software for implementing various embodiments described in the present disclosure. The software may be inferred from various embodiments described in the present disclosure by programmers skilled in the art to which the present disclosure pertains. For example, the software may be a program including machine-readable commands (e.g., instructions, codes, or code segments). The device may be a device capable of operating according to commands called from a storage medium, such as a computer. In one embodiment, the device may be a computing device according to various embodiments described in the present disclosure. In one embodiment, the processor of the device may execute the called command, causing components of the device to perform functions corresponding to the command. The storage medium may refer to any type of recording medium that stores data and can be read by the device. The storage medium may include, for example, a ROM, a RAM, a CD-ROM, a magnetic tape, a floppy disk, an optical data storage device, etc. In one embodiment, the storage medium may be implemented in a distributed form, such as in a network-connected computer system. In this case, the software may be distributed, stored, and executed in the computer system. In another embodiment, the storage medium may be a non-transitory storage medium. A non-transitory storage medium refers to a tangible medium that exists regardless of whether data is stored semi-permanently or temporarily, and does not include signals that are transmitted transitively.

[0142] While the technical concepts of the present disclosure have been described through various embodiments, the technical concepts of the present disclosure encompass various substitutions, modifications, and variations that can be made within the scope understandable to those of ordinary skill in the art to which the present disclosure pertains. Furthermore, it should be understood that such substitutions, modifications, and variations are encompassed within the scope of the appended claims.

Claims

1. In a method performed by an electronic device, Step to check the basic data; A step of identifying multiple sub-paths corresponding to the first group; A step of generating a plurality of candidate paths corresponding to the first group based on a plurality of sub-paths corresponding to the first group; A step of checking one or more first objective functions and one or more first constraints based on the first group; A step of calculating one or more first parameters corresponding to the first objective function and one or more first constraints based on the above basic data and a plurality of candidate paths corresponding to the first group; A method comprising the step of producing a first selection vector that selects at least some of a plurality of candidate paths corresponding to the first group based on the one or more first objective functions, the one or more first constraints and the one or more first parameters.

2. In paragraph 1, The above method, A step of identifying a remaining request among one or more requests for transportation of an item based on the first selection vector and the basic data; A method further comprising the step of generating a full path corresponding to the second group based on the remaining requests.

3. In paragraph 2, The step of generating the entire path corresponding to the second group is: A step of generating a plurality of candidate paths corresponding to the second group based on the remaining requests and the basic data; A step of checking one or more second objective functions and one or more second constraints based on the second group; A step of calculating one or more second parameters based on the above basic data and a plurality of candidate paths corresponding to the second group; and A method further comprising the step of generating a second selection vector for selecting at least some of a plurality of candidate paths corresponding to the second group based on the one or more second objective functions, the one or more second constraints and the one or more second parameters.

4. In paragraph 3, A method wherein said one or more second objective functions are different from said one or more first objective functions.

5. In paragraph 1, The step of checking multiple sub-paths corresponding to the above first group is: A step of verifying basic data including information on a plurality of candidate locations corresponding to the first group; and A method comprising the step of selecting at least some of the plurality of candidate locations based on the above basic data and generating a plurality of sub-paths corresponding to the first group.

6. In paragraph 1, The step of checking multiple sub-paths corresponding to the above first group is: A method comprising the step of generating a plurality of sub-routes corresponding to the types of transportation means based on at least some types of transportation means among the types of one or more transportation means included in the first group.

7. In paragraph 1, A step of checking whether each candidate path among the above multiple candidate paths satisfies the path condition; and A method comprising the step of calculating a first selection vector based on the plurality of candidate paths, if each of the above candidate paths satisfies the path condition.

8. In paragraph 7, A method further comprising the step of removing the candidate path if the candidate path does not satisfy the path condition.

9. In paragraph 1, A method wherein at least some of said one or more first objective functions are generated based on workload parameters derived from said plurality of candidate paths and said underlying data.

10. In paragraph 1, A method wherein at least some of said one or more first objective functions are generated based on cost parameters calculated based on said plurality of candidate paths and said base data.

11. In paragraph 1, A method further comprising the step of generating an entire path corresponding to the first group based on the first selection vector.

12. In electronic devices, one or more processors, comprising one or more memories storing instructions executed by said one or more processors; An electronic device, wherein when the instructions are executed by the one or more processors, the one or more processors are configured to execute a method according to any one of claims 1 to 11.

13. A non-transitory computer-readable recording medium having recorded thereon instructions that, when executed by one or more processors, cause the one or more processors to perform an operation, A non-transitory computer-readable recording medium configured to cause the one or more processors to execute a method according to any one of claims 1 to 11.

Images