WO2021031637A1 - 一种基于空闲行程车辆的预约出行订单的派单方法和装置 - Google Patents

一种基于空闲行程车辆的预约出行订单的派单方法和装置 Download PDF

Info

Publication number
WO2021031637A1
WO2021031637A1 PCT/CN2020/091266 CN2020091266W WO2021031637A1 WO 2021031637 A1 WO2021031637 A1 WO 2021031637A1 CN 2020091266 W CN2020091266 W CN 2020091266W WO 2021031637 A1 WO2021031637 A1 WO 2021031637A1
Authority
WO
WIPO (PCT)
Prior art keywords
travel
order
vehicles
idle
vehicle
Prior art date
Application number
PCT/CN2020/091266
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 WO2021031637A1 publication Critical patent/WO2021031637A1/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/06—Resources, workflows, human or project management; Enterprise or organisation planning; Enterprise or organisation modelling
    • G06Q10/063—Operations research, analysis or management
    • G06Q10/0631—Resource planning, allocation, distributing or scheduling for enterprises or organisations
    • G06Q10/06315—Needs-based resource requirements planning or analysis
    • 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
    • G06Q50/40—

Definitions

  • the present invention relates to the technical field of online car-hailing, in particular to a method and device for dispatching travel orders based on idle travel 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 dispatching travel orders based on idle travel vehicles to improve the service experience of users.
  • the present invention discloses a method for dispatching a travel order based on an idle travel vehicle reservation, which is applied to a server of a travel taxi system.
  • the dispatching method includes the steps:
  • the long-term reservation form is sent to the plurality of vehicles in a broadcast form, and the vehicles include idle travel vehicles and non-idle travel vehicles;
  • the reservation travel order is the short-term reservation form
  • the obtaining of an appointment travel order includes:
  • the scheduled travel order is selected from all the travel orders.
  • the acquiring multiple idle itinerary vehicles within a preset range according to the reserved departure position includes:
  • the acquiring multiple idle itinerary vehicles within a preset range according to the reserved departure position further includes the steps:
  • the acquiring multiple idle itinerary vehicles within a preset range according to the reserved departure position further includes the steps:
  • the idle journey vehicles whose remaining journey does not match the actual journey of the reserved travel order are excluded from the plurality of idle journey vehicles.
  • the acquiring multiple idle itinerary vehicles within a preset range according to the reserved departure position further includes the steps:
  • the optimization calculation of the vehicle information of the short-term reservation form and the idle travel vehicle through a greedy algorithm includes:
  • the vehicle-order matrix includes a set of vehicles and a set of reservation orders, and also includes the distance parameters between each idle trip vehicle in the vehicle set and each short-term reservation in the reservation order set ,
  • the distance parameter is the reciprocal of the distance between the normalized current position of the idle travel vehicle and the starting position of the short-term reservation form;
  • the target vehicle is selected from the vehicle set by using a greedy algorithm.
  • the present application also provides an order dispatching device based on the reserved travel order of idle travel vehicles, which is applied to the server of the travel taxi system, and the order dispatching device includes:
  • the order obtaining module is configured to obtain the scheduled travel orders, and obtain the scheduled departure location and scheduled departure time of each of the scheduled travel orders;
  • a vehicle acquisition module configured to acquire a plurality of idle journey vehicles within a preset range according to the reserved departure position
  • 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 by judging the scheduled departure time; if the scheduled travel order is the long-term reservation order, then The long-term appointment form is sent to the multiple vehicles in a broadcast form, and the vehicles include idle travel vehicles and non-idle travel vehicles;
  • the optimization calculation module is configured to perform optimization calculations on the short-term reservation order and the vehicle information of the idle travel vehicle through a greedy algorithm if the travel reservation order is the short-term reservation order, from the multiple Identify the target vehicle among idle travel vehicles;
  • the second pushing module is configured to send the short-term appointment form 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 the travel orders.
  • the vehicle acquisition module includes:
  • the second acquiring unit is configured to acquire all vehicles within the preset range according to the reserved departure position
  • the second filtering unit is configured to select the idle trip vehicle according to the passenger loading status of each vehicle.
  • the vehicle acquisition module further includes:
  • the third filtering unit is configured to remove, from the plurality of idle trip vehicles, idle trip vehicles whose types do not match the specified model of the scheduled travel order.
  • the vehicle acquisition module further includes:
  • the fourth filtering unit is configured to exclude idle trip vehicles whose drivers have issued a rejection message from the plurality of idle trip vehicles through the greedy algorithm.
  • the vehicle acquisition module further includes:
  • the fifth filtering unit is configured to eliminate idle trip vehicles whose remaining trip does not match the actual trip of the reserved travel order from the plurality of idle trip vehicles.
  • the vehicle acquisition module further includes:
  • the sixth filtering module is configured to eliminate idle travel vehicles that cannot reach the scheduled departure location according to the scheduled departure time.
  • the present invention provides a method and device for dispatching reservation travel orders based on idle travel vehicles.
  • the method and device are applied to the server of the travel taxi system, specifically to obtain the reservation travel order and obtain The scheduled departure location and scheduled departure time of each scheduled travel order; get multiple idle itinerary vehicles within the preset range according to the scheduled departure location; determine whether the scheduled travel order is a long-term reservation or a short-term reservation by judging the scheduled departure time
  • the long-term reservation form is broadcast to multiple idle itinerary vehicles; if the reservation travel order is a short-term reservation form, the greedy algorithm is used to optimize the vehicle information of the short-term reservation form and the idle travel vehicle.
  • the target vehicle is obtained from the idle travel vehicles; the short-term reservation form is sent to the target vehicle.
  • the order dispatching method in this technical solution selects the corresponding target vehicle through a greedy algorithm for the corresponding reserved travel order, and performs a comprehensive calculation of the idle itinerary vehicles that may receive orders, instead of simply dispatching orders based on distance or dispatching orders through rush orders. It realizes the maximum dispatch matching under the constraints of minimizing the overall pick-up time/distance, thereby avoiding the global efficiency problems in the distance-based dispatch mode and the order-grabbing mode, and improves the user's service experience.
  • FIG. 1 is a flowchart of a method for dispatching a travel order based on an idle travel vehicle according to an embodiment of the application;
  • FIG. 2 is a block diagram of a device for dispatching a travel order based on a reserved travel order for a free travel vehicle according to an embodiment of the application.
  • Fig. 1 is a flowchart of a method for dispatching a travel order based on an idle travel vehicle according to an embodiment of the application.
  • the dispatch method provided in this embodiment is applied to the server of the ride-hailing system, and is used to place an order for passengers and provide a dispatching solution to a taxi.
  • the idle trip vehicle here refers to the contracted vehicle belonging to the ride-hailing system, and is currently in an idle state, that is, the state of not providing services to passengers.
  • the state of not providing services to passengers specifically refers to not carrying passengers or driving to pick up passengers. On the way to carry passengers.
  • the dispatch method specifically includes the following steps:
  • the travel reservation order here refers to a travel order that is currently issued by passengers who need to provide car rental services and needs car rental services in the future.
  • passengers place corresponding orders they generally use the mobile terminal to send electronic information to the server of the ride-hailing system.
  • the scheduled travel order will include the corresponding scheduled departure location and scheduled departure time, the scheduled departure location will indicate the specific location of the passenger who issued the travel order, and the scheduled time will indicate the time required to get the service.
  • a preset time interval such as every 2 seconds
  • For specific travel orders Whether it is a real-time travel order or a forward reservation order can be judged by the appointment time of the car, that is, it can be judged by the appointment time parameter in the travel order; when all travel orders within this period of time are pulled, according to the appointment in the travel order Time parameters are used to make judgments, and all reservation travel orders are selected from the judgment.
  • the idle travel vehicles within the preset range based on the location information according to the scheduled departure location, that is, the vehicles that do not provide services for any passengers.
  • 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.
  • steps in this application may also include some or all of the following steps.
  • the passenger’s travel order will provide the vehicle type they need, that is, the vehicle type requirement is included. If the passenger’s demand cannot be met, the passenger’s experience will be reduced. Therefore, when determining the entire idle itinerary After the vehicle, filter all idle travel vehicles according to the specified vehicle type in the travel order. If one or some vehicles do not match the specified vehicle type, it will be removed and then optimized calculations can be performed to avoid express rejection by passengers Car models participate in the calculation.
  • the remaining itinerary information of each vehicle is received at the same time, and the itinerary requirements of the corresponding reservation travel order are judged, and vehicles whose remaining itinerary cannot meet the requirements of the itinerary are excluded from them, thereby avoiding midway parking Video passenger travel.
  • the idle itinerary vehicles by accepting the feedback information of the corresponding idle itinerary vehicles, it is determined whether the corresponding idle itinerary vehicles can reach the scheduled departure position according to the scheduled departure time. If not, the idle itinerary vehicles will be eliminated to avoid delaying passengers Travel.
  • the free travel vehicle determines whether the corresponding reservation travel order is a long-term reservation or a short-term reservation by judging the reserved departure time.
  • the two are divided according to the distance of the reserved car time pointed to by the reserved departure time from 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 travel vehicle For the long-term appointment order, because there will be no conflict with the current order status of the idle travel vehicle, it can be pushed to all vehicles through broadcast, and the drivers of all vehicles can accept or reject orders at any time.
  • the vehicles here are not only Including idle trip vehicles and non-idle trip vehicles.
  • the vehicle information of the short-term reservation form and the idle trip vehicle is optimized according to the greedy algorithm, and the best match with the short-term reservation form is found from multiple idle trip vehicles
  • the idle travel vehicle of is used as the target vehicle.
  • the vehicle-order matrix is first constructed, and when the vehicle-order matrix is constructed, multiple short-term appointment orders are first obtained to form an appointment order set 0.
  • For each short-term appointment order o according to its departure The current position of a plurality of idle trip vehicles d of the position distance is selected, and a candidate vehicle set D is obtained.
  • 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 idle trip vehicle, and the After the countdown, normalize it as the distance parameter v between the corresponding reservation and the corresponding idle journey vehicle, as shown in Table 1.
  • 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 corresponding short-term reservation form is sent to the target vehicle so that the target vehicle can serve the passenger who sent the order.
  • Sending to the target vehicle here actually refers to sending the scheduled travel order to the mobile device on the target vehicle, such as the mobile phone held by the driver, the car machine of the vehicle, and so on.
  • the real-time order or the reservation order can also be pushed to other vehicles such as idle travel vehicles in the form of broadcasting, so as to increase the vehicle's order acceptance rate.
  • this embodiment provides a method for dispatching reservation travel orders based on idle travel vehicles.
  • the method is applied to the server of the travel taxi system, specifically to obtain the reservation travel order and obtain each reservation.
  • the scheduled departure location and scheduled departure time of the travel order obtain multiple idle itinerary vehicles within the preset range according to the scheduled departure location; determine whether the scheduled travel order is a long-term reservation order or a short-term reservation order by judging the scheduled departure time.
  • the long-term reservation order is sent to multiple idle itinerary vehicles in the form of broadcast; if the reservation travel order is a short-time reservation order, the greedy algorithm is used to optimize the vehicle information of the short-term reservation order and idle itinerary vehicles, from multiple idle itineraries
  • the target vehicle is obtained from the vehicle; the short-term reservation form is sent to the target vehicle.
  • the order dispatching method in this technical solution selects the corresponding target vehicle through a greedy algorithm for the corresponding reserved travel order, and performs a comprehensive calculation of the idle itinerary vehicles that may take orders, instead of simply dispatching orders based on distance or dispatching orders It realizes the maximum dispatch matching under the constraints of minimizing the overall pick-up time/distance, thereby avoiding the global efficiency problems in the distance-based dispatch mode and the order-grabbing mode, and improves the user's service experience.
  • FIG. 2 is a block diagram of a device for dispatching a travel order based on a reserved travel order for a free travel vehicle according to an embodiment of the application.
  • the dispatch device provided in this embodiment is applied to the server of the ride-hailing system, which can be understood as an actual electronic device or a functional module of the server, which is used to place orders for passengers and provide dispatch orders to taxis.
  • the idle trip vehicle here refers to the contracted vehicle belonging to the ride-hailing system, and is currently in an idle state, that is, the state of not providing services to passengers.
  • the state of not providing services to passengers specifically refers to not carrying passengers or driving to pick up passengers.
  • the order dispatching device specifically includes an order acquisition module 10, a vehicle acquisition module 20, a first push module 30, an optimization calculation module 40, and a second push module 50.
  • the order obtaining module 10 is used to obtain a travel reservation order.
  • the travel reservation order here refers to a travel order that is currently issued by passengers who need to provide car rental services and needs car rental services in the future.
  • passengers When passengers place corresponding orders, they usually send electronic messages to the server of the ride-hailing system through mobile terminals.
  • the scheduled travel order will include the corresponding scheduled departure location and scheduled departure time, the scheduled departure location will indicate the specific location of the passenger who issued the travel order, and the scheduled time will indicate the time required to get the service.
  • the order acquisition module here specifically includes a first acquisition unit and a first filter unit.
  • the first obtaining unit is used to retrieve 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 reservation orders. Whether the travel order is a real-time travel order or an appointment travel order can be judged by the reserved car time, that is, it can be judged by the appointment time parameter in the 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.
  • a preset time interval such as every 2 seconds
  • the vehicle acquisition module 20 is configured to acquire a plurality of idle journey vehicles within a preset range according to the reserved departure position.
  • the idle travel vehicles within the preset range based on the location information according to the scheduled departure location, that is, the vehicles that do not provide services for any passengers.
  • 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 includes a second acquisition unit and a second filtering unit.
  • the second acquisition unit is used to acquire all vehicles in the preset range according to the location information, that is, to acquire All vehicles contracted with the ride-hailing system;
  • the second filter unit is used to make judgments according to the service status of each vehicle, and select idle travel vehicles from it.
  • the third filter unit, the fourth filter unit, the fifth filter unit, and the sixth filter unit can also be used in the steps of this application.
  • the third filtering unit is used to eliminate idle travel vehicles whose types do not match the vehicle type specified in the reserved travel order.
  • the passenger’s travel order will provide the vehicle type they need, that is, the vehicle type requirement is included. If the passenger’s demand cannot be met, the passenger’s experience will be reduced. Therefore, when determining the entire idle itinerary After the vehicle, filter all idle travel vehicles according to the specified vehicle type in the travel order. If one or some vehicles do not match the specified vehicle type, it will be removed and then optimized calculations can be performed to avoid express rejection by passengers Car models participate in the calculation.
  • the fourth filter unit is used to eliminate idle travel vehicles whose drivers have issued rejection information.
  • the fifth filter unit is used to eliminate idle travel vehicles whose remaining travel cannot meet the order demand.
  • the remaining itinerary information of each vehicle is received at the same time, and the itinerary requirements of the corresponding reservation travel order are judged, and vehicles whose remaining itinerary cannot meet the requirements of the itinerary are excluded from them, thereby avoiding midway parking Video passenger travel.
  • the sixth filtering unit is used to eliminate idle travel vehicles that cannot arrive at the reserved location on time.
  • the idle itinerary vehicles by accepting the feedback information of the corresponding idle itinerary vehicles, it is determined whether the corresponding idle itinerary vehicles can reach the scheduled departure position according to the scheduled departure time. If not, the idle itinerary vehicles will be eliminated to avoid delaying passengers Travel.
  • the first push module 30 is used for judging the long and short-term appointment order, and broadcast and push the long-term appointment order.
  • the free travel vehicle determines whether the corresponding reservation travel order is a long-term reservation or a short-term reservation by judging the reserved departure time.
  • the two are divided according to the distance of the reserved car time pointed to by the reserved departure time from 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 optimization calculation module 40 is used for calculating according to the greedy algorithm to obtain the target vehicle.
  • the vehicle information of the short-term reservation form and the idle trip vehicle is optimized according to the greedy algorithm, and the best match with the short-term reservation form is found from multiple idle trip vehicles
  • the idle travel vehicle of is used as the target vehicle.
  • the second push module 50 is used to send the scheduled travel order to the target vehicle.
  • the corresponding short-term reservation form is sent to the target vehicle so that the target vehicle can serve the passenger who sent the order.
  • Sending to the target vehicle here actually refers to sending the scheduled travel order to the mobile device on the target vehicle, such as the mobile phone held by the driver, the car machine of the vehicle, and so on.
  • the real-time order or the reservation order can also be pushed to other vehicles such as idle travel vehicles in the form of broadcasting, so as to increase the vehicle's order acceptance rate.
  • this embodiment provides a device for dispatching reservation travel orders based on idle travel vehicles.
  • the device is applied to the server of the travel taxi system, specifically to obtain the reservation travel order and obtain each reservation.
  • the scheduled departure location and scheduled departure time of the travel order obtain multiple idle itinerary vehicles within the preset range according to the scheduled departure location; determine whether the scheduled travel order is a long-term reservation order or a short-term reservation order by judging the scheduled departure time.
  • the long-term reservation order is sent to multiple idle itinerary vehicles in the form of broadcast; if the reservation travel order is a short-time reservation order, the greedy algorithm is used to optimize the vehicle information of the short-term reservation order and idle itinerary vehicles, from multiple idle itineraries
  • the target vehicle is obtained from the vehicle; the short-term reservation form is sent to the target vehicle.
  • the order dispatching device in this technical scheme selects the corresponding target vehicle through a greedy algorithm for the corresponding reserved travel order, and performs a comprehensive calculation of the idle travel vehicles that may take orders, instead of simply dispatching orders based on distance or dispatching orders It realizes the maximum dispatch matching under the constraints of minimizing the overall pick-up time/distance, thereby avoiding the global efficiency problems in the distance-based dispatch mode and the order-grabbing mode, and improves 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)
  • Human Resources & Organizations (AREA)
  • Engineering & Computer Science (AREA)
  • Strategic Management (AREA)
  • Economics (AREA)
  • Entrepreneurship & Innovation (AREA)
  • Physics & Mathematics (AREA)
  • General Physics & Mathematics (AREA)
  • Theoretical Computer Science (AREA)
  • Marketing (AREA)
  • Development Economics (AREA)
  • General Business, Economics & Management (AREA)
  • Tourism & Hospitality (AREA)
  • Operations Research (AREA)
  • Quality & Reliability (AREA)
  • Accounting & Taxation (AREA)
  • Finance (AREA)
  • Game Theory and Decision Science (AREA)
  • Educational Administration (AREA)
  • Management, Administration, Business Operations System, And Electronic Commerce (AREA)
  • Traffic Control Systems (AREA)

