CN114926068A - Network taxi appointment scheduling method and device - Google Patents

Network taxi appointment scheduling method and device Download PDF

Info

Publication number
CN114926068A
CN114926068A CN202210617163.9A CN202210617163A CN114926068A CN 114926068 A CN114926068 A CN 114926068A CN 202210617163 A CN202210617163 A CN 202210617163A CN 114926068 A CN114926068 A CN 114926068A
Authority
CN
China
Prior art keywords
saturation
hot area
target hot
driver
main 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
CN202210617163.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.)
Guangzhou Chenqi Travel Technology Co Ltd
Original Assignee
Guangzhou Chenqi Travel Technology 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 Guangzhou Chenqi Travel Technology Co Ltd filed Critical Guangzhou Chenqi Travel Technology Co Ltd
Priority to CN202210617163.9A priority Critical patent/CN114926068A/en
Publication of CN114926068A publication Critical patent/CN114926068A/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/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
    • G—PHYSICS
    • G06—COMPUTING; CALCULATING OR COUNTING
    • G06F—ELECTRIC DIGITAL DATA PROCESSING
    • G06F16/00—Information retrieval; Database structures therefor; File system structures therefor
    • G06F16/90—Details of database functions independent of the retrieved data types
    • G06F16/95—Retrieval from the web
    • G06F16/953—Querying, e.g. by the use of web search engines
    • G06F16/9535—Search customisation based on user profiles and personalisation
    • G—PHYSICS
    • G06—COMPUTING; CALCULATING OR COUNTING
    • G06F—ELECTRIC DIGITAL DATA PROCESSING
    • G06F16/00—Information retrieval; Database structures therefor; File system structures therefor
    • G06F16/90—Details of database functions independent of the retrieved data types
    • G06F16/95—Retrieval from the web
    • G06F16/953—Querying, e.g. by the use of web search engines
    • G06F16/9537—Spatial or temporal dependent retrieval, e.g. spatiotemporal queries
    • 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
    • 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

  • Engineering & Computer Science (AREA)
  • Business, Economics & Management (AREA)
  • Theoretical Computer Science (AREA)
  • Databases & Information Systems (AREA)
  • Physics & Mathematics (AREA)
  • General Physics & Mathematics (AREA)
  • Human Resources & Organizations (AREA)
  • Strategic Management (AREA)
  • Economics (AREA)
  • General Business, Economics & Management (AREA)
  • Marketing (AREA)
  • Entrepreneurship & Innovation (AREA)
  • Tourism & Hospitality (AREA)
  • Finance (AREA)
  • Development Economics (AREA)
  • General Engineering & Computer Science (AREA)
  • Accounting & Taxation (AREA)
  • Data Mining & Analysis (AREA)
  • Educational Administration (AREA)
  • Quality & Reliability (AREA)
  • Operations Research (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 invention discloses a network taxi appointment scheduling method and a device, comprising the following steps: acquiring a hotspot searching request at a driver end, and searching a main target hotspot hitting the hotspot searching request; acquiring the current order quantity and the current driver end quantity of a main target hotspot, and calculating the current driver saturation of the main target hotspot; if the current driver saturation of the main target hotspot is within the saturation threshold, pushing the main target hotspot to a driver end; and if the current driver saturation of the main target hot area exceeds the saturation threshold, searching a secondary target hot area, of which the current driver saturation is within the saturation threshold, near the main target hot area according to a preset grading strategy, and pushing the secondary target hot area to a driver end. By introducing the current driver saturation judging factor, the supply and demand relationship between the passenger end riding demand and the driver end order quantity demand of the main target hot area and the secondary target hot area can be accurately reflected, so that the driver can be reasonably dispatched between the cold area and the hot area, and the problem of unbalance between the driver quantity and the order quantity is effectively solved.

Description

Network appointment scheduling method and device
Technical Field
The invention belongs to the technical field of network taxi appointment, and particularly relates to a network taxi appointment scheduling method and device.
Background
In the field of network appointment, in order to take the riding requirements of a passenger end and the order quantity requirements of a driver end into consideration, a network appointment platform divides a map into a hot area and a cold area based on the current order quantity, the order quantity in the hot area is large, and the order quantity in the cold area is small. Because there is a threshold limit to the distance between the current position of the driver and the place where the order begins when the driver is rushing to place the order and dispatching the order to the driver, the order in the hot zone can only be obtained when the driver is located in the hot zone.
Generally, drivers tend to go to a hot area to wait for orders before dispatching or robbing orders in order to obtain more orders, and the number of orders in the hot area is limited, so that the phenomenon of driver bunching is easy to occur, a large number of drivers in the hot area cannot receive new orders in a short time, and in other hot areas or cold areas, the number of drivers is insufficient, and the passenger end cannot be matched to a proper driver end in a short time, so that the problem of insufficient transportation capacity is caused.
Disclosure of Invention
The invention aims to solve the technical problems and provides a network taxi appointment scheduling method and device.
In order to solve the problems, the invention is realized according to the following technical scheme:
in a first aspect, the invention provides a network taxi appointment scheduling method, which comprises the following steps:
acquiring a hotspot search request of a driver end, and searching a main target hotspot hitting the hotspot search request;
acquiring the current order number and the current driver end number of the main target hot area, and calculating the current driver saturation of the main target hot area; the current driver saturation is equal to the current order quantity/the current driver end quantity;
if the current driver saturation of the main target hot area is within the saturation threshold, pushing the main target hot area to a driver end; and if the current driver saturation of the main target hot area exceeds the saturation threshold, searching a secondary target hot area, of which the current driver saturation is within the saturation threshold, near the main target hot area according to a preset grading strategy, and pushing the secondary target hot area to a driver end.
With reference to the first aspect, the present invention further provides a 1 st implementation manner of the first aspect, where searching for a secondary target hotspot where a current driver saturation near the primary target hotspot is within a saturation threshold according to a preset ranking policy specifically includes:
acquiring a hot zone distribution map near a main target hot zone, wherein the hot zone distribution map is provided with a preset grading strategy;
and gradually searching the network car-booking hot areas in the hot area distribution diagram by taking the main target hot area as a center, and detecting the saturation of the network car-booking hot areas until the network car-booking hot areas with the current driver saturation within the saturation threshold value are searched and used as the secondary target hot areas.
With reference to the first aspect, the present invention further provides a 2 nd implementation manner of the first aspect, wherein the preset ranking policy is obtained by:
and the center of the main target hot zone is taken as the center of a circle, and the preset distance is taken as the radius to define the grade of the hot zone step by step.
With reference to the first aspect, the present invention further provides a third implementation manner of the first aspect, where before the pushing the primary target hotspot or the secondary target hotspot to the driver, the method further includes:
acquiring historical driver saturation of a main target hot area or a secondary target hot area in a preset time period on the basis of a current time node;
if the historical driver saturation is within the saturation threshold, pushing the main target hot area or the secondary target hot area to a driver end; and if the historical driver saturation exceeds the saturation threshold, searching a nearby secondary target hot area according to a preset grading strategy.
With reference to the first aspect, the present invention further provides a 4 th implementation manner of the first aspect, before the pushing the primary target hotspot or the secondary target hotspot to the driver end, the method further includes:
acquiring the total amount of historical newly-added orders and the total amount of historical newly-added drivers of the main target hot area or the secondary target hot area in a preset time period on the basis of the current time node;
calculating the estimated saturation of the main target hot area or the secondary target hot area, wherein the estimated saturation is (the total amount of the newly added historical orders + the current order number)/(the total amount of the newly added historical server side + the current server side number);
if the estimated saturation is within the saturation threshold, pushing the main target hot area or the secondary target hot area to a driver end; and if the estimated saturation exceeds the saturation threshold, searching for a nearby secondary target hot area according to a preset grading strategy.
In a second aspect, the present invention provides a network appointment scheduling apparatus, including:
the main target hot area searching module is used for acquiring a hot area searching request from a driver end and searching a main target hot area which hits the hot area searching request;
the current driver saturation calculation module is used for acquiring the current order number and the current driver end number of the main target hotspot and calculating the current driver saturation of the main target hotspot; the current driver saturation is equal to the current order quantity/the current driver end quantity;
the hot zone pushing module is used for pushing the main target hot zone to the driver end if the current driver saturation of the main target hot zone is within the saturation threshold; and if the current driver saturation of the main target hotspot exceeds the saturation threshold, searching a secondary target hotspot with the current driver saturation within the saturation threshold near the main target hotspot according to a preset grading strategy, and pushing the secondary target hotspot to a driver end.
With reference to the second aspect, the present invention further provides a 1 st implementation manner of the second aspect, where the hot zone pushing module is further provided with a secondary target hot zone searching unit, and the secondary target hot zone searching unit specifically executes:
acquiring a hot zone distribution diagram near a main target hot zone, wherein the hot zone distribution diagram is provided with a preset grading strategy;
and searching the network car-booking hot areas in the hot area distribution diagram step by taking the main target hot area as a center, and detecting the saturation of the network car-booking hot areas until the network car-booking hot areas with the current driver saturation within the saturation threshold value are searched as secondary target hot areas.
In combination with the second aspect, the present invention further provides a 2 nd implementation manner of the second aspect, wherein the preset ranking strategy is obtained by:
and the center of the main target hot area is taken as the center of a circle, and the preset distance is taken as the radius to define the grade of the hot area step by step.
With reference to the second aspect, the present invention further provides a 3 rd implementation manner of the second aspect, where a first hot zone pushing unit is disposed in the hot zone pushing module, and the first hot zone pushing unit specifically executes:
acquiring historical driver saturation of a main target hot area or a secondary target hot area in a preset time period on the basis of the current time node;
if the historical driver saturation is within the saturation threshold, pushing the main target hot area or the secondary target hot area to a driver end; and if the historical driver saturation exceeds the saturation threshold, searching a nearby secondary target hot area according to a preset grading strategy.
With reference to the second aspect, the present invention further provides a 4 th implementation manner of the second aspect, where a second hot zone pushing unit is disposed in the hot zone pushing module, and the second hot zone pushing unit specifically executes:
acquiring the total quantity of historical newly-added orders and the total quantity of historical newly-added driver sides of the main target hot area or the secondary target hot area in a preset time period on the basis of the current time node;
calculating the estimated saturation of the main target hot area or the secondary target hot area, wherein the estimated saturation is (total amount of the historical newly-added orders + current order number)/(total amount of the historical newly-added driver end + current driver end number);
if the estimated saturation is within the saturation threshold, pushing the main target hot area or the secondary target hot area to a driver end; and if the estimated saturation exceeds the saturation threshold, searching for a nearby secondary target hot area according to a preset grading strategy.
Compared with the prior art, the invention has the beneficial effects that:
in the embodiment of the application, the current driver saturation degree judgment factor is introduced, so that the supply and demand relation between the passenger end riding demand of the main target hot area and the passenger end riding demand of the secondary target hot area and the driver end order quantity demand can be accurately reflected, the driver can be conveniently and reasonably dispatched between the cold area and the hot area, and the problem of unbalance between the driver quantity and the order quantity is effectively solved.
Drawings
Embodiments of the invention are described in further detail below with reference to the attached drawing figures, wherein:
FIG. 1 is a schematic flow chart diagram of a network taxi appointment scheduling method of the present invention;
fig. 2 is a schematic structural diagram of the network appointment scheduling device of the present invention.
Detailed Description
The preferred embodiments of the present invention will be described in conjunction with the accompanying drawings, and it should be understood that they are presented herein only to illustrate and explain the present invention and not to limit the present invention.
Preferred embodiments of the present disclosure will be described in more detail below with reference to the accompanying drawings. While the preferred embodiments of the present disclosure are shown in the drawings, it should be understood that the present disclosure may be embodied in various forms and should not be limited to the embodiments set forth herein. Rather, these embodiments are provided so that this disclosure will be thorough and complete, and will fully convey the scope of the disclosure to those skilled in the art.
The term "including" and variations thereof as used herein is intended to be open-ended, i.e., "including but not limited to". Unless specifically stated otherwise, the term "or" means "and/or". The term "based on" means "based at least in part on". The terms "one example embodiment" and "one embodiment" mean "at least one example embodiment". The term "another embodiment" means "at least one additional embodiment". The terms "first," "second," and the like may refer to different or the same object. Other explicit and implicit definitions are also possible below.
The network taxi appointment has two modes of obtaining orders, wherein one mode is that the network taxi appointment platform directly sends orders to a driver, and the other mode is that the driver end snatches orders on the network taxi appointment platform. In order to give consideration to the riding demand of a passenger end and the order quantity demand of a driver end, a network booking platform divides a map into a hot area and a cold area based on the current order quantity, the order quantity in the hot area is large, the order quantity in the cold area is small, the distance between the current position of a driver and the order starting place is limited by a threshold value, the order in the hot area can be obtained only when the driver is located in the hot area, and the driver end needs to drive the vehicle to the hot area to obtain more orders.
In the prior art, when a plurality of hot areas exist in a map, a driver usually drives directly to the nearest hot area or drives to the hot area with the largest amount of orders, and when a part of the hot areas reach the highest point of the amount of orders during inquiry of the driver, the hot areas become cold areas, so that a large number of drivers cannot obtain new orders in a short time, and transport capacity is wasted. The orders in other hot or cold areas are increased on the way for the driver to go to the destination hot area, which is likely to cause a lot of drivers to be piled in the same hot area and the capacity of other hot areas is insufficient.
Example 1
As shown in fig. 1, the network appointment scheduling method according to the present invention includes:
step S1: acquiring a hotspot searching request at a driver end, and searching and hitting a main target hotspot of the hotspot searching request;
step S2: acquiring the current order quantity and the current driver end quantity of a main target hotspot, and calculating the current driver saturation of the main target hotspot; the current driver saturation is equal to the current order quantity/the current driver end quantity;
step S3: if the current driver saturation of the main target hotspot is within the saturation threshold, pushing the main target hotspot to a driver end; and if the current driver saturation of the main target hot area exceeds the saturation threshold, searching a secondary target hot area, of which the current driver saturation is within the saturation threshold, near the main target hot area according to a preset grading strategy, and pushing the secondary target hot area to a driver end.
In the embodiment, the current driver saturation judging factor is introduced, so that the supply and demand relation between the passenger end riding demand and the driver end order quantity demand of the main target hotspot and the secondary target hotspot can be accurately reflected, the driver can be reasonably dispatched between the cold area and the hotspot conveniently, and the problem of unbalance between the driver quantity and the order quantity is effectively solved.
Step S1: and acquiring a hotspot search request at a driver end, and searching and hitting a main target hotspot of the hotspot search request.
The driver can install the driver end APP of net car booking platform on mobile device, sends the hot area search command through the hot area search module at APP, and APP can acquire the longitude and latitude coordinate of mobile device automatically to send the net car booking platform with this longitude and latitude coordinate as driver's current coordinate.
The hotspot search command generally comprises two forms, one is a hotspot search command without a reference place, and the hotspot search command is usually presented as a shortcut key for searching a nearby network car-booking hotspot on the APP, and a driver can directly press the shortcut key to send the hotspot search command, and at the moment, a network car-booking platform searches for a nearest network car-booking hotspot by taking the current coordinate of the driver as a center to serve as a main target hotspot. The other is a hot area searching command with a reference place, a driver can input the name or the address of the reference place in a searching box, an APP can call an electronic map and mark the reference place in the electronic map, the electronic map is presented on an APP interface, the driver can control the electronic map to zoom in or out so as to conveniently check the reference place and surrounding buildings, whether the position of the reference place is correct is confirmed, if the reference place is correct, the driver can quit the electronic map interface, a 'confirmation' key on the APP is clicked to send the hot area searching command, a network car-booking platform takes the reference place as the center, a network car-booking platform which is closest to the reference object is searched by taking the reference place as the center, and a network car-booking hot area which is closest to the reference object is searched as a main target hot area; if the reference location is wrong, the driver needs to input the reference location again in the search box, or directly call the electronic map and click a certain location on the electronic map as the reference location.
Step S2: acquiring the current order quantity and the current driver end quantity of a main target hotspot, and calculating the current driver saturation of the main target hotspot; current driver saturation is current order quantity/current driver end quantity.
After the main target hot area is selected, the network taxi booking platform needs to acquire the current order number of the selected main target hot area and the current driver end number located in the main target hot area, the current driver saturation of the main target hot area can be calculated through a preset formula, and the current driver saturation is sent to an APP at the driver end. The current order number is the total number of orders which are not matched with the driver end and are in the process in the main target hot area in the current time period; when the driver side APP is opened and operated, the network booking platform can acquire the current coordinate data of the driver side in real time, if the current coordinate of the driver side is located in the main target hot area, the driver is determined to be located in the main target hot area, and the current driver side number in the main target hot area can be acquired.
Step S3: if the current driver saturation of the main target hot area is within the saturation threshold, pushing the main target hot area to a driver end; and if the current driver saturation of the main target hot area exceeds the saturation threshold, searching a secondary target hot area, of which the current driver saturation is within the saturation threshold, near the main target hot area according to a preset grading strategy, and pushing the secondary target hot area to a driver end.
And comparing the current driver saturation data with a saturation threshold, if the current driver saturation is within the saturation threshold, indicating that the number of orders in the main target hot area is too large, and at the moment, introducing the driver end to digest the orders, and if the current driver saturation exceeds the saturation threshold, indicating that the number of the driver ends in the main target hot area is too large, and additionally finding a secondary target hot area within the saturation threshold to push the secondary target hot area to the driver end.
In a preferred embodiment, the searching for the secondary target hotspot where the current driver saturation near the primary target hotspot is within the saturation threshold according to the preset grading strategy specifically includes:
step S301: acquiring a hot zone distribution diagram near a main target hot zone, wherein the hot zone distribution diagram is provided with a preset grading strategy;
step S302: and searching the network car-booking hot areas in the hot area distribution diagram step by taking the main target hot area as a center, and detecting the saturation of the network car-booking hot areas until the network car-booking hot areas with the current driver saturation within the saturation threshold value are searched as secondary target hot areas.
In step S301 and step S302, a hotspot distribution map is established with the main target hotspot as the center, polygonal grids are fully laid in the hotspot distribution map, preferably, hexagonal grids are selected in this embodiment, the longitude and latitude of the polygonal grids in the hotspot distribution map are coded according to the urban building distribution, codes with different digits can be set according to different grid schedules, and the longitude and latitude coordinate codes of the same polygonal grid are the same. Some hotspots have larger areas, such as schools, or large hospitals, which occupy multiple polygonal meshes in the hotspot pattern, which may be provided with the same code. In the hotspot distribution map, the darker the color of a polygon mesh, the closer to red, the more orders indicating the area are, the more hot the area is, the lighter the color is, the less orders indicating the area is, the cold the area is, and the color of each polygon mesh is the same.
And in the hotspot distribution diagram, the hotspots are arranged in a grading manner according to a preset grading strategy, the closer to the main target hotspot, the higher the grade is, the hotspots in the hotspot distribution diagram are searched step by step until the network taxi appointment hotspot with the current driver saturation within the saturation threshold is found out and is used as a secondary target hotspot, and the network taxi appointment hotspot is pushed to a driver end.
The preset grading strategy can be obtained by the following method: and the center of the main target hot area is taken as the center of a circle, and the preset distance is taken as the radius to define the grade of the hot area step by step. And taking the center of the polygonal grid where the main target hot area is located as the center of a circle, and grading the polygonal grids around the main target hot area according to a preset distance. For example, the preset distance is 1KM, a circular area is established by the radius 1KM, all polygonal meshes in the circular area with the radius 1KM are set to be in a first grade, all polygonal meshes in the annular area with the radius 1KM and the radius 1KM are set to be in a second grade, and so on, the farther away from the main target hot area, the lower the grade of the polygonal meshes is.
In a preferred embodiment, based on historical data, hotspots in the hotspot profile are weighted, with higher weights indicating a greater number of orders in the hotspot history, such as hotspots containing subway stations, office buildings, etc. Firstly, setting a grading strategy according to a preset distance, and then re-determining the boundary of the grade according to the weight value. If the sum of the weights of the hot areas is still lower than the preset value within the preset distance, the range of the grade is continuously expanded until the sum of the weights of the hot areas is equal to or greater than the preset value, so that the hot areas with sufficient quota exist in each grade range, and the proper secondary target hot area can be conveniently and quickly searched.
In a preferred embodiment, before pushing the primary target hotspot or the secondary target hotspot to the driver end, the method further comprises the following steps:
step S4: acquiring historical driver saturation of a main target hot area or a secondary target hot area in a preset time period on the basis of a current time node;
step S5: if the historical driver saturation is within the saturation threshold, pushing the main target hot area or the secondary target hot area to a driver end; and if the historical driver saturation exceeds the saturation threshold, searching a nearby secondary target hot area according to a preset grading strategy.
In step S4 and step S5, the driver usually selects one or some hot zone for order taking due to distance and historical experience, and does not go to another hot zone for order taking, and the order amount of a certain hot zone is usually not changed greatly according to life experience and under the condition that no unexpected events occur. In a certain time period, a hot zone is in a saturation state in a historical record for a long time, and then the hot zone is saturated in the same day; conversely, if the hotspot is left unsaturated for a long time in the history, drivers in other hotspots often have difficulty knowing the amount of orders in the hotspot and going to the hotspot to obtain orders, so that the driver saturation in a future time period on the day can be relatively accurately estimated by using historical driver saturation data.
The driver saturation data in the history record is used for estimating the saturation of the hot area in the future time period, and the order number in the time period fluctuates at a fixed value according to the living node, such as the early peak of work, and is generally not too much or too little because the driver needs a certain time to go to the target hot area from the current position. Whether saturation will occur in the future time period is presumed by historical driver saturation.
In another embodiment, before pushing the primary target hotspot or the secondary target hotspot to the driver end, the method further comprises:
step S6: acquiring the total amount of historical newly-added orders and the total amount of historical newly-added drivers of the main target hot area or the secondary target hot area in a preset time period on the basis of the current time node;
step S7: calculating the estimated saturation of the main target hot area or the secondary target hot area, wherein the estimated saturation is (the total amount of the newly added historical orders + the current order number)/(the total amount of the newly added historical server side + the current server side number);
step S8: if the estimated saturation is within the saturation threshold, pushing the main target hot area or the secondary target hot area to a driver end; and if the estimated saturation exceeds the saturation threshold, searching for a nearby secondary target hot area according to a preset grading strategy.
In steps S6 to S8, according to the daily life experience, in the case of an unexpected emergency, the number of new orders in a certain time period fluctuates around a fixed value, and the shorter the number of adjacent days, the smaller the fluctuation value. For example, during the morning peak work, the number of people who select to have a net appointment and work is usually the same wave person, but people who select subways, buses and single vehicles do not change vehicles at will, and the total amount of orders generated by the passengers usually fluctuates within a certain range and does not change greatly. The total amount of the historical newly-added orders and the total amount of the historical newly-added driver ends in the preset time period are obtained, the saturation data in the future time period of the day can be accurately estimated through the calculation formula for estimating the saturation, and the accuracy of driver scheduling is improved.
In summary, when the method is executed, on one hand, the supply and demand relationship between the passenger end riding demand and the driver end order quantity demand of the main target hot area and the secondary target hot area can be accurately reflected by introducing the current driver saturation degree judgment factor, so that the driver can be reasonably dispatched between the cold area and the hot area, and the problem of unbalance between the driver quantity and the order quantity is effectively solved; on the other hand, the hot zone distribution diagram is classified by setting a preset classification strategy, and hot zones in the hot zone distribution diagram can be reasonably classified by combining the polygonal grids and the hot zone weights, so that the secondary target hot zones meeting the requirements can be quickly searched.
Other steps of the network appointment scheduling method according to the embodiment are shown in the prior art.
Example 2
In a second aspect, as shown in fig. 2, the present invention discloses a network appointment scheduling apparatus, which includes a main target hot zone searching module M1, a current driver saturation calculating module M2, and a hot zone pushing module M3.
The main target hot zone searching module M1 is configured to obtain a hot zone search request from a driver, and search for a main target hot zone that hits the hot zone search request;
the current driver saturation calculation module M2 is configured to obtain a current order quantity and a current driver end quantity of the main target hotspot, and calculate a current driver saturation of the main target hotspot; the current driver saturation is equal to the current order quantity/the current driver end quantity;
the hot zone pushing module M3 is used for pushing the main target hot zone to the driver end if the current driver saturation of the main target hot zone is within the saturation threshold; and if the current driver saturation of the main target hotspot exceeds the saturation threshold, searching a secondary target hotspot with the current driver saturation within the saturation threshold near the main target hotspot according to a preset grading strategy, and pushing the secondary target hotspot to a driver end.
For the second aspect, the method further includes a 1 st preferred implementation, where the hot zone pushing module is further provided with a secondary target hot zone searching unit, and the secondary target hot zone searching unit specifically executes:
acquiring a hot zone distribution diagram near a main target hot zone, wherein the hot zone distribution diagram is provided with a preset grading strategy;
and searching the network car-booking hot areas in the hot area distribution diagram step by taking the main target hot area as a center, and detecting the saturation of the network car-booking hot areas until the network car-booking hot areas with the current driver saturation within the saturation threshold value are searched as secondary target hot areas.
For the second aspect, further comprising a 2 nd preferred implementation, the preset ranking strategy may be obtained by:
and the center of the main target hot area is taken as the center of a circle, and the preset distance is taken as the radius to define the grade of the hot area step by step.
For the second aspect, the method further includes a 3 rd preferred implementation, where a first hot zone pushing unit is disposed in the hot zone pushing module, and the first hot zone pushing unit specifically executes:
acquiring historical driver saturation of a main target hot area or a secondary target hot area in a preset time period on the basis of a current time node;
if the historical driver saturation is within the saturation threshold, pushing the main target hot area or the secondary target hot area to a driver end; and if the historical driver saturation exceeds the saturation threshold, searching a nearby secondary target hot area according to a preset grading strategy.
For the second aspect, the method further includes a 4 th preferred implementation, where a second hot zone pushing unit is disposed in the hot zone pushing module, and the second hot zone pushing unit specifically executes:
acquiring the total quantity of historical newly-added orders and the total quantity of historical newly-added driver sides of the main target hot area or the secondary target hot area in a preset time period on the basis of the current time node;
calculating the estimated saturation of the main target hot area or the secondary target hot area, wherein the estimated saturation is (the total amount of the newly added historical orders + the current order number)/(the total amount of the newly added historical server side + the current server side number);
if the estimated saturation is within the saturation threshold, pushing the main target hot area or the secondary target hot area to a driver end; and if the estimated saturation exceeds the saturation threshold, searching a nearby sub-target hot area according to a preset grading strategy.
In summary, when the device of the present embodiment operates, all steps of the network appointment scheduling method described in embodiment 1 can be implemented, so as to achieve the technical effect achieved in embodiment 1.
Other structures of the network appointment scheduling device described in the embodiment are referred to in the prior art.
Example 3
The invention also discloses an electronic device, at least one processor and a memory communicatively connected with the at least one processor, wherein the memory stores instructions executable by the at least one processor, the instructions are executed by the at least one processor, and when the at least one processor executes the instructions, the following steps are specifically realized:
acquiring a hotspot searching request at a driver end, and searching and hitting a main target hotspot of the hotspot searching request;
acquiring the current order number and the current driver end number of the main target hot area, and calculating the current driver saturation of the main target hot area; the current driver saturation is equal to the current order quantity/the current driver end quantity;
if the current driver saturation of the main target hot area is within the saturation threshold, pushing the main target hot area to a driver end; and if the current driver saturation of the main target hotspot exceeds the saturation threshold, searching a secondary target hotspot with the current driver saturation within the saturation threshold near the main target hotspot according to a preset grading strategy, and pushing the secondary target hotspot to a driver end.
Example 4
The invention also discloses a storage medium, which stores a computer program, and when the computer program is executed by a processor, the following steps are concretely realized:
acquiring a hotspot search request of a driver end, and searching a main target hotspot hitting the hotspot search request;
acquiring the current order number and the current driver end number of the main target hot area, and calculating the current driver saturation of the main target hot area; the current driver saturation is equal to the current order quantity/the current driver end quantity;
if the current driver saturation of the main target hotspot is within the saturation threshold, pushing the main target hotspot to a driver end; and if the current driver saturation of the main target hot area exceeds the saturation threshold, searching a secondary target hot area, of which the current driver saturation is within the saturation threshold, near the main target hot area according to a preset grading strategy, and pushing the secondary target hot area to a driver end.
The present disclosure may be methods, apparatus, systems, and/or computer program products. The computer program product may include a computer-readable storage medium having computer-readable program instructions embodied thereon for carrying out various aspects of the present disclosure.
The computer readable storage medium may be a tangible device that can hold and store the instructions for use by the instruction execution device. The computer readable storage medium may be, for example, but not limited to, an electronic, magnetic, optical, electromagnetic, semiconductor memory device, or any suitable combination of the foregoing. More specific examples (a non-exhaustive list) of the computer readable storage medium would include the following: a portable computer diskette, a hard disk, a Random Access Memory (RAM), a read-only memory (ROM), an erasable programmable read-only memory (EPROM or flash memory), a Static Random Access Memory (SRAM), a portable compact disc read-only memory (CD-ROM), a Digital Versatile Disc (DVD), a memory stick, a floppy disk, a mechanical coding device, such as punch cards or in-groove projection structures having instructions stored thereon, and any suitable combination of the foregoing. Computer-readable storage media as used herein is not to be construed as transitory signals per se, such as radio waves or other freely propagating electromagnetic waves, electromagnetic waves propagating through a waveguide or other transmission medium (e.g., optical pulses through a fiber optic cable), or electrical signals transmitted through electrical wires.
The computer-readable program instructions described herein may be downloaded from a computer-readable storage medium to a respective computing/processing device, or to an external computer or external storage device via a network, such as the internet, a local area network, a wide area network, and/or a wireless network. The network may include copper transmission cables, fiber optic transmission, wireless transmission, routers, firewalls, switches, gateway computers and/or edge servers. The network adapter card or network interface in each computing/processing device receives computer-readable program instructions from the network and forwards the computer-readable program instructions for storage in a computer-readable storage medium in the respective computing/processing device.
The computer program instructions for carrying out operations of the present disclosure may be assembler instructions, Instruction Set Architecture (ISA) instructions, machine-related instructions, microcode, firmware instructions, state setting data, or source or object code written in any combination of one or more programming languages, including an object oriented programming language such as Smalltalk, C + +, Java, or the like, as well as conventional procedural programming languages, such as the "C" programming language or similar programming languages. The computer-readable program instructions may execute entirely on the user's computer, partly on the user's computer, as a stand-alone software package, partly on the user's computer and partly on a remote computer or entirely on the remote computer or server. In the case of a remote computer, the remote computer may be connected to the user's computer through any type of network, including a Local Area Network (LAN) or a Wide Area Network (WAN), or the connection may be made to an external computer (for example, through the Internet using an Internet service provider). In some embodiments, the electronic circuitry that can execute the computer-readable program instructions implements aspects of the present disclosure by utilizing the state information of the computer-readable program instructions to personalize the electronic circuitry, such as a programmable logic circuit, a Field Programmable Gate Array (FPGA), or a Programmable Logic Array (PLA).
Having described embodiments of the present disclosure, the foregoing description is intended to be exemplary, not exhaustive, and not limited to the disclosed embodiments. Many modifications and variations will be apparent to those of ordinary skill in the art without departing from the scope and spirit of the described embodiments. The terminology used herein was chosen in order to best explain the principles of the embodiments, the practical application, or improvements to the technology in the marketplace, or to enable others of ordinary skill in the art to understand the embodiments disclosed herein.

Claims (10)

1. A network appointment scheduling method is characterized by comprising the following steps:
acquiring a hotspot searching request at a driver end, and searching and hitting a main target hotspot of the hotspot searching request;
acquiring the current order number and the current driver end number of the main target hot area, and calculating the current driver saturation of the main target hot area; the current driver saturation is equal to the current order quantity/the current driver end quantity;
if the current driver saturation of the main target hot area is within the saturation threshold, pushing the main target hot area to a driver end; and if the current driver saturation of the main target hot area exceeds the saturation threshold, searching a secondary target hot area, of which the current driver saturation is within the saturation threshold, near the main target hot area according to a preset grading strategy, and pushing the secondary target hot area to a driver end.
2. The method as claimed in claim 1, wherein searching for a secondary target hotspot with a current driver saturation within a saturation threshold near the primary target hotspot according to a preset hierarchical strategy comprises:
acquiring a hot zone distribution diagram near a main target hot zone, wherein the hot zone distribution diagram is provided with a preset grading strategy;
and gradually searching the network car-booking hot areas in the hot area distribution diagram by taking the main target hot area as a center, and detecting the saturation of the network car-booking hot areas until the network car-booking hot areas with the current driver saturation within the saturation threshold value are searched and used as the secondary target hot areas.
3. The network appointment scheduling method according to claim 2, wherein the preset grading strategy is obtained by:
and the center of the main target hot area is taken as the center of a circle, and the preset distance is taken as the radius to define the grade of the hot area step by step.
4. The method as claimed in claim 1, further comprising, before pushing the primary or secondary target hotspot to the driver's end:
acquiring historical driver saturation of a main target hot area or a secondary target hot area in a preset time period on the basis of the current time node;
if the historical driver saturation is within the saturation threshold, pushing the main target hot area or the secondary target hot area to a driver end; and if the historical driver saturation exceeds the saturation threshold, searching a nearby secondary target hot area according to a preset grading strategy.
5. The method as claimed in claim 1, further comprising, before pushing the primary or secondary target hotspot to the driver's end:
acquiring the total amount of historical newly-added orders and the total amount of historical newly-added drivers of the main target hot area or the secondary target hot area in a preset time period on the basis of the current time node;
calculating the estimated saturation of the main target hot area or the secondary target hot area, wherein the estimated saturation is (the total amount of the newly added historical orders + the current order number)/(the total amount of the newly added historical server side + the current server side number);
if the estimated saturation is within the saturation threshold, pushing the main target hot area or the secondary target hot area to a driver end; and if the estimated saturation exceeds the saturation threshold, searching for a nearby secondary target hot area according to a preset grading strategy.
6. A network taxi appointment scheduling device is characterized by comprising:
the main target hot area searching module is used for acquiring a hot area searching request from a driver end and searching a main target hot area which hits the hot area searching request;
the current driver saturation calculation module is used for acquiring the current order number and the current driver end number of the main target hotspot and calculating the current driver saturation of the main target hotspot; the current driver saturation is equal to the current order quantity/the current driver end quantity;
the hot zone pushing module is used for pushing the main target hot zone to the driver end if the current driver saturation of the main target hot zone is within the saturation threshold; and if the current driver saturation of the main target hot area exceeds the saturation threshold, searching a secondary target hot area, of which the current driver saturation is within the saturation threshold, near the main target hot area according to a preset grading strategy, and pushing the secondary target hot area to a driver end.
7. The device according to claim 6, wherein the hot zone push module further comprises a secondary target hot zone search unit, and the secondary target hot zone search unit specifically executes:
acquiring a hot zone distribution map near a main target hot zone, wherein the hot zone distribution map is provided with a preset grading strategy;
and gradually searching the network car-booking hot areas in the hot area distribution diagram by taking the main target hot area as a center, and detecting the saturation of the network car-booking hot areas until the network car-booking hot areas with the current driver saturation within the saturation threshold value are searched and used as the secondary target hot areas.
8. The network appointment scheduling device of claim 7, wherein the preset hierarchical strategy is obtained by the following method:
and the center of the main target hot zone is taken as the center of a circle, and the preset distance is taken as the radius to define the grade of the hot zone step by step.
9. The device according to claim 6, wherein the hot zone push module is provided with a first hot zone push unit, and the first hot zone push unit specifically executes:
acquiring historical driver saturation of a main target hot area or a secondary target hot area in a preset time period on the basis of a current time node;
if the historical driver saturation is within the saturation threshold, pushing the main target hot area or the secondary target hot area to a driver end; and if the historical driver saturation exceeds the saturation threshold, searching a nearby secondary target hot area according to a preset grading strategy.
10. The network appointment scheduling method according to claim 6, wherein a second hot zone pushing unit is provided in the hot zone pushing module, and the second hot zone pushing unit specifically performs:
acquiring the total amount of historical newly-added orders and the total amount of historical newly-added drivers of the main target hot area or the secondary target hot area in a preset time period on the basis of the current time node;
calculating the estimated saturation of the main target hot area or the secondary target hot area, wherein the estimated saturation is (total amount of the historical newly-added orders + current order number)/(total amount of the historical newly-added driver end + current driver end number);
if the estimated saturation is within the saturation threshold, pushing the main target hot area or the secondary target hot area to a driver end; and if the estimated saturation exceeds the saturation threshold, searching for a nearby secondary target hot area according to a preset grading strategy.
CN202210617163.9A 2022-06-01 2022-06-01 Network taxi appointment scheduling method and device Pending CN114926068A (en)

Priority Applications (1)

Application Number Priority Date Filing Date Title
CN202210617163.9A CN114926068A (en) 2022-06-01 2022-06-01 Network taxi appointment scheduling method and device

Applications Claiming Priority (1)

Application Number Priority Date Filing Date Title
CN202210617163.9A CN114926068A (en) 2022-06-01 2022-06-01 Network taxi appointment scheduling method and device

Publications (1)

Publication Number Publication Date
CN114926068A true CN114926068A (en) 2022-08-19

Family

ID=82812008

Family Applications (1)

Application Number Title Priority Date Filing Date
CN202210617163.9A Pending CN114926068A (en) 2022-06-01 2022-06-01 Network taxi appointment scheduling method and device

Country Status (1)

Country Link
CN (1) CN114926068A (en)

Similar Documents

Publication Publication Date Title
US9776512B2 (en) Methods, circuits, devices, systems and associated computer executable code for driver decision support
EP3886007A1 (en) Information processing method and information processing system
US20120259540A1 (en) Methods and systems for workforce management
US9988237B1 (en) Elevator management according to probabilistic destination determination
CN107766957A (en) A kind of recommendation method and device of lavatory
US20200210905A1 (en) Systems and Methods for Managing Networked Vehicle Resources
CN103761888A (en) Service system for looking for and booking parking spaces and obtaining car-related information through mobile phone terminal
CN109841054B (en) Method, device, equipment and storage medium for recommending boarding points
CN109102093B (en) Method and device for determining single hot spot area under taxi appointment and electronic equipment
Van Buuren et al. Ambulance dispatch center pilots proactive relocation policies to enhance effectiveness
CN112068544B (en) Scheduling method, device, equipment and storage medium of autonomous mobile device
CN110070751A (en) Automatic propelling device and method are shared in parking stall sharing distribution management system, parking stall
CN111854734A (en) Airport indoor navigation method, system, electronic device and medium
WO2020022165A1 (en) Information processing device, information processing method, and program
Jaiswal et al. Modelling relationships between passenger demand and bus delays at busway stations
WO2020254418A1 (en) System and method for populating a database with occupancy data of parking facilities
CN114926068A (en) Network taxi appointment scheduling method and device
CN114881692A (en) Network appointment scheduling method and device, electronic equipment and storage medium
Begade et al. Cloud based smart car parking system using Internet of Things
CN113536128A (en) Recommendation method for transportation hub transfer mode and electronic equipment
CN112434860B (en) Traffic connection method, device, computer equipment and storage medium
US20240077318A1 (en) Methods and servers for generating a prediction score by a machine learning algorithm
CN112101804B (en) Vehicle scheduling method and device, readable storage medium and electronic equipment
Soto Ferrari et al. A discrete-event simulation approach to assess the benefits of parking technologies in hospitals
JP7478847B2 (en) Simulation Equipment

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