Resource Allocation Method, Resource Allocation Device, Computer-Readable Medium, and Device

Abstract

Embodiments of the present disclosure provide a resource allocation method, a resource allocation device, a computer-readable medium, and an electronic device, relating to the field of computer technologies. The method includes: generating a plurality of flight segment loops according to a plurality of task locations, the maximum number of flight segments in a loop, and flight segment connection rules; determining a set of flight segment chains corresponding to each of the plurality of flight segment loops; where there are no identical flight segment chains in the set; determining aircraft allocation information for each flight segment loop in the plurality of flight segment loops according to the number of flight segments of each flight segment chain in each set of flight segment chains; screening the plurality of flight segment loops according to the aircraft allocation information corresponding to each flight segment loop, and determining the aircraft allocation information corresponding to each flight segment loop in the screening result as the resource allocation result; where the screening result includes the minimum number of aircraft passing through a plurality of task locations. It can be seen that by implementing the technical solution of the present application, subjective limitations can be avoided, the resource allocation result can be optimized, and the resource allocation efficiency can be improved.

Description

Technical Field

[0001] The present disclosure relates to the field of computer technologies, and in particular, to a resource allocation method, a resource allocation device, a computer-readable medium, and an electronic device. Background Art

[0002] In the logistics field, performing logistics tasks by freight airplanes has higher freight efficiency compared to performing logistics tasks by trucks or trains. Generally, after receiving a freight task, the freight airplanes can be manually allocated to complete the freight task within the time limit. However, the method of manually allocating freight airplanes has subjective limitations and low efficiency.

[0003] It should be noted that the information disclosed in the above background art section is only used to enhance the understanding of the background of the present disclosure, and thus may include information that does not constitute the prior art known to those of ordinary skill in the art. Summary of the Invention

[0004] The purpose of the embodiments of the present disclosure is to provide a resource allocation method, a resource allocation device, a computer-readable medium, and an electronic device, which can avoid subjective limitations, optimize the resource allocation result, and improve the resource allocation efficiency.

[0005] The first aspect of the embodiments of the present disclosure provides a resource allocation method, including:

[0006] Generating a plurality of flight segment loops according to a plurality of task locations, the maximum number of flight segments in a loop, and flight segment connection rules; wherein, the flight segments in the flight segment loop are represented by a task location as the starting point and a task location as the ending point;

[0007] Determining a set of flight segment chains corresponding to each of the plurality of flight segment loops; wherein, there are no identical flight segment chains in the set of flight segment chains;

[0008] Determining aircraft allocation information for each flight segment loop in the plurality of flight segment loops according to the number of flight segments of each flight segment chain in each set of flight segment chains;

[0009] Screening the plurality of flight segment loops according to the aircraft allocation information corresponding to each flight segment loop, and determining the aircraft allocation information corresponding to each flight segment loop in the screening result as the resource allocation result; wherein, the screening result includes the minimum number of aircraft passing through a plurality of task locations.

[0010] In an exemplary embodiment of the present disclosure, after determining the aircraft allocation information corresponding to each flight segment loop in the screening result as the resource allocation result, the above method further includes:

[0011] Sending the resource allocation result to the terminals at a plurality of task locations, so that the terminals schedule the aircraft according to the resource allocation result.

[0012] In an exemplary embodiment of the present disclosure, generating a plurality of flight segment loops according to a plurality of task locations, the maximum number of flight segments in the loop, and the flight segment connection rule includes:

[0013] Determine a plurality of task locations whose delivery timeliness belongs to the current unit time period;

[0014] Generate a plurality of flight segment loops according to the maximum number of flight segments in the loop, the flight segment connection rule, and the plurality of task locations within a unit time.

[0015] In an exemplary embodiment of the present disclosure, determining a set of flight segment chains corresponding to each of the plurality of flight segment loops includes:

[0016] Determine a set of target nodes corresponding to each flight segment loop among the plurality of flight segment loops; wherein, each target node in the set of target nodes is used as the starting point of a flight segment chain;

[0017] Determine the node order corresponding to each of the plurality of flight segment loops;

[0018] Determine a set of flight segment chains corresponding to each of the plurality of flight segment loops according to the node order and the set of target nodes corresponding to each of the plurality of flight segment loops.

[0019] In an exemplary embodiment of the present disclosure, wherein: the set of target nodes includes at least a first target node and a second target node, both the first target node and the second target node are any node in the corresponding target flight segment loop, and the target flight segment loop is any one of the plurality of flight segment loops;

[0020] Determining a set of flight segment chains corresponding to each of the plurality of flight segment loops according to the node order and the set of target nodes corresponding to each of the plurality of flight segment loops includes:

[0021] Determine a first flight segment chain starting from the first target node according to the node order;

[0022] Determine the second target node according to the position of the first target node in the corresponding node order, and determine a second flight segment chain starting from the second target node according to the node order;

[0023] Determine the set of flight segment chains formed by the first flight segment chain and the second flight segment chain as the set of flight segment chains corresponding to the target flight segment loop.

[0024] In an exemplary embodiment of the present disclosure, determining aircraft allocation information for each flight segment loop among the plurality of flight segment loops according to the number of flight segments of each flight segment chain in each set of flight segment chains includes:

[0025] Generate aircraft allocation information for each flight segment chain according to the number of flight segments of each flight segment chain;

[0026] Determine the aircraft allocation information corresponding to each set of flight segment chains according to the aircraft allocation information of each flight segment chain;

[0027] Select the aircraft allocation information from the aircraft allocation information corresponding to each leg chain set according to the required number of aircraft corresponding to each aircraft allocation information, as the aircraft allocation information for multiple leg loops.

[0028] In an exemplary embodiment of the present disclosure, generating the aircraft allocation information for each leg chain according to the number of legs of each leg chain includes:

[0029] If the number of legs of the target leg chain is 1, generate the aircraft allocation information corresponding to the target leg chain; wherein, the target leg chain is any leg chain in the leg chain set;

[0030] If the number of legs of the target leg chain is 2, determine the leg type of each leg in the target leg chain, and generate the aircraft allocation information corresponding to the target leg chain according to the determination result;

[0031] If the number of legs of the target leg chain is greater than 2, divide the target leg chain according to the optimal leg combination, and generate the aircraft allocation information corresponding to the division result according to the priority of the leg type.

[0032] According to the second aspect of the embodiments of the present disclosure, there is provided a resource allocation device, and the device includes:

[0033] A leg loop generation unit, configured to generate a plurality of leg loops according to a plurality of task locations, the maximum number of legs in the loop, and leg connection rules; wherein, the legs in the leg loop are represented by a task location as the starting point and a task location as the ending point;

[0034] A leg chain determination unit, configured to determine the leg chain set corresponding to each of the plurality of leg loops; wherein, there are no identical leg chains in the leg chain set;

[0035] An aircraft allocation information determination unit, configured to determine the aircraft allocation information for each leg loop in the plurality of leg loops according to the number of legs of each leg chain in each leg chain set;

[0036] A leg loop screening unit, configured to screen the plurality of leg loops according to the aircraft allocation information corresponding to each leg loop, and determine the aircraft allocation information corresponding to each leg loop in the screening result as the resource allocation result; wherein, the screening result includes the minimum number of aircraft passing through a plurality of task locations.

[0037] In an exemplary embodiment of the present disclosure, the device further includes:

