Vehicle dispatching methods, devices, equipment, storage media and products

Abstract

This application discloses a vehicle dispatching method, apparatus, device, storage medium, and product, relating to the field of intelligent dispatching technology. The method includes: selecting candidate carpooling addresses from undispatched addresses based on a dispatching start address, where the dispatching start address is the current address of the vehicle to be dispatched; performing multi-level filtering on the candidate carpooling addresses to determine the addresses to be selected; prioritizing each address to be selected; and selecting the target arrival address of the currently dispatched vehicle from the address list based on the ranking results. Because the overall planning and dispatching is not performed directly before the vehicle travels, but rather during the vehicle assembly process, the method progressively plans where the vehicle to be dispatched should be dispatched and determines the target arrival address. Furthermore, multi-level filtering is performed during the planning process based on factors such as neighborhood and compatibility to ensure reasonable vehicle dispatching, thereby improving the actual effectiveness of vehicle dispatching.

Description

Technical Field

[0001] This application relates to the field of intelligent scheduling technology, and in particular to vehicle scheduling methods, devices, equipment, storage media and products. Background Technology

[0002] In the intelligent carpooling dispatch scenario, currently, before the vehicle departs, a certain shipping address or the address corresponding to a high-priority order is selected as the starting point. Then, several addresses corresponding to the remaining orders to be dispatched are randomly selected and merged into the same vehicle's journey. After the vehicle completes the joint assembly according to the vehicle's journey, the assembled goods are delivered to the order processing unit (such as a factory).

[0003] However, in the actual scheduling process, since the selection is done directly without considering the actual situation of each order, such as the actual travel route, even if several orders seem to be able to carpool, in reality there may be detours, address incompatibility, disruption of the travel direction, etc., resulting in poor overall scheduling effect. Summary of the Invention

[0004] The main purpose of this application is to provide a vehicle dispatching method, apparatus, equipment, storage medium and product, which aims to solve the technical problem that when related technologies perform vehicle dispatching, they do not consider the actual situation of each address, but randomly select orders for grouping, resulting in poor actual dispatching effect.

[0005] To achieve the above objectives, this application proposes a vehicle dispatching method, the method comprising: Candidate carpooling addresses are selected from unscheduled addresses based on the scheduling start address, where the scheduling start address is the current address of the vehicle to be scheduled; The candidate carpooling addresses are filtered through multiple levels to determine the addresses to be selected; The addresses to be selected are prioritized, and the target arrival address of the currently scheduled vehicle is selected from the addresses to be selected based on the prioritization results.

[0006] Optionally, the step of performing multi-level filtering on the candidate carpooling addresses to determine the address to be selected includes: Based on the scheduling start address, the candidate carpooling addresses are filtered by neighborhood range to determine the first-level filtered addresses; Based on the loaded addresses of the vehicles to be dispatched, the primary filtering addresses are subjected to common compatibility filtering to determine the secondary filtering addresses; The addresses in the secondary filtering are subjected to incorporation filtering to determine the addresses to be selected.

[0007] Optionally, the step of filtering the candidate carpooling addresses based on the scheduling start address to determine the primary filtering address includes: Obtain the straight-line interval distance corresponding to the scheduling start address, where the straight-line interval distance is the straight-line distance between the scheduling start address and the order processing unit; The dynamic neighborhood range is determined based on the straight-line interval distance and the map angle threshold. Candidate carpooling addresses within the dynamic neighborhood range are used as primary filtering addresses.

[0008] Optionally, the step of performing common compatibility filtering on the first-level filtered addresses based on the loaded addresses of the vehicles to be dispatched to determine the second-level filtered addresses includes: Obtain the list of possible addresses corresponding to each loaded address of the vehicle to be dispatched; The first-level filter address that appears in the list of possible addresses corresponding to at least one loaded address will be used as the second-level filter address.

[0009] Optionally, the step of performing concatenation-based filtering on the secondary filtering addresses to determine the addresses to be selected includes: Obtain the order capacity information and vehicle model requirements corresponding to each secondary filter address; Detect whether the order capacity information exceeds the carrying capacity of the vehicle to be dispatched, and determine whether the vehicle type requirement matches the vehicle to be dispatched; The secondary filter address that is not within the carrying capacity of the vehicle to be dispatched and whose corresponding vehicle model requirement matches the vehicle to be dispatched is selected as the address to be selected.

[0010] Optionally, after detecting whether the order capacity information exceeds the carrying capacity of the vehicle to be dispatched, and determining whether the vehicle type demand matches the vehicle to be dispatched, the method further includes: Secondary filtering addresses that contain order capacity information that exceeds the carrying capacity of the vehicle to be dispatched, or whose vehicle model requirements do not match the vehicle to be dispatched, are designated as addresses to be confirmed. Determine the retention priority corresponding to the address to be confirmed; Whether the address to be confirmed can be retained is determined based on the retention priority. If it cannot be retained, the address to be confirmed will be removed from the unscheduled addresses, or the address to be confirmed will be marked as an address that cannot be concatenated.

