+

CN104809527B - The order automatic selecting method that a kind of mobile phone is called a taxi - Google Patents

The order automatic selecting method that a kind of mobile phone is called a taxi Download PDF

Info

Publication number
CN104809527B
CN104809527B CN201510236530.0A CN201510236530A CN104809527B CN 104809527 B CN104809527 B CN 104809527B CN 201510236530 A CN201510236530 A CN 201510236530A CN 104809527 B CN104809527 B CN 104809527B
Authority
CN
China
Prior art keywords
order
new
new order
time
place
Prior art date
Legal status (The legal status is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the status listed.)
Active
Application number
CN201510236530.0A
Other languages
Chinese (zh)
Other versions
CN104809527A (en
Inventor
王田
许迪文
王成
钟必能
张国亮
蔡奕侨
Current Assignee (The listed assignees may be inaccurate. Google has not performed a legal analysis and makes no representation or warranty as to the accuracy of the list.)
Huaqiao University
Original Assignee
Huaqiao University
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 Huaqiao University filed Critical Huaqiao University
Priority to CN201510236530.0A priority Critical patent/CN104809527B/en
Publication of CN104809527A publication Critical patent/CN104809527A/en
Application granted granted Critical
Publication of CN104809527B publication Critical patent/CN104809527B/en
Active legal-status Critical Current
Anticipated expiration legal-status Critical

Links

Landscapes

  • Management, Administration, Business Operations System, And Electronic Commerce (AREA)

Abstract

一种手机打车的订单自动选择方法，1)若已接订单列表尚未存在订单，则进入步骤2)，若已接订单列表存在订单，则进入步骤3)；2)判断司机能否在规定的时间内完成从当前地点至新订单接客地点的路程，并判断新订单效率值是否为正，若均满足，则将新订单加入订单列表，若否，则拒绝新订单；3)先根据接客开始时间判断新订单处于订单列表的位置，而后针对不同位置，分别进行时间冲突判断及对应的订单效率值判断，若均满足，则将新订单加入订单列表，若否，则拒绝订单。本发明能使司机利益最大化的同时还避免了司机对订单做出判断时存在的安全隐患，另一方面可以合理地调度的士资源，缓解“打车难”“空载多”的问题。

An automatic order selection method for mobile phone taxis, 1) if there is no order in the received order list, then enter step 2), if there is an order in the received order list, then enter step 3); Complete the journey from the current location to the pick-up location of the new order within a certain time, and judge whether the efficiency value of the new order is positive. If both are satisfied, add the new order to the order list, otherwise, reject the new order; The time judges that the new order is in the position of the order list, and then judges the time conflict and the corresponding order efficiency value for different positions. If both are satisfied, the new order will be added to the order list, and if not, the order will be rejected. The present invention can maximize the driver's benefits and avoid potential safety hazards when the driver makes judgments on orders. On the other hand, it can rationally dispatch taxi resources and alleviate the problems of "difficult to take a taxi" and "too many empty loads".

Description

一种手机打车的订单自动选择方法An automatic order selection method for mobile taxi hailing

技术领域technical field

本发明涉及手机应用领域，特别是一种手机打车的订单自动选择方法。The invention relates to the field of mobile phone applications, in particular to an automatic order selection method for calling a taxi with a mobile phone.

背景技术Background technique

伴随着互联网的发展，现有的手机打车软件已经逐渐走进人们的生活。手机打车软件的出现使得当前“打车难”“空载多”的情况有所缓解。用户在注册登录过以后，可以利用提前预约订单的方式将打车需求上传至服务器，再由服务器将订单广播给用户周围的出租车司机，由司机判断决定是否接单。Along with the development of the Internet, the existing mobile taxi-hailing software has gradually entered people's lives. The emergence of mobile taxi-hailing software has alleviated the current situation of "difficult to hail a taxi" and "too many empty loads". After the user has registered and logged in, he can use the method of booking an order in advance to upload the taxi demand to the server, and then the server broadcasts the order to the taxi drivers around the user, and the driver decides whether to accept the order.

结合日益流行的互联网移动支付的预约打车方式使得利用手机软件打车比起传统打车方式有不少优势。然而，当前主流的手机打车软件仅将用户的订单信息广播给司机而未提供相关的收益等信息供司机判断，从而影响到司机对订单判断的准确性。司机需要根据用户提交订单的起始点和时间判断接下此订单时间是否允许，收益是否可观，这样就使其无法专心驾驶，给自己和顾客带来了很大的安全威胁。另外，往往因司机不敢轻易接单，或是接下后无法按时完成，从而大大降低了用户的打车成功率，使得手机打车软件的用户体验大打折扣。Combined with the increasingly popular Internet mobile payment method of booking a taxi, the use of mobile phone software to hail a taxi has many advantages over the traditional way of hailing a taxi. However, the current mainstream mobile taxi-hailing software only broadcasts the user's order information to the driver and does not provide relevant income and other information for the driver to judge, thus affecting the accuracy of the driver's judgment on the order. The driver needs to judge whether the time for taking the order is allowed and whether the income is considerable based on the starting point and time of the user's submission of the order, which prevents them from concentrating on driving and poses a great security threat to themselves and customers. In addition, often because the driver dare not take the order easily, or cannot complete it on time after taking the order, the success rate of the user's taxi-hailing is greatly reduced, and the user experience of the mobile taxi-hailing software is greatly reduced.

发明内容Contents of the invention