Abstract

一种基于空闲行程车辆的预约出行订单的派单方法和装置，该方法和装置应用于出行打车系统的服务器，具体为获取预约出行订单(S1)，并获取每个预约出行订单的预约出发位置和预约出发时间；根据预约出发位置获取预设范围内的多个空闲行程车辆(S2)；判断确定预约出行订单是长时预约单还是短时预约单，将长时预约单通过广播形式发送到多个空闲行程车辆和非空闲行程车辆(S3)；对于短时预约单，则通过贪心算法对短时预约单和空闲行程车辆的车辆信息进行计算，得到目标车辆(S4)；将短时预约单发送给目标车辆(S5)。针对相应的预约出行订单通过贪心算法选择相应目标车辆，实现了约束条件下的最大派单匹配，从而避免了基于距离的派单模式和抢单模式中全局效率问题。

Description

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

Claims (15)

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

Applications Claiming Priority (2)

Application Number Priority Date Filing Date Title
CN201910770437.6A CN110570003A (zh) 2019-08-20 2019-08-20 一种基于空闲行程车辆的预约出行订单的派单方法和装置
CN201910770437.6 2019-08-20

Publications (1)

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

Family

ID=68774161

Family Applications (1)

Application Number Title Priority Date Filing Date
PCT/CN2020/091266 WO2021031637A1 (zh) 2019-08-20 2020-05-20 一种基于空闲行程车辆的预约出行订单的派单方法和装置