[0038] A resource allocation result distribution unit, configured to, after the leg loop screening unit determines the aircraft allocation information corresponding to each leg loop in the screening result as the resource allocation result, send the resource allocation result to the terminals at a plurality of task locations, so that the terminals perform aircraft scheduling according to the resource allocation result.

[0039] In an exemplary embodiment of the present disclosure, the flight segment loop generation unit generates a plurality of flight segment loops according to a plurality of task locations, the maximum number of flight segments in the loop, and the flight segment connection rule, including:

[0040] Determine a plurality of task locations whose delivery timeliness belongs to the current unit time period;

[0041] Generate a plurality of flight segment loops according to the maximum number of flight segments in the loop, the flight segment connection rule, and the plurality of task locations within a unit time.

[0042] In an exemplary embodiment of the present disclosure, the flight segment chain determination unit determines a set of flight segment chains corresponding to each of the plurality of flight segment loops, including:

[0043] Determine a set of target nodes corresponding to each flight segment loop among the plurality of flight segment loops; wherein, each target node in the set of target nodes is used as the starting point of the flight segment chain;

[0044] Determine the node order corresponding to each of the plurality of flight segment loops;

[0045] Determine a set of flight segment chains corresponding to each of the plurality of flight segment loops according to the node order and the set of target nodes corresponding to each of the plurality of flight segment loops.

[0046] In an exemplary embodiment of the present disclosure, wherein: the set of target nodes includes at least a first target node and a second target node, both the first target node and the second target node are any node in the corresponding target flight segment loop, and the target flight segment loop is any one of the plurality of flight segment loops;

[0047] The flight segment chain determination unit determines a set of flight segment chains corresponding to each of the plurality of flight segment loops according to the node order and the set of target nodes corresponding to each of the plurality of flight segment loops, including:

[0048] Determine a first flight segment chain starting from the first target node according to the node order;

[0049] Determine the second target node according to the position of the first target node in the corresponding node order, and determine a second flight segment chain starting from the second target node according to the node order;

[0050] Determine the set of flight segment chains formed by the first flight segment chain and the second flight segment chain as the set of flight segment chains corresponding to the target flight segment loop.

[0051] In an exemplary embodiment of the present disclosure, the aircraft allocation information determination unit determines aircraft allocation information for each flight segment loop among the plurality of flight segment loops according to the number of flight segments of each flight segment chain in each set of flight segment chains, including:

[0052] Generate aircraft allocation information for each flight segment chain according to the number of flight segments of each flight segment chain;

[0053] Determine the aircraft allocation information corresponding to each set of flight segment chains according to the aircraft allocation information of each flight segment chain;

[0054] Select the aircraft allocation information from the aircraft allocation information corresponding to each set of flight segment chains according to the required number of aircraft corresponding to each aircraft allocation information as the aircraft allocation information for multiple flight loops.

[0055] In an exemplary embodiment of the present disclosure, the aircraft allocation information determination unit generates the aircraft allocation information for each flight segment chain according to the number of flight segments of each flight segment chain, including:

[0056] If the number of flight segments of the target flight segment chain is 1, generate the aircraft allocation information corresponding to the target flight segment chain; wherein, the target flight segment chain is any flight segment chain in each set of flight segment chains;

[0057] If the number of flight segments of the target flight segment chain is 2, determine the flight segment type of each flight segment in the target flight segment chain, and generate the aircraft allocation information corresponding to the target flight segment chain according to the determination result;

[0058] If the number of flight segments of the target flight segment chain is greater than 2, divide the target flight segment chain according to the optimal flight segment combination, and generate the aircraft allocation information corresponding to the division result according to the priority of the flight segment type.

[0059] According to the third aspect of the embodiments of the present disclosure, there is provided a computer-readable medium, on which a computer program is stored, and when the program is executed by a processor, the resource allocation method in the first aspect in the above embodiments is implemented.

[0060] According to the fourth aspect of the embodiments of the present disclosure, there is provided an electronic device, including: one or more processors; a storage device for storing one or more programs, and when the one or more programs are executed by the one or more processors, the one or more processors implement the resource allocation method in the first aspect in the above embodiments.

[0061] According to the fifth aspect of the present application, there is provided a computer program product or a computer program, the computer program product or the computer program includes computer instructions, and the computer instructions are stored in a computer-readable storage medium. The processor of the computer device reads the computer instructions from the computer-readable storage medium, and the processor executes the computer instructions, so that the computer device executes the methods provided in the above various alternative implementation manners.

[0062] The technical solutions provided by the embodiments of the present disclosure may include the following beneficial effects:

[0063] The technical solutions provided by some embodiments of the present disclosure specifically include: generating a plurality of flight segment loops according to a plurality of task locations, the maximum number of flight segments in the loop, and flight segment connection rules; wherein, the flight segments in the flight segment loop are represented by a task location as the starting point and a task location as the ending point; determining a set of flight segment chains corresponding to each of the plurality of flight segment loops; wherein, there are no identical flight segment chains in the set of flight segment chains; determining aircraft allocation information for each flight segment loop in the plurality of flight segment loops according to the number of flight segments in each flight segment chain in each set of flight segment chains; screening the plurality of flight segment loops according to the aircraft allocation information corresponding to each flight segment loop, and determining the aircraft allocation information corresponding to each flight segment loop in the screening result as the resource allocation result; wherein, the screening result includes the minimum number of aircraft passing through a plurality of task locations. Implementing the embodiments of the present disclosure, on the one hand, by determining the aircraft allocation information corresponding to the flight segment loop, the resource allocation result can be optimized, achieving the completion of the freight task with the least resources and avoiding subjective limitations. On the other hand, by the flight segment loops generated by the constraints of the maximum number of flight segments in the loop and flight segment connection rules, invalid analysis can be avoided and the resource allocation efficiency can be improved.

[0064] It should be understood that the above general description and the following detailed description are only exemplary and explanatory, and cannot limit the present disclosure. BRIEF DESCRIPTION OF THE DRAWINGS

[0065] The accompanying drawings herein are incorporated into the specification and constitute a part of the specification, showing embodiments consistent with the present disclosure and used together with the specification to explain the principles of the present disclosure. Obviously, the accompanying drawings in the following description are only some embodiments of the present disclosure, and those of ordinary skill in the art can obtain other drawings based on these drawings without creative efforts.

[0066] Figure 1 A schematic diagram schematically showing an exemplary system architecture of a resource allocation method and a resource allocation device to which embodiments of the present disclosure can be applied;

[0067] Figure 2 A schematic diagram showing the structure of a computer system of an electronic device suitable for implementing embodiments of the present disclosure;

[0068] Figure 3 A flowchart schematically showing a resource allocation method according to an embodiment of the present disclosure;

[0069] Figure 4 A schematic diagram schematically showing an aircraft executing a delivery task according to an embodiment of the present disclosure;

[0070] Figure 5 A schematic diagram schematically showing waypoints of an aircraft executing a delivery task according to an embodiment of the present disclosure;

[0071] Figure 6 Schematically shows a schematic diagram a of a resource allocation method according to an embodiment of the present disclosure;

[0072] Figure 7 Schematically shows a schematic diagram b of a resource allocation method according to an embodiment of the present disclosure;

[0073] Figure 8 Schematically shows a schematic diagram c of a resource allocation method according to an embodiment of the present disclosure;

[0074] Figure 9 Schematically shows a schematic diagram of a module for implementing a resource allocation method according to an embodiment of the present disclosure;

[0075] Figure 10 Schematically shows a flowchart of a resource allocation method according to an embodiment of the present disclosure;

