WO2021031635A1 - 基于非空闲行程车辆的预约单混合连环派单方法和装置 - Google Patents

基于非空闲行程车辆的预约单混合连环派单方法和装置 Download PDF

Info

Publication number
WO2021031635A1
WO2021031635A1 PCT/CN2020/091263 CN2020091263W WO2021031635A1 WO 2021031635 A1 WO2021031635 A1 WO 2021031635A1 CN 2020091263 W CN2020091263 W CN 2020091263W WO 2021031635 A1 WO2021031635 A1 WO 2021031635A1
Authority
WO
WIPO (PCT)
Prior art keywords
order
idle
vehicle
reservation
vehicles
Prior art date
Application number
PCT/CN2020/091263
Other languages
English (en)
French (fr)
Inventor
李书恒
成凯
汤义强
赵海帆
郭玉林
张之硕
Original Assignee
南京领行科技股份有限公司
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 南京领行科技股份有限公司 filed Critical 南京领行科技股份有限公司
Publication of WO2021031635A1 publication Critical patent/WO2021031635A1/zh

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/04—Forecasting or optimisation specially adapted for administrative or management purposes, e.g. linear programming or "cutting stock problem"
    • 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
    • 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

Definitions

  • the present invention relates to the technical field of online car-hailing, and in particular to a method and device for dispatching reservations based on non-idle itinerary vehicles.
  • taxis can be divided into two types: cruise taxis and online booking taxis. Cruising taxis means that they are usually on the road and stop when they are called to provide transportation services for passengers; while booking taxis online is to pick up orders through the Internet. Provide transportation services for passengers in a single way. Online car-hailing is short for online car rental.
  • the present invention provides a method and device for hybrid and serial dispatch of reservation orders based on non-idle itinerary vehicles to improve the service experience of users.
  • the present invention discloses a reservation order hybrid serial dispatch method based on non-idle itinerary vehicles, which is applied to the server of a travel taxi system.
  • the reservation reservation hybrid serial dispatch method includes the steps:
  • the long-term reservation form will be pushed to the multiple non-idle itinerary vehicles in the form of broadcast, and the long-term reservations that are not received within the preset time period will be pushed
  • the order is returned to the order pool of the server;
  • the reserved travel order is the short-term reservation form
  • the non-idle ones whose completion time does not match the travel time of the short-term reservation form are excluded Travel vehicle
  • said obtaining real-time travel orders includes:
  • the scheduled travel order is selected from all the travel orders according to the time parameter of the travel order.
  • the acquiring multiple non-idle itinerary vehicles includes:
  • the non-idle trip vehicle is selected from the vehicle according to the passenger loading status of each vehicle.
  • the acquiring multiple non-idle itinerary vehicles further includes the steps:
  • the non-idle itinerary vehicles whose remaining itinerary does not match the actual itinerary of the short-term reservation order are excluded.
  • the acquiring multiple non-idle itinerary vehicles further includes the steps:
  • the sending multiple non-conflicting multiple short-term appointment orders to the target vehicle includes:
  • the target vehicle has the current real-time order and has accepted one or more of the short-term appointment orders, the short-term time required will not conflict with the time of the current real-time order and the accepted short-term appointment order
  • the reservation form is sent to the target vehicle.
  • the optimization calculation of the short-term reservation form and the vehicle information of the non-idle trip vehicle through a greedy algorithm includes the steps:
  • the vehicle-order matrix includes a vehicle set and a reservation order set, and also includes the distance between each non-idle itinerary vehicle in the vehicle set and each short-term reservation order in the reservation order set Parameter, the distance parameter is the reciprocal of the distance between the current position of the non-idle trip vehicle and the departure position of the short-term reservation form that has undergone normalization processing;
  • the target vehicle is selected from the vehicle set by using a greedy algorithm.
  • the order obtaining module is configured to obtain travel reservation orders
  • the vehicle acquisition module is configured to acquire multiple non-idle itinerary vehicles
  • the first push module is configured to determine whether the scheduled travel order is a long-term reservation order or a short-term reservation order; if the scheduled travel order is the long-term reservation order, broadcast the long-term reservation order Push to the multiple non-idle itinerary vehicles, and return long-term appointment orders that have not been taken within a preset time period to the order pool of the server;
  • the time filtering module is configured to, if the travel reservation order is the short-term reservation order, exclude the travel of the completion time and the short-term reservation order according to the completion time of the current order of the non-idle itinerary vehicle Non-idle itinerary vehicles whose time does not match;
  • the location filtering module is configured to exclude non-idle itinerary vehicles that cannot reach the departure point specified by the short-term reservation form according to the end position and completion time of the current order of the non-idle itinerary vehicle;
  • An optimization calculation module configured to perform optimization calculations on the short-term reservation form and the vehicle information of the non-idle trip vehicle through a greedy algorithm, and determine a target vehicle from the plurality of non-idle trip vehicles;
  • the second pushing module is configured to sequentially send non-conflicting short-term appointment orders to the target vehicle.
  • the order acquisition module includes:
  • the first obtaining unit is configured to pull all travel orders within the preset time period from the order pool of the server every preset time period;
  • the first filtering unit is configured to select the scheduled travel order from all travel orders according to the time parameter of the travel order.
  • the vehicle acquisition module includes:
  • the second obtaining unit is configured to obtain all vehicles within the preset range according to the scheduled travel location of the scheduled travel order;
  • the second filtering unit is configured to select the non-idle trip vehicle from the vehicle according to the passenger loading state of each vehicle.
  • the vehicle acquisition module further includes:
  • the third filtering unit is configured to exclude non-idle-trip vehicles whose remaining itinerary does not match the actual itinerary of the short-term reservation form from the plurality of non-idle itinerary vehicles.
  • the vehicle acquisition module further includes:
  • the fourth filtering unit is configured to exclude from the plurality of non-idle itinerary vehicles whose driver has made a predetermined rejection behavior.
  • the second pushing module includes:
  • the first pushing unit is configured to, if only the current real-time order exists in the target vehicle, send the short-term reservation order whose start time is after the order end time of the current real-time order to the target vehicle;
  • the second pushing unit is configured to set the required time between the current real-time order and the accepted short-term order if the current real-time order exists in the target vehicle and one or more of the short-term reservation orders have been accepted.
  • the short-term appointment form whose time does not conflict with the time appointment form is sent to the target vehicle.
  • the present invention provides a method and device for dispatching reservation orders based on real-time single-journey vehicles.
  • the method and device are applied to the server of the travel taxi system, specifically to obtain reservation travel orders; Multiple non-idle itinerary vehicles; judge whether the reservation travel order is a long-term reservation order or a short-term reservation order, and push the long-term reservation order to multiple non-idle itinerary vehicles through broadcast; propose non-idle vehicles that do not match the time according to the order completion time Itinerary vehicles; exclude non-idle itinerary vehicles that cannot reach the starting point of the short-term reservation order; optimize the vehicle information of the short-time reservation order and non-idle itinerary vehicles through the greedy algorithm, and obtain the target vehicle from multiple non-idle itinerary vehicles; Send non-conflicting short-term appointment orders to the target vehicle in turn. From the above solution, it can be seen that even when the current non-idle itinerary vehicle has accepted the reservation travel order, the order can be accepted again, which increases the order acceptance rate
  • this application uses a greedy algorithm to select the corresponding target vehicle for the corresponding reservation travel order, and it performs a comprehensive calculation of the non-idle itinerary vehicles that may take orders, rather than simply dispatching orders based on distance or dispatching orders through rush orders. Minimize the maximum dispatch matching under the constraints of overall driving time/distance, thereby avoiding the global efficiency problems in distance-based dispatch mode and rush mode, and improve the user's service experience.
  • Fig. 1 is a flow chart of a method for dispatching reservation orders based on non-idle itinerary vehicles according to an embodiment of the application;
  • FIG. 2 is a flowchart of another method for dispatching reservation orders based on non-idle itinerary vehicles according to an embodiment of the application;
  • FIG. 3 is a flowchart of yet another method for dispatching reservation orders based on non-idle itinerary vehicles according to an embodiment of the application;
  • Fig. 4 is a block diagram of a hybrid serial dispatching device for reservation orders based on non-idle travel vehicles according to an embodiment of the application;
  • FIG. 5 is a block diagram of another hybrid serial dispatching device for reservation orders based on non-idle itinerary vehicles according to an embodiment of the application;
  • FIG. 6 is a block diagram of another device for dispatching a reservation order based on a non-idle itinerary vehicle according to an embodiment of the application.
  • Fig. 1 is a flow chart of a method for dispatching reservation orders based on non-idle itinerary vehicles in an embodiment of the application.
  • the reservation order hybrid serial dispatch method provided in this embodiment is applied to the server of the travel taxi system, and is used to place orders for passengers and provide an order dispatching solution to the taxi.
  • the non-idle trip vehicles here refer to the vehicles that belong to the contracted vehicles of the ride-hailing system and are currently in service.
  • the method for dispatching an appointment order mixed serial order specifically includes the following steps:
  • the travel reservation order here refers to a travel order that passengers who need to provide car rental services currently issue and need to get car rental services in the future. When passengers place corresponding orders, they generally use the mobile terminal to send electronic information to the server of the ride-hailing system.
  • the reservation travel order will include corresponding location information, and the location information will indicate the specific location of the passenger who issued the travel order.
  • a preset time interval such as every 2 seconds
  • For specific travel orders Whether it is a real-time travel order or an appointment travel order can be judged by the appointment time of the car, that is, it can be judged by the time parameter in the travel order; when all travel orders within this period of time are pulled, it will be processed according to the time parameter in the travel order Judgment, select all reservation travel orders from the judgment.
  • the non-idle itinerary vehicles within the preset range based on the location information are obtained according to the location information.
  • the non-idle itinerary vehicles refer to the vehicles with real-time orders or the The vehicle that executes the reservation form.
  • the preset range may be determined according to actual conditions, such as a block with the location information as a basic point, a range within a certain spatial scale, or a city.
  • non-idle itinerary vehicles In the process of obtaining multiple non-idle itinerary vehicles, first obtain all vehicles in the preset range according to the location information, that is, obtain all the vehicles in the preset range that have contracted with the ride-hailing system; then, according to the service of each vehicle The status is judged, and non-idle travel vehicles are selected from it.
  • process of acquiring multiple non-idle trip vehicles in this application also includes some or all of the following steps, and the order of the following steps does not represent the order of execution.
  • the non-idle itinerary vehicles in this application refer to all vehicles contracted with the platform except for the idle itinerary vehicles, which include vehicles that are executing real-time orders, or vehicles that only have reservation orders, and also include vehicles that are rushing to the agreed place to execute the contract Delivery of real-time orders or reserved vehicles.
  • the remaining journey information of each vehicle is received at the same time, and the journey requirements of the corresponding reservation travel order are judged, and vehicles whose remaining journeys cannot meet the requirements of the journey are excluded from them, so as to avoid halfway Parking affects the travel of passengers.
  • this application may also include all the steps of steps S01 and S02 described above before step S4.
  • the free travel vehicle determine whether the corresponding reservation travel order is a long-term reservation order or a short-term reservation order through the judgment of the reservation time information.
  • the two are divided according to the reservation time information pointed to by the reservation time information and the current time
  • the length of the time limit is determined by the preset time threshold.
  • the time threshold can be one day or one week. The time threshold determined according to this principle is within the protection scope of this application.
  • the idle trip vehicle For the long-term appointment order, because there will be no conflict with the current order status of the idle trip vehicle, it can be pushed to all idle trip vehicles in the form of broadcast, and the driver of the idle trip vehicle can accept or reject the order at any time.
  • the broadcasted long-term reservation order if the order is not received within the preset time period, such as 1 second, 10 seconds, 60 seconds, 100 seconds, or the duration between the above values or other durations, it will not be received.
  • the long-term appointment order received is returned to the order pool of the server.
  • the completion time of the current order of the non-idle itinerary vehicle such as the real-time order or the previously received reservation order, and then compare the travel time of the short-term reservation order according to the completion time. If the two conflicts, the short-term reservation cannot be made on time.
  • the non-idle itinerary vehicle that cannot provide services on time is eliminated.
  • the completion time and end position of the current order of the non-idle travel vehicle such as the real-time order or the previously received and executed reservation order, and determine whether the non-idle travel vehicle can arrive at the starting point of the short-term reservation order on time, if it can, not If not, the non-idle itinerary vehicle will be eliminated.
  • the reservation travel order and the vehicle information of the selected idle trip vehicle are optimized, and the non-idle trip vehicle that best matches the short-term reservation form is found from multiple non-idle trip vehicles as the target vehicle.
  • the vehicle-order matrix is first constructed.
  • multiple short-term appointment orders are first obtained to form an appointment order set O.
  • the current positions of multiple non-idle trip vehicles d with a location distance are selected, thereby obtaining a candidate vehicle set D.
  • the reservation form set and the vehicle set are taken as two dimensions to form the vehicle-order matrix.
  • the matrix also includes the reciprocal of the distance between the departure position of each short-term reservation form and the current position of each non-idle trip vehicle, and the After multiple countdowns, normalize them as the distance parameter v between the corresponding short-term reservation and the corresponding non-idle trip vehicle, as shown in Table 1.
  • the greedy algorithm After obtaining the vehicle-order matrix, for each short-term reservation, use the greedy algorithm to select from the vehicle set, that is, use the greedy algorithm to determine the distance between the corresponding short-term reservation and the corresponding non-idle trip vehicle and the distance between the two The parameters are calculated to obtain the target vehicle.
  • Greedy algorithm means that the overall optimal solution of the problem can be achieved through a series of local optimal choices, namely greedy choices. This is the first basic element for the greedy algorithm to be feasible, and it is also the main difference between the greedy algorithm and the dynamic programming algorithm.
  • Greedy algorithm uses a top-down, iterative method to make successive choices. Every time a greedy choice is made, the problem is reduced to a smaller sub-problem. For a specific problem, to determine whether it has the nature of greedy choice, we must prove that the greedy choice made at each step can finally get the optimal solution of the problem.
  • the non-conflicting short-term appointment orders are sent to the target vehicle in turn, so that the target vehicle serves the passenger who sent the order.
  • Non-conflict here means that the time of the short-term appointment order does not conflict.
  • sending to the target vehicle actually refers to sending the real-time travel order to the mobile device on the target vehicle, such as a mobile phone held by the driver.
  • a target vehicle only has a real-time order, that is, it is serving the corresponding passengers and has not accepted other reservations, then the short-term reservations whose starting time is after the real-time order are pushed to the corresponding Target vehicle
  • the time gap between the real-time order and the first appointment order, and the time gap between the appointment orders Calculate, if there is a short-term appointment order that can meet the above time gap at this time, the short-term appointment form will be pushed to the target vehicle; also, the short-term appointment form whose starting time is after the last short-term appointment form Push to the target vehicle.
  • this embodiment provides a method for dispatching reservation orders based on real-time single-trip vehicles. This method is applied to the server of the travel taxi system, specifically to obtain reservation travel orders; Idle itinerary vehicles; judge whether the reservation travel order is a long-term reservation or a short-term reservation.
  • this application uses a greedy algorithm to select the corresponding target vehicle for the corresponding reservation travel order, and it performs a comprehensive calculation of the non-idle itinerary vehicles that may take orders, rather than simply dispatching orders based on distance or dispatching orders through rush orders. Minimize the maximum dispatch matching under the constraints of overall driving time/distance, thereby avoiding the global efficiency problems in distance-based dispatch mode and rush mode, and improve the user's service experience.
  • FIG. 6 is a block diagram of a hybrid serial dispatching device for reservation orders based on non-idle travel vehicles according to an embodiment of the application.
  • the reservation order hybrid serial dispatching device is applied to the server of the ride-hailing system. It can be understood as an actual electronic device or a functional module of the server, which is used to place orders for passengers and dispatch them to taxis. Provide a single dispatch plan.
  • the non-idle trip vehicle here refers to the contracted vehicle that belongs to the ride-hailing system for the trip and is in service at the current moment.
  • the appointment order hybrid chain dispatching device specifically includes an order acquisition module 10, a vehicle acquisition module 20, a first pushing module 30, a time filtering module 40, a location filtering module 50, an optimization calculation module 60, and a second pushing module 70.
  • the order obtaining module 10 is used to obtain a travel reservation order.
  • the travel reservation order here refers to a travel order that passengers who need to provide car rental services currently issue and need to get car rental services in the future. When passengers place corresponding orders, they generally use the mobile terminal to send electronic information to the server of the ride-hailing system.
  • the reservation travel order will include corresponding location information, and the location information will indicate the specific location of the passenger who issued the travel order.
  • the order acquisition module here specifically includes a first acquisition unit and a first filter unit.
  • the first acquisition unit is used to pull all travel orders generated during this period of time from the order pool of the server at a preset time interval, such as every 2 seconds, including real-time travel orders and scheduled travel orders.
  • a preset time interval such as every 2 seconds
  • the specific travel order is a real-time travel order or an appointment travel order
  • the first filter unit is used when the first acquisition unit pulls this section After all the travel orders within the time, judge according to the time parameters in the travel order, and select all the scheduled travel orders from the judgment.
  • the vehicle acquisition module 20 is configured to acquire multiple non-idle itinerary vehicles within a preset range according to location information.
  • the non-idle itinerary vehicles within the preset range based on the location information are obtained according to the location information.
  • the non-idle itinerary vehicles refer to the vehicles with real-time orders or the The vehicle that executes the reservation form.
  • the preset range may be determined according to actual conditions, such as a block with the location information as a basic point, a range within a certain spatial scale, or a city.
  • the module controls the second acquisition unit and the second filtering unit.
  • the second acquisition unit is used to acquire all vehicles within the preset range according to the location information, that is, to acquire the preset All the vehicles in the range contracted with the ride-hailing system;
  • the second filter unit is used for judging according to the service status of each vehicle, and selecting non-idle vehicles from it.
  • the module also includes a third filter unit and a fourth filter unit, or one of them.
  • the third filter unit is used to eliminate real-time single-trip vehicles whose remaining trips cannot meet the order requirements.
  • the remaining journey information of each vehicle is received at the same time, and the journey requirements of the corresponding reservation travel order are judged, and vehicles whose remaining journeys cannot meet the requirements of the journey are excluded from them, so as to avoid halfway Parking images of passengers' travel.
  • the fourth filtering unit is used to eliminate vehicles on non-idle trips whose drivers have issued rejection information before the optimization calculation module performs calculations according to the greedy algorithm.
  • the first push module 30 is used for judging the long- and short-term appointment orders, and broadcast and push the long-term appointment orders.
  • the reservation time information determines whether the corresponding reservation travel order is a long-term reservation order or a short-term reservation order. The two are divided according to the reservation time information pointed to by the reservation time information.
  • the length of the time that is, the length of the appointment order is determined by the preset time threshold.
  • the time threshold can be one day or one week. The time threshold determined according to this principle is within the protection scope of this application.
  • the non-idle itinerary vehicle For the long-term appointment order, because there will be no conflict with the current order status of the non-idle itinerary vehicle, it can be pushed to all non-idle itinerary vehicles through broadcast, and the driver of the non-idle itinerary vehicle can accept or reject the order at any time. single.
  • the broadcasted long-term reservation order if the order is not received within the preset time period, such as 1 second, 10 seconds, 60 seconds, 100 seconds, or the duration between the above values or other durations, it will not be received.
  • the long-term appointment order received is returned to the order pool of the server.
  • the time filtering module 40 is used to eliminate non-idle itinerary vehicles whose time does not match according to the order completion time.
  • the completion time of the current order of the non-idle itinerary vehicle such as the real-time order or the previously received reservation order, and then compare the travel time of the short-term reservation order according to the completion time. If the two conflicts, the short-term reservation cannot be made on time.
  • the non-idle itinerary vehicle that cannot provide services on time is eliminated.
  • the location filtering module 50 is used to eliminate non-idle vehicles that cannot reach the starting point of the short-term reservation form.
  • the completion time and end position of the current order of the non-idle travel vehicle such as the real-time order or the previously received and executed reservation order, and determine whether the non-idle travel vehicle can arrive at the starting point of the short-term reservation order on time, if it can, not If not, the non-idle itinerary vehicle will be eliminated.
  • the optimization calculation module 60 is used for calculating according to the greedy algorithm to obtain the target vehicle.
  • the reserved travel order and the vehicle information of the selected non-idle itinerary vehicle are optimized, and the non-idle itinerary vehicle that best matches the real-time travel order is found from multiple non-idle itinerary vehicles as the target vehicle.
  • the second push module 70 is used to sequentially send non-conflicting short-term appointment orders to the target vehicle in sequence.
  • Non-conflict here means that the time of the short-term appointment order does not conflict.
  • sending to the target vehicle actually refers to sending the real-time travel order to the mobile device on the target vehicle, such as a mobile phone held by the driver.
  • the module includes a first push unit and a second push unit.
  • the first push unit is used if a target vehicle only has a real-time order, that is, it is serving the corresponding passengers and has not accepted other reservation orders. Push the short-term appointment order whose starting time is after the real-time order to the corresponding target vehicle;
  • the second push unit is used to determine the time gap between the real-time order and the first-ranked appointment order, and the time gap between the real-time order and the appointment order if there are one or more short-term appointment orders at this time. If there is a short-term reservation that can meet the above-mentioned time gap at this time, the short-term reservation will be pushed to the target vehicle, or the starting time will be located shortly after the last short-term reservation The reservation form is pushed to the target vehicle.
  • this embodiment provides a hybrid serial dispatching device for reservation orders based on non-idle itinerary vehicles, which is applied to the server of the travel taxi system, specifically to obtain reservation travel orders; Idle itinerary vehicles; judge whether the reservation travel order is a long-term reservation or a short-term reservation.
  • this application uses a greedy algorithm to select the corresponding target vehicle for the corresponding reservation travel order, and it performs a comprehensive calculation of the non-idle itinerary vehicles that may take orders, rather than simply dispatching orders based on distance or dispatching orders through rush orders. Minimize the maximum dispatch matching under the constraints of overall driving time/distance, thereby avoiding the global efficiency problems in distance-based dispatch mode and rush mode, and improve the user's service experience.
  • the embodiments of the embodiments of the present invention may be provided as methods, devices, or computer program products. Therefore, the embodiments of the present invention may adopt the form of a complete hardware embodiment, a complete software embodiment, or an embodiment combining software and hardware. Moreover, the embodiments of the present invention may adopt the form of computer program products implemented on one or more computer-usable storage media (including but not limited to disk storage, CD-ROM, optical storage, etc.) containing computer-usable program codes.
  • computer-usable storage media including but not limited to disk storage, CD-ROM, optical storage, etc.
  • These computer program instructions can also be stored in a computer-readable memory that can guide a computer or other programmable data processing terminal equipment to work in a specific manner, so that the instructions stored in the computer-readable memory produce an article of manufacture including the instruction device.
  • the instruction device implements the functions specified in one process or multiple processes in the flowchart and/or one block or multiple blocks in the block diagram.

