CN117670457A - Method and device for determining assignment scheme and server cluster - Google Patents

Method and device for determining assignment scheme and server cluster Download PDF

Info

Publication number
CN117670457A
CN117670457A CN202210975584.9A CN202210975584A CN117670457A CN 117670457 A CN117670457 A CN 117670457A CN 202210975584 A CN202210975584 A CN 202210975584A CN 117670457 A CN117670457 A CN 117670457A
Authority
CN
China
Prior art keywords
dispatching
selectable
order
scheme
target
Prior art date
Legal status (The legal status is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the status listed.)
Pending
Application number
CN202210975584.9A
Other languages
Chinese (zh)
Inventor
王怀宇
Current Assignee (The listed assignees may be inaccurate. Google has not performed a legal analysis and makes no representation or warranty as to the accuracy of the list.)
Beijing Didi Infinity Technology and Development Co Ltd
Original Assignee
Beijing Didi Infinity Technology and Development Co Ltd
Priority date (The priority date is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the date listed.)
Filing date
Publication date
Application filed by Beijing Didi Infinity Technology and Development Co Ltd filed Critical Beijing Didi Infinity Technology and Development Co Ltd
Priority to CN202210975584.9A priority Critical patent/CN117670457A/en
Publication of CN117670457A publication Critical patent/CN117670457A/en
Pending legal-status Critical Current

Links

Classifications

    • G—PHYSICS
    • G06—COMPUTING; CALCULATING OR COUNTING
    • G06Q—INFORMATION AND COMMUNICATION TECHNOLOGY [ICT] SPECIALLY ADAPTED FOR ADMINISTRATIVE, COMMERCIAL, FINANCIAL, MANAGERIAL OR SUPERVISORY PURPOSES; SYSTEMS OR METHODS SPECIALLY ADAPTED FOR ADMINISTRATIVE, COMMERCIAL, FINANCIAL, MANAGERIAL OR SUPERVISORY PURPOSES, NOT OTHERWISE PROVIDED FOR
    • G06Q30/00—Commerce
    • G06Q30/06—Buying, selling or leasing transactions
    • G06Q30/0601—Electronic shopping [e-shopping]
    • G06Q30/0633—Lists, e.g. purchase orders, compilation or processing
    • G06Q30/0635—Processing of requisition or of purchase orders
    • G—PHYSICS
    • G06—COMPUTING; CALCULATING OR COUNTING
    • G06Q—INFORMATION AND COMMUNICATION TECHNOLOGY [ICT] SPECIALLY ADAPTED FOR ADMINISTRATIVE, COMMERCIAL, FINANCIAL, MANAGERIAL OR SUPERVISORY PURPOSES; SYSTEMS OR METHODS SPECIALLY ADAPTED FOR ADMINISTRATIVE, COMMERCIAL, FINANCIAL, MANAGERIAL OR SUPERVISORY PURPOSES, NOT OTHERWISE PROVIDED FOR
    • G06Q10/00—Administration; Management
    • G06Q10/06—Resources, workflows, human or project management; Enterprise or organisation planning; Enterprise or organisation modelling
    • G06Q10/063—Operations research, analysis or management
    • G06Q10/0631—Resource planning, allocation, distributing or scheduling for enterprises or organisations

Landscapes

  • Business, Economics & Management (AREA)
  • Human Resources & Organizations (AREA)
  • Engineering & Computer Science (AREA)
  • Strategic Management (AREA)
  • Economics (AREA)
  • Entrepreneurship & Innovation (AREA)
  • General Business, Economics & Management (AREA)
  • Finance (AREA)
  • Development Economics (AREA)
  • Marketing (AREA)
  • Accounting & Taxation (AREA)
  • Theoretical Computer Science (AREA)
  • General Physics & Mathematics (AREA)
  • Physics & Mathematics (AREA)
  • Educational Administration (AREA)
  • Tourism & Hospitality (AREA)
  • Quality & Reliability (AREA)
  • Operations Research (AREA)
  • Game Theory and Decision Science (AREA)
  • Management, Administration, Business Operations System, And Electronic Commerce (AREA)

Abstract

The invention provides a method, a device and a server cluster for determining a dispatching scheme, which are characterized in that a dispatching scheme is combined by distributing calculation of driver matching tasks and priority scores to working nodes and then utilizing calculation results of the working nodes, and finally, a target dispatching scheme combination with the highest priority score sum is determined, and the calculation pressure of a server is distributed to the working nodes in a distributed calculation mode, so that the problem that the calculation speed is reduced due to overlarge calculation amount and insufficient calculation resources of the server is solved.

Description