[0011] Furthermore, to achieve the above objectives, this application also proposes a vehicle dispatching device, which includes: The selection module is used to select candidate carpooling addresses from unscheduled addresses based on the scheduling start address, wherein the scheduling start address is the current address of the vehicle to be scheduled; The filtering module is used to perform multi-level filtering on the candidate carpooling addresses to determine the addresses to be selected; The sorting module is used to prioritize each candidate address and select the target arrival address of the currently scheduled vehicle from the candidate addresses based on the sorting results.

[0012] In addition, to achieve the above objectives, this application also proposes a vehicle dispatching device, the device comprising: a memory, a processor, and a computer program stored in the memory and executable on the processor, the computer program being configured to implement the steps of the vehicle dispatching method as described above.

[0013] In addition, to achieve the above objectives, this application also proposes a storage medium, which is a computer-readable storage medium, on which a computer program is stored, and which, when executed by a processor, implements the steps of the vehicle scheduling method described above.

[0014] In addition, to achieve the above objectives, this application also provides a computer program product, which includes a computer program that, when executed by a processor, implements the steps of the vehicle scheduling method described above.

[0015] One or more technical solutions proposed in this application have at least the following technical effects: Because the overall planning and scheduling is not carried out directly before the vehicles are driven, but rather during the vehicle assembly process, the planning is done step by step to determine where the vehicles to be scheduled should be dispatched and to determine the target arrival address. In addition, during the planning process, multiple levels of screening are carried out from the perspectives of neighborhood and compatibility to ensure that the vehicles can be reasonably dispatched, thereby improving the actual effect of vehicle dispatching. Attached Figure Description

[0016] The accompanying drawings, which are incorporated in and form part of this specification, illustrate embodiments consistent with this application and, together with the description, serve to explain the principles of this application.

[0017] To more clearly illustrate the technical solutions in the embodiments of this application or the prior art, the drawings used in the description of the embodiments or the prior art will be briefly introduced below. Obviously, for those skilled in the art, other drawings can be obtained based on these drawings without creative effort.

[0018] Figure 1 This is a flowchart illustrating an embodiment of the vehicle dispatching method of this application. Figure 2 This is a flowchart illustrating Embodiment 2 of the vehicle dispatching method of this application; Figure 3 This is a schematic diagram of the module structure of the vehicle dispatching device according to an embodiment of this application; Figure 4This is a schematic diagram of the equipment structure of the hardware operating environment involved in the vehicle scheduling method in this application embodiment.

[0019] The purpose, features, and advantages of this application will be further explained in conjunction with the embodiments and with reference to the accompanying drawings. Detailed Implementation

[0020] It should be understood that the specific embodiments described herein are merely illustrative of the technical solutions of this application and are not intended to limit this application.

[0021] To better understand the technical solution of this application, a detailed description will be provided below in conjunction with the accompanying drawings and specific implementation methods.

[0022] Based on this, the embodiments of this application provide a vehicle dispatching method, referring to... Figure 1 , Figure 1 This is a flowchart illustrating the first embodiment of the vehicle dispatching method of this application.

[0023] In this embodiment, the vehicle dispatching method includes steps S10 to S30: Step S10: Select candidate carpooling addresses from unscheduled addresses based on the scheduling start address, where the scheduling start address is the current address of the vehicle to be scheduled.

[0024] It should be noted that the execution subject of this embodiment can be a vehicle dispatching device. The vehicle dispatching device can be an electronic device such as a personal computer or server, or a controller installed in the vehicle to be dispatched, such as an ECU controller or other types of controllers. It can also be other devices that can achieve the same or similar functions. This embodiment does not limit this. In this embodiment and the following embodiments, the vehicle dispatching device is used as an example to illustrate the vehicle dispatching method of this application.

[0025] It should be noted that the vehicles to be dispatched can be those that need to be dispatched for consolidated transport, that is, vehicles that load goods from multiple orders and deliver them to the order processing unit. The order processing unit can be a unit that collects and processes goods in a unified manner, such as a factory or its subsidiary, or a similar unit, such as a cargo distribution center or a laundry factory.

[0026] It should be noted that an unscheduled address can be the address corresponding to an order to be scheduled (also known as an unprocessed order). An order to be scheduled can include information such as order number, customer information, address data, delivery time, emergency flag, area, weight, split order attribute, and creation time.

[0027] Address data can further include: address number, address priority, and information about the unit to which it belongs (such as information about the factory or subsidiary factory). If necessary, it can also include information such as the route code to which the address belongs and the priority of the route. The route to which the address belongs is the transportation route to which the address belongs, such as the route from Area A to Factory A.

[0028] In practical use, the portion of unscheduled addresses that meets the following conditions can be selected as candidate carpooling addresses: If the address is within the range of addresses that the vehicle is currently allowed to reach, such as the distance between the unscheduled address and the scheduling start address not exceeding the current maximum distance that the vehicle to be scheduled is currently allowed to travel; The factory area or sub-factory to which the address belongs must be consistent with the current scheduling context. For example, if the vehicle to be scheduled is delivering goods to factory A, then the factory mentioned at the unscheduled address must also be factory A.

[0029] Furthermore, we can further determine whether an address should be selected as a candidate carpooling address only if the following conditions are met: The address has available map master point information, such as an unscheduled address corresponding to a point that is convenient for vehicles to be dispatched to load goods; The current vehicle capacity and number of stations allow for acceptance, for example: the goods loaded on the vehicles to be dispatched have not exceeded the capacity limit, and the loading addresses of the vehicles to be dispatched have not exceeded the station number limit.

