Abstract

Aiming at the problem that online ride-hailing drivers often empty their cars to replenish fuel at gas stations when their cars run out of gas, a new order assignment algorithm is proposed. According to the vehicle fuel volume reported by the driver to the platform, the vehicle with low fuel volume will be automatically assigned to the destination close to the gas station orders, and the driver will be reminded to go to the nearby gas station to reduce the empty vehicle round-trip rate. First of all, orders are classified into ordinary orders and refuelling orders, so that when the vehicle is short of fuel, the driver can be assigned to the refuelling orders with destinations close to gas stations. Then, a new order allocation mathematical model is established. This paper solves the order assignment problem based on the heap-optimized Dijkstra’s algorithm and Astar algorithm. Experimental results show that the algorithm can intelligently allocate orders for drivers with insufficient fuel to their destinations closer to the gas station, shorten the distance the driver drives empty to the gas station to replenish fuel, and reduce the empty vehicle round-trip rate. When using Dijkstra's algorithm and Astar algorithm to solve the order allocation problem, there is no significant difference in their processing time.

Full Text
Paper version not known

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call

Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.