Country Status (2)

Country Link
CN (1) CN110570003A (zh)
WO (1) WO2021031637A1 (zh)

Cited By (3)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN114119159A (zh) * 2021-11-29 2022-03-01 武汉理工大学 一种网约车实时订单匹配和空闲车辆调度方法及系统
CN117669945A (zh) * 2023-11-29 2024-03-08 安徽联爱科技有限公司 一种定制客运车辆出行业务自动派单方法及系统
CN117669945B (zh) * 2023-11-29 2024-05-10 安徽联爱科技有限公司 一种定制客运车辆出行业务自动派单方法及系统

Families Citing this family (9)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN110852464A (zh) * 2019-08-20 2020-02-28 南京领行科技股份有限公司 一种基于实时单行程车辆的预约单连环派单方法和装置
CN110570002A (zh) * 2019-08-20 2019-12-13 南京领行科技股份有限公司 基于非空闲行程车辆的预约单混合连环派单方法和装置
CN110570003A (zh) * 2019-08-20 2019-12-13 南京领行科技股份有限公司 一种基于空闲行程车辆的预约出行订单的派单方法和装置
CN113139764B (zh) * 2020-01-19 2023-04-14 北京三快在线科技有限公司 派单方法、装置、存储介质及电子设备
CN111598277B (zh) * 2020-04-15 2021-09-14 杭州优行科技有限公司 一种预约取送件订单的派送方法、装置、电子设备及存储介质
CN112669534B (zh) * 2020-12-03 2022-05-17 东风汽车集团有限公司 一种服务车辆分配方法及装置
CN113033849B (zh) * 2021-03-30 2024-02-27 满帮信息科技有限公司 预约车辆匹配方法、系统、电子设备及存储介质
CN113283622B (zh) * 2021-04-30 2024-01-12 完美世界控股集团有限公司 一种在线选座方法及装置、存储介质、计算机设备
CN113159458B (zh) * 2021-05-20 2022-04-08 南京领行科技股份有限公司 网约车的分配方法、装置、电子设备及存储介质