[0030] In actual use, since this type of cargo loading vehicle actually loads cargo from multiple locations, the next step to be dispatched can be determined when the vehicle is loading cargo or when loading is completed. At this time, step S10 and subsequent steps of this embodiment are executed.

[0031] Step S20: Perform multi-level filtering on the candidate carpooling addresses to determine the address to be selected.

[0032] In practical use, in order to ensure that a suitable address can be selected, the previously selected candidate carpooling addresses can be screened in multiple ways, such as whether they are within the neighborhood range, whether they are compatible with the addresses previously loaded, and whether the orders corresponding to the addresses can be combined with the goods in the vehicles to be dispatched, so as to determine the address to be selected.

[0033] Step S30: Sort the candidate addresses by priority, and select the target arrival address of the currently scheduled vehicle from the candidate addresses based on the sorting results.

[0034] In practical use, the addresses to be selected can be sorted by priority. Then, the address with the highest priority in the sorting result can be selected as the target arrival address of the currently dispatched vehicle.

[0035] For example, if the addresses are sorted from highest to lowest priority, the top-ranked address in the sorting results can be selected as the target arrival address for the currently dispatched vehicle.

[0036] The target arrival address can be the location where the dispatched vehicle will be loaded with goods for the next time, that is, the address that the dispatched vehicle should currently arrive at.

[0037] In practical applications, when determining the target arrival address, or when the vehicle to be dispatched arrives at the target arrival address, the relevant information of the vehicle to be dispatched can be updated, and then the process returns to step S10. The relevant information for the vehicles to be dispatched may include: Vehicle loaded addresses (vehicle loaded addresses can be stored in a set or a data table); The total distance traveled by the vehicle; The maximum straight-line distance difference between the addresses the vehicle has arrived at or is about to arrive at; Allowed carpooling angle for vehicles (i.e., map angle threshold); The permitted carpooling distance; The maximum value of the current address level of the vehicle; The total loaded area and weight of the vehicle.

[0038] If the vehicle to be dispatched has no previously loaded address, the cumulative path distance of the vehicle is the main path distance from the pick-up origin (the origin can also be the order processing unit, such as the vehicle to be dispatched departing from the order processing unit, loading goods and returning to the order processing unit) to the current address; if the vehicle already has a loaded address, the cumulative path distance of the vehicle is increased by the path distance from the last loaded address to the current address.

[0039] This embodiment provides a vehicle scheduling method. Instead of performing overall planning and scheduling directly before the vehicles are driven, the method gradually plans where the vehicles to be scheduled should be dispatched during the vehicle assembly process, determines the target arrival address, and conducts multi-level screening based on factors such as neighborhood and compatibility during the planning process to ensure that vehicles can be reasonably scheduled, thereby improving the actual effect of vehicle scheduling.

[0040] Based on the first embodiment of this application, in the second embodiment of this application, the content that is the same as or similar to that in Embodiment 1 above can be referred to the above description, and will not be repeated hereafter. Based on this, please refer to... Figure 2 Step S20 includes steps S201 to S203: Step S201: Filter the candidate carpooling addresses by neighborhood range based on the scheduling start address to determine the first-level filter address.

[0041] It should be noted that the neighborhood range filtering can determine whether the candidate carpooling address exceeds the neighborhood range of the vehicle to be dispatched, so as to determine whether the vehicle to be dispatched will change its direction of travel when it travels to the candidate carpooling address, and whether this will exceed the allowed range of changes.

[0042] In specific implementation, in order to reasonably divide the neighborhood range and ensure the effectiveness of neighborhood range filtering, step S201 in this embodiment may include: Obtain the linear interval distance corresponding to the scheduling start address; The dynamic neighborhood range is determined based on the straight-line interval distance and the map angle threshold. Candidate carpooling addresses within the dynamic neighborhood range are used as primary filtering addresses.

[0043] It should be noted that the straight-line interval distance corresponding to the dispatch starting address can be the straight-line distance between the dispatch starting address and the order processing unit. The map angle threshold can be preset by the vehicle dispatching equipment administrator to limit the allowable directional divergence of vehicles to be dispatched during their journey.

[0044] In practical use, the unit address of the order processing unit can be obtained, and then the straight-line distance between the scheduling start address and the unit address can be calculated to obtain the straight-line interval distance corresponding to the scheduling start address.

[0045] In one scenario, if the vehicle to be dispatched is returning to the order processing unit after loading goods from the order processing unit, then the straight-line interval distance corresponding to the dispatch starting address is actually 0 when the target arrival address is determined for the first time. In this case, the straight-line interval distance corresponding to the dispatch starting address can be a preset distance value.

[0046] In practical applications, the included angle is taken as the map included angle threshold or half of the map included angle threshold. The sine value corresponding to the included angle is calculated, and the sine value is multiplied by the straight line interval distance. The product is used as the dividing benchmark for the dynamic neighborhood range, thereby obtaining the dynamic neighborhood range.

[0047] Understandably, dividing the dynamic neighborhood range in this way allows the dynamic neighborhood range of a vehicle to be dispatched to be larger the further away it is from the order processing unit, and smaller the dynamic neighborhood range of the vehicle to be dispatched to be closer to the order processing unit.

