CN116136973A - Method and device for dispatching network appointment orders and electronic equipment - Google Patents

Method and device for dispatching network appointment orders and electronic equipment Download PDF

Info

Publication number
CN116136973A
CN116136973A CN202310295265.8A CN202310295265A CN116136973A CN 116136973 A CN116136973 A CN 116136973A CN 202310295265 A CN202310295265 A CN 202310295265A CN 116136973 A CN116136973 A CN 116136973A
Authority
CN
China
Prior art keywords
reservation list
reservation
time interval
queue
preset time
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
CN202310295265.8A
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.)
Shouyue Technology Beijing Co Ltd
Original Assignee
Shouyue Technology Beijing 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 Shouyue Technology Beijing Co Ltd filed Critical Shouyue Technology Beijing Co Ltd
Priority to CN202310295265.8A priority Critical patent/CN116136973A/en
Publication of CN116136973A publication Critical patent/CN116136973A/en
Pending legal-status Critical Current

Links

Images

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
    • G06Q10/00—Administration; Management
    • G06Q10/02—Reservations, e.g. for tickets, services or events
    • 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
    • G06Q10/06311—Scheduling, planning or task assignment for a person or group
    • 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
    • G06Q50/00—Information and communication technology [ICT] specially adapted for implementation of business processes of specific business sectors, e.g. utilities or tourism
    • G06Q50/40—Business processes related to the transportation industry

Landscapes

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

Abstract

The disclosure relates to the technical field of network taxi reservation, in particular to a method and a device for dispatching a taxi reservation list and electronic equipment. The method comprises the following steps: acquiring reservation list information of a network appointment vehicle, and constructing a reservation list directed graph based on the sequence of riding time points in the reservation list information; in the reservation list directed graph, acquiring a reservation list of the riding time falling in a preset time interval for each preset time interval, and constructing a reservation list queue set corresponding to the preset time interval; and allocating the reservation list queues in the reservation list queue set to drivers conforming to a preset strategy. The present disclosure achieves a reasonable allocation of all reservation sheets with minimal driver capacity by mapping the reservation sheets onto directed graphs and by aggregating the reservation sheet graphs.

Description