Method and device for determining assignment scheme and server cluster
Technical Field
The disclosure relates to the technical field of computers, in particular to a method and a device for determining a dispatch scheme and a server cluster.
Background
With the rapid development of intelligent travel technology, services such as driving by a driver, network about vehicles and the like become a common travel mode, a user can initiate orders to service platforms such as driving by a driver, network about vehicles and the like, the service platforms can distribute the orders to nearby drivers, and the drivers can go to the area where the user is located after receiving the orders, so that services are provided for the user. When the service platform distributes orders, the orders are not usually dispatched immediately, but are stored in an order pool, an order distribution algorithm is called for matching a plurality of orders and a plurality of drivers at fixed frequency, and the orders are dispatched again until the most suitable driver is found in a given time.
However, with the increase of the number of orders and the number of drivers, the calculation amount of the server for distributing orders will increase in a cartesian product manner, and the calculation amount will increase greatly when one order or driver is added, and since the calculation of order distribution needs to be completed on one server, the calculation resources of a single server are limited, the calculation speed will be slow due to insufficient calculation resources, and even the result of order distribution failure will be caused.
Disclosure of Invention
The embodiment of the disclosure at least provides a method and a device for determining a dispatch scheme and a server cluster.
In a first aspect, an embodiment of the present disclosure provides a method for determining a dispatch scheme, including:
acquiring order information of a plurality of to-be-processed orders and dispatching influence parameters of a plurality of candidate drivers corresponding to each to-be-processed order, and generating driver matching tasks carrying the order information and dispatching influence parameters for each to-be-processed order;
assigning a plurality of driver matching tasks to a plurality of work nodes, wherein each work node is assigned with at least one driver matching task, the driver matching tasks are used for indicating to generate each selectable dispatch list scheme and determining priority scores corresponding to the selectable dispatch list schemes; indicating pre-assigned candidate drivers in the selectable recipe;
After obtaining each selectable dispatching list scheme fed back by the plurality of working nodes, determining a target dispatching list scheme combination based on the priority scores respectively corresponding to each selectable dispatching list scheme, wherein the target dispatching list scheme combination comprises target dispatching list schemes respectively determined for each driver matching task; the target dispatch protocol combination has a highest sum of priority scores compared to other dispatch protocol combinations, and the candidate drivers assigned between each target dispatch protocol are different.
In an alternative embodiment, the determining the target assignment scheme combination based on the priority scores corresponding to the selectable assignment schemes respectively includes:
combining the selectable dispatch list schemes corresponding to the matching tasks of each driver to obtain a plurality of dispatch list scheme combinations; each dispatching scheme combination comprises an optional dispatching scheme corresponding to each driver matching task, and candidate drivers distributed among the optional dispatching schemes in different dispatching scheme combinations are different;
and determining the target assignment scheme combination based on the sum of priority scores corresponding to the assignment scheme combinations.
In an alternative embodiment, the acquiring order information of at least one pending order includes:
Taking the first time interval as a period, acquiring order information of at least one to-be-processed order generated in the target area;
the method further comprises the steps of:
responding to a dispatching scheme acquisition request sent by a dispatching server every time a second time interval passes, and sending a target dispatching scheme combination determined in the latest period to the dispatching server so that the dispatching server distributes the plurality of orders to be processed based on the target dispatching scheme combination; wherein the second time interval is greater than the first time interval.
In an alternative embodiment, the candidate drivers corresponding to the pending order are determined by:
determining the dispatch area information of the to-be-processed order based on the initial position corresponding to the to-be-processed order and a preset target distance;
and determining the candidate drivers based on the dispatch area information and the position information of each to-be-picked-up driver.
In a second aspect, embodiments of the present disclosure further provide another method for determining a dispatch scheme, including:
responding to a dispatching node to distribute at least one driver matching task, and determining order information of a to-be-processed order carried by the driver matching task and dispatch influencing parameters of a plurality of candidate drivers corresponding to the to-be-processed order;
Generating each selectable dispatching list scheme corresponding to the driver matching task, and determining the priority grade corresponding to each selectable dispatching list scheme based on order information corresponding to the selectable dispatching list scheme and dispatching list influence parameters; indicating candidate drivers pre-assigned to the pending orders in the selectable order;
feeding back the selectable assignment schemes to a scheduling node, so that the scheduling node determines a target assignment scheme combination based on the priority scores respectively corresponding to the selectable assignment schemes, wherein the target assignment scheme combination comprises target assignment schemes respectively determined for each driver matching task; the target dispatch protocol combination has a highest sum of priority scores compared to other dispatch protocol combinations, and the candidate drivers assigned between each target dispatch protocol are different.
In an alternative embodiment, the generating each selectable order scheme corresponding to the driver matching task, and determining the priority score corresponding to each selectable order scheme based on the order information corresponding to the selectable order scheme and the order influencing parameter, includes:
aiming at any driver matching task, screening target candidate drivers from the plurality of candidate drivers based on order information and dispatch influencing parameters corresponding to the driver matching task;
Generating selectable dispatch list schemes for distributing the pending orders to each target candidate driver respectively;
determining order information characteristics corresponding to any selectable dispatching scheme and dispatching influence parameter characteristics of target candidate drivers corresponding to the selectable dispatching scheme;
and determining the priority grade of the selectable order dispatching scheme based on the order information characteristics and the order dispatching influence parameter characteristics.
In an alternative embodiment, the generating each selectable order scheme corresponding to the driver matching task, and determining the priority score corresponding to each selectable order scheme based on the order information corresponding to the selectable order scheme and the order influencing parameter, includes:
creating a plurality of sub-work nodes under the condition that a plurality of driver matching tasks exist;
and respectively distributing different sub-working nodes for each driver matching task so that each sub-working node generates each selectable dispatching list scheme corresponding to the driver matching task, and determining the priority grade corresponding to each selectable dispatching list scheme based on order information and dispatching list influence parameters corresponding to the selectable dispatching list scheme.
In a third aspect, embodiments of the present disclosure further provide a server cluster, including a master server node and a plurality of slave server nodes; wherein,
the master server node is used for configuring the slave server node into a calling node and a plurality of working nodes corresponding to each target area;
the calling node is configured to perform a dispatch protocol determination method as described in the first aspect or any possible implementation manner of the first aspect, and the working node is configured to perform a dispatch protocol determination method as described in the second aspect or any possible implementation manner of the second aspect.
In an alternative implementation manner, the main server node is further configured to configure a new call node for any target area when the call node of the target area is in error.
In a fourth aspect, an embodiment of the present disclosure further provides a dispatch scheme determining device, including:
the system comprises an acquisition module, a storage module and a storage module, wherein the acquisition module is used for acquiring order information of a plurality of to-be-processed orders and dispatching influence parameters of a plurality of candidate drivers corresponding to each to-be-processed order, and generating driver matching tasks carrying the order information and dispatching influence parameters for each to-be-processed order;
The allocation module is used for allocating a plurality of driver matching tasks to a plurality of working nodes, wherein each working node is allocated with at least one driver matching task, and the driver matching tasks are used for indicating to generate each selectable order scheme and determining priority scores corresponding to the selectable order schemes; indicating pre-assigned candidate drivers in the selectable recipe;
the determining module is used for determining a target dispatching scheme combination based on the priority scores corresponding to the selectable dispatching schemes respectively after acquiring the selectable dispatching schemes fed back by the plurality of working nodes, wherein the target dispatching scheme combination comprises target dispatching schemes determined for the matching tasks of each driver respectively; the target dispatch protocol combination has a highest sum of priority scores compared to other dispatch protocol combinations, and the candidate drivers assigned between each target dispatch protocol are different.
In a fifth aspect, embodiments of the present disclosure further provide another assignment scheme determining apparatus, including:
the response module is used for responding to the dispatching node to distribute at least one driver matching task and determining order information of an order to be processed carried by the driver matching task and dispatch influencing parameters of a plurality of candidate drivers corresponding to the order to be processed;
The generation module is used for generating each selectable dispatching list scheme corresponding to the driver matching task and determining the priority grade corresponding to each selectable dispatching list scheme based on order information corresponding to the selectable dispatching list scheme and dispatching list influence parameters; indicating candidate drivers pre-assigned to the pending orders in the selectable order;
the feedback module is used for feeding back the selectable dispatching schemes to a dispatching node so that the dispatching node can determine target dispatching scheme combinations based on the priority scores corresponding to the selectable dispatching schemes respectively, and the target dispatching scheme combinations comprise target dispatching schemes determined for the matching tasks of drivers respectively; the target dispatch protocol combination has a highest sum of priority scores compared to other dispatch protocol combinations, and the candidate drivers assigned between each target dispatch protocol are different.
In a sixth aspect, the disclosed embodiments further provide an electronic device, a processor, and a memory, where the memory stores machine-readable instructions executable by the processor, and the processor is configured to execute the machine-readable instructions stored in the memory, where the machine-readable instructions, when executed by the processor, perform the steps in the first aspect, or any of the possible implementation manners of the first aspect, or perform the steps in the second aspect, or any of the possible implementation manners of the second aspect.
In a seventh aspect, the disclosed embodiments further provide a computer readable storage medium having stored thereon a computer program which, when executed, performs the steps of the first aspect, or any of the possible implementations of the first aspect, or performs the steps of the second aspect, or any of the possible implementations of the second aspect.
The method, the device and the server cluster for determining the dispatch protocol provided by the embodiment of the disclosure acquire order information of a plurality of to-be-processed orders and dispatch influence parameters of a plurality of candidate drivers corresponding to each to-be-processed order, and generate driver matching tasks carrying the order information and the dispatch influence parameters for each to-be-processed order; assigning a plurality of driver matching tasks to a plurality of work nodes, wherein each work node is assigned with at least one driver matching task, the driver matching tasks are used for indicating to generate each selectable dispatch list scheme and determining priority scores corresponding to the selectable dispatch list schemes; indicating pre-assigned candidate drivers in the selectable recipe; after obtaining each selectable dispatching list scheme fed back by the plurality of working nodes, determining a target dispatching list scheme combination based on the priority scores respectively corresponding to each selectable dispatching list scheme, wherein the target dispatching list scheme combination comprises target dispatching list schemes respectively determined for each driver matching task; the target dispatch protocol combination has a highest sum of priority scores compared to other dispatch protocol combinations, and the candidate drivers assigned between each target dispatch protocol are different. According to the method and the system for calculating the priority scores, the calculation of the driver matching tasks and the priority scores is distributed to the working nodes, the calculation results of the working nodes are utilized to carry out the combination of the dispatch schemes, the target dispatch scheme combination with the highest priority score sum is finally determined, the calculation pressure of the server is distributed to the working nodes in a distributed calculation mode, and the problem that the calculation speed is reduced due to the fact that the calculation amount is too large and the calculation resources are insufficient is prevented.
The foregoing objects, features and advantages of the disclosure will be more readily apparent from the following detailed description of the preferred embodiments taken in conjunction with the accompanying drawings.
Drawings
In order to more clearly illustrate the technical solutions of the embodiments of the present disclosure, the drawings required for the embodiments are briefly described below, which are incorporated in and constitute a part of the specification, these drawings showing embodiments consistent with the present disclosure and together with the description serve to illustrate the technical solutions of the present disclosure. It is to be understood that the following drawings illustrate only certain embodiments of the present disclosure and are therefore not to be considered limiting of its scope, for the person of ordinary skill in the art may admit to other equally relevant drawings without inventive effort.
FIG. 1 illustrates one of the schematics of a server cluster provided by embodiments of the present disclosure;
FIG. 2 illustrates a second schematic diagram of a server cluster provided by an embodiment of the present disclosure;
FIG. 3 illustrates a flow chart of a method of determining a dispatch protocol provided by embodiments of the present disclosure;
FIG. 4 illustrates a flow chart of another method of determining a dispatch protocol provided by embodiments of the present disclosure;
Fig. 5 shows a schematic diagram of a dispatch scheme determination device provided by an embodiment of the disclosure;
FIG. 6 is a schematic diagram of another dispatch protocol determination device provided by embodiments of the present disclosure;
fig. 7 shows a schematic diagram of an electronic device provided by an embodiment of the disclosure.
Detailed Description
For the purposes of making the objects, technical solutions and advantages of the embodiments of the present disclosure more apparent, the technical solutions in the embodiments of the present disclosure will be clearly and completely described below with reference to the drawings in the embodiments of the present disclosure, and it is apparent that the described embodiments are only some embodiments of the present disclosure, but not all embodiments. The components of the embodiments of the present disclosure, which are generally described and illustrated in the figures herein, may be arranged and designed in a wide variety of different configurations. Thus, the following detailed description of the embodiments of the present disclosure provided in the accompanying drawings is not intended to limit the scope of the disclosure, as claimed, but is merely representative of selected embodiments of the disclosure. All other embodiments, which can be made by those skilled in the art based on the embodiments of this disclosure without making any inventive effort, are intended to be within the scope of this disclosure.
In order to solve the technical problem that in the prior art, the calculation efficiency is reduced due to insufficient calculation resources and increased calculation amount in order allocation, the invention provides a dispatching scheme determining method, a dispatching scheme determining device and a server cluster.
The present invention is directed to a method for manufacturing a semiconductor device, and a semiconductor device manufactured by the method.
It should be noted that: like reference numerals and letters denote like items in the following figures, and thus once an item is defined in one figure, no further definition or explanation thereof is necessary in the following figures.
For the sake of understanding the present embodiment, a server cluster disclosed in the embodiments of the present disclosure will be first described in detail.
Referring to fig. 1, one schematic diagram of a server cluster provided by an embodiment of the present disclosure is shown, where the server cluster includes a master server node and a plurality of slave server nodes, where the master server node may be configured to configure the slave server nodes as a call node and a plurality of working nodes corresponding to each target area, the call node may allocate a driver matching task to the working node when obtaining an order to be processed by executing the dispatch protocol determining method provided by the embodiment of the present disclosure, and perform order allocation work according to data fed back by the working node, so as to obtain a dispatch protocol for use by a dispatch server, and the working node may execute the driver matching task allocated by the call node and feed back a settlement result to the call node by executing another dispatch protocol determining method provided by the embodiment of the present disclosure. When the calling node of any target area reports errors, the main server node can configure a new calling node for the target area so as to continuously execute the task determined by the dispatch scheme.
The master server node and the slave server node are generally computer devices with a certain computing capability. The master server node may be a separate node independent of the slave server node, or may be the slave server node itself, that is, the slave server node may configure itself as the master server node.
For example, when the main server node performs call node configuration, one call node may be configured for each target area, and a plurality of working nodes may be configured for each target area, and the target areas may be divided according to cities or designated areas.
Referring to fig. 2, a second schematic diagram of a server cluster according to an embodiment of the disclosure is shown, where the working node may set an idle slave server node in the server cluster as a corresponding sub-working node thereof, so as to execute driver matching tasks of different pending orders.
The method for determining the dispatch scheme provided in the embodiments of the present disclosure will be described below with an execution body as a calling node and a working node, respectively.
Referring to fig. 3, a flowchart of a method for determining a dispatch scheme according to an embodiment of the present disclosure is shown, where an execution body is a calling node, and the method includes steps S301 to S303, where:
S301, acquiring order information of a plurality of to-be-processed orders and dispatching influence parameters of a plurality of candidate drivers corresponding to each to-be-processed order, and generating driver matching tasks carrying the order information and the dispatching influence parameters for each to-be-processed order.
The to-be-processed order may be an order in a scene of driving, network about, sharing an automobile and the like, an order initiated by a user may be stored in an order pool, different target areas may be respectively deployed with the order pool, and the calling node may acquire order information of the to-be-processed order in the order pool and order allocation influence parameters of a plurality of candidate drivers corresponding to the to-be-processed order with a first time interval as a period.
Wherein the order information may include information of a current location of the user, a starting location of the order, a target location of the order, a preference tag of the driver, an attribute tag of the user, etc., the dispatch influence parameter of the candidate driver may include information of a current location of the driver, a current status of the driver, a current destination location of the driver, an attribute tag of the driver, etc., the attribute tag of the user may include information of the user's sex, age, appearance characteristics, etc., and the attribute tag of the driver may include information of quality of service level, driver's sex, age, appearance characteristics, security level, etc.
It should be noted that, the acquisition of the order information and the parameters of the dispatch effect obtains the consent of the user in advance.
The candidate drivers of the to-be-processed order may refer to drivers capable of receiving the to-be-processed order, and for example, the candidate drivers may be determined based on the starting position corresponding to the to-be-processed order and a preset target distance, and then based on the to-be-processed order dispatch area information and the position information of each to-be-picked-up driver.
The method includes the steps of determining the order receiving area information, determining the position information of each order receiving driver, determining the order receiving area information, and determining the order receiving driver as candidate drivers if the position information of each order receiving driver and the order receiving area information indicate that the order receiving driver is located in the order receiving area.
Then, a driver matching task of each pending order may be generated, where the driver matching task may carry order information of the corresponding pending order and a dispatch influencing parameter of the corresponding candidate driver, where the driver matching task is used to instruct generation of each selectable dispatch plan, where the selectable dispatch plan refers to a possible dispatch plan of the pending order, and indicates candidate drivers that may be allocated to the pending order, that is, indicates candidate drivers that have been pre-allocated. Since one pending order may correspond to multiple candidate drivers, one pending order may also correspond to multiple selectable dispatch lists.
S302, distributing a plurality of driver matching tasks to a plurality of working nodes, wherein each working node is distributed with at least one driver matching task, and the driver matching tasks are used for indicating to generate each selectable dispatching list scheme and determining priority scores corresponding to the selectable dispatching list schemes; a pre-assigned candidate driver is indicated in the selectable recipe.
In order to reduce the calculation amount of the calling node, a plurality of working nodes can be allocated to the driver matching task, the driver matching task is executed by the working nodes, each selectable order scheme is generated, the priority grade of each selectable order scheme is determined, and the priority grade of the selectable order scheme can be determined based on the corresponding order information and the order influencing parameters.
The priority score can represent the priority of the corresponding selectable order scheme, the priority score can reflect the information such as the safety degree, efficiency degree, income degree and the like under the selectable order scheme, the priority score can be determined based on the information such as the distance between a candidate driver and a starting position, the duration required for receiving driving, the duration required for delivering driving, the road congestion condition and the like, and the priority score can be determined based on order information and order allocation influence parameters.
After the working node calculates and completes the dispatchable scheme and the priority score corresponding to the dispatchable scheme, the data can be fed back to the calling node.
The working node may be a distributed server pre-allocated to the calling node, or may be an idle server not yet allocated to any calling node in the server cluster, where the working node may register through the routing node, so that the calling node may call the working node, and after the working node feeds the calculated data back to the calling node, the calling node may aggregate the data obtained by calculating each working node, so as to obtain a full number of selectable assignment schemes and priority scores corresponding to the selectable assignment schemes.
S303, after obtaining each selectable dispatching list scheme fed back by the plurality of working nodes, determining a target dispatching list scheme combination based on the priority scores corresponding to each selectable dispatching list scheme, wherein the target dispatching list scheme combination comprises target dispatching list schemes determined for each driver matching task; the target dispatch protocol combination has a highest sum of priority scores compared to other dispatch protocol combinations, and the candidate drivers assigned between each target dispatch protocol are different.
After the selectable order allocation schemes fed back by the working node are obtained, the target order allocation scheme combination can be determined based on the priority scores corresponding to the selectable order allocation schemes respectively, so that the overall optimal order allocation scheme for all the to-be-processed orders is obtained, the overall optimal effect can be realized by enabling the target order allocation scheme combination to be highest than the sum of the priority scores of other order allocation scheme combinations, and because the same driver can only accept one to-be-processed order in the same time period, the allocated candidate drivers among the target order allocation schemes are different.
Specifically, the selectable order schemes corresponding to the driver matching tasks can be combined first, so that a plurality of order scheme combinations including one selectable order scheme corresponding to each driver matching task respectively are obtained, and candidate drivers distributed among the selectable order schemes in different order scheme combinations are different.
For example, if there are a pending order a, a pending order B, and a pending order C, where the candidate drivers corresponding to the pending order a include a driver a and a driver B, the candidate drivers corresponding to the pending order B include a driver a and a driver C, and the candidate drivers corresponding to the pending order C include a driver B and a driver D, the selectable order allocation scheme may include a pending order a-driver a, a pending order a-driver B, a pending order B-driver a, a pending order B-driver C, a pending order C-driver B, and a pending order C-driver D, and the combined dispatch scheme combination may include a combination 1: a to-be-processed order a-driver A, a to-be-processed order B-driver C and a to-be-processed order C-driver B; combination 2: a to-be-processed order a-driver A, a to-be-processed order b-driver C and a to-be-processed order C-driver D; combination 3: a to-be-processed order a-driver B, a to-be-processed order B-driver A and a to-be-processed order c-driver D; combination 4: a pending order a-driver B, a pending order B-driver C, and a pending order C-driver D.
After obtaining a plurality of assignment scheme combinations, the sum of priority scores corresponding to the assignment scheme combinations can be determined, and the target assignment scheme combination can be determined.
For example, the assignment scheme combination with the highest sum of priority scores may be selected as the target assignment scheme.
In practical applications, the target dispatch plan combination may be determined using a global optimization algorithm, which may include a hungarian algorithm, a Kuhn-mannkles (KM) algorithm, and the like.
Thus, an optimal assignment scheme under various aspects can be obtained.
After the target dispatching scheme combination is obtained, the target dispatching scheme combination can be stored in a database, and because order information of an order to be processed is periodically obtained, the target dispatching scheme combination obtained in each period can also be stored, when the dispatching server sends a dispatching scheme obtaining request to a calling node, the calling node can send the target dispatching scheme combination determined in the latest period to the dispatching server, and therefore the dispatching server can dispatch the order to be processed according to the dispatching scheme indicated by the target dispatching scheme combination.
The dispatch server may send a dispatch scheme acquisition request to the calling node with a second time interval as a period, where the second time interval may be greater than the first time interval for acquiring order information, and the second time interval is typically several times the first time interval, so that the calling node has sufficient time to calculate a better dispatch scheme when a new order or a new candidate driver appears.
In this way, in the embodiment of the disclosure, the calculation of the driver matching task and the priority score is distributed to the working node, the calculation result of the working node is used for combining the dispatch schemes, the target dispatch scheme combination with the highest priority score sum is finally determined, and the calculation pressure of the server is distributed to the working node in a distributed calculation mode, so that the problem that the calculation speed is reduced due to the fact that the calculation amount is excessive and the calculation resources are insufficient is prevented.
Referring to fig. 4, a flowchart of a method for determining a dispatch scheme according to an embodiment of the disclosure is shown, where an execution body is a working node, and the method includes steps S301 to S303, where:
s401, at least one driver matching task is distributed in response to a dispatching node, and order information of a to-be-processed order carried by the driver matching task and dispatch influencing parameters of a plurality of candidate drivers corresponding to the to-be-processed order are determined.
In the step, the instruction generated by the driver matching task, namely the dispatching node, generates each selectable dispatch list scheme and carries corresponding to-be-processed order information and dispatch list influence parameters of corresponding candidate drivers. With this data, individual selectable sheet schemes corresponding to driver matching tasks can be generated.
S402, generating each selectable dispatching list scheme corresponding to the driver matching task, and determining a priority grade corresponding to each selectable dispatching list scheme based on order information corresponding to the selectable dispatching list scheme and dispatching list influence parameters; candidate drivers pre-assigned to the pending order are indicated in the selectable order.
Specifically, for any driver matching task, a target candidate driver may be screened from multiple candidate drivers based on order information corresponding to the driver matching task and a dispatch influencing parameter, and for example, a driver preference tag indicated in order information of an order to be processed corresponding to the driver matching task and an attribute tag corresponding to the candidate driver may be determined first, where the driver preference tag may be a number of tags preset by a user, a category of the tag may be selected from attribute tags of the driver, and the attribute tag of the candidate driver may be based on the driver preference tag and the attribute tag of the candidate driver, and multiple candidate drivers of the order to be processed may be screened to obtain the target candidate driver, and specifically, the driver preference tag may be used as a screening condition to screen candidate drivers including the driver preference tag in the attribute tag as the target candidate driver. For example, if the driver preference tag includes "male", only male drivers may be considered as target candidate drivers.
After screening to obtain target candidate drivers, the to-be-processed orders can be respectively distributed to the screened target candidate drivers to obtain a plurality of selectable order allocation schemes, then, the priority scores of the selectable order allocation schemes can be calculated again, the priority scores can be calculated by using a trained model, therefore, the order information characteristics corresponding to the selectable order allocation schemes and the order allocation influence parameter characteristics of the target candidate drivers corresponding to the selectable order allocation schemes can be determined first, and then, the order information characteristics and the order allocation influence parameter characteristics are input into the trained priority scoring model to obtain the priority scores of the selectable order allocation schemes.
When executing the driver matching task, if there are multiple received driver matching tasks, that is, multiple orders to be processed need to be driver matched, multiple sub-working nodes can be created, the sub-working nodes can be created on the working nodes or on idle sub-server nodes in the server cluster, and then different driver matching tasks are respectively distributed to different sub-working nodes, so that the driver matching task is executed in a distributed mode.
S403, feeding back the selectable dispatching schemes to a dispatching node, so that the dispatching node determines target dispatching scheme combinations based on the priority scores corresponding to the selectable dispatching schemes respectively, wherein the target dispatching scheme combinations comprise target dispatching schemes determined for the matching tasks of drivers respectively; the target dispatch protocol combination has a highest sum of priority scores compared to other dispatch protocol combinations, and the candidate drivers assigned between each target dispatch protocol are different.
In this way, the matching tasks of the driver are distributed to different working nodes for execution, then the data fed back by each working node are collected and tidied by the calling node, the target dispatch scheme combination is determined, the calculation pressure of the server is distributed to the working nodes in a distributed calculation mode, and the problem that the calculation speed is reduced due to overlarge calculation amount and insufficient calculation resources of the server is prevented.
It will be appreciated by those skilled in the art that in the above-described method of the specific embodiments, the written order of steps is not meant to imply a strict order of execution but rather should be construed according to the function and possibly inherent logic of the steps.
Based on the same inventive concept, the embodiment of the disclosure further provides a dispatching scheme determining device corresponding to the dispatching scheme determining method, and since the principle of solving the problem by the device in the embodiment of the disclosure is similar to that of the dispatching scheme determining method in the embodiment of the disclosure, the implementation of the device can refer to the implementation of the method, and the repetition is omitted.
Referring to fig. 5, a schematic diagram of a dispatch scheme determining device according to an embodiment of the disclosure is provided, where the device includes:
The obtaining module 510 is configured to obtain order information of a plurality of to-be-processed orders, and dispatch parameters of a plurality of candidate drivers corresponding to each to-be-processed order, and generate, for each to-be-processed order, a driver matching task carrying the order information and the dispatch parameters;
the allocation module 520 is configured to allocate a plurality of driver matching tasks to a plurality of working nodes, where each working node is allocated with at least one driver matching task, where the driver matching task is configured to instruct generation of each selectable order scheme, and determine a priority score corresponding to the selectable order scheme; indicating pre-assigned candidate drivers in the selectable recipe;
the determining module 530 is configured to determine, after obtaining each selectable assignment scenario fed back by the plurality of working nodes, a target assignment scenario combination based on the priority scores corresponding to each selectable assignment scenario respectively, where the target assignment scenario combination includes target assignment scenarios determined for each driver matching task respectively; the target dispatch protocol combination has a highest sum of priority scores compared to other dispatch protocol combinations, and the candidate drivers assigned between each target dispatch protocol are different.
In an alternative embodiment, the determining module 530 is specifically configured to:
combining the selectable dispatch list schemes corresponding to the matching tasks of each driver to obtain a plurality of dispatch list scheme combinations; each dispatching scheme combination comprises an optional dispatching scheme corresponding to each driver matching task, and candidate drivers distributed among the optional dispatching schemes in different dispatching scheme combinations are different;
and determining the target assignment scheme combination based on the sum of priority scores corresponding to the assignment scheme combinations.
In an alternative embodiment, the obtaining module 510 is configured to, when obtaining order information of at least one pending order:
taking the first time interval as a period, acquiring order information of at least one to-be-processed order generated in the target area;
the determining module 530 is further configured to:
responding to a dispatching scheme acquisition request sent by a dispatching server every time a second time interval passes, and sending a target dispatching scheme combination determined in the latest period to the dispatching server so that the dispatching server distributes the plurality of orders to be processed based on the target dispatching scheme combination; wherein the second time interval is greater than the first time interval.
In an alternative embodiment, the obtaining module 510 is further configured to:
determining the dispatch area information of the to-be-processed order based on the initial position corresponding to the to-be-processed order and a preset target distance;
and determining the candidate drivers based on the dispatch area information and the position information of each to-be-picked-up driver.
Referring to fig. 6, a schematic diagram of another assignment scheme determining apparatus according to an embodiment of the disclosure is shown, where the apparatus includes:
the response module 610 is configured to respond to the dispatch node to allocate at least one driver matching task, and determine order information of an order to be processed carried by the driver matching task and dispatch influencing parameters of a plurality of candidate drivers corresponding to the order to be processed;
the generating module 620 is configured to generate each selectable order scheme corresponding to the driver matching task, and determine a priority score corresponding to each selectable order scheme based on order information corresponding to the selectable order scheme and order assignment influencing parameters; indicating candidate drivers pre-assigned to the pending orders in the selectable order;
the feedback module 630 is configured to feed back the selectable assignment schemes to a scheduling node, so that the scheduling node determines a target assignment scheme combination based on the priority scores corresponding to the selectable assignment schemes respectively, where the target assignment scheme combination includes target assignment schemes determined for each driver matching task respectively; the target dispatch protocol combination has a highest sum of priority scores compared to other dispatch protocol combinations, and the candidate drivers assigned between each target dispatch protocol are different.
In an alternative embodiment, the generating module 620 is specifically configured to:
aiming at any driver matching task, screening target candidate drivers from the plurality of candidate drivers based on order information and dispatch influencing parameters corresponding to the driver matching task;
generating selectable dispatch list schemes for distributing the pending orders to each target candidate driver respectively;
determining order information characteristics corresponding to any selectable dispatching scheme and dispatching influence parameter characteristics of target candidate drivers corresponding to the selectable dispatching scheme;
and determining the priority grade of the selectable order dispatching scheme based on the order information characteristics and the order dispatching influence parameter characteristics.
In an alternative embodiment, the generating module 620 is specifically configured to:
creating a plurality of sub-work nodes under the condition that a plurality of driver matching tasks exist;
and respectively distributing different sub-working nodes for each driver matching task so that each sub-working node generates each selectable dispatching list scheme corresponding to the driver matching task, and determining the priority grade corresponding to each selectable dispatching list scheme based on order information and dispatching list influence parameters corresponding to the selectable dispatching list scheme.
The process flow of each module in the apparatus and the interaction flow between the modules may be described with reference to the related descriptions in the above method embodiments, which are not described in detail herein.
The embodiment of the disclosure further provides an electronic device, as shown in fig. 7, which is a schematic diagram of the electronic device provided by the embodiment of the disclosure, including:
a processor 71, a memory 72, and a bus 73; memory 72 is used to store execution instructions, including memory 721 and external memory 722; the memory 721 is also called an internal memory, and is used for temporarily storing operation data in the processor 71 and data exchanged with the external memory 622 such as a hard disk, and the processor 71 exchanges data with the external memory 722 through the memory 721, and when the electronic device 700 is operated, the processor 71 and the memory 72 communicate with each other through the bus 73, so that the processor 71 executes the following instructions:
acquiring order information of a plurality of to-be-processed orders and dispatching influence parameters of a plurality of candidate drivers corresponding to each to-be-processed order, and generating driver matching tasks carrying the order information and dispatching influence parameters for each to-be-processed order;
assigning a plurality of driver matching tasks to a plurality of work nodes, wherein each work node is assigned with at least one driver matching task, the driver matching tasks are used for indicating to generate each selectable dispatch list scheme and determining priority scores corresponding to the selectable dispatch list schemes; indicating pre-assigned candidate drivers in the selectable recipe;
After obtaining each selectable dispatching list scheme fed back by the plurality of working nodes, determining a target dispatching list scheme combination based on the priority scores respectively corresponding to each selectable dispatching list scheme, wherein the target dispatching list scheme combination comprises target dispatching list schemes respectively determined for each driver matching task; the target dispatch protocol combination has a highest sum of priority scores compared to other dispatch protocol combinations, and the candidate drivers assigned between each target dispatch protocol are different.
In an alternative embodiment, the determining, in the instructions executed by the processor 71, the target assignment scheme combination based on the priority scores corresponding to the respective selectable assignment schemes includes:
combining the selectable dispatch list schemes corresponding to the matching tasks of each driver to obtain a plurality of dispatch list scheme combinations; each dispatching scheme combination comprises an optional dispatching scheme corresponding to each driver matching task, and candidate drivers distributed among the optional dispatching schemes in different dispatching scheme combinations are different;
and determining the target assignment scheme combination based on the sum of priority scores corresponding to the assignment scheme combinations.
In an alternative embodiment, the acquiring order information of the at least one pending order in the instructions executed by the processor 71 includes:
taking the first time interval as a period, acquiring order information of at least one to-be-processed order generated in the target area;
further comprises:
responding to a dispatching scheme acquisition request sent by a dispatching server every time a second time interval passes, and sending a target dispatching scheme combination determined in the latest period to the dispatching server so that the dispatching server distributes the plurality of orders to be processed based on the target dispatching scheme combination; wherein the second time interval is greater than the first time interval.
In an alternative embodiment, the instructions executed by the processor 71 further include:
determining the dispatch area information of the to-be-processed order based on the initial position corresponding to the to-be-processed order and a preset target distance;
and determining the candidate drivers based on the dispatch area information and the position information of each to-be-picked-up driver.
Alternatively, when the electronic device 700 is operating, the processor 71 communicates with the memory 72 via the bus 73, such that the processor 71 executes the following instructions:
Responding to a dispatching node to distribute at least one driver matching task, and determining order information of a to-be-processed order carried by the driver matching task and dispatch influencing parameters of a plurality of candidate drivers corresponding to the to-be-processed order;
generating each selectable dispatching list scheme corresponding to the driver matching task, and determining the priority grade corresponding to each selectable dispatching list scheme based on order information corresponding to the selectable dispatching list scheme and dispatching list influence parameters; indicating candidate drivers pre-assigned to the pending orders in the selectable order;
feeding back the selectable assignment schemes to a scheduling node, so that the scheduling node determines a target assignment scheme combination based on the priority scores respectively corresponding to the selectable assignment schemes, wherein the target assignment scheme combination comprises target assignment schemes respectively determined for each driver matching task; the target dispatch protocol combination has a highest sum of priority scores compared to other dispatch protocol combinations, and the candidate drivers assigned between each target dispatch protocol are different.
In an alternative embodiment, in the instructions executed by the processor 71, the generating each alternative order scheme corresponding to the driver matching task, and determining the priority score corresponding to each alternative order scheme based on the order information corresponding to the alternative order scheme and the order influencing parameter, includes:
Aiming at any driver matching task, screening target candidate drivers from the plurality of candidate drivers based on order information and dispatch influencing parameters corresponding to the driver matching task;
generating selectable dispatch list schemes for distributing the pending orders to each target candidate driver respectively;
determining order information characteristics corresponding to any selectable dispatching scheme and dispatching influence parameter characteristics of target candidate drivers corresponding to the selectable dispatching scheme;
and determining the priority grade of the selectable order dispatching scheme based on the order information characteristics and the order dispatching influence parameter characteristics.
In an alternative embodiment, in the instructions executed by the processor 71, the generating each alternative order scheme corresponding to the driver matching task, and determining the priority score corresponding to each alternative order scheme based on the order information corresponding to the alternative order scheme and the order influencing parameter, includes:
creating a plurality of sub-work nodes under the condition that a plurality of driver matching tasks exist;
and respectively distributing different sub-working nodes for each driver matching task so that each sub-working node generates each selectable dispatching list scheme corresponding to the driver matching task, and determining the priority grade corresponding to each selectable dispatching list scheme based on order information and dispatching list influence parameters corresponding to the selectable dispatching list scheme.
The specific execution process of the above instruction may refer to the steps of the assignment scheme determination method described in the embodiments of the present disclosure, which are not described herein.
The disclosed embodiments also provide a computer readable storage medium having a computer program stored thereon, which when executed by a processor performs the steps of the dispatch scheme determination method described in the method embodiments above. Wherein the storage medium may be a volatile or nonvolatile computer readable storage medium.
The computer program product of the method for determining a prescription scheme provided in the embodiments of the present disclosure includes a computer readable storage medium storing program code, where the program code includes instructions for executing the steps of the method for determining a prescription scheme described in the embodiments of the method, and the details of the embodiments of the method may be referred to above and are not described herein.
The disclosed embodiments also provide a computer program which, when executed by a processor, implements any of the methods of the previous embodiments. The computer program product may be realized in particular by means of hardware, software or a combination thereof. In an alternative embodiment, the computer program product is embodied as a computer storage medium, and in another alternative embodiment, the computer program product is embodied as a software product, such as a software development kit (Software Development Kit, SDK), or the like.
It will be clear to those skilled in the art that, for convenience and brevity of description, specific working procedures of the above-described system and apparatus may refer to corresponding procedures in the foregoing method embodiments, which are not described herein again. In the several embodiments provided in the present disclosure, it should be understood that the disclosed systems, devices, and methods may be implemented in other manners. The above-described apparatus embodiments are merely illustrative, for example, the division of the units is merely a logical function division, and there may be other manners of division in actual implementation, and for example, multiple units or components may be combined or integrated into another system, or some features may be omitted, or not performed. Alternatively, the coupling or direct coupling or communication connection shown or discussed with each other may be through some communication interface, device or unit indirect coupling or communication connection, which may be in electrical, mechanical or other form.
The units described as separate units may or may not be physically separate, and units shown as units may or may not be physical units, may be located in one place, or may be distributed on a plurality of network units. Some or all of the units may be selected according to actual needs to achieve the purpose of the solution of this embodiment.
In addition, each functional unit in each embodiment of the present disclosure may be integrated in one processing unit, or each unit may exist alone physically, or two or more units may be integrated in one unit.
The functions, if implemented in the form of software functional units and sold or used as a stand-alone product, may be stored in a non-volatile computer readable storage medium executable by a processor. Based on such understanding, the technical solution of the present disclosure may be embodied in essence or a part contributing to the prior art or a part of the technical solution, or in the form of a software product stored in a storage medium, including several instructions to cause a computer device (which may be a personal computer, a server, or a network device, etc.) to perform all or part of the steps of the method described in the embodiments of the present disclosure. And the aforementioned storage medium includes: a U-disk, a removable hard disk, a Read-Only Memory (ROM), a random access Memory (Random Access Memory, RAM), a magnetic disk, or an optical disk, or other various media capable of storing program codes.
Finally, it should be noted that: the foregoing examples are merely specific embodiments of the present disclosure, and are not intended to limit the scope of the disclosure, but the present disclosure is not limited thereto, and those skilled in the art will appreciate that while the foregoing examples are described in detail, it is not limited to the disclosure: any person skilled in the art, within the technical scope of the disclosure of the present disclosure, may modify or easily conceive changes to the technical solutions described in the foregoing embodiments, or make equivalent substitutions for some of the technical features thereof; such modifications, changes or substitutions do not depart from the spirit and scope of the technical solutions of the embodiments of the disclosure, and are intended to be included within the scope of the present disclosure. Therefore, the protection scope of the present disclosure shall be subject to the protection scope of the claims.

