Title: Optimising order selection algorithm based on online taxi-hailing applications

Authors: Tian Wang; Wenhua Wang; Yongxuan Lai; Diwen Xu; Haixing Miao; Qun Wu

Addresses: College of Computer Science and Technology, Huaqiao University, Xiamen, Fujian 361021, China ' College of Computer Science and Technology, Huaqiao University, Xiamen, Fujian 361021, China ' Software School, Xiamen University, Xiamen, Fujian 361005, China ' College of Computer Science and Technology, Huaqiao University, Xiamen, Fujian 361021, China ' College of Computer Science and Technology, Huaqiao University, Xiamen, Fujian 361021, China ' College of Computer Science and Technology, Huaqiao University, Xiamen, Fujian 361021, China

Abstract: Nowadays, with the widespread use of smart devices and networking technologies, the application of taxi-hailing servers is becoming more and more popular in our daily life. However, the drivers' behaviour of robbing orders while driving brings great potential traffic security problems. Considering the characteristics and deficiencies of the mainstream taxi-hailing apps in smart devices, this paper studies the order selection problem from the drivers' end. According to different customers' requirement, an order autoselection algorithm is proposed. Moreover, it adopts a time buffer mechanism to avoid time conflicts among the orders, and a new concept of 'efficiency value of orders' is proposed to evaluate the profits of orders. This algorithm can auto-select orders for the driver according to their qualities, which can not only improve the safety, but also maximise the drivers' revenue. Extensive simulations validate the performance of the proposed method.

Keywords: taxi-hailing application; order selection algorithm; the biggest profit; greedy algorithm; safety; efficiency value of orders.

DOI: 10.1504/IJCSE.2018.094417

International Journal of Computational Science and Engineering, 2018 Vol.17 No.1, pp.34 - 42

Received: 29 Jan 2016
Accepted: 22 Mar 2016
Published online: 03 Sep 2018 *

Full-text access for editors Full-text access for subscribers Purchase this article Comment on this article