Method and device for dispatching network appointment orders and electronic equipment
Technical Field
The disclosure relates to the technical field of network taxi reservation, in particular to a method and a device for dispatching a taxi reservation list and electronic equipment.
Background
The reservation list refers to a reservation vehicle order in which a passenger can reserve travel time and call a driver in advance.
After the network appointment receiving the appointment, the existing solution is that when the appointment arrives, the appointment is sent to all drivers currently located in a certain radius area, the drivers combine the situation to rob the appointment, and the appointment is allocated to the driver by the driver who first arrives.
However, the method can not rapidly and reasonably arrange the reservation list to judge whether to rob the list, so that most reservation list is scattered and distributed to drivers on a plurality of different driving paths, and the capacity resource is wasted.
Disclosure of Invention
The embodiment of the disclosure provides a network appointment scheduling method, a network appointment scheduling device, electronic equipment, a computer readable storage medium and a computer program product, which are used for solving the problem that the conventional unilateral allocation scheduling method wastes transportation resources.
A first aspect of an embodiment of the present disclosure provides a method for assigning a network appointment to a vehicle, including:
acquiring reservation list information of a network appointment vehicle, and constructing a reservation list directed graph based on the sequence of riding time points in the reservation list information;
in the reservation list directed graph, acquiring a reservation list of the riding time falling in a preset time interval for each preset time interval, and constructing a reservation list queue set corresponding to the preset time interval;
and allocating the reservation list queues in the reservation list queue set to drivers conforming to a preset strategy.
In some embodiments, the building a reservation sheet directed graph includes:
and connecting each reservation list as a vertex, connecting reservation list vertices by taking the sequence of the reservation list riding time points as directed edges, defining the driving time between adjacent reservation lists as the weight of the directed edges between the vertices, and constructing a reservation list directed graph.
In some embodiments, the adjacent reservation list refers to:
and if the distance between the first reservation list end point and the second reservation list start point in the two reservation lists is smaller than a preset threshold value, the first reservation list and the second reservation list form an adjacent reservation list.
In some embodiments, the constructing a reservation list queue set corresponding to the preset time interval includes:
for each preset time interval, constructing a reservation list queue set corresponding to the preset time interval, initializing the reservation list queue set, enabling the reservation list queue set to contain a first reservation list queue and enabling the first reservation list queue to be empty;
acquiring a first vertex with zero arrival degree in the reservation list directed graph, determining a preset time interval of the riding time of the reservation list represented by the first vertex, searching a second vertex connected with the first vertex in a reservation list queue set corresponding to the preset time interval, inserting the first vertex into the queue tail of the searched reservation list queue of the first and second vertices if a plurality of second vertices exist, creating a second reservation list queue in the reservation list queue set and making the second reservation list queue empty if the second vertex does not exist, inserting the second vertex into the queue tail of the second reservation list queue, and deleting the first vertex and the directed edge connected with the first vertex in the reservation list directed graph;
and repeating the previous step until all vertexes on the reservation list directed graph are traversed.
In some embodiments, the preset policy refers to:
sequencing the drivers waiting for dispatch in a driver queue corresponding to the time interval of the drivers on duty;
collecting a reservation list needing to be dispatched in preset time, and distributing the reservation list to a reservation list queue set corresponding to each preset time interval;
and distributing the reservation list queues in the reservation list queue set corresponding to each preset time interval to a first driver meeting preset conditions in the driver queues corresponding to the preset time intervals.
In some embodiments, the ordering the drivers in a driver queue corresponding to a driver on-duty time interval comprises:
and sequencing the amount of the reserved list running water in the preset period of the driver history in a driver queue corresponding to the time interval of the driver working according to the order from small to large.
In some embodiments, the preset conditions include:
the driver services the total time of day for no more than 8 hours.
A second aspect of the embodiments of the present disclosure provides a network appointment-making device for appointment-making of a vehicle, which is characterized by comprising:
the first construction module is used for acquiring reservation list information of the network appointment, and constructing a reservation list directed graph based on the sequence of riding time points in the reservation list information;
the second construction module is used for acquiring a reservation list of which the riding time falls in a preset time interval for each preset time interval in the reservation list directed graph, and constructing a reservation list queue set corresponding to the preset time interval;
and the allocation module is used for allocating the reservation list queues in the reservation list queue set to drivers conforming to a preset strategy.
A third aspect of the disclosed embodiments provides an electronic device, comprising a memory and a processor,
the memory is used for storing a computer program;
the processor is configured to implement the method according to the first aspect of the present disclosure when executing the computer program.
A fourth aspect of the disclosed embodiments provides a computer readable storage medium having stored thereon a computer program which, when executed by a processor, implements a method according to the first aspect of the disclosure.
A fifth aspect of the disclosed embodiments provides a computer program product comprising a computer program, instructions which, when executed by a processor, implement a method according to the first aspect of the disclosure.
In summary, the method, the device, the electronic equipment, the computer readable storage medium and the program product for dispatching the network appointment orders provided by the embodiments of the present disclosure map the appointment orders onto the directed graph, mine the relation between the appointment orders, the drivers and the appointment orders, and complete the reasonable allocation of all the appointment orders with the least driver capacity through the aggregation link on the appointment order graph, thereby solving the problem of the prior ordered type waste of transportation resources in the appointment order dispatching process.
Drawings
The features and advantages of the present disclosure will be more clearly understood by reference to the accompanying drawings, which are schematic and should not be construed as limiting the disclosure in any way, in which:
FIG. 1 is a flow chart of a method of order dispatch of a network appointment vehicle according to some embodiments of the present disclosure;
FIG. 2 is a flow diagram of a method for ordering a reservation sheet for a network appointment in accordance with some embodiments of the present disclosure;
FIG. 3 is a schematic diagram of an online dating reservation list dispatch device according to some embodiments of the present disclosure;
fig. 4 is a schematic diagram of an electronic device, shown, according to some embodiments of the present disclosure.
Detailed Description
In the following detailed description, numerous specific details are set forth by way of examples in order to provide a thorough understanding of the relevant disclosure. However, it will be apparent to one of ordinary skill in the art that the present disclosure may be practiced without these specific details. It should be appreciated that the use of "system," "apparatus," "unit," and/or "module" terms in this disclosure is one method for distinguishing between different parts, elements, portions, or components at different levels in a sequential arrangement. However, these terms may be replaced with other expressions if the other expressions can achieve the same purpose.
It will be understood that when a device, unit, or module is referred to as being "on," "connected to," or "coupled to" another device, unit, or module, it can be directly on, connected to, or coupled to, or in communication with the other device, unit, or module, or intervening devices, units, or modules may be present unless the context clearly indicates an exception. For example, the term "and/or" as used in this disclosure includes any and all combinations of one or more of the associated listed items.
The terminology used in the present disclosure is for the purpose of describing particular embodiments only and is not intended to limit the scope of the present disclosure. As used in the specification and the claims, the terms "a," "an," "the," and/or "the" are not specific to a singular, but may include a plurality, unless the context clearly dictates otherwise. In general, the terms "comprises" and "comprising" are intended to cover only those features, integers, steps, operations, elements, and/or components that are explicitly identified, but do not constitute an exclusive list, as other features, integers, steps, operations, elements, and/or components may be included.
These and other features and characteristics of the present disclosure, as well as the methods of operation, functions of the related elements of structure, combinations of parts and economies of manufacture, may be better understood with reference to the following description and the accompanying drawings, all of which form a part of this specification. It is to be expressly understood, however, that the drawings are for the purpose of illustration and description only and are not intended as a definition of the limits of the disclosure. It will be understood that the figures are not drawn to scale.
Various block diagrams are used in the present disclosure to illustrate various modifications of the embodiments according to the present disclosure. It should be understood that the foregoing or following structures are not intended to limit the present disclosure. The protection scope of the present disclosure is subject to the claims.
Fig. 1 is a flow chart illustrating a method of order dispatch of a network appointment vehicle according to some embodiments of the present disclosure. In some embodiments, the network appointment scheduling method may be performed by a scheduling server.
As shown in fig. 1, the network appointment order assignment method includes the following steps:
s201, acquiring reservation list information of the network appointment, and constructing a reservation list directed graph based on the sequence of riding time points in the reservation list information.
Specifically, in some embodiments of the present disclosure, each reservation sheet is used as a vertex, the reservation sheet vertices are connected with each other by using the sequence of the reservation sheet riding time points as directed edges, the driving time between adjacent reservation sheets is defined as the weight of the directed edges between the vertices, and a reservation sheet directed graph is constructed.
Wherein, the adjacent reservation list refers to:
and if the distance between the first reservation list end point and the second reservation list start point in the two reservation lists is smaller than a preset threshold value, the first reservation list and the second reservation list form an adjacent reservation list.
S202, in the reservation list directed graph, acquiring a reservation list of which the riding time falls in a preset time interval for each preset time interval, and constructing a reservation list queue set corresponding to the preset time interval.
Specifically, in some embodiments of the present disclosure, constructing a reservation list queue set corresponding to the preset time interval includes:
for each preset time interval, constructing a reservation list queue set corresponding to the preset time interval, initializing the reservation list queue set, enabling the reservation list queue set to contain a first reservation list queue and enabling the first reservation list queue to be empty;
acquiring a first vertex with zero arrival degree in the reservation list directed graph, determining a preset time interval of the riding time of the reservation list represented by the first vertex, searching a second vertex connected with the first vertex in a reservation list queue set corresponding to the preset time interval, inserting the first vertex into the queue tail of the searched reservation list queue of the first and second vertices if a plurality of second vertices exist, creating a second reservation list queue in the reservation list queue set and making the second reservation list queue empty if the second vertex does not exist, inserting the second vertex into the queue tail of the second reservation list queue, and deleting the first vertex and the directed edge connected with the first vertex in the reservation list directed graph;
and repeating the previous step until all vertexes on the reservation list directed graph are traversed.
S203, the reservation list queues in the reservation list queue set are distributed to drivers conforming to a preset strategy.
Specifically, in some embodiments of the present disclosure, the preset policy refers to:
sequencing the drivers waiting for dispatch in a driver queue corresponding to the time interval of the drivers on duty;
collecting a reservation list needing to be dispatched in preset time, and distributing the reservation list to a reservation list queue set corresponding to each preset time interval;
and distributing the reservation list queues in the reservation list queue set corresponding to each preset time interval to a first driver meeting preset conditions in the driver queues corresponding to the preset time intervals.
In some embodiments of the disclosure, the ordering the drivers in a driver queue corresponding to a driver on-duty time interval includes:
and sequencing the amount of the reserved list running water in the preset period of the driver history in a driver queue corresponding to the time interval of the driver working according to the order from small to large.
In some embodiments of the present disclosure, the preset condition includes:
the driver services the total time of day for no more than 8 hours.
Fig. 2 is a flow diagram illustrating a method for ordering a reservation sheet for a network appointment according to some embodiments of the present disclosure. As shown in fig. 2, the network appointment-making method provides a new appointment-making combination matching strategy, by mapping the appointment-making on the graph and mining the relation between the drivers and the appointment-making among the appointment-making, through the aggregation link on the appointment-making graph, the reasonable distribution of all the appointment-making is realized with the least driver's carrying capacity, thereby solving the problem of the wasting carrying capacity resource of the appointment-making in the process of ordering.
The combined matching strategy is divided into three links, namely a reservation list graph construction link, a reservation list aggregation link, a reservation list and a driver matching link. Firstly, constructing a directed reservation list graph for all reservation lists meeting the conditions according to the sequence of reservation riding time, and describing travel constraint among the reservation lists so as to effectively carry out subsequent reservation list aggregation links. And then, carrying out topological sorting on the graph, aggregating reservation list queue sets according to sorting results, and aggregating reservation lists with similar strokes in the same reservation list queue as far as possible on the premise of meeting the condition that the strokes among the reservation lists do not conflict, so that the demand on the transportation capacity of a driver is reduced, meanwhile, the driver does not need to rob the list, and other excessive and complex operations, the combination reservation list which is more coherent in time can be received, and the experience of the driver is improved. And finally, distributing all the reservation orders in a reservation order queue to a driver meeting the requirements of a vehicle type and working time. Different reservation list queues are distributed to different drivers from small to large according to the history reservation list running water of the drivers, so that the platform completes reasonable distribution of reservation lists with minimum driver capacity resources while considering the experience of the drivers.
1. Reservation sheet construction
Each reservation list is defined as a vertex, the sequence of reservation list riding time points is regarded as a directed edge, and the reservation list vertex is connected. Meanwhile, in order to avoid the driver from driving for a longer distance, two reservation list vertices are connected to meet certain constraint conditions, such as that the distance between the last list end point and the next list start point is less than 7 km (the constraint conditions can be customized according to different service scenes). In addition, the driving time between reservation sheets is defined as the weight of the directed edge between the vertexes, thereby constructing the reservation sheet graph.
2. Reservation sheet aggregation
a. For preset time intervals, such as 7:00-10:59, 11:00-14:59 (this time interval is typically taken as the period of time for the driver to work), different barrels are set up, and a reservation list set for which the riding time falls within the time period is stored. Setting different reservation list vertex queues in the barrel, and storing reservation list aggregation results;
b. and taking out the vertex with zero entry degree (the vertex pointed by the directed edge) on the reservation list graph, finding a bucket corresponding to the riding time of the vertex, searching the first reservation list vertex connected with the vertex in the bucket, and inserting the reservation list vertex into the tail of the queue where the reservation list is positioned. If no vertex is connected with the new queue, a new queue is built in the barrel and then is inserted into the tail of the new queue;
c. deleting the vertex with zero incidence and the connected directed edge;
d. and c, repeating the steps b and c until all vertexes on the reservation list graph are traversed, namely, the topological ordering of the reservation list graph is finished, and meanwhile, the reservation list queue set which is as long as possible in different time periods is obtained.
3. Appointment sheet, driver matching process
a. The network appointment vehicle platform collects appointment orders needing combination matching at fixed time points every day;
b. sequencing all available drivers from small to large according to the reserved single running water in a certain period of the history of the available drivers, and putting the reserved single running water in a bucket corresponding to a time interval of the drivers on duty;
c. for all the reservation orders needing to be combined and matched, constructing a reservation order diagram structure according to the description of the first item and the second item, and aggregating the reservation order diagram structure;
d. the reservation list queue sets in different time periods are distributed to drivers which correspond to the first driving receiving type in the corresponding barrel and meet certain constraint conditions, such as that the total daily service time of each driver is not longer than 8 hours (the constraint conditions can be correspondingly adjusted according to different service scenes). Fig. 3 is a schematic diagram of an online dating order dispatch device, according to some embodiments of the present disclosure. As shown in the figure 3 of the drawings, the network appointment/appointment-ordering device 300 comprises a first construction module 310 a second construction module 320, an allocation module 330. The network appointment order dispatch function can be executed by an order dispatch server. Wherein:
a first construction module 310, configured to obtain reservation list information of a network appointment, and construct a reservation list directed graph based on a sequence of riding time points in the reservation list information;
a second construction module 320, configured to obtain, for each preset time interval in the reservation list directed graph, a reservation list whose riding time falls within the preset time interval, and construct a reservation list queue set corresponding to the preset time interval;
and the allocation module 330 is configured to allocate the reservation list queues in the reservation list queue set to drivers that conform to a preset policy.
An embodiment of the present disclosure provides an electronic device, where the electronic device 400 includes a memory 420 and a processor 410, where the memory 420 is configured to store a computer program, and the processor 410 is configured to implement the network appointment scheduling method described in S201-S203 in fig. 1 when the computer program is executed.
One embodiment of the present disclosure provides a computer readable storage medium having a computer program stored thereon, which when executed by a processor, implements the network appointment scheduling method described in S201-S203 in fig. 1.
One embodiment of the present disclosure provides a computer program product, including a computer program, and instructions, which when executed by a processor, implement the network appointment order dispatching method described in S201-S203 in fig. 1.
In summary, the method, the device, the electronic equipment, the computer readable storage medium and the program product for dispatching the network appointment orders provided by the embodiments of the present disclosure map the appointment orders onto the directed graph, mine the relation between the appointment orders, the drivers and the appointment orders, and complete the reasonable allocation of all the appointment orders with the least driver capacity through the aggregation link on the appointment order graph, thereby solving the problem of the prior ordered type waste of transportation resources in the appointment order dispatching process.
It will be clear to those skilled in the art that, for convenience and brevity of description, the specific operation of the apparatus and modules described above may refer to the corresponding description in the foregoing apparatus embodiments, which is not repeated here.
While the subject matter described herein is provided in the general context of operating systems and application programs that execute in conjunction with the execution of a computer system, those skilled in the art will recognize that other implementations may also be performed in combination with other types of program modules. Generally, program modules include routines, programs, components, data structures, and other types of structures that perform particular tasks or implement particular abstract data types. Those skilled in the art will appreciate that the subject matter described herein may be practiced with other computer system configurations, including hand-held devices, multiprocessor systems, microprocessor-based or programmable consumer electronics, minicomputers, mainframe computers, and the like, as well as distributed computing environments that have tasks performed by remote processing devices that are linked through a communications network. In a distributed computing environment, program modules may be located in both local and remote memory storage devices.
Those of ordinary skill in the art will appreciate that the elements and method steps of the examples described in connection with the embodiments disclosed herein can be implemented as electronic hardware, or as a combination of computer software and electronic hardware. Whether such functionality is implemented as hardware or software depends upon the particular application and design constraints imposed on the solution. Skilled artisans may implement the described functionality in varying ways for each particular application, but such implementation decisions should not be interpreted as causing a departure from the scope of the present disclosure.
It is to be understood that the above-described embodiments of the present disclosure are merely illustrative or explanatory of the principles of the disclosure and are not restrictive of the disclosure. Accordingly, any modifications, equivalent substitutions, improvements, or the like, which do not depart from the spirit and scope of the present disclosure, are intended to be included within the scope of the present disclosure. Furthermore, the appended claims of this disclosure are intended to cover all such changes and modifications that fall within the scope and boundary of the appended claims, or the equivalents of such scope and boundary.