本发明的主要目的在于克服现有技术中的上述缺陷，提出一种实现资源的合理调度、最大化行车收益、优化手机打车软件的用户体验的手机打车的订单自动选择方法。The main purpose of the present invention is to overcome the above-mentioned defects in the prior art, and propose an automatic order selection method for mobile phone taxis that realizes reasonable scheduling of resources, maximizes driving revenue, and optimizes user experience of mobile phone taxi software.

本发明采用如下技术方案：The present invention adopts following technical scheme:

一种手机打车的订单自动选择方法，其特征在于：定义订单为J(Jt、Js、Jd)，其中：Jt为接客开始时间、Js为接客地点、Jd为送客地点；订单序列为(J1，J2，J3…Jn)，按照时间顺序前后到达,n＝1、2、3…；两地之间的距离为D(Js，Jd)；当前时刻为t，的士速度为v；当若干新订单产生时，根据订单序列内订单到达的顺序，依次按如下步骤判断A method for automatically selecting an order for taking a taxi with a mobile phone, characterized in that the order is defined as J(J t , J s , J d ), wherein: J t is the pick-up start time, J s is the pick-up location, and J d is the drop-off location ; The order sequence is (J 1 , J 2 , J 3 ...J n ), arriving in sequence according to time, n=1, 2, 3...; the distance between the two places is D(J s , J d ); the current The time is t, and the speed of the taxi is v; when several new orders are generated, according to the order of order arrival in the order sequence, follow the steps below to determine

1)若已接订单列表尚未存在订单，则进入步骤2)，若已接订单列表存在订单，则进入步骤3)；1) If there is no order in the received order list, go to step 2), if there is an order in the received order list, go to step 3);

2)判断司机能否在规定的时间内完成从当前地点至新订单接客地点的路程，并判断新订单效率值是否为正，若均满足，则将新订单加入订单列表，若否，则拒绝新订单；2) Judging whether the driver can complete the journey from the current location to the pick-up location of the new order within the specified time, and judging whether the efficiency value of the new order is positive, if all are satisfied, add the new order to the order list, if not, reject it new order;

3)先根据接客开始时间判断新订单处于订单列表的位置，而后针对不同位置，分别进行时间冲突判断及对应的订单效率值判断，若均满足，则将新订单加入订单列表，若否，则拒绝订单。3) First judge the position of the new order in the order list according to the pick-up start time, and then judge the time conflict and the corresponding order efficiency value for different positions. If they are all satisfied, add the new order to the order list, if not, then Reject the order.

优选的，令当前地点为L，在步骤2)中判断司机能否在规定的时间内完成从当前地点至新订单接客地点的路程，具体为满足下式：(D(J1s,L)/v)*△t<＝J1t-t，其中△t为缓冲时间倍数，J1s为新订单的接客地点，J1t为新订单的接客时间。Preferably, let the current location be L, and in step 2), judge whether the driver can complete the journey from the current location to the new order pick-up location within the specified time, specifically to satisfy the following formula: (D(J 1s ,L)/ v)*△t<=J 1t -t, where △t is the buffer time multiple, J 1s is the pick-up location of the new order, and J 1t is the pick-up time of the new order.

优选的，令当前地点为L，在步骤2)中判断新订单效率值是否为正，具体为满足下式：Value(L,J1s,J1d)>0，其中J1s为新订单的接客地点，J1d为新订单的送客地点。Preferably, let the current location be L, and judge whether the new order efficiency value is positive in step 2), specifically satisfying the following formula: Value(L,J 1s ,J 1d )>0, where J 1s is the pick-up of the new order location, J 1d is the drop-off location for the new order.

优选的，令的士的起步路程为L0，起步价为V0，若D(J1s，J1d)≤L0，则Gain(J1s,J1d)＝V0；若D(J1s，J1d)＞L0，则Gain(J1s,J1d)＝V0+每公里收费*(D(J1s,J1d)-L0)；令成本Cost(L,J1d)＝D(J1s,J1d)*每公里油耗费；得到新订单效率值Value(L,J1s,J1d)＝Gain(J1s,J1d)-Cost(L,J1d)。Preferably, the starting distance of the taxi is L 0 , the starting price is V 0 , if D(J 1s , J 1d )≤L 0 , then Gain(J 1s , J 1d )=V 0 ; if D(J 1s , J 1d )＞L 0 , then Gain(J 1s ,J 1d )=V 0 +charge per kilometer*(D(J 1s ,J 1d )-L 0 ); make cost Cost(L,J 1d )=D (J 1s , J 1d )*fuel consumption per kilometer; get the new order efficiency value Value(L,J 1s ,J 1d )=Gain(J 1s ,J 1d )-Cost(L,J 1d ).

优选的，令已存在的订单列表为(J1，J2，J3…Jk)，按接客开始时间排列；新订单为Jk+1，J(k+1)s为新订单接客地点，J(k+1)d为新订单送客地点，J(k+1)t为新订单接客时间；在步骤3)中，具体操作如下：Preferably, let the existing order list be (J 1 , J 2 , J 3 ... J k ), sorted by pick-up start time; the new order is J k+1 , and J (k+1)s is the pick-up location of the new order , J (k+1)d is the drop-off location of the new order, and J (k+1)t is the pick-up time of the new order; in step 3), the specific operations are as follows:

3.1)根据订单接客时间判断新订单处于订单列表的位置，若处于订单列表前端，则进入步骤3.2)；若处于订单列表内的某两个已存在订单之间，则进入步骤3.3)；若处于订单列表末端，则进入步骤3.4)；3.1) Judging the position of the new order in the order list according to the order pick-up time, if it is at the front end of the order list, go to step 3.2); if it is between two existing orders in the order list, go to step 3.3); At the end of the order list, go to step 3.4);