[0048] In practical use, if the distance between the candidate carpooling address and the scheduling start address is less than or equal to the dividing benchmark of the dynamic neighborhood range, it can be determined that the candidate carpooling address is within the dynamic neighborhood range.

[0049] The interval between the candidate carpooling address and the dispatch starting address can be calculated as the path distance (i.e., path length) from the dispatch starting address to the candidate carpooling address. Of course, this interval distance can also be a straight-line distance, and the specific distance to be used can be preset by the vehicle dispatching equipment administrator.

[0050] If the candidate carpooling address is within the dynamic neighborhood range, it means that the candidate carpooling address is within the current direction divergence control range of the vehicle to be dispatched. Therefore, the candidate carpooling address can be used as a first-level filtering address. Conversely, if the candidate carpooling address is not within the dynamic neighborhood range, it means that the candidate carpooling address is outside the current direction divergence control range of the vehicle to be dispatched. In this case, the candidate carpooling address can be filtered out.

[0051] In the specific implementation, before filtering the candidate carpooling addresses by neighborhood range based on the scheduling start address, it is also possible to first check whether the candidate carpooling addresses have been marked. If a carpooling is not allowed mark is set, then the candidate carpooling addresses can be removed directly. After that, the remaining candidate carpooling addresses are filtered by neighborhood range based on the scheduling start address.

[0052] The "no carpooling" flag can be pre-marked by the vehicle dispatching equipment administrator or automatically set by the vehicle dispatching equipment when certain conditions are met.

[0053] In practical applications, in some cases, in order to facilitate the management of orders at different levels, the vehicle dispatching equipment can also set corresponding address levels for each address according to the corresponding order. At this time, it can also detect whether the address level of the candidate carpooling address is higher than the dispatching start address. If so, the candidate carpooling address can be removed. Then, the remaining candidate carpooling addresses can be filtered by neighborhood range according to the dispatching start address.

[0054] In practical use, the marking determination and address level determination can be combined. For example, first check whether each candidate carpooling address has a marking. If a marking that does not allow carpooling is set, then the candidate carpooling addresses can be removed directly. Then, check whether the address level of each candidate carpooling address is higher than the scheduling start address. Remove the candidate carpooling addresses whose address level is higher than the scheduling start address. Then, filter the remaining candidate carpooling addresses by neighborhood range based on the scheduling start address.

[0055] Step S202: Perform common compatibility filtering on the first-level filtering addresses based on the loaded addresses of the vehicles to be dispatched, and determine the second-level filtering addresses.

[0056] It should be noted that in some cases, although the primary filter address does not exceed the neighborhood of the vehicle to be dispatched, the primary filter address may have poor compatibility with the already loaded addresses of the vehicle to be dispatched. In this case, the poorly compatible primary filter address can be filtered out to ensure good compatibility between the addresses of the cargo loading.

[0057] In a specific implementation, in order to reasonably determine compatibility and conduct appropriate screening, step S202 of this embodiment may include: Obtain the list of possible addresses corresponding to each loaded address of the vehicle to be dispatched; The first-level filter address that appears in the list of possible addresses corresponding to at least one loaded address will be used as the second-level filter address.

[0058] It should be noted that the loaded address can be an address where the vehicle to be dispatched has previously loaded cargo. The list of possible carpooling addresses corresponding to the loaded address can be a list of candidate carpooling addresses or aggregated addresses obtained when the loaded address is used as the dispatch starting address.

[0059] In practical use, if the first-level filter address does not appear in the list of possible addresses corresponding to all loaded addresses, it can be determined that the common compatibility between the first-level filter address and the loaded addresses of the vehicle to be dispatched is poor. In this case, the compatibility judgment result is incompatible, and the first-level filter address can be filtered out. If the primary filter address appears in the list of addresses that can be combined with some of the already loaded addresses, it can be determined that the primary filter address has general compatibility with the already loaded addresses of the vehicle to be dispatched. In this case, the compatibility judgment result is partial compatibility, and further judgment is required. Therefore, the primary filter address can be used as the secondary filter address. If the primary filter address appears in the list of possible addresses corresponding to all loaded addresses, it can be determined that the primary filter address has good common compatibility with the loaded addresses of the vehicle to be dispatched. In this case, the compatibility judgment result is fully compatible, and the primary filter address can be directly used as the secondary filter address.

[0060] Step S203: Perform fillability filtering on the secondary filter addresses to determine the addresses to be selected.

[0061] In practical use, after determining the secondary screening addresses, the incorporation of each secondary screening address can be further screened to determine whether the goods corresponding to each secondary screening address can be incorporated into the vehicle to be dispatched, and the secondary screening addresses where the goods can be incorporated into the vehicle to be dispatched are selected as the candidate addresses.

[0062] In a specific implementation, in order to reasonably perform the inclusion-ability screening, step S203 in this embodiment may include: Obtain the order capacity information and vehicle model requirements corresponding to each secondary filter address; Detect whether the order capacity information exceeds the carrying capacity of the vehicle to be dispatched, and determine whether the vehicle type requirement matches the vehicle to be dispatched; The secondary filter address that is not within the carrying capacity of the vehicle to be dispatched and whose corresponding vehicle model requirement matches the vehicle to be dispatched is selected as the address to be selected.