[0076] Figure 11 Schematically shows a structural block diagram of a resource allocation device according to an embodiment of the present disclosure. Detailed implementation manners

[0077] Now, example embodiments will be described more fully with reference to the accompanying drawings. However, the example embodiments can be implemented in various forms and should not be construed as limited to the examples set forth herein; rather, these embodiments are provided so that this disclosure will be more thorough and complete, and will fully convey the concept of the example embodiments to those skilled in the art. The features, structures, or characteristics described can be combined in any suitable manner in one or more embodiments. In the following description, numerous specific details are provided to give a thorough understanding of the embodiments of the present disclosure. However, those skilled in the art will realize that one or more of the specific details can be omitted in practicing the technical solutions of the present disclosure, or other methods, components, devices, steps, etc. can be adopted. In other cases, well-known technical solutions are not shown or described in detail to avoid obscuring the various aspects of the present disclosure.

[0078] In addition, the accompanying drawings are only schematic illustrations of the present disclosure and are not necessarily drawn to scale. The same reference numerals in the drawings denote the same or similar parts, and thus repeated descriptions thereof will be omitted. Some of the block diagrams shown in the drawings are functional entities and do not necessarily correspond to physically or logically independent entities. These functional entities can be implemented in software form, or in one or more hardware modules or integrated circuits, or in different networks and / or processor devices and / or microcontroller devices.

[0079] Figure 1The figure shows a schematic diagram of a system architecture of an exemplary application environment of a resource allocation method and a resource allocation device to which embodiments of the present disclosure can be applied.

[0080] As Figure 1 shown, the system architecture 100 may include one or more of the terminal devices 101, 102, 103, a network 104, and a server 105. The network 104 is used to provide a medium for a communication link between the terminal devices 101, 102, 103 and the server 105. The network 104 may include various connection types, such as wired, wireless communication links, or fiber optic cables, etc. The terminal devices 101, 102, 103 may be various electronic devices with a display screen, including but not limited to desktop computers, portable computers, smartphones, and tablet computers, etc. It should be understood that Figure 1 the numbers of the terminal devices, the network, and the server in

[0081] Figure 2 The figure shows a schematic diagram of a computer system of an electronic device suitable for implementing embodiments of the present disclosure.

[0082] It should be noted that Figure 2 the computer system 200 of the electronic device shown is only an example and should not impose any limitations on the functions and usage scope of the embodiments of the present disclosure.

[0083] As Figure 2As shown, the computer system 200 includes a central processing unit (CPU) 201, which can perform various appropriate actions and processes according to a program stored in a read-only memory (ROM) 202 or a program loaded from a storage section 208 into a random access memory (RAM) 203. In the (RAM) 203, various programs and data required for system operation are also stored. The (CPU) 201, (ROM) 202, and (RAM) 203 are connected to each other via a bus 204. An input / output (I / O) interface 205 is also connected to the bus 204.

[0084] The following components are connected to the (I / O) interface 205: an input section 206 including a keyboard, a mouse, etc.; an output section 207 including, for example, a cathode ray tube (CRT), a liquid crystal display (LCD), etc., and a speaker, etc.; a storage section 208 including a hard disk, etc.; and a communication section 209 including a network interface card such as a LAN card, a modem, etc. The communication section 209 performs communication processing via a network such as the Internet. A drive 210 is also connected to the (I / O) interface 205 as needed. A removable medium 211, such as a magnetic disk, an optical disk, a magneto-optical disk, a semiconductor memory, etc., is installed on the drive 210 as needed so that a computer program read from it can be installed into the storage section 208 as needed.

[0085] Specifically, according to an embodiment of the present disclosure, the processes described below with reference to the flowcharts can be implemented as computer software programs. For example, an embodiment of the present disclosure includes a computer program product that includes a computer program carried on a computer-readable medium, and the computer program contains program codes for performing the methods shown in the flowcharts. In such an embodiment, the computer program can be downloaded and installed from a network via the communication section 209, and / or installed from the removable medium 211. When the computer program is executed by the central processing unit (CPU) 201, various functions defined in the methods and apparatuses of the present application are executed.

[0086] It should be noted that the computer-readable medium shown in the present disclosure can be a computer-readable signal medium, a computer-readable storage medium, or any combination of the two. A computer-readable storage medium can be, for example, but not limited to, an electrical, magnetic, optical, electromagnetic, infrared, or semiconductor system, apparatus, or device, or any combination of the above. More specific examples of a computer-readable storage medium can include, but are not limited to: an electrical connection with one or more wires, a portable computer disk, a hard disk, a random access memory (RAM), a read-only memory (ROM), an erasable programmable read-only memory (EPROM or flash memory), an optical fiber, a portable compact disk read-only memory (CD-ROM), an optical storage device, a magnetic storage device, or any suitable combination of the above. In the present disclosure, a computer-readable storage medium can be any tangible medium that contains or stores a program, which can be used by or in conjunction with an instruction execution system, apparatus, or device. In the present disclosure, a computer-readable signal medium can include a data signal propagated in a baseband or as part of a carrier wave, which carries computer-readable program code. Such a propagated data signal can take various forms, including but not limited to electromagnetic signals, optical signals, or any suitable combination of the above. A computer-readable signal medium can also be any computer-readable medium other than a computer-readable storage medium, which can send, propagate, or transmit a program for use by or in conjunction with an instruction execution system, apparatus, or device. The program code contained on a computer-readable medium can be transmitted using any appropriate medium, including but not limited to: wireless, wire, optical cable, RF, etc., or any suitable combination of the above.

[0087] The flowcharts and block diagrams in the accompanying drawings illustrate the possible architectures, functions, and operations of systems, methods, and computer program products according to various embodiments of the present disclosure. In this regard, each block in a flowchart or block diagram can represent a module, a program segment, or a part of code that contains one or more executable instructions for implementing a specified logical function. It should also be noted that in some alternative implementations, the functions marked in the blocks can occur in a different order than that marked in the accompanying drawings. For example, two consecutive blocks shown can actually be executed substantially in parallel, and they can sometimes be executed in the reverse order, depending on the functions involved. It should also be noted that each block in the block diagram or flowchart, and the combination of blocks in the block diagram or flowchart, can be implemented by a dedicated hardware-based system for performing the specified functions or operations, or can be implemented by a combination of dedicated hardware and computer instructions.

[0088] The units involved in the embodiments described in the present disclosure may be implemented in software or in hardware, and the described units may also be provided in a processor. Among them, the names of these units do not constitute a limitation to the units themselves in some cases.

[0089] As another aspect, the present application also provides a computer-readable medium, which may be included in the electronic device described in the above embodiments; or may exist separately without being assembled into the electronic device. The above computer-readable medium carries one or more programs, and when the one or more programs are executed by an electronic device, the electronic device is caused to implement the methods described in the following embodiments. For example, the electronic device may implement the various steps as shown in Figure 3 and so on.

[0090] This exemplary embodiment provides a resource allocation method. Referring to Figure 3 shown, the resource allocation method may include the following steps S310 to S340. Specifically:

[0091] Step S310: Generate a plurality of flight segment loops according to a plurality of task locations, the maximum number of flight segments in the loop, and the flight segment connection rules; wherein, the flight segments in the flight segment loop are represented by the task location as the starting point and the task location as the ending point.

[0092] Step S320: Determine the flight segment chain sets respectively corresponding to the plurality of flight segment loops; wherein, there are no identical flight segment chains in the flight segment chain set.