3.2)判断司机能否在规定的时间内完成从当前地点至新订单接客地点的路程，及在规定的时间内完成从新订单接客地点至下一订单接客地点；并判断新订单效率值和下一订单效率值是否均为正，若均满足，则将新订单加入订单列表，若否，则拒绝新订单；3.2) Judging whether the driver can complete the journey from the current location to the new order pick-up location within the specified time, and from the new order pickup location to the next order pickup location within the specified time; and judge the efficiency value of the new order and the next order Whether the order efficiency values are all positive, if they are all satisfied, the new order will be added to the order list, if not, the new order will be rejected;

3.3)判断司机能否在规定的时间内完成从前一订单的接客地点至新订单的接客地点的路程，及在规定的时间内完成从新订单的接客地点至下一订单的接客地点；并判断新订单的效率值和下一订单效率值是否为正，若均满足，则将新订单加入订单列表，若否，则拒绝新订单；3.3) Judging whether the driver can complete the journey from the pick-up location of the previous order to the pickup location of the new order within the specified time, and complete the journey from the pickup location of the new order to the pickup location of the next order within the specified time; Whether the efficiency value of the order and the efficiency value of the next order are positive, if both are satisfied, the new order will be added to the order list, if not, the new order will be rejected;

3.4)判断司机能否在规定的时间内完成从前一订单的接客地点至新订单的接客地点的路程，并判断新订单的效率值是否为正，若均满足，则将新订单加入订单列表，若否，则拒绝新订单。3.4) Determine whether the driver can complete the journey from the pick-up point of the previous order to the pick-up point of the new order within the specified time, and judge whether the efficiency value of the new order is positive, if all are satisfied, add the new order to the order list, If not, reject the new order.

优选的，在步骤3.2)中，令当前地点为L；新订单满足J1t>J(k+1)t，J1t为下一订单接客时间；△t为缓冲时间倍数；所需同时满足的条件如下：Preferably, in step 3.2), let the current location be L; the new order satisfies J 1t >J (k+1)t , and J 1t is the pick-up time of the next order; Δt is the buffer time multiple; The conditions are as follows:

3.2.1)(D(J(k+1)s，L)/v)*△t<＝J(k+1)t-t；3.2.1)(D(J (k+1)s ，L)/v)*△t<=J (k+1)t -t;

3.2.2)(D(J(k+1)s,J(k+1)d)/v+D(J(k+1)d，J1s)/v)*△t<＝J1t-J(k+1)t，J1s为下一订单接客地点；3.2.2)(D(J (k+1)s , J (k+1)d )/v+D(J (k+1)d , J 1s )/v)*△t<=J 1t - J (k+1)t , J 1s is the pick-up location for the next order;

3.2.3)新订单效率值Value(L,J(k+1)s,J(k+1)d)>0；3.2.3) New order efficiency value Value(L,J (k+1)s ,J (k+1)d )>0;

3.2.4)下一订单效率值Value(J(k+1)d,J1s,J1d)>0，J1d为下一订单送客地点。3.2.4) The efficiency value of the next order Value(J (k+1)d , J 1s , J 1d )>0, J 1d is the delivery location of the next order.

优选的，在步骤3.3)中，令Ji和Ji+1分别为前一订单和后一订单，新订单满足Jit<J(k+1)t<J(i+1)t，Jit为前一订单接客时间，J(i+1)t为后一订单接客时间；△t为缓冲时间倍数；所需同时满足的条件如下：Preferably, in step 3.3), let J i and J i+1 be the previous order and the next order respectively, and the new order satisfies J it <J (k+1)t <J (i+1)t , J it is the pick-up time of the previous order, J (i+1)t is the pick-up time of the next order; △t is the multiple of the buffer time; the conditions to be met at the same time are as follows:

3.3.1)(D(Jis，Jid)/v+D(Jid，J(k+1)s)/v)*△t<＝J(k+1)t-Jit；Jis为前一订单接客地点，Jid为前一订单送客地点；3.3.1)(D(J is , J id )/v+D(J id , J (k+1)s )/v)*△t<=J (k+1)t -J it ; J is is the pick-up location of the previous order, and J id is the drop-off location of the previous order;

3.3.2)(D(J(k+1)s，J(k+1)d)/v+D(J(k+1)d，J(i+1)s)/v)*△t<＝J(i+1)t-J(k+1)t；3.3.2)(D(J (k+1)s ，J (k+1)d )/v+D(J (k+1)d ，J (i+1)s )/v)*△t <=J (i+1)t -J (k+1)t ;

3.3.3)新订单的效率值Value(Jid,J(k+1)s,J(k+1)d)>0；3.3.3) The efficiency value of the new order Value(J id ,J (k+1)s ,J (k+1)d) >0;

3.3.4)下一订单效率值Value(J(k+1)d,J(i+1)s,J(i+1)d)>0，J(i+1)s为后一订单接客地点，J(i+1)d为后一订单送客地点。3.3.4) The efficiency value of the next order Value(J (k+1)d , J (i+1)s , J (i+1)d )>0, J (i+1)s is the pick-up for the next order location, J (i+1)d is the delivery location of the next order.

优选的，在步骤3.4)中，新订单满足Jkt<J(k+1)t，Jkt为前一订单接客时间；△t为缓冲时间倍数；所需同时满足的条件如下：Preferably, in step 3.4), the new order satisfies J kt < J (k+1)t , J kt is the pick-up time of the previous order; Δt is the multiple of the buffer time; the conditions to be satisfied at the same time are as follows:

3.4.1)((D(Jks，Jkd)/v+D(Jkd，J(k+1)s)/v)*△t<＝J(k+1)t-Jkt，Jks为前一订单接客地点，Jkd为前一订单送客地点；3.4.1)((D(J ks , J kd )/v+D(J kd , J (k+1)s )/v)*△t<=J (k+1)t -J kt , J ks is the pick-up location of the previous order, J kd is the drop-off location of the previous order;

3.4.2)该新订单的效率值Value(Jkd,J(k+1)s,J(k+1)d>0。3.4.2) The efficiency value of the new order Value(J kd , J (k+1)s , J (k+1)d >0.

优选的，所述订单的效率值为接下该笔订单的收益和完成订单所耗费成本的差值。Preferably, the efficiency value of the order is the difference between the income of receiving the order and the cost of completing the order.

由上述对本发明的描述可知，与现有技术相比，本发明具有如下有益效果：As can be seen from the above description of the present invention, compared with the prior art, the present invention has the following beneficial effects:

本发明根据司机已有订单和新产生订单的时间和路程信息，判断其是否会产生时间冲突、预计收益并将结果反馈给司机或者进行订单的自动选择。一方面方便司机选择订单，避免错误接单，使得司机利益最大化，同时还避免了司机对订单做出判断时存在的安全隐患；另一方面可以合理地调度的士资源，缓解“打车难”、“空载多”的问题。According to the time and distance information of the driver's existing order and the newly generated order, the present invention judges whether there will be a time conflict, predicts the income and feeds back the result to the driver or automatically selects the order. On the one hand, it is convenient for drivers to choose orders, avoid wrong orders, maximize the benefits of drivers, and at the same time avoid potential safety hazards when drivers make judgments on orders; , "more empty load" problem.

附图说明Description of drawings

图1为本发明方法路线示意图(已接订单列表不存在订单)；Fig. 1 is a schematic diagram of the route of the method of the present invention (there is no order in the received order list);

图2为图1的时间判断节点图；Fig. 2 is the time judgment node diagram of Fig. 1;

图3为本发明方法路线示意图(新订单处于已接订单列表前端)；Fig. 3 is a schematic diagram of the route of the method of the present invention (the new order is at the front end of the received order list);

图4为图3的时间判断节点图；Fig. 4 is the time judgment node diagram of Fig. 3;

图5为本发明方法路线示意图(新订单处于已接订单列表的两订单之间)；Fig. 5 is a schematic diagram of the route of the method of the present invention (the new order is between the two orders of the received order list);

图6为图5的时间判断节点图；Fig. 6 is the time judgment node diagram of Fig. 5;

图7为本发明方法路线示意图(新订单处于已接订单列表末端)；Fig. 7 is a schematic diagram of the method route of the present invention (the new order is at the end of the received order list);

图8为图7的时间判断节点图。FIG. 8 is a time judgment node diagram of FIG. 7 .

具体实施方式Detailed ways

以下通过具体实施方式对本发明作进一步的描述。The present invention will be further described below through specific embodiments.

一种手机打车的订单自动选择方法，首先作如下定义：A method for automatically selecting an order for calling a taxi with a mobile phone. Firstly, the following definition is made:

订单为J(Jt，Js，Jd)，其中：Jt为接客开始时间、Js为接客地点、Jd为送客地点；The order is J(J t , J s , J d ), where: J t is the pick-up start time, J s is the pick-up location, and J d is the drop-off location;

订单序列为(J1，J2，J3…Jn)，按照时间顺序前后到达；The order sequence is (J 1 , J 2 , J 3 ...J n ), arriving in sequence according to time;

两地之间的距离为D(Js，Jd)；The distance between the two places is D(J s , J d );

的士的起步路程为L0，起步价为V0，The starting distance of the taxi is L 0 , the starting fare is V 0 ,

当前时刻为t，的士速度为v，当前地点为L；The current moment is t, the taxi speed is v, and the current location is L;

已存在的订单列表为(J1，J2，J3…Jk)，按接客开始时间排列；The list of existing orders is (J 1 , J 2 , J 3 ...J k ), arranged by pick-up start time;

当若干新订单产生时，根据订单序列内订单到达的顺序，依次按如下步骤判断：When several new orders are generated, according to the order of order arrival in the order sequence, follow the steps below to judge in turn:

1)若已接订单列表尚未存在订单，则进入步骤2)，若已接订单列表存在订单，则进入步骤3)。1) If there is no order in the received order list, go to step 2), if there is an order in the received order list, go to step 3).

2)参照图1，此时令新订单为J1(J1t,J1s,J1d)，J1s为新订单的接客地点，J1d为新订单的送客地点，J1t为新订单的接客时间。先判断司机能否在规定的时间内完成从当前地点至新订单接客地点的路程，即满足(D(J1s,L)/v)*△t<＝J1t-t，其中△t为缓冲时间倍数。参照图2，令△tn＝D(J1s,L)/v,△t1＝D(J1s，J1d)/v，若△tn<＝Jn1t-t，则满足条件。2) Referring to Figure 1, the new order at this time is J 1 (J 1t , J 1s , J 1d ), J 1s is the pick-up location of the new order, J 1d is the drop-off location of the new order, and J 1t is the pick-up location of the new order time. First judge whether the driver can complete the journey from the current location to the pick-up location of the new order within the specified time, that is, satisfy (D(J 1s ,L)/v)*△t<=J 1t -t, where △t is the buffer time multiples. Referring to FIG. 2 , let Δt n =D(J 1s ,L)/v, Δt 1 =D(J 1s , J 1d )/v, if Δt n <=J n1t -t, then the condition is satisfied.