Claims (13)

1. A method for determining a dispatch protocol, comprising:
acquiring order information of a plurality of to-be-processed orders and dispatching influence parameters of a plurality of candidate drivers corresponding to each to-be-processed order, and generating driver matching tasks carrying the order information and dispatching influence parameters for each to-be-processed order;
assigning a plurality of driver matching tasks to a plurality of work nodes, wherein each work node is assigned with at least one driver matching task, the driver matching tasks are used for indicating to generate each selectable dispatch list scheme and determining priority scores corresponding to the selectable dispatch list schemes; indicating pre-assigned candidate drivers in the selectable recipe;
after obtaining each selectable dispatching list scheme fed back by the plurality of working nodes, determining a target dispatching list scheme combination based on the priority scores respectively corresponding to each selectable dispatching list scheme, wherein the target dispatching list scheme combination comprises target dispatching list schemes respectively determined for each driver matching task; the target dispatch protocol combination has a highest sum of priority scores compared to other dispatch protocol combinations, and the candidate drivers assigned between each target dispatch protocol are different.
2. The method of claim 1, wherein the determining a target assignment scheme combination based on the priority scores for each of the selectable assignment schemes, respectively, comprises:
combining the selectable dispatch list schemes corresponding to the matching tasks of each driver to obtain a plurality of dispatch list scheme combinations; each dispatching scheme combination comprises an optional dispatching scheme corresponding to each driver matching task, and candidate drivers distributed among the optional dispatching schemes in different dispatching scheme combinations are different;
and determining the target assignment scheme combination based on the sum of priority scores corresponding to the assignment scheme combinations.
3. The method of claim 1, wherein the obtaining order information for at least one pending order comprises:
taking the first time interval as a period, acquiring order information of at least one to-be-processed order generated in the target area;
the method further comprises the steps of:
responding to a dispatching scheme acquisition request sent by a dispatching server every time a second time interval passes, and sending a target dispatching scheme combination determined in the latest period to the dispatching server so that the dispatching server distributes the plurality of orders to be processed based on the target dispatching scheme combination; wherein the second time interval is greater than the first time interval.
4. The method of claim 1, wherein candidate drivers for the pending order are determined by:
determining the dispatch area information of the to-be-processed order based on the initial position corresponding to the to-be-processed order and a preset target distance;
and determining the candidate drivers based on the dispatch area information and the position information of each to-be-picked-up driver.
5. A method for determining a dispatch protocol, comprising:
responding to a dispatching node to distribute at least one driver matching task, and determining order information of a to-be-processed order carried by the driver matching task and dispatch influencing parameters of a plurality of candidate drivers corresponding to the to-be-processed order;
generating each selectable dispatching list scheme corresponding to the driver matching task, and determining the priority grade corresponding to each selectable dispatching list scheme based on order information corresponding to the selectable dispatching list scheme and dispatching list influence parameters; indicating candidate drivers pre-assigned to the pending orders in the selectable order;
feeding back the selectable assignment schemes to a scheduling node, so that the scheduling node determines a target assignment scheme combination based on the priority scores respectively corresponding to the selectable assignment schemes, wherein the target assignment scheme combination comprises target assignment schemes respectively determined for each driver matching task; the target dispatch protocol combination has a highest sum of priority scores compared to other dispatch protocol combinations, and the candidate drivers assigned between each target dispatch protocol are different.
6. The method of claim 5, wherein generating each selectable order proposal corresponding to the driver matching task and determining a priority score corresponding to each selectable order proposal based on order information corresponding to the selectable order proposal and order influencing parameters comprises:
aiming at any driver matching task, screening target candidate drivers from the plurality of candidate drivers based on order information and dispatch influencing parameters corresponding to the driver matching task;
generating selectable dispatch list schemes for distributing the pending orders to each target candidate driver respectively;
determining order information characteristics corresponding to any selectable dispatching scheme and dispatching influence parameter characteristics of target candidate drivers corresponding to the selectable dispatching scheme;
and determining the priority grade of the selectable order dispatching scheme based on the order information characteristics and the order dispatching influence parameter characteristics.
7. The method of claim 5, wherein generating each selectable order proposal corresponding to the driver matching task and determining a priority score corresponding to each selectable order proposal based on order information corresponding to the selectable order proposal and order influencing parameters comprises:
Creating a plurality of sub-work nodes under the condition that a plurality of driver matching tasks exist;
and respectively distributing different sub-working nodes for each driver matching task so that each sub-working node generates each selectable dispatching list scheme corresponding to the driver matching task, and determining the priority grade corresponding to each selectable dispatching list scheme based on order information and dispatching list influence parameters corresponding to the selectable dispatching list scheme.
8. A dispatch protocol determination device comprising:
the system comprises an acquisition module, a storage module and a storage module, wherein the acquisition module is used for acquiring order information of a plurality of to-be-processed orders and dispatching influence parameters of a plurality of candidate drivers corresponding to each to-be-processed order, and generating driver matching tasks carrying the order information and dispatching influence parameters for each to-be-processed order;
the allocation module is used for allocating a plurality of driver matching tasks to a plurality of working nodes, wherein each working node is allocated with at least one driver matching task, and the driver matching tasks are used for indicating to generate each selectable order scheme and determining priority scores corresponding to the selectable order schemes; indicating pre-assigned candidate drivers in the selectable recipe;
The determining module is used for determining a target dispatching scheme combination based on the priority scores corresponding to the selectable dispatching schemes respectively after acquiring the selectable dispatching schemes fed back by the plurality of working nodes, wherein the target dispatching scheme combination comprises target dispatching schemes determined for the matching tasks of each driver respectively; the target dispatch protocol combination has a highest sum of priority scores compared to other dispatch protocol combinations, and the candidate drivers assigned between each target dispatch protocol are different.
9. A dispatch protocol determination device comprising:
the response module is used for responding to the dispatching node to distribute at least one driver matching task and determining order information of an order to be processed carried by the driver matching task and dispatch influencing parameters of a plurality of candidate drivers corresponding to the order to be processed;
the generation module is used for generating each selectable dispatching list scheme corresponding to the driver matching task and determining the priority grade corresponding to each selectable dispatching list scheme based on order information corresponding to the selectable dispatching list scheme and dispatching list influence parameters; indicating candidate drivers pre-assigned to the pending orders in the selectable order;
The feedback module is used for feeding back the selectable dispatching schemes to a dispatching node so that the dispatching node can determine target dispatching scheme combinations based on the priority scores corresponding to the selectable dispatching schemes respectively, and the target dispatching scheme combinations comprise target dispatching schemes determined for the matching tasks of drivers respectively; the target dispatch protocol combination has a highest sum of priority scores compared to other dispatch protocol combinations, and the candidate drivers assigned between each target dispatch protocol are different.
10. A server cluster comprising a master server node and a plurality of slave server nodes; wherein,
the master server node is used for configuring the slave server node into a calling node and a plurality of working nodes corresponding to each target area;
the calling node is configured to execute the dispatch protocol determination method according to any one of claims 1 to 4, and the working node is configured to execute the dispatch protocol determination method according to any one of claims 5 to 7.
11. The server cluster of claim 10, wherein the master server node is further configured to configure a new calling node for any target area when a calling node of the target area is in error.
12. An electronic device, comprising: a processor, a memory storing machine-readable instructions executable by the processor for executing the machine-readable instructions stored in the memory, which when executed by the processor, perform the steps of the order determination method of any of claims 1 to 4 or 5 to 7.
13. A computer-readable storage medium, wherein the computer-readable storage medium has stored thereon a computer program which, when executed by an electronic device, performs the steps of the dispatch scheme determination method of any one of claims 1 to 4 or 5 to 7.
CN202210975584.9A 2022-08-15 2022-08-15 Method and device for determining assignment scheme and server cluster Pending CN117670457A (en)