[0093] Step S330: Determine the aircraft allocation information for each flight segment loop in the plurality of flight segment loops according to the number of flight segments of each flight segment chain in each flight segment chain set.

[0094] Step S340: Screen the plurality of flight segment loops according to the aircraft allocation information respectively corresponding to each flight segment loop, and determine the aircraft allocation information corresponding to each flight segment loop in the screening result as the resource allocation result; wherein, the screening result includes the minimum number of aircraft passing through a plurality of task locations.

[0095] Implement Figure 3 the resource allocation method shown, which can optimize the resource allocation result by determining the aircraft allocation information corresponding to the flight segment loop, achieve the freight transportation task with the least resources, and avoid subjective limitations. In addition, the flight segment loops generated by the constraints of the maximum number of flight segments in the loop and the flight segment connection rules can avoid invalid analysis and improve the resource allocation efficiency.

[0096] Next, the above steps of this exemplary embodiment will be described in more detail.

[0097] In step S310, multiple flight segment loops are generated according to multiple task locations, the maximum number of flight segments in the loop, and the flight segment connection rules; wherein, the flight segments in the flight segment loop are represented by the task location as the starting point and the task location as the ending point.

[0098] Specifically, the task location can be represented by a place name, and the parameter representation method of the place name can be (longitude, latitude). The maximum number of flight segments in the loop is used to represent the maximum number of flight segments that can be included in the flight segment loop. The maximum number of flight segments in the loop (e.g., 6) can be set artificially or determined by a deep learning model based on supervised learning. This is not limited in the embodiments of the present application. The flight segment connection rules are used to define the passable flight routes, flight timings (e.g., the aircraft needs to return to the starting point the next day after leaving the starting point), and the ending point of the previous flight segment is the starting point of the next flight segment. The multiple flight segment loops can correspond to the same number of nodes or different numbers of nodes. Each task location serves as a node in the flight segment loop and can form a flight segment loop. Among the multiple task locations, there can be at least one starting point and at least one ending point. The flight segment represented by the task location as the starting point and the task location as the ending point is used to indicate that the aircraft transports goods from the starting point to the ending point to complete the freight task from the task location as the starting point to the task location as the ending point.

[0099] Among them, generating multiple flight segment loops according to multiple task locations, the maximum number of flight segments in the loop, and the flight segment connection rules includes: generating multiple flight segment loops based on NetworkX according to multiple task locations, the maximum number of flight segments in the loop, and the flight segment connection rules. Among them, NetworkX is developed based on the Python language and is used to analyze complex networks. It provides widely used graph and complex network algorithms. Using NetworkX, various random networks and special networks can be generated, and the networks can be stored in a standardized data format; operations such as visualizing complex networks, model simulation, structural feature analysis, statistical data analysis, and designing new network algorithms can be performed. Among them, the Python language is a concise and clear programming language that can flexibly represent graph and complex network algorithms.

[0100] Please refer to Figure 4 , Figure 4 which schematically shows a schematic diagram of an aircraft performing a delivery task according to an embodiment of the present disclosure. As Figure 4 shown, the aircraft can fly from the starting point PKX Beijing Daxing 410 to the ending point CAN Guangzhou Baiyun 420 to complete the first flight segment; further, the aircraft can fly from the starting point CAN Guangzhou Baiyun 420 to the ending point XXX Super Hub 430 to complete the second flight segment; further, the aircraft can fly from the starting point XXX Super Hub 430 to the ending point PKX Beijing Daxing 410 to complete the third flight segment. Among them, PKX Beijing Daxing 410, CAN Guangzhou Baiyun 420, and XXX Super Hub 430 can form the above-mentioned flight segment loop.

[0101] Among them, the first leg, the second leg, and the third leg can be completed by the same aircraft or different aircraft. If the same aircraft can still meet the preset timeliness conditions after completing the first leg, the second leg, and the third leg, the same aircraft can be instructed to complete the first leg, the second leg, and the third leg; if the same aircraft cannot meet the preset timeliness conditions after completing the first leg, the second leg, and the third leg, different aircraft can be controlled to complete the first leg, the second leg, and the third leg.

[0102] Based on Figure 4 , please refer to Figure 5 , Figure 5 FIG. schematically shows a waypoint diagram of an aircraft performing a delivery mission according to an embodiment of the present disclosure. As Figure 5 shown, the aircraft can take off from the starting point PKX Beijing Daxing at a timestamp of 2100, and then arrive at the end point CAN Guangzhou Baiyun at a timestamp of 0030 to complete the first leg; the aircraft can take off from the starting point CAN Guangzhou Baiyun at a timestamp of 0130, and then arrive at the end point XXX Super Hub at a timestamp of 0400 to complete the second leg; the aircraft can take off from the starting point XXX Super Hub at a timestamp of 0060, and then arrive at the end point PKX Beijing Daxing at a timestamp of 0080 to complete the third leg. The aircraft can meet the preset timeliness conditions after completing the first leg, the second leg, and the third leg, for example, return to the starting point within 24 hours.

[0103] Please refer to Figure 6 , Figure 6 FIG. schematically shows a schematic diagram a of a resource allocation method according to an embodiment of the present disclosure. As Figure 6 shown, the leg loop can be composed of node A610, node B620, node C630, node D640, and node E650. Among them, node A610, node B620, node C630, node D640, and node E650 respectively correspond to different task locations.

[0104] Based on the preset timeliness conditions, aircraft No. 1 can be allocated to fly the first leg from node A610 to node B620, the second leg from node B620 to node C630, and the third leg from node C630 to node D640, and aircraft No. 2 can be allocated to fly the fourth leg from node D640 to node E650 and the fifth leg from node E650 to node A610. This can avoid the situation where instructing one aircraft to complete the first leg to the fifth leg causes the aircraft to not meet the preset timeliness conditions.

[0105] Please refer to Figure 7 , Figure 7 FIG. schematically shows a schematic diagram b of a resource allocation method according to an embodiment of the present disclosure. AsFigure 7 As shown, the flight segment loop can also be composed of node A710, node B720, and node C730; among them, node A710, node B720, and node C730 respectively correspond to different task locations. Specifically, in a resource allocation method, it is possible to allocate the No. 1 aircraft to fly the first flight segment from node A710 to node B720 and the second flight segment from node B720 to node A710, allocate the No. 2 aircraft to fly the third flight segment from node B720 to node C730 and the fourth flight segment from node C730 to node B720, and allocate the No. 3 aircraft to fly the fifth flight segment from node C730 to node A710 and the sixth flight segment from node A710 to node C730.

[0106] Please refer to Figure 8 , Figure 8 FIG. schematically shows a schematic diagram c of a resource allocation method according to an embodiment of the present disclosure. As Figure 8 shown, the flight segment loop can also be composed of node A810, node B820, and node C830; among them, node A810, node B820, and node C830 respectively correspond to different task locations. Specifically, in a resource allocation method, it is possible to allocate the No. 1 aircraft to fly the first flight segment from node A810 to node B820, the second flight segment from node B820 to node C830, and the third flight segment from node C830 to node A810, and allocate the No. 2 aircraft to fly the fourth flight segment from node A810 to node C830, the fifth flight segment from node C830 to node B820, and the sixth flight segment from node B820 to node A810.

[0107] In an exemplary embodiment of the present disclosure, a plurality of flight segment loops are generated according to a plurality of task locations, the maximum number of flight segments in the loop, and the flight segment connection rule, including: determining a plurality of task locations whose delivery timeliness belongs to the current unit time period (for example, within 20 hours); generating a plurality of flight segment loops according to the maximum number of flight segments in the loop, the flight segment connection rule, and the plurality of task locations within the unit time.