再判断新订单效率值是否为正。新订单的效率值为接下该笔订单的收益和完成订单所耗费成本的差值，即满足Value(L,J1s,J1d)>0。若D(J1s，J1d)≤L0，则在起步路程L0内，Gain(J1s,J1d)＝V0。若D(J1s，J1d)＞L0，则超出起步路程L0，Gain(J1s,J1d)＝V0+每公里收费*(D(J1s,J1d)-L0)；令成本Cost(L,J1d)＝D(J1s,J1d)*每公里油耗费。最后得到新订单效率值Value(L,J1s,J1d)＝Gain(J1s,J1d)-Cost(L,J1d)。Then judge whether the new order efficiency value is positive. The efficiency value of a new order is the difference between the revenue of receiving the order and the cost of completing the order, that is, Value(L,J 1s ,J 1d )>0. If D(J 1s , J 1d )≤L 0 , then within the starting distance L 0 , Gain(J 1s , J 1d )=V 0 . If D(J 1s , J 1d )＞L 0 , then the starting distance L 0 is exceeded, Gain(J 1s ,J 1d )＝V 0 + toll per kilometer*(D(J 1s ,J 1d )-L 0 ); Let cost Cost(L, J 1d )=D(J 1s , J 1d )*fuel consumption per kilometer. Finally, the new order efficiency value Value(L,J 1s ,J 1d )=Gain(J 1s ,J 1d )-Cost(L,J 1d ) is obtained.

若上述两个条件均满足，则将该新订单加入订单列表，若否，则拒绝新订单。If the above two conditions are met, the new order will be added to the order list, if not, the new order will be rejected.

3)此时令新订单为Jk+1(J(k+1)t,J(k+1)s,J(k+1)d)，J(k+1)s为新订单接客地点，J(k+1)d为新订单送客地点，J(k+1)t为新订单接客时间。3) The new order at this time is J k+1 (J (k+1)t , J (k+1)s , J (k+1)d ), J (k+1)s is the pick-up location of the new order, J (k+1)d is the drop-off location of the new order, and J (k+1)t is the pick-up time of the new order.

3.1)根据订单接客时间判断新订单处于订单列表的位置，若处于订单列表前端，则进入步骤3.2)；若处于订单列表内的某两个已存在订单之间，则进入步骤3.3)；若处于订单列表末端，则进入步骤3.4)；3.1) Judging the position of the new order in the order list according to the order pick-up time, if it is at the front end of the order list, go to step 3.2); if it is between two existing orders in the order list, go to step 3.3); At the end of the order list, go to step 3.4);

3.2)参照图3，新订单满足J1t>J(k+1)t，J1t为下一订单接客时间，J1s为下一订单接客地点，J1d为下一订单送客地点。判断司机能否在规定的时间内完成从当前地点至新订单接客地点的路程即(D(J(k+1)s，L)/v)*△t<＝J(k+1)t-t，及在规定的时间内完成从新订单接客地点至下一订单接客地点即(D(J(k+1)s,J(k+1)d)/v+D(J(k+1)d，J1s)/v)*△t<＝J1t-J(k+1)t，△t为缓冲时间倍数。参照图4，令△t1＝D(Jks,Jkd)/v,△t2＝D(Jkd,J(k+1)s)/v,△tx＝J(k+1)t-Jkt。若△t1+△t2<△tx，则满足条件。3.2) Referring to Figure 3, the new order satisfies J 1t >J (k+1)t , J 1t is the pick-up time of the next order, J 1s is the pick-up location of the next order, and J 1d is the drop-off location of the next order. Judging whether the driver can complete the distance from the current location to the pick-up location of the new order within the specified time (D(J (k+1)s , L)/v)*△t<=J (k+1)t - t, and complete the transfer from the pick-up point of the new order to the pick-up point of the next order within the specified time (D(J (k+1)s ,J (k+1)d )/v+D(J (k+1) d , J 1s )/v)*△t<=J 1t -J (k+1)t , △t is the buffer time multiple. Referring to Fig. 4, let Δt 1 =D(J ks , J kd )/v, Δt 2 =D(J kd, J (k+1)s )/v, Δt x =J (k+1) t -J kt . If Δt 1 +Δt 2 <Δt x , the condition is satisfied.

并判断新订单效率值和下一订单效率值是否均为正，新订单效率值Value(L,J(k+1)s,J(k+1)d)>0；下一订单效率值Value(J(k+1)d,J1s,J1d)>0，若均满足，则将新订单加入订单列表，若否，则拒绝新订单。And judge whether the new order efficiency value and the next order efficiency value are both positive, the new order efficiency value Value(L,J (k+1)s ,J (k+1)d )>0; the next order efficiency value Value (J (k+1)d , J 1s , J 1d )>0, if all are satisfied, add the new order to the order list, if not, reject the new order.

3.3)令Ji和Ji+1分别为前一订单和后一订单，新订单满足Jit<J(k+1)t<J(i+1)t，Jit为前一订单接客时间，Jis为前一订单接客地点，Jid为前一订单送客地点；J(i+1)t为后一订单接客时间，J(i+1)s为后一订单接客地点，J(i+1)d为后一订单送客地点；△t为缓冲时间倍数。3.3) Let J i and J i+1 be the previous order and the next order respectively, the new order satisfies J it <J (k+1)t <J( i+1)t , and J it is the pick-up time of the previous order , J is is the pick-up location of the previous order, J id is the drop-off location of the previous order; J( i+1)t is the pick-up time of the next order, J (i+1)s is the pick-up location of the next order, J ( i+1)d is the delivery location of the next order; △t is the buffer time multiple.