Citations (6)

* 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
CN107122836A (zh) * 2017-04-14 2017-09-01 上海雷腾软件股份有限公司 一种用于车辆派单的方法及设备
CN109598363A (zh) * 2018-12-19 2019-04-09 睿驰达新能源汽车科技（北京）有限公司 一种车辆预约方法和装置
CN109800896A (zh) * 2018-12-21 2019-05-24 浙江数链科技有限公司 车辆调度方法、装置、计算机设备和存储介质
CN109961158A (zh) * 2017-12-25 2019-07-02 北京嘀嘀无限科技发展有限公司 预约订单分配方法和预约订单分配装置
CN110570003A (zh) * 2019-08-20 2019-12-13 南京领行科技股份有限公司 一种基于空闲行程车辆的预约出行订单的派单方法和装置

Patent Citations (6)

* 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
CN107122836A (zh) * 2017-04-14 2017-09-01 上海雷腾软件股份有限公司 一种用于车辆派单的方法及设备
CN109961158A (zh) * 2017-12-25 2019-07-02 北京嘀嘀无限科技发展有限公司 预约订单分配方法和预约订单分配装置
CN109598363A (zh) * 2018-12-19 2019-04-09 睿驰达新能源汽车科技（北京）有限公司 一种车辆预约方法和装置
CN109800896A (zh) * 2018-12-21 2019-05-24 浙江数链科技有限公司 车辆调度方法、装置、计算机设备和存储介质
CN110570003A (zh) * 2019-08-20 2019-12-13 南京领行科技股份有限公司 一种基于空闲行程车辆的预约出行订单的派单方法和装置