[0108] Specifically, the plurality of task locations in the current unit time period may include the starting point and the ending point of the delivery tasks received within the current unit time period. Optionally, before determining the plurality of task locations whose delivery timeliness belongs to the current unit time period, the above method may further include: determining the delivery tasks received within the current unit time period, and screening the delivery tasks according to the delivery timeliness corresponding to each delivery task to obtain the delivery tasks whose delivery timeliness belongs to the current unit time period.

[0109] It can be seen that by implementing this optional embodiment, the generation efficiency of the flight segment loop can be improved by restricting the conditions for generating the flight segment loop, which is beneficial to improving the speed of the computer to return the resource allocation result and improving the utilization rate of computing resources.

[0110] In step S320, determine the set of flight segment chains corresponding to each of the multiple flight segment loops; among them, there are no identical flight segment chains in the set of flight segment chains.

[0111] Specifically, the number of flight segment chains corresponding to each flight segment loop can be the same or different.

[0112] As an alternative embodiment, determining the set of flight segment chains corresponding to each of the multiple flight segment loops includes: determining the set of target nodes corresponding to each flight segment loop among the multiple flight segment loops; among them, each target node in the set of target nodes is used as the starting point of a flight segment chain; determining the node order corresponding to each of the multiple flight segment loops; and determining the set of flight segment chains corresponding to each of the multiple flight segment loops according to the node order and the set of target nodes corresponding to each of the multiple flight segment loops.

[0113] It can be seen that implementing this alternative embodiment can determine multiple flight segment chains through the set of target nodes, thereby providing more choices for resource allocation, which helps to determine a more reasonable, more efficient, and lower-cost resource allocation result.

[0114] As an alternative embodiment, wherein: the set of target nodes includes at least a first target node and a second target node, and both the first target node and the second target node are any node in the corresponding target flight segment loop, and the target flight segment loop is any one of the multiple flight segment loops;

[0115] Based on this, determining the set of flight segment chains corresponding to each of the multiple flight segment loops according to the node order and the set of target nodes corresponding to each of the multiple flight segment loops includes: determining a first flight segment chain with the first target node as the starting point according to the node order; determining the second target node according to the position of the first target node in the corresponding node order, and determining a second flight segment chain with the second target node as the starting point according to the node order; and determining the set of flight segment chains formed by the first flight segment chain and the second flight segment chain as the set of flight segment chains corresponding to the target flight segment loop.

[0116] Specifically, the first target node and the second target node can be adjacent nodes in the target flight segment loop. For example, if the flight segment loop includes nodes A, B, C, D, and E, any one of the nodes A, B, C, D, and E (such as node A) can be determined as the target node, so as to obtain a flight segment chain with node A as the starting point (such as ABCDE). Furthermore, determine the node order in the flight segment loop: node A → node B → node C → node D → node E. According to the node order, it can be determined that the next node of node A is node B, and node B is determined as the new target node, so as to obtain a flight segment chain with node B as the starting point (such as BCDEFA). Furthermore, according to the node order, it can be determined that the next node of node B is node C, and node C is determined as the new target node, so as to obtain a flight segment chain with node C as the starting point (such as CDEFAB)

[0117] It can be seen that by implementing this optional embodiment, it is possible to determine a variety of segment chains corresponding to the segment ring based on different nodes in the segment ring as starting points, thereby facilitating the determination of more diverse aircraft allocation solutions for selection, and optimizing the resource allocation result.

[0118] In step S330, aircraft allocation information is determined for each of the multiple segment rings according to the number of segments in each segment chain in each segment chain set.

[0119] As an optional embodiment, aircraft allocation information is determined for each segment ring in multiple segment rings according to the number of segments of each segment chain in each segment chain set, including: generating aircraft allocation information for each segment chain according to the number of segments of each segment chain; determining aircraft allocation information corresponding to each segment chain set according to the aircraft allocation information of each segment chain; and selecting aircraft allocation information from the aircraft allocation information corresponding to each segment chain set according to the required number of aircraft corresponding to each aircraft allocation information as the aircraft allocation information of multiple segment rings.

[0120] Specifically, the aircraft allocation information corresponding to each segment chain set is a set of aircraft allocation information of each segment chain in the segment chain set. Selecting aircraft allocation information from the aircraft allocation information corresponding to each segment chain set according to the required number of aircraft corresponding to each aircraft allocation information as the aircraft allocation information of multiple segment rings includes: selecting the aircraft allocation information with the least required number of aircraft from the aircraft allocation information corresponding to each segment chain set according to the principle of the lowest number as the optimal aircraft allocation information of the corresponding segment ring.

[0121] It can be seen that the implementation of this optional embodiment can improve the utilization rate of aircraft resources by determining aircraft allocation information to avoid the phenomenon that one aircraft only performs one flight segment.

[0122] As an optional embodiment, the aircraft allocation information of each segment chain is generated according to the number of segments in each segment chain, including: if the number of segments of the target segment chain is 1, then the aircraft allocation information corresponding to the target segment chain is generated; wherein the target segment chain is any segment chain in each segment chain set; if the number of segments of the target segment chain is 2, then the segment type of each segment in the target segment chain is determined, and the aircraft allocation information corresponding to the target segment chain is generated according to the determination result; if the number of segments of the target segment chain is greater than 2, then the target segment chain is divided according to the optimal segment combination, and the aircraft allocation information corresponding to the division result is generated according to the priority of the segment type.

[0123] Among them, if the number of segments in the target segment chain is 1, after generating the aircraft allocation information corresponding to the target segment chain, it may further include: returning the result [1, the segments executed by each aircraft]. Generating the aircraft allocation information corresponding to the target segment chain includes: determining the aircraft at the starting point of the target segment chain, and generating the aircraft allocation information corresponding to the target segment chain according to the basic information of this aircraft.

[0124] Among them, if the number of segments in the target segment chain is 2, perform a segment type determination on each segment in the target segment chain, and generate the aircraft allocation information corresponding to the target segment chain according to the determination result, including: performing a segment type determination on each segment in the target segment chain according to the preset segment type Type1: 'PP', 'EM', 'PM', 'PE', 'EP' and segment type Type2: 'PPP', 'PEM', 'PPM', 'PPE'; if the segment in the target segment chain belongs to segment type Type1, then return [1, [the segments executed by each aircraft]], if it does not belong to segment type Type1, then return [2, [the segments executed by each aircraft]], where [2, [the segments executed by each aircraft]] is used to indicate that this target segment chain with 2 segments requires two aircraft to complete.

[0125] Specifically, the segment type Type1 includes types of combinations of 2 segments, and the segment type Type2 includes types of combinations of 3 segments. Specifically, the above P represents a point-to-point segment, the starting point and the ending point of the P segment can be hub airports, and the P segment does not include transfer stations; the above E represents a hub inbound segment, and the ending point of the E segment is a hub airport; the above M represents a hub outbound segment, and the starting point of the M segment is a hub airport. For example, different segment types can be as shown in the following table:

[0126] Starting Point Name End Point Name Departure Time Arrival Time Flight Duration Aircraft Type Flight Segment Type City A City B 03:00:00 05:30:00 150 B737 P City S City G 01:50:20 03:45:20 115 B738 E City C City S 06:10:40 08:20:40 130 B738 M City S City A 06:13:20 08:18:20 125 B737 M City E City S 01:41:40 03:46:40 125 B737 E City S City B 06:24:00 08:04:00 100 B737 M City G City S 01:36:00 03:58:00 142 B738 E City H City S 02:28:00 04:00:00 92 B767 E City S City F 02:09:00 03:44:00 95 B737 E City S City C 06:12:00 09:02:00 170 B738 M City S City D 06:13:20 08:13:20 120 B738 M City S City A 01:46:40 03:46:40 120 B738 E City S City Z 01:01:20 03:41:20 160 B737 E

[0127] Among them, if the number of segments in the target segment chain is greater than 2, divide the target segment chain according to the optimal segment combination, and generate aircraft allocation information corresponding to the division result according to the priority of segment types, including: divide the target segment chain according to the optimal segment combination (e.g., a combination of 3 segments), obtain the candidate segment combinations corresponding to the target segment chain and store them in temp_list, divide the segment chain into a left part left_part and a right part right_part based on the candidate segment combinations, and determine (left_part, temp_list) corresponding to the left part left_part and (right_part, temp_list) corresponding to the right part right_part. Alternatively, divide the target segment chain according to the optimal segment combination (e.g., a combination of 2 segments), obtain the candidate segment combinations corresponding to the target segment chain and store them in temp_list, divide the segment chain into a left part left_part and a right part right_part based on the candidate segment combinations, and determine (left_part, temp_list) corresponding to the left part left_part and (right_part, temp_list) corresponding to the right part right_part.

[0128] Optionally, if the target segment chain cannot be divided according to a combination of 3 segments or a combination of 2 segments, it may further include: allocating aircraft to each segment in the target segment chain and generating aircraft allocation information.

[0129] Optionally, if the number of segments in the target segment chain is 0, it may further include: returning the result [0, []].

[0130] It can be seen that implementing this optional embodiment can determine different aircraft allocation information according to the number of segments in the target segment chain, thereby adaptively adjusting the allocation of aircraft resources and improving the utilization rate of aircraft resources.

[0131] In step S340, screen multiple segment loops according to the aircraft allocation information corresponding to each segment loop, and determine the aircraft allocation information corresponding to each segment loop in the screening result as the resource allocation result; among them, the screening result includes the minimum number of aircraft passing through multiple mission locations.

[0132] Specifically, screening multiple segment loops according to the aircraft allocation information corresponding to each segment loop includes: determining each segment loop C, segment set A, and the required number of aircraft p of segment loop C c , and the segment loop set S(a) containing segment a in segment set A; calculate from the expression min∑ c 、S(a) for the expression min∑ c∈C x c ×p cand s.t. ∑ c∈S(a) x c = 1; obtain x in c ; if x c = 1, then determine the flight segment loop C as the flight segment loop in the screening result; if x c = 0, then discard the flight segment loop C. Among them, the screening result is constrained to: each flight segment must be covered by a flight segment loop, and each flight segment is only covered once.

[0133] As an optional embodiment, after determining the aircraft allocation information corresponding to each flight segment loop in the screening result as the resource allocation result, the above method further includes: sending the resource allocation result to the terminals at multiple task locations, so that the terminals perform aircraft scheduling according to the resource allocation result.

[0134] Specifically, the terminals at multiple task locations can be the aircraft central control platform or the driver equipment. The terminals perform aircraft scheduling according to the resource allocation result, including: the terminals generate flight information according to the resource allocation result and display the flight information to the driver. Among them, the resource allocation result can include: the number of aircrafts completing the delivery tasks within a unit time, the effective flight time of each aircraft, the flight segments of each aircraft, the airport information where each aircraft docks, etc., which are not limited in the embodiments of the present application. Specifically, sending the resource allocation result to the terminals at multiple task locations includes: parsing the resource allocation result into structured data and sending the structured data to the terminals at multiple task locations.

[0135] It can be seen that implementing this optional embodiment can improve the scheduling efficiency of aircraft, maximize the utilization rate of aircraft resources, and reduce the cost of manually allocating aircraft resources.

[0136] Please refer to Figure 9 , Figure 9 which schematically shows a module diagram for implementing the resource allocation method in an embodiment of the present disclosure. As Figure 9 shown, the module for implementing the resource allocation method can include: a loop generation module 910, a loop splitting module 920, a loop selection module 930, and a loop parsing module 940.

[0137] The loop generation module 910 is used to generate multiple flight segment loops according to multiple task locations, the maximum number of flight segments in the loop, and the flight segment connection rule; among them, the flight segments in the flight segment loop are represented by the task location as the starting point and the task location as the ending point.

[0138] The split loop module 920 is used to determine the node order corresponding to each of the multiple flight segment loops, and determine the flight segment chain sets corresponding to each of the multiple flight segment loops according to the node order and the target node sets corresponding to each of the multiple flight segment loops, and determine the aircraft allocation information for each of the multiple flight segment loops according to the number of flight segments of each flight segment chain in each flight segment chain set.

[0139] The selection loop module 930 is used to screen the multiple flight segment loops according to the aircraft allocation information corresponding to each flight segment loop, and obtain a screening result.

[0140] The parsing loop module 940 is used to parse the screening result, and determine the aircraft allocation information corresponding to each flight segment loop in the screening result as the resource allocation result; wherein, the screening result includes the minimum number of aircraft passing through multiple task locations.

[0141] Please refer to Figure 10 , Figure 10 which schematically shows a flowchart of a resource allocation method according to an embodiment of the present disclosure. As Figure 10 shown, the resource allocation method may include: step S1000 to step S1080.

[0142] Step S1000: Determine multiple task locations whose delivery timeliness belongs to the current unit time period, and generate multiple flight segment loops according to the maximum number of flight segments in the loop, the flight segment connection rule, and the multiple task locations within the unit time; wherein, the flight segments in the flight segment loop are represented by the task location as the starting point and the task location as the ending point.

[0143] Step S1010: Determine the target node sets corresponding to each of the multiple flight segment loops; wherein, each target node in the target node set is used as the starting point of the flight segment chain.

[0144] Step S1020: Determine the node order corresponding to each of the multiple flight segment loops, and determine the flight segment chain sets corresponding to each of the multiple flight segment loops according to the node order and the target node sets corresponding to each of the multiple flight segment loops; wherein, there are no identical flight segment chains in the flight segment chain set. The target flight segment chain is any flight segment chain in each flight segment chain set. If the number of flight segments of the target flight segment chain is 1, then execute step S1030. The target flight segment chain is any flight segment chain in each flight segment chain set. If the number of flight segments of the target flight segment chain is 2, then execute step S1040. The target flight segment chain is any flight segment chain in each flight segment chain set. If the number of flight segments of the target flight segment chain is greater than 2, then execute step S1050.

[0145] Step S1030: Generate the aircraft allocation information corresponding to the target flight segment chain; wherein, the target flight segment chain is any flight segment chain in each flight segment chain set. Then execute step S1060.

[0146] Step S1040: Determine the flight segment type for each flight segment in the target flight segment chain, and generate the aircraft allocation information corresponding to the target flight segment chain according to the determination result. Then, execute step S1060.

[0147] Step S1050: Divide the target flight segment chain according to the optimal flight segment combination, and generate the aircraft allocation information corresponding to the division result according to the priority of the flight segment type. Then, execute step S1060.

[0148] Step S1060: Determine the aircraft allocation information corresponding to each flight segment chain set according to the aircraft allocation information of each flight segment chain, and select the aircraft allocation information from the aircraft allocation information corresponding to each flight segment chain set according to the required number of aircraft corresponding to each aircraft allocation information as the aircraft allocation information for multiple flight segments loops.