参照图5，判断司机能否在规定的时间内完成从前一订单的接客地点至新订单的接客地点的路程即(D(Jis，Jid)/v+D(Jid，J(k+1)s)/v)*△t<＝J(k+1)t-Jit，及在规定的时间内完成从新订单的接客地点至下一订单的接客地点(D(J(k+1)s，J(k+1)d)/v+D(J(k+1)d，J(i+1)s)/v)*△t<＝J(i+1)t-J(k+1)t。参照图6，令△tn＝D(J(k+1)s,L)/v,△t1＝D(J(k+1)s,J(k+1)d)/v,△t2＝D(J(k+1)d,J1s)/v,△tx＝J1t-J(k+1)ts。若△tn<＝J(k+1)t-t且△t1+△t2<＝△tx，则满足条件。，Referring to Figure 5, it is judged whether the driver can complete the journey from the pick-up location of the previous order to the pick-up location of the new order within the specified time (D(J is , J id )/v+D(J id , J (k+ 1)s )/v)*△t<＝J (k+1)t -J it , and within the stipulated time, complete from the pick-up point of the new order to the pick-up point of the next order (D(J (k+1) )s , J (k+1)d )/v+D(J (k+1)d , J (i+1)s )/v)*△t<=J (i+1)t -J ( k+1)t . Referring to Fig. 6, let △t n =D(J (k+1)s ,L)/v,△t 1 =D(J (k+1)s ,J (k+1)d )/v,△ t 2 =D(J (k+1)d ,J 1s )/v,Δt x =J 1t −J (k+1)ts . If Δt n <= J (k+1)t −t and Δt 1 +Δt 2 <= Δt x , the condition is satisfied. ,

并判断新订单的效率值和下一订单效率值是否为正，新订单的效率值Value(Jid,J(k+1)s,J(k+1)d)>0，下一订单效率值Value(J(k+1)d,J(i+1)s,J(i+1)d)>0，若均满足，则将新订单加入订单列表，若否，则拒绝新订单。And judge whether the efficiency value of the new order and the efficiency value of the next order are positive, the efficiency value of the new order Value(J id ,J (k+1)s ,J (k+1)d) >0, the efficiency of the next order The value Value(J (k+1)d , J (i+1)s , J (i+1)d )>0, if all are satisfied, the new order will be added to the order list, if not, the new order will be rejected.

3.4)新订单满足Jkt<J(k+1)t，Jkt为前一订单接客时间，Jks为前一订单接客地点，Jkd为前一订单送客地点；△t为缓冲时间倍数。参照图7，判断司机能否在规定的时间内完成从前一订单的接客地点至新订单的接客地点的路程((D(Jks，Jkd)/v+D(Jkd，J(k+1)s)/v)*△t<＝J(k+1)t-Jkt，参照图8，令△t1＝D(Jis,Jid)/v,△t2＝D(Jid,J(k+1)s)/v,△t3＝D(J(k+1)s,J(k+1)d)/v,△t4＝D(J(k+1)d,J(i+1)s)/v,△tx＝J(k+1)t-Jit,△ty＝J(i+1)t-J(k+1)t，若△t1+△t2<＝△tx且△t3+△t4<＝△ty，则满足条件。并判断新订单的效率值是否为正即Value(Jkd,J(k+1)s,J(k+1)d>0，若均满足，则将新订单加入订单列表，若否，则拒绝新订单。3.4) The new order satisfies J kt < J (k+1)t , J kt is the pick-up time of the previous order, J ks is the pick-up location of the previous order, J kd is the drop-off location of the previous order; △t is the buffer time multiple . Referring to Figure 7, it is judged whether the driver can complete the journey from the pick-up location of the previous order to the pick-up location of the new order within the specified time ((D(J ks , J kd )/v+D(J kd , J (k+ 1)s )/v)*△t<=J (k+1)t -J kt , referring to Figure 8, let △t 1 =D(J is ,J id )/v,△t 2 =D(J id ,J (k+1)s )/v,△t 3 ＝D(J (k+1)s ,J (k+1)d )/v,△t 4 ＝D(J (k+1) d ,J (i+1)s )/v,△t x ＝J (k+1)t -J it ,△t y ＝J (i+1)t -J (k+1)t , if △ t 1 +△t 2 <=△t x and △t 3 +△t 4 <=△t y , then the condition is met. And judge whether the efficiency value of the new order is positive or not Value(J kd ,J (k+1 )s , J (k+1)d >0, if all are satisfied, add the new order to the order list, if not, reject the new order.

在步骤3.2)至步骤3.4)中的订单的效率值均为接下该笔订单的收益和完成订单所耗费成本的差值。其计算方法与步骤2)的计算方法类似。The efficiency value of the order in step 3.2) to step 3.4) is the difference between the income of receiving the order and the cost of completing the order. Its calculation method is similar to that of step 2).

上述仅为本发明的具体实施方式，但本发明的设计构思并不局限于此，凡利用此构思对本发明进行非实质性的改动，均应属于侵犯本发明保护范围的行为。The above is only a specific embodiment of the present invention, but the design concept of the present invention is not limited thereto, and any non-substantial changes made to the present invention by using this concept should be an act of violating the protection scope of the present invention.

Claims (8)