Priority Applications (1)

Application Number Priority Date Filing Date Title
CN202210975584.9A CN117670457A (en) 2022-08-15 2022-08-15 Method and device for determining assignment scheme and server cluster

Applications Claiming Priority (1)

Application Number Priority Date Filing Date Title
CN202210975584.9A CN117670457A (en) 2022-08-15 2022-08-15 Method and device for determining assignment scheme and server cluster

Publications (1)

Publication Number Publication Date
CN117670457A true CN117670457A (en) 2024-03-08

Family

ID=90070022

Family Applications (1)

Application Number Title Priority Date Filing Date
CN202210975584.9A Pending CN117670457A (en) 2022-08-15 2022-08-15 Method and device for determining assignment scheme and server cluster

Country Status (1)

Country Link
CN (1) CN117670457A (en)

Similar Documents

Publication Publication Date Title
US11488276B2 (en) Allocation of dynamically batched service providers and service requesters
CN113222305B (en) Order scheduling method, order scheduling device, storage medium and electronic equipment
JP6638088B2 (en) System and method for multiple round driver selection
CN106779910B (en) Distribution order distribution method and device
CN106453146B (en) Method, system, device and readable storage medium for allocating private cloud computing resources
US20200128066A1 (en) Using predictive analytics to determine expected use patterns of vehicles to recapture under-utilized computational resources of vehicles
CN111861310A (en) Freight order allocation method, device, server and storage medium
CN109416646B (en) Optimization method for container allocation and processing equipment
CN112579622B (en) Method, device and equipment for processing service data
JP2015534694A (en) Method, computer program product, and electronic control device for finding a parking place for a vehicle
CN109416802A (en) The method and apparatus for managing vehicle
CN103810045A (en) Resource allocation method, resource manager, resource server and system
CN109525410A (en) The method, apparatus and distributed memory system of distributed memory system updating and management
CN105893497A (en) Task processing method and device
CN116405565A (en) Resource issuing method of cloud service and related equipment
CN112995303B (en) Cross-cluster scheduling method and device
CN106169994A (en) The method of controlling security communicated between container and device
CN113271613B (en) Data processing method based on base station group, base station and base station system
CN110544159B (en) Map information processing method and device, readable storage medium and electronic equipment
CN107545351A (en) Method for allocating tasks and device
CN103299298B (en) The method and system of process business
CN111523743A (en) Order distribution method, device, server and nonvolatile storage medium
US20150105935A1 (en) Method and system for managing operation of multi-line public transportation
CN117670457A (en) Method and device for determining assignment scheme and server cluster
CN112433855A (en) Resource allocation method, device and server

Legal Events

Date Code Title Description
PB01 Publication
PB01 Publication
SE01 Entry into force of request for substantive examination
SE01 Entry into force of request for substantive examination