Dynamic taxi-sharing system and sharing method thereof

摘要

A dynamic taxi-sharing system and a sharing method thereof. A ride-sharing service provider carries at least one passenger from the first current location to the first travel destination through a route in an area and sends registration information to a service server. A plurality of ride-sharing requests is sent to the service server, and each of the ride-sharing requests comprises the second current location and the second travel destination. The service server divides the area into n by n blocks. A ride-matching module of the service server chooses a destination area in which the first travel destination is a center point and divides the destination area into k by k blocks. According to the registration information and the ride-sharing requests, the ride-matching module matches at least one ride-sharing traveler to the ride-sharing service provider to achieve a goal of fuel-saving and pollution-reducing.

主权项

1. A dynamic taxi-sharing system, comprising:
a ride-sharing service provider carrying at least one passenger from a first current location to a first travel destination through a route in an area and sending registration information to a service server computer; a plurality of ride-sharing requests being sent to the service server computer, each of the ride-sharing requests comprising a second current location and a second travel destination; and the service server computer dividing the area into n by n blocks, n being an integer greater than 1, the service server computer choosing a destination area in which the first travel destination is a center point and dividing the destination area into k by k blocks, k being an integer greater than 1 and smaller than n, according to the registration information and the ride-sharing requests, service server computer matching at least one ride-sharing traveler, having the second current location close to the route and the second travel destination inside the destination area, to the ride-sharing service provider; wherein the n×n blocks are represented by a matrix, and each element of the matrix represents a transit time of a corresponding road section of the area for obtaining a fastest path to the first travel destination and the second travel destination.