1. a kind of order automatic selecting method that mobile phone is called a taxi, it is characterised in that：Definition order is J (Jt、Js、Jd), wherein：JtFor Receive lodgers time started, JsFor prostitution place, JdFor place of seing a visitor out；Order sequence is (J1, J2, J3…Jn), sequentially in time before After reach, n=1,2,3 ...；The distance between two places are D (Js, Jd)；Current time is t, and taxi speed is v；It is newly ordered when several When per unit area yield is given birth to, according to the order that order in order sequence reaches, judge as follows successively
If 1) 2) list that received orders enters step not yet there are order, if the list that received orders enters step there are order It is rapid 3)；
2) judge that can driver complete the distance from current location to new order prostitution place before the deadline, and judge new Whether order efficiency value is just, if being satisfied by, new order to be added in order list, if it is not, then refusing new order；
3) first judge that new order is in the position of order list according to the time started of receiving lodgers, then for different position, respectively into Row time conflict judges and corresponding order efficiency value judges, if being satisfied by, new order is added in order list, if it is not, then Refuse order；
It is (J to make already present order list1, J2, J3…Jk), by time started arrangement of receiving lodgers；New order is Jk+1, J(k+1)sTo be new Order prostitution place, J(k+1)dIt sees a visitor out place for new order, J(k+1)tIt receives lodgers the time for new order；In step 3), concrete operations It is as follows：
3.1) judge that new order is in the position of order list according to the order prostitution time, if being in order list front end, into Enter step 3.2)；If between certain two existing order in order list, enter step 3.3)；If it is arranged in order 3.4) table end then enters step；
3.2) judge that can driver complete from current location to the distance in new order prostitution place and advise before the deadline It is completed in the fixed time from new order prostitution place to next order prostitution place；And judge new order efficiency value and next order Whether efficiency value is just, if being satisfied by, new order to be added in order list, if it is not, then refusing new order；
3.3) judge that can driver complete the prostitution place from the prostitution place of previous order to new order before the deadline Distance and complete prostitution place from the prostitution place of new order to next order before the deadline；And judge newly to order Whether single efficiency value and next order efficiency value is just, if being satisfied by, new order to be added in order list, if it is not, then refusing Exhausted new order；
3.4) judge that can driver complete the prostitution place from the prostitution place of previous order to new order before the deadline Distance, and judge whether the efficiency value of new order is just, if being satisfied by, new order to be added in order list, if it is not, then refusing Exhausted new order.
2. the order automatic selecting method that a kind of mobile phone as described in claim 1 is called a taxi, it is characterised in that：The current location is made to be L judges that can driver complete the distance from current location to new order prostitution place before the deadline in step 2), has Body is to meet following formula：(D(J1s,L)/v)*△t<=J1t- t, wherein △ t be buffer time multiple, J1sFor the prostitution of new order Point, J1tFor the prostitution time of new order.
3. the order automatic selecting method that a kind of mobile phone as described in claim 1 is called a taxi, it is characterised in that：The current location is made to be L judges whether new order efficiency value is just, specially to meet following formula in step 2)：Value(L,J1s,J1d)>0, wherein J1s For the prostitution place of new order, J1dFor the place of seing a visitor out of new order.
4. the order automatic selecting method that a kind of mobile phone as claimed in claim 3 is called a taxi, it is characterised in that：Make the starting of taxi Distance is L0, starting fare V0If D (J1s, J1d)≤L0, then Gain (J1s,J1d)=V0；If D (J1s, J1d) ＞ L0, then Gain (J1s,J1d)=V0+ every kilometer of charge * (D (J1s,J1d)-L0)；Make cost Cost (L, J1d)=D (J1s,J1d) the every gas mileages of * Take；Obtain new order efficiency value Value (L, J1s,J1d)=Gain (J1s,J1d)-Cost(L,J1d)。
5. the order automatic selecting method that a kind of mobile phone as described in claim 1 is called a taxi, it is characterised in that：In step 3.2) In, it is L to make current location；New order meets J1t>J(k+1)t, J1tIt receives lodgers the time for next order；△ t are buffer time multiple； Condition that is required while meeting is as follows：
3.2.1)(D(J(k+1)s, L) and/v) * △ t<=J(k+1)t-t；
3.2.2)(D(J(k+1)s,J(k+1)d)/v+D(J(k+1)d, J1s)/v)*△t<=J1t-J(k+1)t, J1sReceive lodgers ground for next order Point；
3.2.3) new order efficiency value Value (L, J(k+1)s,J(k+1)d)>0；
3.2.4) next order efficiency value Value (J(k+1)d,J1s,J1d)>0, J1dIt sees a visitor out place for next order.
6. the order automatic selecting method that a kind of mobile phone as described in claim 1 is called a taxi, it is characterised in that：In step 3.3) In, make JiAnd Ji+1Respectively previous order and latter order, new order meet Jit<J(k+1)t<J(i+1)t, JitIt is connect for previous order Objective time, J(i+1)tIt receives lodgers the time for latter order；△ t are buffer time multiple；Condition that is required while meeting is as follows：
3.3.1)(D(Jis, Jid)/v+D(Jid, J(k+1)s)/v)*△t<=J(k+1)t-Jit；JisFor previous order prostitution place, Jid It sees a visitor out place for previous order；
3.3.2)(D(J(k+1)s, J(k+1)d)/v+D(J(k+1)d, J(i+1)s)/v)*△t<=J(i+1)t-J(k+1)t；
3.3.3) efficiency value Value (the J of new orderid,J(k+1)s,J(k+1)d)) >0；
3.3.4) next order efficiency value Value (J(k+1)d,J(i+1)s,J(i+1)d)>0, J(i+1)sFor latter order prostitution place, J(i+1)dIt sees a visitor out place for latter order.
7. the order automatic selecting method that a kind of mobile phone as described in claim 1 is called a taxi, it is characterised in that：In step 3.4) In, new order meets Jkt<J(k+1)t, JktIt receives lodgers the time for previous order；△ t are buffer time multiple；It is required while satisfaction Condition is as follows：
3.4.1)((D(Jks, Jkd)/v+D(Jkd, J(k+1)s)/v)*△t<=J(k+1)t-Jkt, JksFor previous order prostitution place, JkdIt sees a visitor out place for previous order；
3.4.2) efficiency value Value (the J of the new orderkd,J(k+1)s,J(k+1)d) >0。
8. the order automatic selecting method that a kind of mobile phone as described in claim 5 or 6 or 7 is called a taxi, it is characterised in that：It is described to order Single efficiency value is the income for connecing down this order and the difference for completing cost spent by order.
CN201510236530.0A 2015-05-11 2015-05-11 The order automatic selecting method that a kind of mobile phone is called a taxi Active CN104809527B (en)