[0149] Step S1070: Screen multiple flight segment loops according to the aircraft allocation information corresponding to each flight segment loop, and determine the aircraft allocation information corresponding to each flight segment loop in the screening result as the resource allocation result; wherein, the screening result includes the minimum number of aircraft passing through multiple task locations.

[0150] Step S1080: Send the resource allocation result to the terminals at multiple task locations so that the terminals perform aircraft scheduling according to the resource allocation result.

[0151] It should be noted that steps S1000 to S1080 correspond to Figure 3 the steps and their embodiments shown. For the specific implementation manners of steps S1000 to S1080, please refer to Figure 3 the steps and their embodiments shown, which will not be elaborated here.

[0152] It can be seen that by implementing Figure 10 the method shown, the resource allocation result can be optimized by determining the aircraft allocation information corresponding to the flight segment loop, so as to complete the freight task with the least resources and avoid subjective limitations. In addition, the flight segment loops generated by the maximum number of flight segments in the loop and the flight segment connection rules can avoid invalid analysis and improve the resource allocation efficiency.

[0153] Furthermore, in this exemplary embodiment, a resource allocation device is further provided. Referring to Figure 11 shown, Figure 11 schematically shows the structural block of the resource allocation device in an embodiment of the present disclosure. The resource allocation device 1100 may include:

[0154] According to the second aspect of the embodiments of the present disclosure, a resource allocation device is provided, and the above device includes:

[0155] A flight segment loop generation unit 1101, configured to generate a plurality of flight segment loops according to a plurality of task locations, the maximum number of flight segments in a loop, and flight segment connection rules; wherein, the flight segments in the flight segment loop are represented by a task location as the starting point and a task location as the ending point;

[0156] A flight segment chain determination unit 1102, configured to determine a set of flight segment chains corresponding to each of the plurality of flight segment loops; wherein, there are no identical flight segment chains in the set of flight segment chains;

[0157] An aircraft allocation information determination unit 1103, configured to determine aircraft allocation information for each flight segment loop among the plurality of flight segment loops according to the number of flight segments of each flight segment chain in each set of flight segment chains;

[0158] A flight segment loop screening unit 1104, configured to screen the plurality of flight segment loops according to the aircraft allocation information corresponding to each flight segment loop, and determine the aircraft allocation information corresponding to each flight segment loop in the screening result as a resource allocation result; wherein, the screening result includes the minimum number of aircraft passing through a plurality of task locations.

[0159] It can be seen that implementing Figure 11 the device shown can optimize the resource allocation result by determining the aircraft allocation information corresponding to the flight segment loop, achieve the freight transportation task with the least resources, and avoid subjective limitations. In addition, the flight segment loops generated by constraining with the maximum number of flight segments in the loop and flight segment connection rules can avoid invalid analysis and improve the resource allocation efficiency.

[0160] In an exemplary embodiment of the present disclosure, the above device further includes:

[0161] A resource allocation result distribution unit (not shown), configured to, after the flight segment loop screening unit 1104 determines the aircraft allocation information corresponding to each flight segment loop in the screening result as a resource allocation result, send the resource allocation result to the terminals at a plurality of task locations, so that the terminals perform aircraft scheduling according to the resource allocation result.

[0162] It can be seen that implementing this optional embodiment can improve the scheduling efficiency of aircraft, maximize the utilization rate of aircraft resources, and reduce the cost of manually allocating aircraft resources.

[0163] In an exemplary embodiment of the present disclosure, the flight segment loop generation unit 1101 generates a plurality of flight segment loops according to a plurality of task locations, the maximum number of flight segments in a loop, and flight segment connection rules, including:

[0164] Determine a plurality of task locations whose delivery timeliness belongs to the current unit time period;

[0165] Generate a plurality of flight segment loops according to the maximum number of flight segments in the loop, flight segment connection rules, and a plurality of task locations within a unit time.

[0166] It can be seen that implementing this optional embodiment can improve the generation efficiency of the flight segment loop by restricting the conditions for generating the flight segment loop, thereby facilitating the improvement of the speed at which the computer returns the resource allocation result and enhancing the utilization rate of computing resources.

[0167] In an exemplary embodiment of the present disclosure, the flight segment chain determination unit 1102 determines the flight segment chain sets corresponding to multiple flight segment loops, including:

[0168] Determining the target node set corresponding to each flight segment loop among the multiple flight segment loops; wherein, each target node in the target node set is used as the starting point of the flight segment chain;

[0169] Determining the node order corresponding to each of the multiple flight segment loops;

[0170] Determining the flight segment chain sets corresponding to the multiple flight segment loops according to the node order and the target node sets corresponding to the multiple flight segment loops respectively.

[0171] It can be seen that implementing this optional embodiment can determine multiple flight segment chains through the target node set, thereby providing more choices for resource allocation and helping to determine a more reasonable, efficient, and cost-effective resource allocation result.

[0172] In an exemplary embodiment of the present disclosure, wherein: the target node set includes at least a first target node and a second target node, both the first target node and the second target node are any node in the corresponding target flight segment loop, and the target flight segment loop is any one of the multiple flight segment loops;

[0173] The flight segment chain determination unit 1102 determines the flight segment chain sets corresponding to the multiple flight segment loops according to the node order and the target node sets corresponding to the multiple flight segment loops respectively, including:

[0174] Determining a first flight segment chain with the first target node as the starting point according to the node order;

[0175] Determining the second target node according to the position of the first target node in the corresponding node order, and determining a second flight segment chain with the second target node as the starting point according to the node order;

[0176] Determining the flight segment chain set composed of the first flight segment chain and the second flight segment chain as the flight segment chain set corresponding to the target flight segment loop.

[0177] It can be seen that implementing this optional embodiment can determine multiple flight segment chains corresponding to the flight segment loop based on different nodes in the flight segment loop as the starting points, thereby facilitating the determination of more diverse aircraft allocation schemes for selection and optimizing the resource allocation result.

[0178] In an exemplary embodiment of the present disclosure, the aircraft allocation information determination unit 1103 determines the aircraft allocation information for each flight segment loop among a plurality of flight segment loops according to the number of flight segments in each flight segment chain in each set of flight segment chains, including:

[0179] Generating the aircraft allocation information for each flight segment chain according to the number of flight segments in each flight segment chain;

[0180] Determining the aircraft allocation information corresponding to each set of flight segment chains according to the aircraft allocation information of each flight segment chain;

[0181] Selecting the aircraft allocation information from the aircraft allocation information corresponding to each set of flight segment chains according to the required number of aircraft corresponding to each aircraft allocation information as the aircraft allocation information for the plurality of flight segment loops.

[0182] It can be seen that by implementing this optional embodiment, the phenomenon that an aircraft only executes one flight segment can be avoided as much as possible by determining the aircraft allocation information, thereby improving the utilization rate of aircraft resources.

[0183] In an exemplary embodiment of the present disclosure, the aircraft allocation information determination unit 1103 generates the aircraft allocation information for each flight segment chain according to the number of flight segments in each flight segment chain, including:

[0184] If the number of flight segments of the target flight segment chain is 1, generating the aircraft allocation information corresponding to the target flight segment chain; wherein the target flight segment chain is any flight segment chain in each set of flight segment chains;

[0185] If the number of flight segments of the target flight segment chain is 2, determining the type of each flight segment in the target flight segment chain, and generating the aircraft allocation information corresponding to the target flight segment chain according to the determination result;