Cited By (3)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN114119159A (zh) * 2021-11-29 2022-03-01 武汉理工大学 一种网约车实时订单匹配和空闲车辆调度方法及系统
CN117669945A (zh) * 2023-11-29 2024-03-08 安徽联爱科技有限公司 一种定制客运车辆出行业务自动派单方法及系统
CN117669945B (zh) * 2023-11-29 2024-05-10 安徽联爱科技有限公司 一种定制客运车辆出行业务自动派单方法及系统

Also Published As

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

Similar Documents

Publication Publication Date Title
WO2021031637A1 (zh) 一种基于空闲行程车辆的预约出行订单的派单方法和装置
WO2021031638A1 (zh) 一种派单方法和装置
US11747154B2 (en) Network system for preselecting a service provider based on predictive information
US20220215499A1 (en) Hierarchical selection process
US11601511B2 (en) Service information and configuration user interface
WO2021031634A1 (zh) 一种基于实时单行程车辆的预约单连环派单方法和装置
US11599964B2 (en) Network system to filter requests by destination and deadline
US11001161B2 (en) Electric vehicle charging scheduler
US10796248B2 (en) Ride-sharing joint rental groups
CN110809774A (zh) 提供运输服务的方法和系统
WO2021031635A1 (zh) 基于非空闲行程车辆的预约单混合连环派单方法和装置
US20160320195A1 (en) Ride-sharing long-term ride-share groups
US20170330111A1 (en) Systems and methods for managing travel options
US20180315021A1 (en) System and method for generating event invitations to specified recipients
CN113658446A (zh) 路径规划方法及装置、计算机可读存储介质、终端
CN111915050A (zh) 泊车位可用性预测系统和方法
US20170178085A1 (en) Method, apparatus, and system for managing reservations
JP6439251B2 (ja) 車両管理システム及び車両管理方法
WO2021031636A1 (zh) 一种基于实时单行程车辆的实时单派单方法和装置
CN111860902A (zh) 订单处理方法、装置、设备及计算机可读存储介质
CN110853333A (zh) 一种基于实时单行程车辆的预约单派单方法和装置
CN114881692A (zh) 网约车调度方法、装置、电子设备及存储介质
CN114529180A (zh) 数据处理方法及装置
CN110751532A (zh) 一种资源分配的方法及装置
US20220261698A1 (en) Information processing device, non-transitory storage medium, and information processing method for managing vehicles that are used in car sharing service

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: 20853869

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: 20853869

Country of ref document: EP

Kind code of ref document: A1