Landscapes

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

Abstract

一种基于实时单行程车辆的预约单混合连环派单方法和装置，应用于出行打车系统的服务器，具体为获取预约出行订单（S1）；获取多个非空闲行程车辆（S2）；判断预约出行订单为长时预约单还是短时预约单，对于长时预约单通过广播形式向多个非空闲行程车辆推送（S3）；根据订单完成时间剔除时间不匹配（S4）和无法到达出发点（S5）的非空闲行程车辆；通过贪心算法对短时预约单和非空闲行程车辆的车辆信息进行优化计算，从多个非空闲行程车辆中得到目标车辆（S6）；将不相冲突的短时预约单依次发送给目标车辆（S7）。通过上述方案可以看出，即使在当前非空闲行程车辆已经接受有预约出行订单的情况下，也能将再次接单，提高了接单率，从而提高了用户的使用体验。

Description

基于非空闲行程车辆的预约单混合连环派单方法和装置 技术领域
本发明涉及网约车技术领域，特别是涉及一种基于非空闲行程车辆的预约单混合连环派单方法和装置。
背景技术
一般来说，出租车可以分为巡游出租汽车和网络预约出租汽车两种，巡游出租即是平时巡游在路上，即招即停为乘客提供运输服务；而网络预约出租汽车是通过网络下单接单的方式为乘客提供运输服务。网约车就是网络预约出租汽车的简称。
当处于上下班等高峰时段时，几乎所有车辆都处于服务状态，而对于预约出行订单这种不需即时提供服务的订单，如果相应的非空闲行程车辆能够也能接受这样的订单，势必会提高预约出行订单的接单率，从而能够提高用户的服务体验。
发明内容
有鉴于此，本发明提供了一种基于非空闲行程车辆的预约单混合连环派单方法和装置，以提高用户的服务体验。
为了解决上述问题，本发明公开了一种基于非空闲行程车辆的预约单混合连环派单方法，应用于出行打车系统的服务器，所述预约单混合连环派单方法包括步骤：
获取预约出行订单；
获取多个非空闲行程车辆；
判断所述预约出行订单为长时预约单还是短时预约单；
若所述预约出行订单为所述长时预约单，则对于所述长时预约单通过广播形式向所述多个非空闲行程车辆推送，并将预设时长内没有被接单的长时预约单返回到所述服务器的订单池中；
若所述预约出行订单为所述短时预约单，则根据所述非空闲行程车辆的当前订单的完成时间，剔除所述完成时间与所述短时预约单的出行时间不相匹配的非空闲行程车辆；
根据所述非空闲行程车辆的当前订单的终点位置和完成时间，剔除无法到达所述短时预约单指定的出发点的非空闲行程车辆；
通过贪心算法对所述短时预约单和所述非空闲行程车辆的车辆信息进行优化计算，从所述多个非空闲行程车辆中确定目标车辆；
将多个不相冲突的短时预约单依次发送至所述目标车辆。
可选的，所述获取实时出行订单，包括：
从所述服务器的订单池中每隔预设时长拉取所述预设时长内的所有出行订单；
根据所述出行订单的时间参数从所述所有出行订单中选取出所述预约出行订单。
可选的，所述获取多个非空闲行程车辆，包括：
根据所述预约出行订单的预约出行位置获取所述预设范围内所有车辆；
根据每个所述车辆的载客状态从中选取出所述非空闲行程车辆。
可选的，所述获取多个非空闲行程车辆，还包括步骤：
从所述多个非空闲行程车辆中剔除剩余行程与所述短时预约单的实际行程不匹配的非空闲行程车辆。
可选的，所述获取多个非空闲行程车辆，还包括步骤：
从所述多个非空闲行程车辆中剔除其司机做出预先规定的拒单行为的非空闲行程车辆。
可选的，所述将多个不相冲突的多个短时预约单发送给所述目标车辆，包括：
如果所述目标车辆仅存在当前实时单，则将开始时间位于所述当前实时单的订单终点时间之后的短时预约单发送给所述目标车辆；
如果所述目标车辆存在所述当前实时单且已接受一个或多个所述短时预约单，将所需与所述当前实时单和已被接受的短时预约单的时间不冲突的短时预约单发送给所述目标车辆。
可选的，所述通过贪心算法对所述短时预约单和所述非空闲行程车辆的车辆信息进行优化计算，包括步骤：
构建车辆-订单矩阵，所述车辆-订单矩阵包括车辆集合和预约单集合，还包括所述车辆集合中每个非空闲行程车辆与所述预约订单集合中每个短时预约单相对应的距离参数，所述距离参数为经过归一化处理的所述非空闲行程车辆的当前位置与所述短时预约单的出发位置的距离的倒数；
针对每个所述短时预约单，利用贪心算法从所述车辆集合中选定所述目标车辆。
一种基于非空闲行程车辆的预约单混合连环派单装置，应用于出行打车系统的服务器，所述预约单派单装置包括：
订单获取模块，被配置为获取预约出行订单；
车辆获取模块，被配置为获取多个非空闲行程车辆；
第一推送模块，被配置为判断所述预约出行订单为长时预约单还是短时预约单；若所述预约出行订单为所述长时预约单，则对于所述长时预约单通过广播形式向所述多个非空闲行程车辆推送，并将预设时长内没有被接单的长时预约单返回到所述服务器的订单池中；
时间过滤模块，被配置为若所述预约出行订单为所述短时预约单，则根据所述非空闲行程车辆的当前订单的完成时间，剔除所述完成时间与所述短时预约单的出行时间不相匹配的非空闲行程车辆；
地点过滤模块，被配置为根据所述非空闲行程车辆的当前订单的终点位置和完成时间，剔除无法到达所述短时预约单指定的出发点的非空闲行程车辆；
优化计算模块，被配置为通过贪心算法对所述短时预约单和所述非空闲行程车辆的车辆信息进行优化计算，从所述多个非空闲行程车辆中确定目标车辆；
第二推送模块，被配置为将不相冲突的短时预约单依次发送至所述目标车辆。
可选的，所述订单获取模块包括：
第一获取单元，被配置为从所述服务器的订单池中每隔预设时长拉取所述预设时长内的所有出行订单；
第一过滤单元，被配置为根据所述出行订单的时间参数从所述所有出行订单中选取出所述预约出行订单。
可选的，所述车辆获取模块包括：
第二获取单元，被配置为根据所述预约出行订单的预约出行位置获取所述预设范围内所有车辆；
第二过滤单元，被配置为根据每个所述车辆的载客状态从中选取出所述非空闲行程车辆。
可选的，所述车辆获取模块还包括：
第三过滤单元，被配置为从所述多个非空闲行程车辆中剔除剩余行程与所述短时预约单的实际行程不匹配的非空闲行程车辆。
可选的，所述车辆获取模块还包括：
第四过滤单元，被配置为从所述多个非空闲行程车辆中剔除其司机做出预先规定的拒单行为的非空闲行程车辆。
可选的，所述第二推送模块包括：
第一推送单元，被配置为如所述目标车辆仅存在当前实时单，则将开始时间位于所述当前实时单的订单终点时间之后的短时预约单发送给所述目标车辆；
第二推送单元，被配置为如果所述目标车辆存在所述当前实时单且已接受一个或多个所述短时预约单，将所需时间介于所述当前实时单与已被接受的短时预约单的时间不冲突的短时预约单发送给所述目标车辆。
从上述技术方案可以看出，本发明提供了一种基于实时单行程车辆的预约单混合连环派单方法和装置，该方法和装置应用于出行打车系统的服务器，具体为获取预约出行订单；获取多个非空闲行程车辆；判断预约出行订单为长时预约单还是短时预约单，对于长时预约单通过广播形式向多个非空闲行程车辆推送；根据订单完成时间提出时间不匹配的非空闲行程车辆；剔除无法到达短时预约单的出发点的非空闲行程车辆；通过贪心算法对短时预约单和非空闲行程车辆的车辆信息进行优化计算，从多个非空闲行程车辆中得到目标车辆；将不相冲突的短时预约单依次发送给目标车辆。通过上述方案可以看出，即使在当前非空闲行程车辆已经接受有预约出行订单的情况下，也能将再次接单，提高了接单率，从而提高了用户的使用体验。
且本申请针对相应的预约出行订单通过贪心算法选择相应目标车辆，其对可能接单的非空闲行程车辆进行通盘计算，而非简单地仅基于距离派单或者通过抢单方式派单，实现了最小化总体接驾时间/距离的约束条件下的最大派单匹配，从而避免了基于距离的派单模式和抢单模式中全局效率问题，提高了用户的服务体验。
附图说明
为了更清楚地说明本发明实施例或现有技术中的技术方案，下面将对实施例或现有技术描述中所需要使用的附图作简单地介绍，显而易见地，下面描述中的附图仅仅是本发明的一些实施例，对于本领域普通技术人员来讲，在不付出创造性劳动的前提下，还可以根据这些附图获得其他的附图。
图1为本申请实施例的一种基于非空闲行程车辆的预约单混合连环派单方法的流 程图；
图2为本申请实施例的另一种基于非空闲行程车辆的预约单混合连环派单方法的流程图；
图3为本申请实施例的又一种基于非空闲行程车辆的预约单混合连环派单方法的流程图；
图4为本申请实施例的一种基于非空闲行程车辆的预约单混合连环派单装置的框图；。
图5为本申请实施例的另一种基于非空闲行程车辆的预约单混合连环派单装置的框图；
图6为本申请实施例的又一种基于非空闲行程车辆的预约单混合连环派单装置的框图。
具体实施方式
下面将结合本发明实施例中的附图，对本发明实施例中的技术方案进行清楚、完整地描述，显然，所描述的实施例仅仅是本发明一部分实施例，而不是全部的实施例。基于本发明中的实施例，本领域普通技术人员在没有做出创造性劳动前提下所获得的所有其他实施例，都属于本发明保护的范围。
实施例一
图1为本申请实施例的一种基于非空闲行程车辆的预约单混合连环派单方法的流程图。
如图1所示，本实施例提供的预约单混合连环派单方法应用于出行打车系统的服务器，用于为乘客下单并向出租车辆派单提供派单方案。这里的非空闲行程车辆是指属于该出行打车系统的签约车辆，且当前时刻处于服务状态的车辆。该预约单混合连环派单方法具体包括如下步骤：
S1、获取预约出行订单。
这里的预约出行订单是指需要提供租车服务的乘客当前发出并需要在将来得到租车服务的出行订单。乘客在发出相应订单时一般通移动终端向本出行打车系统的服务器发出的电子信息。该预约出行订单中会包括相应的位置信息，该位置信息会表明发出该出行订单的乘客的具体位置。
由于服务器所接收到的出行订单包括实时出行订单和预约出行订单，因此这里获取预约出行订单具体通过以下操作实现：
首先从上述服务器的订单池中每隔预设时长、如每隔2秒拉取在这段时间内所产生的所有出行订单，其中会包括实时出行订单和预约出行订单，对于具体的出行订单究竟为实时出行订单还是预约出行订单可以通过预约用车时间来判断，即可以通过出行订单中的时间参数来判断；当拉取到此段时间内所有出行订单后，根据出行订单中的时间参数进行判断，通过判断从中选取出所有的预约出行订单。
S2、获取多个非空闲行程车辆。
即在确定发出该预约出行订单的位置信息的情况下，根据该位置信息获取以该位置信息为根据的预设范围内的非空闲行程车辆，非空闲行程车辆是指有实时单的车辆或者 正在执行预约单的车辆。该预设范围可以根据实际情况确定，例如以该位置信息为基本点的一个街区、一定空间尺度内的范围或者一个城市等。
在获取多个非空闲行程车辆的过程中，首先根据该位置信息获取该预设范围内所有车辆，即获取该预设范围内所有与该出行打车系统签约的车辆；然后根据每个车辆的服务状态进行判断，从中选取出非空闲行程车辆。
另外，本申请中获取多个非空闲行程车辆过程中，还包括如下步骤的部分或全部，下面步骤的排序不代表执行的先后顺序。
本申请中的非空闲行程车辆是指除空闲行程车辆以外的所有与平台签约的车辆，其包括正在执行实时单的车辆，或者仅具有预约单的车辆，还包括正在赶往约定地点执行已经被派送的实时单或者预约单的车辆。
S01、剔除剩余行程无法满足订单需求的实时单行程车辆。
即在选定全部的实时单行程车辆过程中，同时接收每个车辆的剩余行程信息，并对相应预约出行订单的行程要求进行判断，从中剔除剩余行程无法满足该行程要求的车辆，从而避免中途停车影响乘客的出行。
S02、剔除其司机做出预先规定的拒单行为的非空闲行程车辆。
即在确定全部的非空闲行程车辆后，如果其中有车辆的司机做出过预先规定的拒单行为、如上一次拒单或者在一定时间内做出限定次数的拒单行为，此时可以将该车辆予以剔除，然后在进行优化计算，从而可以避免有问题车辆被推送实时出行订单而影响乘客的用车。
还有，本申请中在步骤S4之前还可以包括上述步骤S01和S02的全部步骤。
S3、对长短时预约订单进行判断，将长时预约单进行广播推送。
即在确定空闲行程车辆后，通过对预约时间信息的判断确定相应预约出行订单为长时预约单还是短时预约单，两者划分的根据为预约时间信息所指向的预约用车时间距离当前时刻的长短，即通过预设的时间阈值对长短时预约单进行判定，该时间阈值可以为一天或一周，按此原则所确定的时间阈值均在本申请的保护范围之内。
对于其中的长时预约单，因为与空闲行程车辆的当前订单状态不会产生任何冲突，因此可以通过广播形式向所有空闲行程车辆进行推送，空闲行程车辆的司机可以随时接单或拒单。
另外，对于被广播的长时预约单，如果在预设时长内没有被接单，例如1秒、10秒、60秒、100秒或者上述数值之间的时长或者其他时长，则将该没有被接单的长时预约单返回给服务器的订单池。
S4、根据订单完成时间剔除时间不匹配的非空闲行程车辆。
即确定非空闲行程车辆的当前订单、如实时单或者之前接收的预约单的完成时间，然后根据该完成时间对短时预约单的出行时间进行比较，如果两者冲突，即不能按时为该短时预约单的乘客提供服务，则剔除这个不能按时提供服务的非空闲行程车辆。
S5、剔除无法到达短时预约单的出发点的非空闲行程车辆。
即确定非空闲行程车辆的当前订单、如实时单或者之前接收并正在执行的预约单的完成时间和终点位置，确定该非空闲行程车辆能否按时抵达短时预约单的出发点，如果能则不做处置，如果不能则将这个非空闲行程车辆予以剔除。
S6、根据贪心算法进行计算，得到目标车辆。
即根据贪心算法对预约出行订单和选定的空闲行程车辆的车辆信息进行优化计算，从多个非空闲行程车辆中找出与该短时预约单最匹配的非空闲行程车辆作为该目标车辆。
具体是指，首先构建车辆-订单矩阵，在构建该车辆-订单矩阵时，首先获取多个短时预约单，从而构成预约单集合O，针对其中的每个短时预约单o，根据其出发位置距离的多个非空闲行程车辆d的当前位置进行选择，从而得到候选的车辆集合D。将预约单集合和车辆集合作为两个维度构成该车辆-订单矩阵，该矩阵中还包括每个短时预约单的出发位置与每个非空闲行程车辆的当前位置的距离的倒数，且在得到多个倒数后对其进行归一化处理作为相应短时预约单与相应非空闲行程车辆的距离参数v，具体如表1所示。
  d1 d2 d3 d4 d5 d6