Priority Applications (1)

Application Number Priority Date Filing Date Title
CN201510236530.0A CN104809527B (en) 2015-05-11 2015-05-11 The order automatic selecting method that a kind of mobile phone is called a taxi

Applications Claiming Priority (1)

Application Number Priority Date Filing Date Title
CN201510236530.0A CN104809527B (en) 2015-05-11 2015-05-11 The order automatic selecting method that a kind of mobile phone is called a taxi

Publications (2)

Publication Number Publication Date
CN104809527A CN104809527A (en) 2015-07-29
CN104809527B true CN104809527B (en) 2018-05-25

Family

ID=53694336

Family Applications (1)

Application Number Title Priority Date Filing Date
CN201510236530.0A Active CN104809527B (en) 2015-05-11 2015-05-11 The order automatic selecting method that a kind of mobile phone is called a taxi

Country Status (1)

Country Link
CN (1) CN104809527B (en)

Families Citing this family (4)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
GB2556780A (en) * 2015-08-20 2018-06-06 Beijing Didi Infinity Science And Tech Limited Method and system for predicting current order information on the basis of historical order
CN108074000A (en) * 2016-11-16 2018-05-25 北京嘀嘀无限科技发展有限公司 Order processing method and apparatus
CN106600057B (en) * 2016-12-13 2020-09-18 品骏控股有限公司 Express delivery task scheduling method and device
CN109978193A (en) * 2017-12-28 2019-07-05 北京嘀嘀无限科技发展有限公司 Network about vehicle order allocation method and device

Citations (4)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN102509449A (en) * 2011-10-24 2012-06-20 北京东方车云信息技术有限公司 Vehicle scheduling method based on fuzzy decision
CN103218769A (en) * 2013-03-19 2013-07-24 王兴健 Taxi order allocation method
CN103971507A (en) * 2013-01-30 2014-08-06 国民技术股份有限公司 Taxi calling method, platform and system
CN104599168A (en) * 2015-02-02 2015-05-06 北京嘀嘀无限科技发展有限公司 Method and device for allocating taxi-calling orders

Patent Citations (4)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN102509449A (en) * 2011-10-24 2012-06-20 北京东方车云信息技术有限公司 Vehicle scheduling method based on fuzzy decision
CN103971507A (en) * 2013-01-30 2014-08-06 国民技术股份有限公司 Taxi calling method, platform and system
CN103218769A (en) * 2013-03-19 2013-07-24 王兴健 Taxi order allocation method
CN104599168A (en) * 2015-02-02 2015-05-06 北京嘀嘀无限科技发展有限公司 Method and device for allocating taxi-calling orders

Also Published As

Publication number Publication date
CN104809527A (en) 2015-07-29

Similar Documents

Publication Publication Date Title
CN104021667B (en) Integrate subscription services and the taxi dispatching system called a taxi in real time and scheduling method
CN104809527B (en) The order automatic selecting method that a kind of mobile phone is called a taxi
CN103971515B (en) A kind of taxi share-car method, system and server
CN105702020B (en) Method, system and server are sent in a kind of express delivery based on share-car with charge free
CN104050578B (en) Order processing method, apparatus and system
WO2016074538A1 (en) Sent order ranking system and method for reducing no-load running and waiting time in online taxi renting
CN104217585A (en) Taxi pooling method, system and server
CN102063691A (en) Method and system for intelligently scheduling vehicles
CN104464275B (en) A kind of share-car method based on many taxis, system and server
US10021243B2 (en) Telephone call placement
CN104332046A (en) Taxi pooling method, system and server
CN107945503A (en) The share-car method and system of windward driving
CN110832561A (en) System and method for determining and recommending vehicle pickup locations
CN116311870A (en) Boarding point processing method, device, equipment and readable storage medium
CN108417022A (en) A vehicle scheduling method suitable for new energy special vehicle platform
CN109074534B (en) Method for transporting a plurality of objects between object-specific locations
CN104143136A (en) Express item transfer method and device
CN107784412A (en) A kind of order Auto-matching processing method and server
CN104333080A (en) Linkage charging system for electric car
CN107844986A (en) One kind uses car order pricing method and server
CN107862399A (en) A kind of traffic path recommendation process method and server
CN110400111B (en) Article dispatch method, device and system based on automatic driving vehicle
CN112365020B (en) A collection analysis management system and method based on smart logistics
CN118982403A (en) Method, device, storage medium and program product for processing online car-hailing orders
CN108304946A (en) A kind of intelligent share-car method based on social activity

Legal Events

Date Code Title Description
C06 Publication
PB01 Publication
EXSB Decision made by sipo to initiate substantive examination
SE01 Entry into force of request for substantive examination
GR01 Patent grant
GR01 Patent grant
点击 这是indexloc提供的php浏览器服务，不要输入任何密码和下载