[0063] It should be noted that the order capacity information corresponding to the secondary filter address may include information such as the required area and weight when loading the goods of the order corresponding to the secondary filter address.

[0064] In practical use, the remaining available loading area and remaining loading weight of the vehicle to be dispatched can be obtained. If the required area in the order capacity information corresponding to the secondary filter address is less than or equal to the remaining loading area, and the required weight in the order capacity information is less than or equal to the remaining loading weight, it can be determined that the order capacity information does not exceed the carrying capacity of the vehicle to be dispatched.

[0065] In practical use, some addresses may restrict access to certain vehicle types. For example, some areas have height restrictions, preventing vehicles exceeding a certain height from reaching the address. In such cases, it's possible to obtain the reachable vehicle types corresponding to the secondary filter address, thereby identifying the vehicle type requirements for that secondary filter address. In addition, some users may have specific requirements for the vehicle models used for delivery. These requirements will be recorded in the order information. To ensure that users' vehicle model requirements can be met, vehicle model requirements can be extracted from the orders to be dispatched corresponding to the secondary filter addresses. Then, the reachable vehicle models for the secondary filter addresses can be further restricted based on the vehicle model requirements to obtain the vehicle model requirements.

[0066] It is understandable that if the order capacity information corresponding to the secondary filter address does not exceed the carrying capacity of the vehicle to be dispatched, and the corresponding vehicle type requirement matches the vehicle to be dispatched, then it means that the vehicle to be dispatched can be equipped with the order goods corresponding to the secondary filter address. Therefore, the secondary filter address can be used as the address to be selected.

[0067] In the process of making the judgment, it can also detect that the number of vehicle stations of the vehicle to be dispatched is less than a preset station number threshold. If so, the steps of detecting whether the order capacity information exceeds the carrying capacity of the vehicle to be dispatched and determining whether the vehicle type demand matches the vehicle to be dispatched are executed.

[0068] Correspondingly, when sorting the addresses to be selected, the sorting can be assisted by the judgment results from the multi-level filtering process mentioned above, for example: The following three-level priority relationship is used to sort the addresses to be selected: First priority: The candidate address whose corresponding compatibility judgment result is fully compatible takes precedence over the candidate address whose corresponding compatibility judgment result is partially compatible.

[0069] Second priority: In the case of the same compatibility judgment result, the candidate address with a shorter path distance to the scheduling start address, a closer address level, and a more concentrated direction is given higher priority.

[0070] Third priority: Under the same conditions, the address with higher historical carpooling statistics, higher address priority, and higher route priority will be given priority.

[0071] Among them, the historical carpooling statistics can be the number of times the selected address was previously selected as the destination address within a preset time period (such as within one month).

[0072] In specific implementations, to reduce unnecessary subsequent judgments, after detecting whether the order capacity information exceeds the carrying capacity of the vehicle to be dispatched and determining whether the vehicle type demand matches the vehicle to be dispatched, this embodiment may further include: Secondary filtering addresses that contain order capacity information that exceeds the carrying capacity of the vehicle to be dispatched, or whose vehicle model requirements do not match the vehicle to be dispatched, are designated as addresses to be confirmed. Determine the retention priority corresponding to the address to be confirmed; Whether the address to be confirmed can be retained is determined based on the retention priority. If it cannot be retained, the address to be confirmed will be removed from the unscheduled addresses, or the address to be confirmed will be marked as an address that cannot be concatenated.

[0073] It should be noted that, in order to reduce unnecessary subsequent judgments, the secondary screening addresses that the dispatched vehicles cannot currently load can be further judged to determine whether these secondary screening addresses are suitable for retention. Therefore, the retention priority corresponding to the address to be confirmed can be calculated. Then, the address to be confirmed with a retention priority greater than or equal to the preset retention threshold is determined to be retainable, and vice versa.

[0074] In practical use, if the address to be confirmed is determined to be non-retainable, it means that in the current dispatch process, the actual carpooling effect of the address to be confirmed is poor compared to the vehicle to be dispatched. The address to be confirmed can be removed from the undispatch addresses or marked as a non-carpooling address.

[0075] In order to avoid affecting the scheduling of other vehicles waiting to be dispatched, the address to be confirmed can be removed from the unscheduled addresses corresponding to the vehicles waiting to be dispatched. If the address to be confirmed is marked as a non-carpooling address, that is, a non-carpooling mark is set for the address to be confirmed, then the mark will only be effective for the current vehicles waiting to be dispatched.

[0076] In practice, the retention priority can be calculated based on at least one of the following factors corresponding to the address to be confirmed: Historical carpooling statistics; Address priority; Route priority; Path distance; Straight-line distance.

[0077] Among them, the historical carpooling statistics can be the number of times the address to be selected was previously selected as the target destination address within a preset time period (such as within one month); the address priority and route priority can be preset by the vehicle dispatching equipment based on the order data corresponding to the address to be confirmed; the path distance can be the path distance between the address to be confirmed and the dispatching start address; the straight-line distance proximity can be the straight-line distance between the address to be confirmed and the dispatching start address.