o1 v＝0.2 0.5 0.6 0.8 0.7 0.8
o2 0.1 0.6 0.7 0.7 0.2 0.2
o3 0.6 0.4 0.5 0.3 0.1 0.7
表1
在得到上述车辆-订单矩阵后，针对每个短时预约单，利用贪心算法从车辆集合中进行选择，即利用贪心算法对相应短时预约单与相应非空闲行程车辆以及两者之间的距离参数进行计算，得到目标车辆。
具体来说，先从o1订单开始筛选，选中d4(0.8),d6(0.8)；然后o2继续选择，选中d3(0.7),d4(0.7),但是d4已经被o1给选中了，这时候再选择d2(0.6)；最后o3选择，选择d1(0.6),d6(0.7),没有冲突。
贪心算法是指所求问题的整体最优解可以通过一系列局部最优的选择，即贪心选择来达到。这是贪心算法可行的第一个基本要素，也是贪心算法与动态规划算法的主要区别。
贪心算法是采用从顶向下、以迭代的方法做出相继选择，每做一次贪心选择就将所求问题简化为一个规模更小的子问题。对于一个具体问题，要确定它是否具有贪心选择的性质，我们必须证明每一步所作的贪心选择最终能得到问题的最优解。
通常可以首先证明问题的一个整体最优解，是从贪心选择开始的，而且作了贪心选择后，原问题简化为一个规模更小的类似子问题。然后，用数学归纳法证明，通过每一步贪心选择，最终可得到问题的一个整体最优解。
S7、将不相冲突的短时预约单依次发送至目标车辆。
在确定目标车辆后，将不相冲突的短时预约单依次发送至该目标车辆，以便该目标车辆为发送该订单的乘客服务。这里不相冲突是指短时预约单的时间不相冲突。这里发送至目标车辆实际是指将该实时出行订单发送至该目标车辆上的移动设备，例如司机所持的手机等。
具体来说，首先，如果一个目标车辆仅有实时单，即正在为相应的乘客提供服务且没有接受的其他预约单，此时将起始时间位于该实时单之后的短时预约单推送给相应目标车辆；
其次，如果此时不仅有实时单，还存在一个或多个短时预约单，则对实时单与排在 第一位的预约单之间的时间空隙、以及对预约单之间的时间空隙进行计算，如果此时有能够满足上述时间空隙的短时预约单，则将该短时预约单推送给该目标车辆；还有，将起始时间位于最后一个短时预约单之后的短时预约单推送给该目标车辆。
从上述技术方案可以看出，本实施例提供了一种基于实时单行程车辆的预约单混合连环派单方法，该方法应用于出行打车系统的服务器，具体为获取预约出行订单；获取多个非空闲行程车辆；判断预约出行订单为长时预约单还是短时预约单，对于长时预约单通过广播形式向多个非空闲行程车辆推送；根据订单完成时间提出时间不匹配的非空闲行程车辆；剔除无法到达短时预约单的出发点的非空闲行程车辆；通过贪心算法对短时预约单和非空闲行程车辆的车辆信息进行优化计算，从多个非空闲行程车辆中得到目标车辆；将不相冲突的短时预约单依次发送给目标车辆。通过上述方案可以看出，即使在当前非空闲行程车辆已经接受有预约出行订单的情况下，也能将再次接单，提高了接单率，从而提高了用户的使用体验。
且本申请针对相应的预约出行订单通过贪心算法选择相应目标车辆，其对可能接单的非空闲行程车辆进行通盘计算，而非简单地仅基于距离派单或者通过抢单方式派单，实现了最小化总体接驾时间/距离的约束条件下的最大派单匹配，从而避免了基于距离的派单模式和抢单模式中全局效率问题，提高了用户的服务体验。
实施例二
图6为本申请实施例的一种基于非空闲行程车辆的预约单混合连环派单装置的框图。
如图6所示，本实施例提供的预约单混合连环派单装置应用于出行打车系统的服务器，可以理解为实际的电子设备或者服务器的功能模块，用于为乘客下单并向出租车辆派单提供派单方案。这里的非空闲行程车辆是指属于该出行打车系统的签约车辆，且当前时刻处于服务状态。该预约单混合连环派单装置具体包括订单获取模块10、车辆获取模块20、第一推送模块30、时间过滤模块40、位置过滤模块50、优化计算模块60和第二推送模块70。
订单获取模块10用于获取预约出行订单。
这里的预约出行订单是指需要提供租车服务的乘客当前发出并需要在将来得到租车服务的出行订单。乘客在发出相应订单时一般通移动终端向本出行打车系统的服务器发出的电子信息。该预约出行订单中会包括相应的位置信息，该位置信息会表明发出该出行订单的乘客的具体位置。
由于服务器所接收到的出行订单包括实时出行订单和预约出行订单，因此这里的订单获取模块具体包括第一获取单元和第一过滤单元。
第一获取单元用于从上述服务器的订单池中每隔预设时长、如每隔2秒拉取在这段时间内所产生的所有出行订单，其中会包括实时出行订单和预约出行订单，对于具体的出行订单究竟为实时出行订单还是预约出行订单可以通过预约用车时间来判断，即可以通过出行订单中的时间参数来判断；第一过滤单元用于当第一获取单元拉取到此段时间内所有出行订单后，根据出行订单中的时间参数进行判断，通过判断从中选取出所有的预约出行订单。
车辆获取模块20用于根据位置信息获取预设范围内多个非空闲行程车辆。
即在确定发出该预约出行订单的位置信息的情况下，根据该位置信息获取以该位置信息为根据的预设范围内的非空闲行程车辆，非空闲行程车辆是指有实时单的车辆或者正在执行预约单的车辆。该预设范围可以根据实际情况确定，例如以该位置信息为基本点的一个街区、一定空间尺度内的范围或者一个城市等。
该模块把控第二获取单元和第二过滤单元，在获取多个非空闲行程车辆的过程中，第二获取单元用于根据该位置信息获取该预设范围内所有车辆，即获取该预设范围内所有与该出行打车系统签约的车辆；第二过滤单元用于根据每个车辆的服务状态进行判断，从中选取出非空闲行程车辆。
该模块还包括第三过滤单元和第四过滤单元，或者其中的一个单元。
第三过滤单元用于剔除剩余行程无法满足订单需求的实时单行程车辆。
即在选定全部的实时单行程车辆过程中，同时接收每个车辆的剩余行程信息，并对相应预约出行订单的行程要求进行判断，从中剔除剩余行程无法满足该行程要求的车辆，从而避免中途停车影像乘客的出行。
第四过滤单元用于在优化计算模块根据贪心算法进行计算之前，剔除其司机发出拒单信息的非空闲行程车辆。
即在确定全部的非空闲行程车辆后，如果其中有车辆的司机有拒单历史、如上一次拒单或者在一定时间内做出限定次数的拒单行为，此时可以将该车辆予以剔除，然后在进行优化计算，从而可以避免有问题车辆被推送实时出行订单而影响乘客的用车。
第一推送模块30用于对长短时预约订单进行判断，将长时预约单进行广播推送。
即在确定非空闲行程车辆后，通过对预约时间信息的判断确定相应预约出行订单为长时预约单还是短时预约单，两者划分的根据为预约时间信息所指向的预约用车时间距离当前时刻的长短，即通过预设的时间阈值对长短时预约单进行判定，该时间阈值可以为一天或一周，按此原则所确定的时间阈值均在本申请的保护范围之内。
对于其中的长时预约单，因为与非空闲行程车辆的当前订单状态不会产生任何冲突，因此可以通过广播形式向所有非空闲行程车辆进行推送，非空闲行程车辆的司机可以随时接单或拒单。
另外，对于被广播的长时预约单，如果在预设时长内没有被接单，例如1秒、10秒、60秒、100秒或者上述数值之间的时长或者其他时长，则将该没有被接单的长时预约单返回给服务器的订单池。
时间过滤模块40用于根据订单完成时间剔除时间不匹配的非空闲行程车辆。
即确定非空闲行程车辆的当前订单、如实时单或者之前接收的预约单的完成时间，然后根据该完成时间对短时预约单的出行时间进行比较，如果两者冲突，即不能按时为该短时预约单的乘客提供服务，则剔除这个不能按时提供服务的非空闲行程车辆。
位置过滤模块50用于剔除无法到达短时预约单的出发点的非空闲行程车辆。
即确定非空闲行程车辆的当前订单、如实时单或者之前接收并正在执行的预约单的完成时间和终点位置，确定该非空闲行程车辆能否按时抵达短时预约单的出发点，如果能则不做处置，如果不能则将这个非空闲行程车辆予以剔除。
优化计算模块60用于根据贪心算法进行计算，得到目标车辆。
即根据贪心算法对预约出行订单和选定的非空闲行程车辆的车辆信息进行优化 计算，从多个非空闲行程车辆中找出与该实时出行订单最匹配的非空闲行程车辆作为该目标车辆。
第二推送模块70用于依次将不相冲突的短时预约单依次发送至目标车辆。
在确定目标车辆后，依次将多个不相冲突的短时预约单发送至该目标车辆，以便该目标车辆为发送该订单的乘客服务。这里不相冲突是指短时预约单的时间不相冲突。这里发送至目标车辆实际是指将该实时出行订单发送至该目标车辆上的移动设备，例如司机所持的手机等。
具体来说，该模块包括第一推送单元和第二推送单元，第一推送单元用于如果一个目标车辆仅有实时单，即正在为相应的乘客提供服务且没有接受的其他预约单，此时将起始时间位于该实时单之后的短时预约单推送给相应目标车辆；
第二推送单元用于如果此时不仅有实时单，还存在一个或多个短时预约单，则对实时单与排在第一位的预约单之间的时间空隙、以及对预约单之间的时间空隙进行计算，如果此时有能够满足上述时间空隙的短时预约单，则将该短时预约单推送给该目标车辆，或者将起始时间位于最后一个短时预约单之后的短时预约单推送给该目标车辆。
从上述技术方案可以看出，本实施例提供了一种基于非空闲行程车辆的预约单混合连环派单装置，该装置应用于出行打车系统的服务器，具体为获取预约出行订单；获取多个非空闲行程车辆；判断预约出行订单为长时预约单还是短时预约单，对于长时预约单通过广播形式向多个非空闲行程车辆推送；根据订单完成时间提出时间不匹配的非空闲行程车辆；剔除无法到达短时预约单的出发点的非空闲行程车辆；通过贪心算法对短时预约单和非空闲行程车辆的车辆信息进行优化计算，从多个非空闲行程车辆中得到目标车辆；将不相冲突的短时预约单依次发送给目标车辆。通过上述方案可以看出，即使在当前非空闲行程车辆已经接受有预约出行订单的情况下，也能将再次接单，提高了接单率，从而提高了用户的使用体验。
且本申请针对相应的预约出行订单通过贪心算法选择相应目标车辆，其对可能接单的非空闲行程车辆进行通盘计算，而非简单地仅基于距离派单或者通过抢单方式派单，实现了最小化总体接驾时间/距离的约束条件下的最大派单匹配，从而避免了基于距离的派单模式和抢单模式中全局效率问题，提高了用户的服务体验。
本说明书中的各个实施例均采用递进的方式描述，每个实施例重点说明的都是与其他实施例的不同之处，各个实施例之间相同相似的部分互相参见即可。
本领域内的技术人员应明白，本发明实施例的实施例可提供为方法、装置、或计算机程序产品。因此，本发明实施例可采用完全硬件实施例、完全软件实施例、或结合软件和硬件方面的实施例的形式。而且，本发明实施例可采用在一个或多个其中包含有计算机可用程序代码的计算机可用存储介质(包括但不限于磁盘存储器、CD-ROM、光学存储器等)上实施的计算机程序产品的形式。
本发明实施例是参照根据本发明实施例的方法、终端设备(系统)、和计算机程序产品的流程图和/或方框图来描述的。应理解可由计算机程序指令实现流程图和/或方框图中的每一流程和/或方框、以及流程图和/或方框图中的流程和/或方框的结合。可提供这些计算机程序指令到通用计算机、专用计算机、嵌入式处理机或其他可编程数据处理终端设备的处理器以产生一个机器，使得通过计算机或其他可编程数据处理终端设备的处理器执 行的指令产生用于实现在流程图一个流程或多个流程和/或方框图一个方框或多个方框中指定的功能的装置。
这些计算机程序指令也可存储在能引导计算机或其他可编程数据处理终端设备以特定方式工作的计算机可读存储器中，使得存储在该计算机可读存储器中的指令产生包括指令装置的制造品，该指令装置实现在流程图一个流程或多个流程和/或方框图一个方框或多个方框中指定的功能。
这些计算机程序指令也可装载到计算机或其他可编程数据处理终端设备上，使得在计算机或其他可编程终端设备上执行一系列操作步骤以产生计算机实现的处理，从而在计算机或其他可编程终端设备上执行的指令提供用于实现在流程图一个流程或多个流程和/或方框图一个方框或多个方框中指定的功能的步骤。
尽管已描述了本发明实施例的优选实施例，但本领域内的技术人员一旦得知了基本创造性概念，则可对这些实施例做出另外的变更和修改。所以，所附权利要求意欲解释为包括优选实施例以及落入本发明实施例范围的所有变更和修改。
最后，还需要说明的是，在本文中，诸如第一和第二等之类的关系术语仅仅用来将一个实体或者操作与另一个实体或操作区分开来，而不一定要求或者暗示这些实体或操作之间存在任何这种实际的关系或者顺序。而且，术语“包括”、“包含”或者其任何其他变体意在涵盖非排他性的包含，从而使得包括一系列要素的过程、方法、物品或者终端设备不仅包括那些要素，而且还包括没有明确列出的其他要素，或者是还包括为这种过程、方法、物品或者终端设备所固有的要素。在没有更多限制的情况下，由语句“包括一个……”限定的要素，并不排除在包括所述要素的过程、方法、物品或者终端设备中还存在另外的相同要素。
以上对本发明所提供的技术方案进行了详细介绍，本文中应用了具体个例对本发明的原理及实施方式进行了阐述，以上实施例的说明只是用于帮助理解本发明的方法及其核心思想；同时，对于本领域的一般技术人员，依据本发明的思想，在具体实施方式及应用范围上均会有改变之处，综上所述，本说明书内容不应理解为对本发明的限制。

