English (United Kingdom)

https://curated-unify.zendy.io/wp-json/zendy-region/v1/featured_content/oa?rat=en

https://curated-unify.zendy.io/wp-json/zendy-region/v1/highlighted_journal/

Global: Zendy Plus annual

Presents the access of premium content as premium feature

Premium Content

Presents the keyphrase highlighting as premium feature

Keyphrase Highlighting

Presents the summarisation as premium feature

Summarisation

Insights

Presents the pdf analysis as premium feature

PDF Analysis

Presents the zaia usage as premium feature

ZAIA

Global: Zendy Tools annual

Global: Zendy Free Plan

Global: Zendy Tools monthly

Global: Zendy Plus monthly

It is a long-standing challenge to recommend routes to a group of taxis at different locations to minimize the overall mileage spent without customs. This paper studies route recommendation to a group of taxis by minimizing the overall mileage spent without customers. A new recommendation algorithm and evaluation model are proposed. The algorithm recommends the current optimal route and updates both the capacity and the probability along the route after getting a passenger. The new evaluation model is adapted to estimate the performance of each candidate route. A simulator that imitates the recommendation process on the real-world datasets and virtual taxis based on our recommendation system is developed. The experimental results demonstrate the effectiveness of the proposed evaluation model. The proposed method using the potential-cruising-distance model effectively reduces the global cruising distance of multiple taxis, especially in the applications with a large number taxis.

Dynamic Taxi Service Planning by Minimizing Cruising Distance Without Passengers