[0078] In practical use, preset intervals can be set for each of the above factors, with different scores assigned to different preset intervals. Then, the evaluation score for each factor is calculated based on the preset interval in which the address to be confirmed falls. Finally, the evaluation scores for each factor are weighted and summed, and the resulting sum is used as the priority for retention. The weights used in the weighted summation can be preset by the vehicle dispatching equipment administrator.

[0079] For example, for historical carpooling statistics, the preset intervals can be [0,10], [10,100], and [100,1000], with scores of 2, 5, and 10 for each preset interval, respectively.

[0080] In practical applications, other previously filtered addresses can also be used as addresses to be confirmed, and it can be determined whether they can be retained. For example, in addition to using secondary filtering addresses whose corresponding order capacity information exceeds the carrying capacity of the vehicle to be dispatched, or whose corresponding vehicle model requirements do not match the vehicle to be dispatched, addresses that were previously filtered out during neighborhood range filtering and / or common compatibility filtering can also be used as addresses to be confirmed.

[0081] Understandably, this judgment ensures that all candidate grouping addresses selected from the subsequent unscheduled addresses actually meet the following conditions: The address is still within a reasonable neighborhood. The address and the starting address must at least have a basic map-matchable relationship; The priority of reserving this address is no less than a preset threshold.

[0082] This avoids including addresses that appear similar but have poor map representation in the current carpooling batch.

[0083] This embodiment provides a vehicle dispatching method. This embodiment performs continuous multi-level screening through multiple aspects such as neighborhood range, common compatibility, and the ability to share rides, ensuring that any of the selected addresses in the final screening will not cause the vehicle to deviate too much from its direction. At the same time, the address corresponds to a ride-sharing order to be dispatched, further ensuring the effectiveness and rationality of vehicle dispatching.

[0084] It should be noted that the above examples are only for understanding this application and do not constitute a limitation on the vehicle scheduling method of this application. Any simple modifications based on this technical concept are within the protection scope of this application.

[0085] This application also provides a vehicle dispatching device, please refer to... Figure 3 The vehicle dispatching device includes: The selection module 10 is used to select candidate carpooling addresses from unscheduled addresses based on the scheduling start address, wherein the scheduling start address is the address where the vehicle to be scheduled is currently located. The filtering module 20 is used to perform multi-level filtering on the candidate carpooling addresses to determine the addresses to be selected; The sorting module 30 is used to sort the addresses to be selected by priority, and select the target arrival address of the currently scheduled vehicle from the addresses to be selected based on the sorting result.

[0086] The vehicle dispatching device provided in this application, employing the vehicle dispatching method in the above embodiments, can solve the technical problem that related technologies, when dispatching vehicles, do not consider the actual situation of each address but randomly select orders for grouping, resulting in poor actual dispatching performance. Compared with the prior art, the beneficial effects of the vehicle dispatching device provided in this application are the same as those of the vehicle dispatching method provided in the above embodiments, and other technical features in the vehicle dispatching device are the same as those disclosed in the methods of the above embodiments, and will not be repeated here.

[0087] This application provides a vehicle dispatching device, which includes: at least one processor; and a memory communicatively connected to the at least one processor; wherein the memory stores instructions executable by the at least one processor, which are executed by the at least one processor to enable the at least one processor to perform the vehicle dispatching method in Embodiment 1 above.

[0088] The following is for reference. Figure 4The diagram illustrates a structural schematic suitable for implementing vehicle dispatching equipment according to embodiments of this application. Vehicle dispatching equipment in embodiments of this application may include, but is not limited to, mobile terminals such as mobile phones, laptops, digital broadcast receivers, PDAs (Personal Digital Assistants), PADs (Portable Application Description), PMPs (Portable Media Players), in-vehicle terminals (e.g., in-vehicle navigation terminals), and fixed terminals such as digital TVs and desktop computers. Figure 4 The vehicle dispatching equipment shown is merely an example and should not impose any limitations on the functionality and scope of use of the embodiments of this application.

[0089] like Figure 4 As shown, the vehicle dispatching equipment may include a processing unit 1001 (e.g., a central processing unit, a graphics processing unit, etc.), which can perform various appropriate actions and processes according to a program stored in a read-only memory 1002 or a program loaded from a storage device 1003 into a random access memory 1004. The random access memory 1004 also stores various programs and data required for the operation of the vehicle dispatching equipment. The processing unit 1001, the read-only memory 1002, and the random access memory 1004 are interconnected via a bus 1005. An input / output interface 1006 is also connected to the bus. Typically, the following systems can be connected to the input / output interface 1006: input devices 1007 including, for example, a touchscreen, touchpad, keyboard, mouse, image sensor, microphone, accelerometer, gyroscope, etc.; output devices 1008 including, for example, a liquid crystal display (LCD), speaker, vibrator, etc.; storage devices 1003 including, for example, magnetic tape, hard disk, etc.; and communication devices 1009. Communication device 1009 allows the vehicle dispatching equipment to communicate wirelessly or wiredly with other devices to exchange data. Although the figures show vehicle dispatching equipment with various systems, it should be understood that implementation or possession of all the systems shown is not required. More or fewer systems may be implemented alternatively.

[0090] Specifically, according to the embodiments disclosed in this application, the processes described above with reference to the flowcharts can be implemented as computer software programs. For example, embodiments disclosed in this application include a computer program product comprising a computer program carried on a computer-readable medium, the computer program containing program code for performing the methods shown in the flowcharts. In such embodiments, the computer program can be downloaded and installed from a network via a communication device, or installed from storage device 1003, or installed from read-only memory 1002. When the computer program is executed by processing device 1001, it performs the functions defined in the methods of the embodiments disclosed in this application.