Claims (13)

  1. 一种基于非空闲行程车辆的预约单混合连环派单方法，应用于出行打车系统的服务器，其特征在于，所述预约单混合连环派单方法包括步骤：
    获取预约出行订单；
    获取多个非空闲行程车辆；
    判断所述预约出行订单为长时预约单还是短时预约单；
    若所述预约出行订单为所述长时预约单，则对于所述长时预约单通过广播形式向所述多个非空闲行程车辆推送，并将预设时长内没有被接单的长时预约单返回到所述服务器的订单池中；
    若所述预约出行订单为所述短时预约单，则根据所述非空闲行程车辆的当前订单的完成时间，剔除所述完成时间与所述短时预约单的出行时间不相匹配的非空闲行程车辆；
    根据所述非空闲行程车辆的当前订单的终点位置和完成时间，剔除无法到达所述短时预约单指定的出发点的非空闲行程车辆；
    通过贪心算法对所述短时预约单和所述非空闲行程车辆的车辆信息进行优化计算，从所述多个非空闲行程车辆中确定目标车辆；
    将不相冲突的短时预约单依次发送至所述目标车辆。
  2. 如权利要求1所述的预约单混合连环派单方法，其特征在于，所述获取实时出行订单，包括：
    从所述服务器的订单池中每隔预设时长拉取所述预设时长内的所有出行订单；
    根据所述出行订单的时间参数从所述所有出行订单中选取出所述预约出行订单。
  3. 如权利要求1所述的预约单连环派单方法，其特征在于，所述获取多个非空闲行程车辆，包括：
    根据所述预约出行订单的预约出行位置获取所述预设范围内所有车辆；
    根据每个所述车辆的载客状态从中选取出所述非空闲行程车辆。
  4. 如权利要求1所述的预约单派单方法，其特征在于，所述获取多个非空闲行程车辆，还包括步骤：
    从所述多个非空闲行程车辆中剔除剩余行程与所述短时预约单的实际行程不匹配的非空闲行程车辆。
  5. 如权利要求1所述的预约单混合连环派单方法，其特征在于，所述获取多个非空闲行程车辆，还包括步骤：
    从所述多个非空闲行程车辆中剔除其司机做出预先规定的拒单行为的非空闲行程车辆。
  6. 如权利要求1所述的预约单混合连环派单方法，其特征在于，所述将多个不相冲突的多个短时预约单发送给所述目标车辆，包括：
    如果所述目标车辆仅存在当前实时单，则将开始时间位于所述当前实时单的订单终点时间之后的短时预约单发送给所述目标车辆；
    如果所述目标车辆存在所述当前实时单且已接受一个或多个所述短时预约单，将所需时间与所述当前实时单和已被接受的短时预约单的时间不冲突的短时预约单发送给所述目标车辆。
  7. 如权利要求1所述的预约单混合连环派单方法，其特征在于，所述通过贪心算法对所 述短时预约单和所述非空闲行程车辆的车辆信息进行优化计算，包括步骤：
    构建车辆-订单矩阵，所述车辆-订单矩阵包括车辆集合和预约单集合，还包括所述车辆集合中每个非空闲行程车辆与所述预约订单集合中每个短时预约单相对应的距离参数，所述距离参数为经过归一化处理的所述非空闲行程车辆的当前位置与所述短时预约单的出发位置的距离的倒数；
    针对每个所述短时预约单，利用贪心算法从所述车辆集合中选定所述目标车辆。
  8. 一种基于非空闲行程车辆的预约单混合连环派单装置，应用于出行打车系统的服务器，其特征在于，所述预约单派单装置包括：
    订单获取模块，被配置为获取预约出行订单；
    车辆获取模块，被配置为获取多个非空闲行程车辆；
    第一推送模块，被配置为判断所述预约出行订单为长时预约单还是短时预约单；若所述预约出行订单为所述长时预约单，则对于所述长时预约单通过广播形式向所述多个非空闲行程车辆推送，并将预设时长内没有被接单的长时预约单返回到所述服务器的订单池中；
    时间过滤模块，被配置为所述预约出行订单为所述短时预约单，则根据所述非空闲行程车辆的当前订单的完成时间，剔除所述完成时间与所述短时预约单的出行时间不相匹配的非空闲行程车辆；
    地点过滤模块，被配置为根据所述非空闲行程车辆的当前订单的终点位置和完成时间，剔除无法到达所述短时预约单指定的出发点的非空闲行程车辆；
    优化计算模块，被配置为通过贪心算法对所述短时预约单和所述非空闲行程车辆的车辆信息进行优化计算，从所述多个非空闲行程车辆中确定目标车辆；
    第二推送模块，被配置为将不相冲突的短时预约单依次发送至所述目标车辆。
  9. 如权利要求8所述的预约单混合连环派单装置，其特征在于，所述订单获取模块包括：
    第一获取单元，被配置为从所述服务器的订单池中每隔预设时长拉取所述预设时长内的所有出行订单；
    第一过滤单元，被配置为根据所述出行订单的时间参数从所述所有出行订单中选取出所述预约出行订单。
  10. 如权利要求8所述的预约单连环派单方法，其特征在于，所述车辆获取模块包括：
    第二获取单元，被配置为根据所述预约出行订单的预约出行位置获取所述预设范围内所有车辆；
    第二过滤单元，被配置为根据每个所述车辆的载客状态从中选取出所述非空闲行程车辆。
  11. 如权利要求10所述的预约单派单装置，其特征在于，所述车辆获取模块还包括：
    第三过滤单元，被配置为从所述多个非空闲行程车辆中剔除剩余行程与所述短时预约单的实际行程不匹配的非空闲行程车辆。
  12. 如权利要求10所述的预约单混合连环派单装置，其特征在于，所述车辆获取模块还包括：
    第四过滤单元，被配置为从所述多个非空闲行程车辆中剔除其司机做出预先规定的拒 单行为的非空闲行程车辆。
  13. 如权利要求7所述的预约单混合连环派单装置，其特征在于，所述第二推送模块包括：
    第一推送单元，被配置为如所述目标车辆仅存在当前实时单，则将开始时间位于所述当前实时单的订单终点时间之后的短时预约单发送给所述目标车辆；
    第二推送单元，被配置为如果所述目标车辆存在所述当前实时单且已接受一个或多个所述短时预约单，将所需时间与所述当前实时单和已被接受的短时预约单的时间不冲突的短时预约单发送给所述目标车辆。