Claims (10)

1. The method for dispatching the network appointment list of the vehicle appointment is characterized by comprising the following steps of:
acquiring reservation list information of a network appointment vehicle, and constructing a reservation list directed graph based on the sequence of riding time points in the reservation list information;
in the reservation list directed graph, acquiring a reservation list of the riding time falling in a preset time interval for each preset time interval, and constructing a reservation list queue set corresponding to the preset time interval;
and allocating the reservation list queues in the reservation list queue set to drivers conforming to a preset strategy.
2. The method of claim 1, wherein constructing a reservation sheet directed graph comprises:
and connecting each reservation list as a vertex, connecting reservation list vertices by taking the sequence of the reservation list riding time points as directed edges, defining the driving time between adjacent reservation lists as the weight of the directed edges between the vertices, and constructing a reservation list directed graph.
3. The method of claim 2, wherein the adjacent reservation list refers to:
and if the distance between the first reservation list end point and the second reservation list start point in the two reservation lists is smaller than a preset threshold value, the first reservation list and the second reservation list form an adjacent reservation list.
4. The method of claim 1, wherein the constructing a set of reservation list queues corresponding to the preset time interval comprises:
for each preset time interval, constructing a reservation list queue set corresponding to the preset time interval, initializing the reservation list queue set, enabling the reservation list queue set to contain a first reservation list queue and enabling the first reservation list queue to be empty;
acquiring a first vertex with zero arrival degree in the reservation list directed graph, determining a preset time interval of the riding time of the reservation list represented by the first vertex, searching a second vertex connected with the first vertex in a reservation list queue set corresponding to the preset time interval, inserting the first vertex into the queue tail of the searched reservation list queue of the first and second vertices if a plurality of second vertices exist, creating a second reservation list queue in the reservation list queue set and making the second reservation list queue empty if the second vertex does not exist, inserting the second vertex into the queue tail of the second reservation list queue, and deleting the first vertex and the directed edge connected with the first vertex in the reservation list directed graph;
and repeating the previous step until all vertexes on the reservation list directed graph are traversed.
5. The method of claim 4, wherein the preset policy refers to:
sequencing the drivers waiting for dispatch in a driver queue corresponding to the time interval of the drivers on duty;
collecting a reservation list needing to be dispatched in preset time, and distributing the reservation list to a reservation list queue set corresponding to each preset time interval;
and distributing the reservation list queues in the reservation list queue set corresponding to each preset time interval to a first driver meeting preset conditions in the driver queues corresponding to the preset time intervals.
6. The method of claim 5, wherein the ordering drivers in a driver queue corresponding to a driver on-duty time interval comprises:
and sequencing the amount of the reserved list running water in the preset period of the driver history in a driver queue corresponding to the time interval of the driver working according to the order from small to large.
7. The method of claim 6, wherein the preset conditions include:
the driver services the total time of day for no more than 8 hours.
8. The utility model provides a network about car reservation list send single device which characterized in that includes:
the first construction module is used for acquiring reservation list information of the network appointment, and constructing a reservation list directed graph based on the sequence of riding time points in the reservation list information;
the second construction module is used for acquiring a reservation list of which the riding time falls in a preset time interval for each preset time interval in the reservation list directed graph, and constructing a reservation list queue set corresponding to the preset time interval;
and the allocation module is used for allocating the reservation list queues in the reservation list queue set to drivers conforming to a preset strategy.
9. An electronic device, characterized in that: comprising a memory and a processor, wherein the memory is configured to store,
the memory is used for storing a computer program;
the processor being adapted to implement the method according to any of claims 1-7 when executing the computer program.
10. A computer program product comprising a computer program, instructions which, when executed by a processor, implement the method according to any of claims 1-7.
CN202310295265.8A 2023-03-23 2023-03-23 Method and device for dispatching network appointment orders and electronic equipment Pending CN116136973A (en)