[0091] The vehicle dispatching equipment provided in this application, employing the vehicle dispatching method described in the above embodiments, can solve the technical problem that related technologies, when dispatching vehicles, do not consider the actual situation of each address but randomly select orders for grouping, resulting in poor actual dispatching performance. Compared with the prior art, the beneficial effects of the vehicle dispatching equipment provided in this application are the same as those of the vehicle dispatching method provided in the above embodiments, and other technical features in this vehicle dispatching equipment are the same as those disclosed in the previous embodiment method, and will not be repeated here.

[0092] It should be understood that the various parts disclosed in this application can be implemented using hardware, software, firmware, or a combination thereof. In the description of the above embodiments, specific features, structures, materials, or characteristics can be combined in any suitable manner in one or more embodiments or examples.

[0093] The above description is merely a specific embodiment of this application, but the scope of protection of this application is not limited thereto. Any variations or substitutions that can be easily conceived by those skilled in the art within the scope of the technology disclosed in this application should be included within the scope of protection of this application. Therefore, the scope of protection of this application should be determined by the scope of the claims.

[0094] This application provides a computer-readable storage medium having computer-readable program instructions (i.e., a computer program) stored thereon, the computer-readable program instructions being used to execute the vehicle scheduling method in the above embodiments.

[0095] The computer-readable storage medium provided in this application may be, for example, a USB flash drive, but is not limited to, electrical, magnetic, optical, electromagnetic, infrared, or semiconductor systems or devices, or any combination thereof. More specific examples of computer-readable storage media may include, but are not limited to: electrical connections having one or more wires, portable computer disks, hard disks, random access memory (RAM), read-only memory (ROM), erasable programmable read-only memory (EPROM or flash memory), optical fiber, portable compact disk read-only memory (CD-ROM), optical storage devices, magnetic storage devices, or any suitable combination thereof. In this embodiment, the computer-readable storage medium may be any tangible medium containing or storing a program that can be used by or in conjunction with an instruction execution system or device. The program code contained on the computer-readable storage medium may be transmitted using any suitable medium, including but not limited to: wires, optical cables, RF (Radio Frequency), etc., or any suitable combination thereof.

[0096] The aforementioned computer-readable storage medium may be included in the vehicle dispatching equipment; or it may exist independently and not be installed in the vehicle dispatching equipment.

[0097] The aforementioned computer-readable storage medium carries one or more programs that, when executed by a vehicle dispatching device, cause the vehicle dispatching device to: select candidate carpooling addresses from undispatched addresses based on a dispatching start address, wherein the dispatching start address is the current address of the vehicle to be dispatched; perform multi-level filtering on the candidate carpooling addresses to determine the addresses to be selected; prioritize each address to be selected and select the target arrival address of the currently dispatched vehicle from the addresses to be selected based on the prioritization result.

[0098] Computer program code for performing the operations of this application can be written in one or more programming languages ​​or a combination thereof. These programming languages ​​include object-oriented programming languages—such as Python, Java, Smalltalk, and C++—and conventional procedural programming languages—such as the "C" language or similar programming languages. The program code can be executed entirely on the user's computer, partially on the user's computer, as a standalone software package, partially on the user's computer and partially on a remote computer, or entirely on a remote computer or server. In cases involving remote computers, the remote computer can be connected to the user's computer via any type of network—including a Local Area Network (LAN) or a Wide Area Network (WAN)—or can be connected to an external computer (e.g., via the Internet using an Internet service provider).

[0099] The flowcharts and block diagrams in the accompanying drawings illustrate the architecture, functionality, and operation of possible implementations of systems, methods, and computer program products according to various embodiments of this application. In this regard, each block in a flowchart or block diagram may represent a module, segment, or portion of code containing one or more executable instructions for implementing a specified logical function. It should also be noted that in some alternative implementations, the functions indicated in the blocks may occur in a different order than those indicated in the drawings. For example, two consecutively indicated blocks may actually be executed substantially in parallel, and they may sometimes be executed in reverse order, depending on the functions involved. It should also be noted that each block in the block diagrams and / or flowcharts, and combinations of blocks in the block diagrams and / or flowcharts, can be implemented using a dedicated hardware-based system that performs the specified function or operation, or using a combination of dedicated hardware and computer instructions.

[0100] The modules described in the embodiments of this application can be implemented in software or hardware. The names of the modules do not necessarily limit the functionality of the unit itself.

[0101] The readable storage medium provided in this application is a computer-readable storage medium that stores computer-readable program instructions (i.e., a computer program) for executing the above-described vehicle scheduling method. This addresses the technical problem that related technologies, when scheduling vehicles, do not consider the actual situation of each address but instead randomly select vehicles for grouping, resulting in poor actual scheduling performance. Compared with the prior art, the beneficial effects of the computer-readable storage medium provided in this application are the same as those of the vehicle scheduling method provided in the above embodiments, and will not be elaborated upon here.

[0102] This application also provides a computer program product, including a computer program that, when executed by a processor, implements the steps of the vehicle scheduling method described above.