PCT/CN2020/091263 2019-08-20 2020-05-20 基于非空闲行程车辆的预约单混合连环派单方法和装置 WO2021031635A1 (zh)

Applications Claiming Priority (2)

Application Number Priority Date Filing Date Title
CN201910770403.7A CN110570002A (zh) 2019-08-20 2019-08-20 基于非空闲行程车辆的预约单混合连环派单方法和装置
CN201910770403.7 2019-08-20

Publications (1)

Publication Number Publication Date
WO2021031635A1 true WO2021031635A1 (zh) 2021-02-25

Family

ID=68774149

Family Applications (1)

Application Number Title Priority Date Filing Date
PCT/CN2020/091263 WO2021031635A1 (zh) 2019-08-20 2020-05-20 基于非空闲行程车辆的预约单混合连环派单方法和装置

Country Status (2)

Country Link
CN (1) CN110570002A (zh)
WO (1) WO2021031635A1 (zh)

Families Citing this family (3)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN110570002A (zh) * 2019-08-20 2019-12-13 南京领行科技股份有限公司 基于非空闲行程车辆的预约单混合连环派单方法和装置
CN110852464A (zh) * 2019-08-20 2020-02-28 南京领行科技股份有限公司 一种基于实时单行程车辆的预约单连环派单方法和装置
CN112053028A (zh) * 2020-07-24 2020-12-08 长沙市到家悠享家政服务有限公司 订单分配方法、装置、设备和存储介质