Priority Applications (1)

Application Number Priority Date Filing Date Title
CN202310295265.8A CN116136973A (en) 2023-03-23 2023-03-23 Method and device for dispatching network appointment orders and electronic equipment

Applications Claiming Priority (1)

Application Number Priority Date Filing Date Title
CN202310295265.8A CN116136973A (en) 2023-03-23 2023-03-23 Method and device for dispatching network appointment orders and electronic equipment

Publications (1)

Publication Number Publication Date
CN116136973A true CN116136973A (en) 2023-05-19

Family

ID=86334410

Family Applications (1)

Application Number Title Priority Date Filing Date
CN202310295265.8A Pending CN116136973A (en) 2023-03-23 2023-03-23 Method and device for dispatching network appointment orders and electronic equipment

Country Status (1)

Country Link
CN (1) CN116136973A (en)

Similar Documents

Publication Publication Date Title
CN112270135B (en) Intelligent distribution method, device and equipment for logistics dispatching and storage medium
CN108182109B (en) Workflow scheduling and data distribution method in cloud environment
CN113222305B (en) Order scheduling method, order scheduling device, storage medium and electronic equipment
CN111950870B (en) Method and system for scheduling data transmission resources of day foundation measurement and control in an integrated manner according to needs
CN110826968B (en) Urban crowdsourcing distribution task optimal scheduling method based on path planning
CN109598401B (en) Vehicle scheduling method, device, equipment and storage medium thereof
CN109816128B (en) Method, device and equipment for processing network taxi appointment orders and readable storage medium
CN112529487B (en) Vehicle scheduling method, device and storage medium
CN111178686B (en) Distribution method and device of network appointment vehicles, electronic equipment and storage medium
CN111369137A (en) Distribution method, distribution device, server and storage medium of distribution tasks
CN111776896B (en) Elevator dispatching method and device
CN114780244A (en) Container cloud resource elastic allocation method and device, computer equipment and medium
CN115271556A (en) Robot task scheduling method and device, readable storage medium and electronic equipment
CN106407007B (en) Cloud resource configuration optimization method for elastic analysis process
CN113033971B (en) Server, and waybill scheduling method, medium and device of delivery robot
CN111832872A (en) Vehicle scheduling method and device, electronic equipment and storage medium
CN117032937B (en) Task scheduling method based on GPU, electronic device and storage medium
JP6914298B2 (en) Systems and programs that manage vehicle allocation
CN116136973A (en) Method and device for dispatching network appointment orders and electronic equipment
CN116739315A (en) Door and window order dispatching method and device, electronic equipment and storage medium
US8087028B2 (en) Computing device resource scheduling
CN113793195B (en) Network about vehicle order processing method and device, computer equipment and readable storage medium
CN110782113B (en) Charging scheduling method and device, electronic equipment and computer readable storage medium
CN112465178B (en) Vehicle planning method and storage medium
CN117421109B (en) Training task scheduling method and device, computer equipment and storage medium

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