[0103] The computer program product provided in this application can solve the technical problem that when related technologies perform vehicle dispatching, they do not consider the actual situation of each address, but randomly select orders for grouping, resulting in poor actual dispatching effect. Compared with the prior art, the beneficial effects of the computer program product provided in this application are the same as the beneficial effects of the vehicle dispatching method provided in the above embodiments, and will not be repeated here.

[0104] All user-related data involved in this application (such as user privacy data, user behavior data, etc.) were obtained with the user's permission or consent; that is to say, when this application is used in a specific product or technology, user permission is required to obtain and process the relevant data, and the processing of the relevant data must comply with the relevant laws, regulations and regulatory standards of the relevant countries and regions.

[0105] The above description is only a part of the embodiments of this application and does not limit the scope of protection of this application. All equivalent structural transformations made under the technical concept of this application and using the content of this application specification and drawings, or direct / indirect applications in other related technical fields, are included in the scope of protection of this application.

Claims

1. A vehicle dispatching method, characterized in that, The vehicle dispatching method includes: Candidate carpooling addresses are selected from unscheduled addresses based on the scheduling start address, where the scheduling start address is the current address of the vehicle to be scheduled; The candidate carpooling addresses are filtered through multiple levels to determine the addresses to be selected; The addresses to be selected are prioritized, and the target arrival address of the currently scheduled vehicle is selected from the addresses to be selected based on the prioritization results.

2. The vehicle dispatching method as described in claim 1, characterized in that, The process of performing multi-level filtering on the candidate carpooling addresses to determine the addresses to be selected includes: Based on the scheduling start address, the candidate carpooling addresses are filtered by neighborhood range to determine the first-level filtered addresses; Based on the loaded addresses of the vehicles to be dispatched, the primary filtering addresses are subjected to common compatibility filtering to determine the secondary filtering addresses; The addresses in the secondary filtering are subjected to incorporation filtering to determine the addresses to be selected.

3. The vehicle dispatching method as described in claim 2, characterized in that, The step of filtering the candidate carpooling addresses based on the scheduling start address to determine the primary filtering addresses includes: Obtain the straight-line interval distance corresponding to the scheduling start address, where the straight-line interval distance is the straight-line distance between the scheduling start address and the order processing unit; The dynamic neighborhood range is determined based on the straight-line interval distance and the map angle threshold. Candidate carpooling addresses within the dynamic neighborhood range are used as primary filtering addresses.

4. The vehicle dispatching method as described in claim 2, characterized in that, The step of performing common compatibility filtering on the first-level filtered addresses based on the loaded addresses of the vehicles to be dispatched, and determining the second-level filtered addresses, includes: Obtain the list of possible addresses corresponding to each loaded address of the vehicle to be dispatched; The first-level filter address that appears in the list of possible addresses corresponding to at least one loaded address will be used as the second-level filter address.

5. The vehicle dispatching method as described in claim 2, characterized in that, The step of performing concatenation-based filtering on the secondary filtering addresses to determine the addresses to be selected includes: Obtain the order capacity information and vehicle model requirements corresponding to each secondary filter address; Detect whether the order capacity information exceeds the carrying capacity of the vehicle to be dispatched, and determine whether the vehicle type requirement matches the vehicle to be dispatched; The secondary filter address that is not within the carrying capacity of the vehicle to be dispatched and whose corresponding vehicle model requirement matches the vehicle to be dispatched is selected as the address to be selected.

6. The vehicle dispatching method as described in claim 5, characterized in that, After detecting whether the order capacity information exceeds the carrying capacity of the vehicle to be dispatched, and determining whether the vehicle type demand matches the vehicle to be dispatched, the method further includes: Secondary filtering addresses that contain order capacity information that exceeds the carrying capacity of the vehicle to be dispatched, or whose vehicle model requirements do not match the vehicle to be dispatched, are designated as addresses to be confirmed. Determine the retention priority corresponding to the address to be confirmed; Whether the address to be confirmed can be retained is determined based on the retention priority. If it cannot be retained, the address to be confirmed will be removed from the unscheduled addresses, or the address to be confirmed will be marked as an address that cannot be concatenated.

7. A vehicle dispatching device, characterized in that, The vehicle dispatching device includes: The selection module is used to select candidate carpooling addresses from unscheduled addresses based on the scheduling start address, wherein the scheduling start address is the current address of the vehicle to be scheduled; The filtering module is used to perform multi-level filtering on the candidate carpooling addresses to determine the addresses to be selected; The sorting module is used to prioritize each candidate address and select the target arrival address of the currently scheduled vehicle from the candidate addresses based on the sorting results.

8. A vehicle dispatching device, characterized in that, The device includes: a memory, a processor, and a computer program stored in the memory and executable on the processor, the computer program being configured to implement the steps of the vehicle scheduling method as described in any one of claims 1 to 6.

9. A storage medium, characterized in that, The storage medium is a computer-readable storage medium, and a computer program is stored on the storage medium. When the computer program is executed by a processor, it implements the steps of the vehicle scheduling method as described in any one of claims 1 to 6.

10. A computer program product, characterized in that, The computer program product includes a computer program that, when executed by a processor, implements the steps of the vehicle scheduling method as described in any one of claims 1 to 6.

Images