Citations (5)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
WO2013072729A1 (en) * 2011-11-14 2013-05-23 Way Better Ltd System and method for ride sharing
CN109948874A (zh) * 2017-12-21 2019-06-28 北京嘀嘀无限科技发展有限公司 拼车订单分配方法及系统
CN109961158A (zh) * 2017-12-25 2019-07-02 北京嘀嘀无限科技发展有限公司 预约订单分配方法和预约订单分配装置
CN110570002A (zh) * 2019-08-20 2019-12-13 南京领行科技股份有限公司 基于非空闲行程车辆的预约单混合连环派单方法和装置
CN110570003A (zh) * 2019-08-20 2019-12-13 南京领行科技股份有限公司 一种基于空闲行程车辆的预约出行订单的派单方法和装置

Patent Citations (5)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
WO2013072729A1 (en) * 2011-11-14 2013-05-23 Way Better Ltd System and method for ride sharing
CN109948874A (zh) * 2017-12-21 2019-06-28 北京嘀嘀无限科技发展有限公司 拼车订单分配方法及系统
CN109961158A (zh) * 2017-12-25 2019-07-02 北京嘀嘀无限科技发展有限公司 预约订单分配方法和预约订单分配装置
CN110570002A (zh) * 2019-08-20 2019-12-13 南京领行科技股份有限公司 基于非空闲行程车辆的预约单混合连环派单方法和装置
CN110570003A (zh) * 2019-08-20 2019-12-13 南京领行科技股份有限公司 一种基于空闲行程车辆的预约出行订单的派单方法和装置