[0186] If the number of flight segments of the target flight segment chain is greater than 2, dividing the target flight segment chain according to the optimal flight segment combination, and generating the aircraft allocation information corresponding to the division result according to the priority of the flight segment type.

[0187] It can be seen that by implementing this optional embodiment, different aircraft allocation information can be determined according to the number of flight segments of the target flight segment chain, thereby adaptively adjusting the allocation of aircraft resources and improving the utilization rate of aircraft resources.

[0188] It should be noted that although several modules or units of a device for action execution are mentioned in the above detailed description, such a division is not mandatory. In fact, according to the embodiments of the present disclosure, the features and functions of the two or more modules or units described above can be embodied in one module or unit. Conversely, the features and functions of one module or unit described above can be further divided and embodied by a plurality of modules or units.

[0189] Since each functional module of the resource allocation device according to the exemplary embodiments of the present disclosure corresponds to the steps of the exemplary embodiments of the above resource allocation method, for details not disclosed in the embodiments of the present disclosure of the device, reference may be made to the embodiments of the above resource allocation method of the present disclosure.

[0190] Those skilled in the art will readily conceive of other embodiments of the present disclosure after considering the specification and practicing the invention disclosed herein. This application is intended to cover any variations, uses, or adaptations of the present disclosure, which follow the general principles of the present disclosure and include common general knowledge or conventional technical means in the technical field not disclosed by the present disclosure. The specification and embodiments are only to be considered as exemplary, and the true scope and spirit of the present disclosure are pointed out by the following claims.

[0191] It should be understood that the present disclosure is not limited to the exact structures described above and shown in the drawings, and various modifications and changes can be made without departing from its scope. The scope of the present disclosure is only limited by the appended claims.

Claims

1. A resource allocation method, characterized in that, Including: Generating a plurality of flight segment loops according to a plurality of task locations, the maximum number of flight segments in the loop, and flight segment connection rules; wherein, the flight segments in the flight segment loop are represented by a task location as the starting point and a task location as the ending point; Determining a set of flight segment chains corresponding to each of the plurality of flight segment loops; wherein, there are no identical flight segment chains in the set of flight segment chains; Determining aircraft allocation information for each flight segment loop among the plurality of flight segment loops according to the number of flight segments of each flight segment chain in each set of flight segment chains; Screening the plurality of flight segment loops according to the aircraft allocation information corresponding to each flight segment loop respectively, and determining the aircraft allocation information corresponding to each flight segment loop in the screening result as the resource allocation result; wherein, the screening result includes the minimum number of aircraft passing through the plurality of task locations; Wherein, the determining the set of flight segment chains corresponding to each of the plurality of flight segment loops includes: Determining a set of target nodes corresponding to each flight segment loop among the plurality of flight segment loops; wherein, each target node in the set of target nodes is used as the starting point of a flight segment chain; Determining the node order corresponding to each of the plurality of flight segment loops; Determining the set of flight segment chains corresponding to each of the plurality of flight segment loops according to the node order and the set of target nodes corresponding to each of the plurality of flight segment loops respectively.

2. The method according to claim 1, characterized in that, After determining the aircraft allocation information corresponding to each flight segment loop in the screening result as the resource allocation result, the method further includes: Sending the resource allocation result to the terminals at the plurality of task locations, so that the terminals perform aircraft scheduling according to the resource allocation result.

3. The method according to claim 1, characterized in that, Generating a plurality of flight segment loops according to a plurality of task locations, the maximum number of flight segments in the loop, and flight segment connection rules, includes: Determining a plurality of task locations whose delivery timeliness belongs to the current unit time period; Generating a plurality of flight segment loops according to the maximum number of flight segments in the loop, flight segment connection rules, and the plurality of task locations within the unit time.

4. The method according to claim 1, characterized in that, Wherein: The set of target nodes includes at least a first target node and a second target node, both the first target node and the second target node are any node in the corresponding target flight segment loop, and the target flight segment loop is any flight segment loop among the plurality of flight segment loops; The determining the set of flight segment chains corresponding to each of the plurality of flight segment loops according to the node order and the set of target nodes corresponding to each of the plurality of flight segment loops respectively includes: Determining a first flight segment chain with the first target node as the starting point according to the node order; Determining the second target node according to the position of the first target node in the corresponding node order, and determining a second flight segment chain with the second target node as the starting point according to the node order; Determining the set of flight segment chains formed by the first flight segment chain and the second flight segment chain as the set of flight segment chains corresponding to the target flight segment loop.

5. The method according to claim 1, characterized in that, Determining aircraft allocation information for each flight segment loop among the plurality of flight segment loops according to the number of flight segments of each flight segment chain in each set of flight segment chains, includes: Generating aircraft allocation information for each flight segment chain according to the number of flight segments of each flight segment chain; Determining the aircraft allocation information corresponding to each set of flight segment chains according to the aircraft allocation information of each flight segment chain. Select the aircraft allocation information from the aircraft allocation information corresponding to each of the segment chain sets according to the required number of aircraft corresponding to each aircraft allocation information, as the aircraft allocation information for the multiple segment loops.

6. The method according to claim 5, characterized in that, Generate the aircraft allocation information for each segment chain according to the number of segments of each segment chain, including: If the number of segments of the target segment chain is 1, generate the aircraft allocation information corresponding to the target segment chain; wherein, the target segment chain is any segment chain in the set of segment chains. If the number of segments of the target segment chain is 2, determine the segment type of each segment in the target segment chain, and generate the aircraft allocation information corresponding to the target segment chain according to the determination result. If the number of segments of the target segment chain is greater than 2, divide the target segment chain according to the optimal segment combination, and generate the aircraft allocation information corresponding to the division result according to the priority of the segment type.

7. A resource allocation device, characterized in that, Including: A segment loop generation unit, configured to generate a plurality of segment loops according to a plurality of task locations, the maximum number of segments in the loop, and the segment connection rule; wherein, the segments in the segment loop are represented by the task location as the starting point and the task location as the ending point. A segment chain determination unit, configured to determine the set of segment chains corresponding to each of the plurality of segment loops; wherein, there are no identical segment chains in the set of segment chains. An aircraft allocation information determination unit, configured to determine the aircraft allocation information for each segment loop in the plurality of segment loops according to the number of segments of each segment chain in the set of segment chains. A segment loop screening unit, configured to screen the plurality of segment loops according to the aircraft allocation information corresponding to each of the segment loops, and determine the aircraft allocation information corresponding to each segment loop in the screening result as the resource allocation result; wherein, the screening result includes the minimum number of aircraft passing through the plurality of task locations. In the segment chain determination unit, determining the set of segment chains corresponding to each of the plurality of segment loops includes: Determine the set of target nodes corresponding to each segment loop in the plurality of segment loops; wherein, each target node in the set of target nodes is used as the starting point of the segment chain. Determine the node order corresponding to each of the plurality of segment loops. Determine the set of segment chains corresponding to each of the plurality of segment loops according to the node order and the set of target nodes corresponding to each of the plurality of segment loops.

8. A computer-readable medium having a computer program stored thereon, characterized in that, When the program is executed by a processor, it implements the resource allocation method according to any one of claims 1 to 6.

9. An electronic device, characterized in that, Including: One or more processors; A storage device, configured to store one or more programs, and when the one or more programs are executed by the one or more processors, enable the one or more processors to implement the resource allocation method according to any one of claims 1 to 6.

Images