Also Published As

Publication number Publication date
CN110570002A (zh) 2019-12-13

Similar Documents

Publication Publication Date Title
WO2021031638A1 (zh) 一种派单方法和装置
WO2021031637A1 (zh) 一种基于空闲行程车辆的预约出行订单的派单方法和装置
WO2021031634A1 (zh) 一种基于实时单行程车辆的预约单连环派单方法和装置
WO2021031635A1 (zh) 基于非空闲行程车辆的预约单混合连环派单方法和装置
US11250531B2 (en) Hierarchical selection process
CN107230091B (zh) 拼车请求订单匹配方法及装置
WO2017106256A1 (en) Systems and methods for adjusting ride-sharing schedules and routes
CN107784412B (zh) 一种订单自动匹配处理方法及服务器
CN113658446A (zh) 路径规划方法及装置、计算机可读存储介质、终端
CN111915050A (zh) 泊车位可用性预测系统和方法
CN110956351A (zh) 一种订单分配方法及装置、服务器、计算机可读存储介质
DE112016006754T5 (de) Verfahren und vorrichtung zur on-demand-kraftstofflieferung
CN113269427B (zh) 一种公务出行任务调度管理方法及系统
CN111784126A (zh) 车辆调度方法、装置、电子设备及机器可读存储介质
WO2019010580A1 (en) SYSTEM AND METHOD FOR MANAGING PARKING REQUESTS
WO2021031636A1 (zh) 一种基于实时单行程车辆的实时单派单方法和装置
CN110942240B (zh) 信息处理方法、系统、终端及存储介质
CN110852463A (zh) 一种基于空闲行程车辆的预约单连环派单方法和装置
CN111105546A (zh) 一种车辆服务的即时预约方法
CN110853333A (zh) 一种基于实时单行程车辆的预约单派单方法和装置
CN113642761A (zh) Robotaxi自动驾驶共享网约车资源分配方法
CN110766492A (zh) 订单信息的处理方法、装置及设备
CN115713168A (zh) 用车出行时间预测方法、装置、服务器及存储介质
CN111178558A (zh) 网约车订单处理方法及装置、计算机设备和可读存储介质
CN114881692A (zh) 网约车调度方法、装置、电子设备及存储介质

Legal Events

Date Code Title Description
121 Ep: the epo has been informed by wipo that ep was designated in this application

Ref document number: 20854135

Country of ref document: EP

Kind code of ref document: A1

NENP Non-entry into the national phase

Ref country code: DE

122 Ep: pct application non-entry in european phase

Ref document number: 20854135

Country of ref document: EP

Kind code of ref document: A1

122 Ep: pct application non-entry in european phase

Ref document number: 20854135

Country of ref document: EP

Kind code of ref document: A1