Research Article | Open Access
Wei Zhang, Ruichun He, Yong Chen, Mingxia Gao, Changxi Ma, "Research on Taxi Pricing Model and Optimization for Carpooling Detour Problem", Journal of Advanced Transportation, vol. 2019, Article ID 3867874, 11 pages, 2019. https://doi.org/10.1155/2019/3867874
Research on Taxi Pricing Model and Optimization for Carpooling Detour Problem
This paper builds a multiobjective optimization model for solving the taxi carpooling with detour problem and designs a genetic algorithm to determine a fair pricing scheme for riders and drivers. The researches show that it is feasible to share a taxi with detour. It is the key to determine appropriate carpooling payment ratio and detour carpooling payment ratio. The ratio of detour distance to travel distance has an important influence on detour carpooling. It should be limited to less than certain values. Payment ratios and the maximum value of the ratio of detour distance to travel distance are determined by the method proposed in this paper. The method can ensure benefits of passengers and drivers, which makes detour carpooling a reality. These conclusions and the method have a certain guiding significance for formulating taxi policy.
Taxi carpooling mode has become a common travelling mode. The mode permits several passengers to share the same taxi. Taxi carpooling can effectively solve the problem of having difficulty getting a taxi at peak time. It does not only ease the traffic pressure and improve the transportation efficiency [1, 2], but also reduce energy consumption [3–6]. It is an effective solution to solve the urban traffic problem.
Many scholars studied the problem of carpooling [7–12]. This research work focuses on the following two aspects: on the one hand, the characteristics of carpooling behavior, the influence factors of carpooling, and the effects of carpooling are studied [13–18]. Shaheen analyzed carpooling situation in the San Francisco Bay Area and studied passenger characteristics, behaviors, and motivation . Delhomme researched the main determinants of the practice of carpooling by investigating the factual data and gave some strategies for increasing the number of carpoolers and the frequency of carpooling . Malodia studied the characteristics of Indian residents preference for passenger sharing based on the data from the internet survey and found that cognitive attitudes have important effects on passenger sharing behaviour . Tahmasseby found that distance, time, cost, gender, occupation, age, weather conditions, and other factors can affect the choice of sharing . Javid studied the sharing characteristics of 50 states in the United States and the District of Columbia and analyzed the impact of the carpooling policy on the environment . Sweta proved that carpooling mode can help to reduce congestion and fuel consumption . Zhang built a model of multiple passengers carpooling, analyzed carpooling advantages, and proved that carpooling can bring benefits to passengers and drivers by simulation .
On the other hand, the problem of carpooling matching and route optimization is studied. Jamal put forward route planning and ride matching algorithms and designed a system that can supply the users with alternative routes for their trips . Mallus proposed a dynamic carpooling route matching algorithm, and the method is verified by the experiment . Huang proposed carpool route and matching algorithm and solved carpool service problems in cloud computing based on genetic algorithm . Chang designed a vehicular information system that combines the improved carpooling algorithm and the VANET-based route planning and computed the optimal carpooling sequence and precise fuel costs shared . Ma built a taxi carpooling path optimization model, solved it based on the improved genetic algorithm, and obtained optimized path results . He proposed an intelligent routing scheme based on GPS data. The carpooling system provides many-to-many services with multiple pickup and dropping points . Xiao proposed a taxi carpooling matching algorithm based on fuzzy clustering and fuzzy recognition .
In summary, the above researches proved the feasibility and effectiveness of carpooling mode and solved the problem of route planning in carpooling process. However, detour is a common phenomenon of taxi carpooling in reality. Destinations of passengers are different, but they would go to the same direction. Due to the factors, such as having difficulty getting another taxi and lower cost in carpooling, some passengers agree to detour for taking the same taxi. His travel time has to be delayed, but he can get more discount than other passengers in the same carpooling travel. Passengers’ payments have important influences on driver’s income. The reduction of the detour passenger’s cost will depress the driver’s income. How to control the payments of passengers to protect interest of the driver? It is important to study the problem, which can ensure implementation of carpooling policy. However, there are limited researches on the problem. For the problem of taxi detour carpooling, this paper builds a multiobjective optimization model, designs an algorithm to solve the model based on genetic algorithm, and gets reasonable pricing stagey of detour carpooling which ensures interests of passengers and drivers simultaneously. The method makes carpooling detour a reality. The works have a certain guide significance to formulate taxi carpooling policy.
2. Problem Description and Notation
2.1. Problem Description
Suppose two passengers intend to share the same taxi. Of course, it can also be two groups. There may be more than a passenger in each group, but the sum of passengers is not more than taxi capacity. The destinations of the passengers in the same group are the same ones. Therefore, the two groups carpooling can be considered as two passengers carpooling. The problem of two passengers carpooling is studied in this paper. Suppose source of passenger is and the destination is . The best route of passenger is . Source of passenger is , and the destination is . The best route of passenger is . The destinations of the two passengers are different; that is, , but and are in the same direction. Passenger agrees to make a detour in order to share the taxi successfully. The travel routes of the two passengers are shown in Figure 1.
The problem contains two possible situations of detour as follows.
The distance from to is zero, which means that the two passengers start from the same position. In the situation, passenger is sent to his destination; then passenger is sent to the destination. The travel route is . The travel route of passenger is not changed. The travel route of passenger is changed from to . Passenger makes a detour.
The distance from to is not zero, which means that the two passengers start from the different positions. In the situation, passenger gets on the taxi at position ; then passenger gets on the taxi at position . Passenger arrives at the destination first and gets off at position ; then passenger gets off at position . Travel route is . The travel route of passenger is not changed. The travel route of passenger is changed from to . Passenger makes a detour.
In the above carpooling situations, passenger keeps the original route unchanged, but he shares the taxi with others in his travel, so he should enjoy discount price for carpooling. His cost should be lower than that he takes a taxi alone. Passenger travels a new route longer than his original. His time has to be delayed. So more discount should be given to the detour passenger in order to make up for the loss of time caused by a detour. The costs of the two passengers are both reduced, which will influence the income of drivers. Therefore, it is very important to work out a reasonable charging scheme to ensure the interests of the driver and passengers simultaneously. The multiobjective optimization model of taxi carpooling detour is built to study the problem as follows.
2.2. Notation in the Model
All notations in the model are described as follows: : the travel distance of passenger , that is, the distance from to . : the travel distance of passenger , that is, the distance from to : the travel distance of passenger before passenger getting on the taxi, that is, the distance from to . : the travel distance of passenger after passenger getting off the taxi, that is, the distance from to . : the cost of the passenger whose travel distance is . : the base kilometres in taxi charging regulations. : the initiate price in taxi charging regulations, that is, the fee within kilometres. : the price per kilometre more than kilometres according to taxi charging regulations. : the cost of passenger under the condition of non-carpooling. : the cost of passenger under the condition of non-carpooling. : the cost of passenger under the condition of carpooling. : the cost of passenger under the condition of carpooling. : the cost of passenger when he just shares taxi with others and does not make a detour. : the payment ratio of the non-detour passenger, which is called carpooling payment ratio. : the payment ratio of detour passenger, which is called detour payment ratio. : the detour distance which describes the difference between travel distance after detour carpooling and original travel distance. : the driver’s income under the condition of non-carpooling. : the gas fee vehicle consumed when travel distance is . : the gas consumption per 100 km. : the gas price per cubic meter. : the actual travel distance of the vehicle in a carrying trip. : the driver’s income per unit travel length. : the driver’s income under the condition of carpooling. : the driver’s income per unit travel long under the condition of carpooling. : the maximum threshold of the ratio of detour distance to travel distance.
3.1. Cost of Passengers
According to the usual taxi charging regulations in China, cost of passenger is calculated as follows:
If the two passengers take a taxi to their destinations, respectively, that is, they do not share a taxi, cost of passenger and cost of passenger , respectively, are
If the two passengers take the same taxi, passengers just need to pay part charge according to the current traffic policy. The cost of the two passengers is calculated specifically as follows.
Passenger does not make a detour. His travel route is unchanged and the travel time is not delayed. If he shares a taxi with others in part road section, he can only enjoy the discount for the road section of carpooling. There is not any discount for the road section of noncarpooling. The distance of the road section passenger shares taxi with passenger is . The distance of the road section passenger rides taxi alone is . The cost of passenger is
Passenger does not only share a taxi with others, but also make a detour. The travel route of passenger is changed, and his travel time is also delayed. So passenger should enjoy more discount than the other passenger to make up his loss. The detour passenger needs to pay a part of the cost he pays when he does not share a taxi with others. The cost of passenger is where detour payment ratio is not fixed. changes inversely with relative detour distance which is the ratio of detour distance to travel distance. is defined as a function which depends on as follows. is detour distance, and is the ratio of detour distance to travel distance. Function is a decreasing function. When , function is the maximum value. The value decreases with the increases of . If is high so that the value is too low, the interest of the driver will be affected.
Moreover, the cost of passenger by carpooling mode must be lower than that by riding taxi alone; that is,
The cost of passenger by carpooling mode must be lower than that by sharing a taxi but no detour; that is,
3.2. Income of Driver
The income of the driver depends on the payments of passengers and the fee of gas consumed. When travel distance of a vehicle is , the gas fee is
Under the condition of noncarpooling, the driver’s income of the whole travel is
If the time the driver takes in a carrying trip is long, the number of carrying trips in a day will reduce, which influences the total income of the driver all day. So it is unreasonable to describe the driver’s income based on the income of the driver each time carrying trip. In order to reveal the income of the driver really, the income per unit travel length is used.
Under the condition of carpooling, the driver’s income in a carrying trip is
Similarly, under the condition of carpooling, the income per unit travel length is
For driver, the driver’s unit income of detour carpooling must be more than that of noncarpooling; that is,
3.3. The Ratio of Detour Distance
Passengers expect the costs reducing, while driver expects the income increasing. In addition, the ratio of detour distance to travel distance is the key to realize detour carpooling. On the one hand, too long detour distance causes that passenger to be delayed for a long time, which is not accepted by the passenger. On the other hand, according to formula (6), the bigger ratio of detour distance to travel distance is, the smaller is. The decrease of detour passenger’s payment leads to the income reduction of the driver. Too small cannot ensure interests of the driver. Therefore, the ratio of detour distance to travel distance must be confined within a range. If the ratio is more than a certain threshold, the detour carpooling will be become impossible. So the following constraint should be satisfied:
3.4. The Multiobjective Optimization Model of Taxi Detour Carpooling
Based on the analysis above, considering the benefits of passengers and driver simultaneously, the multiobjective optimization model of taxi detour carpooling is built as follows.
Formulas (19) ~ (21) are objective functions. Formula (19) means maximizing the cost saving of passenger . Formula (20) means maximizing the cost saving of passenger . Formula (21) means maximizing the increase of driver’ income. Formula (22) describes all constraints in the model.
4. Algorithm Design
4.1. Algorithm Procedure
The model proposed in the paper is a problem of multiobjective optimization. The purpose is to find the best price parameters and . They must be appropriate for all the possible carpooling. Carpooling is described using travel distances of the passengers, the position of getting on or getting off the taxi, and detour distance. The population composed of various types of carpooling is called carpooling states. Carpooling is an individual of carpooling states population. The price parameters would be obtained based on the carpooling states. Good price parameters depend on carpooling states with good diversity. So the algorithm process is divided into the following two parts: searching carpooling states of diversity; seeking the best price parameters for the carpooling states found in problem (1). The solutions are designed based on genetic algorithm. The exact process is shown in Figure 2. Firstly, the work of searching for carpooling states is carried out. The population of carpooling states with good diversity is found. Then, the work of seeking the best price parameters for each individual of the population obtained from above the process is carried out.
The detail algorithm process would be described as follows.
4.2. Searching Carpooling States
4.2.1. Generating Initial Population
An individual of carpooling states population is described as . For an individual, , , , and are random. Suppose travel distances of passengers are normal distribution, the mean value of which is and standard deviation is . and are created based on the normal distribution. In the process of data generation, the nonpositive values are not used. If a nonpositive value is obtained, regenerating the number until a positive value, is chosen equably in the range . is chosen equably in the range to satisfy constraints. The size of carpooling states population is . individuals are generated, which form a carpooling states population.
4.2.2. Evaluation of Carpooling States
Evaluation of each individual of carpooling states population depends on the closeness to other individuals. The closeness of individual is the average value of the Euclidean space distances between individual and other individual s. It is defined as is the value of attribute of individual . is the standardized value for . is the maximum value of attribute in the population. is the minimum value of attribute in the population. The bigger evaluation value shows that the individual is far away from other individuals, which will be kept.
Diversity of the carpooling states population is measured by . is the average value of the distances between all individuals in population . The bigger is, the better the diversity of the population is.
4.2.3. Selection of Carpooling States
Good individuals are selected from the previous population. The selected individuals will form a new population, the size of which is the same as the previous population. Tournament selection strategy is used to select individuals in the paper. The method is as follows:
individuals are selected randomly from the population, and .
The evaluation values of the selected individuals are computed. The best individual will be selected according to the evaluation values.
The above steps are repeated times until individuals are selected. The individuals form a new population.
4.2.4. Crossover of Carpooling States
Crossover operator between two individuals is carried out with probability . and of individuals are exchanged. Suppose is section of individual and is section of individual . Crossover operator between individual and individual is and .
If individual and individual before crossover operator are ,
individual and individual after crossover operator is .
It is necessary to check whether the new individuals satisfy with constraints. The processes of checking and adjustment are as follows: if is not satisfied, will be increased gradually with ranges up to until satisfying the constraint. If there is no appropriate found, and are both increased until satisfying the constraint.
4.2.5. Mutation of Carpooling States
Mutation operator is carried out for individuals with probability . and have an important influence on individuals. A little change of or will lead to a great change. So or is used as mutation section. For an individual, mutation position is selected randomly. If is selected, section of the individual is changed into a new random number with constraints. If is selected, section of the individual is changed into a new random number with constraints.
4.3. Calculation of Price Parameters
The carpooling states population is obtained based on the above methods. Next, the best price parameters would be found based on the population. Searching price parameters is a process of optimization considering multiple objectives. The searching best price parameters are carried out for each individual found in the carpooling states population. The method is designed based on genetic algorithm as follows.
4.3.1. Generating Fronts
The size of the price parameters population is . Individual of price parameters is represented by . and are generated randomly from 0 to 1, satisfying .
All price parameters individuals are divided into several fronts. Specific distribution principles are as follows:(1)Each individual has three goals based on formulation (19)-(21), that is, , , and . If one goal of individual is better than that of at least, and all goal of individual is not worse than that of , individual dominates , or individual is dominated by .(2)If individual is not dominated by other individuals, the individual belongs to the first front; if individual is only dominated by individuals in the first front, the individual belongs to the second front; if individual is only dominated by individuals in the second front, the individual belongs to the third front, and so on.
Then each individual is assigned to one front. The first front is not dominated totally. The individuals of the front are dominated by that of the front . The individuals of the front are better than that of the front .
4.3.2. Crowding Distance
Crowding distance is the distance between individuals of the same front, which describes crowding degree of individuals. The bigger crowding distance shows that the individuals are not crowded, and the diversity of the population is better. Crowding distance of individual is denoted by :where and are two individuals of the front ; that is, . is the value of goal of individual . is the maximum value of goal of all individuals in the front . is the minimum value of goal of all individuals in the front . reflects the sum of distances between individual and individual else in the front . If , crowding degree of individual is less than that of individual . It means that has priority over while selecting individuals.
4.3.3. Selection Operator
Similarly, tournament selection strategy is used to select individuals in price parameters population. individuals are selected randomly from the population, and . The selected individuals are sorted in order to find the best individual. The sorting process is carried out based on the following rules.
and are individuals of the population. and are fronts generated.(1)If , , and is superior to , then individual is better than individual .(2)If and , then crowding distance is compared further. If , individual is better than individual .
Each individual selected is distributed with a rank. The rank indicates the superior order of individuals. The smaller rank shows the better individual. Based on the above rules, if the front is superior to , the ranks of all individuals in front are smaller than that of individuals in . The ranks of individuals in the same front depend on crowding distances of individuals. The bigger the crowding distance is, the smaller the rank is. The individual with the smallest rank is selected based on the above method. The individual selected is the best one in the population.
The above process is carried out times until individuals are selected.
4.3.4. Crossover Operator
Crossover operator between individuals and is carried out with probability . of individual and that of individual are exchanged. Suppose is section of individual , and is section of individual . Crossover operator is .
If individual and individual before crossover operator are ,
individual and individual after crossover operator are .
It is necessary to check whether the new individuals satisfy constraint. If the constraint is not satisfied, exchange and .
4.3.5. Mutation Operator
Mutation operator is carried out for individuals with probability . Mutation position will be selected randomly in and . If is selected, is regenerated randomly in the range from to 1. If is selected, is regenerated randomly in the range from 0 to .
5. Example Analysis
Take Lanzhou city in China, for example, taxi charging standard stipulates that initiate fee is 10¥/3km, 1.4¥ per kilometer more than 3 kilometers. It costs 8 cubic meters gas consumption per 100 km. Gas price is 3.10¥ per cubic meter. The travel distances of passengers are normal distribution . Under these conditions, the problem of detour carpooling is analyzed based on the method proposed in this paper.
Parameters of the algorithm are set as follows: population size , crossover probability , mutation probability , , and the number of individuals selected by tournament selection strategy .
The evolution of diversity of the carpooling states population is shown as Figure 3. The diversity of the carpooling states population increases gradually until it arrives at stabilization. The final carpooling states population obtained can represent the possible carpooling space with good diversity.
The final carpooling states population containing 100 individuals are obtained. The partial results are shown in Table 1.
The work of seeking price parameters is carried out for each individual of the carpooling states population. One of the evolutionary process is given. The average profit of passenger of each population generation is shown as Figure 4. The profit describes the cost difference between noncarpooling and detour carpooling. The value finally converges to 2 CNY, which means that the average cost of the passenger who does not make a detour saves 2 CNY each time compared with taking a taxi alone.
The average profit of passenger of each population generation is shown as Figure 5. The value finally converges to 5 CNY, which means that the average cost of the passenger who makes a detour saves 5 CNY each time relative to taking a taxi alone. The detour passenger gets more profitable than the nondetour passenger does.
The average profit per kilometer of the driver of each population generation is shown as Figure 6. The value finally converges to about 0.2 CNY, which means that the average income per kilometer increases 0.2 CNY compared with carrying a single passenger.
Based on the results of price parameters of carpooling states, the value is shown as Figure 7. The average value of is 0.82. changes around 0.82. That is, the payment ratio of nondetour passenger is 0.82, which is reasonable. It can ensure the realization of carpooling detour.
The value is shown as Figure 8. The value ranges from 0.6 to 0.8. Discount coefficient of passenger is smaller than that of passenger due to time delay detour caused. The value should be in the range from 0.6 to 0.8 to ensure the realization of carpooling detour.
The relation between and is shown in Figure 9. decreases with the increase of . It can be seen from the scatter plot that there is an obvious linear relationship between and .
The regression equation is obtained by regression analysis.In the regression equation, regression coefficient is -0.1874, and intercept is 0.8039. The significance test of the regression equation is performed. The model has a significant linear relationship, and fitting degree is 0.964. If the passenger does not make a detour, that is, , payment ratio of the passenger is , which is consistent with the above analysis results. Therefore, it is easy to determine discount coefficient based on .
In all individuals of the final carpooling states population, the maximum value of is 0.6. So the maximum ratio of detour distance to travel distance is 0.6. It shows that the passengers and the driver can get benefits simultaneously by the mode of carpooling detour when the ratio of detour distance to travel distance is within 0.6. It becomes possible to take the mode of carpooling detour under the condition.
Based on the above analysis, we can set payment ratio to 0.82, calculate detour payment ratio according to the regression expression obtained, and limit the maximum ratio of detour distance to travel distance to 0.6. Only in this way can carpooling with detour be successful.
The paper establishes the multiobjective optimization model of taxi carpooling detour, designs a solution algorithm, and proposes a method of formulating price scheme to ensure benefits of passengers and driver, which can enable carpooling detour the smooth implementation.
The following conclusions are obtained:
It is feasible to take a taxi by the mode of carpooling detour. Benefits of passengers and driver can be protected simultaneously. Costs of non-detour and detour passengers are reduced, and the incomes of the drivers are increased.
It is the key to determining appropriate payment ratio and detour payment ratio . The detour passenger can get more discount than the non-detour passenger can. The payment ratio is a fixed value. The detour payment ratio changes dynamically, and increases as the ratio of detour distance to travel distance decreases.
The ratio of detour distance to travel distance has an important influence on carpooling detour. The ratio should be limited to less than certain values to protect the interests of passengers and drivers under the condition of carpooling detour. If the ratio exceeds the limit value, it is difficult to find appropriate payment ratio and detour payment ratio.
The parameters, such as the payment ratio, the detour payment ratio, and the maximum value of the ratio of detour distance to travel distance, can be obtained by the method proposed in this paper in a real environment.
The above conclusions and the proposed method has a certain guiding significance to formulate taxi carpooling policy.
The data used to support the findings of this study are included within the article.
Conflicts of Interest
The authors declare that they have no conflicts of interest.
This research was funded by National Natural Science Foundation of China (Project no. 61841303, Project no. 71661021, and Project no. 71861023) and Youth Science Foundation of Lanzhou Jiaotong University (Project no. 2015032). We express our thanks to all who participated in this research for their cooperation.
- G. Perboli, F. Ferrero, S. Musso, and A. Vesco, “Business models and tariff simulation in car-sharing services,” Transportation Research Part A: Policy and Practice, vol. 115, pp. 32–48, 2018.
- R. Li, Z. Liu, and R. Zhang, “Studying the benefits of carpooling in an urban area using automatic vehicle identification data,” Transportation Research Part C: Emerging Technologies, vol. 93, pp. 367–380, 2018.
- P. Baptista, S. Melo, and C. Rolim, “Energy, environmental and mobility impacts of car-sharing systems. empirical results from lisbon, portugal,” Procedia - Social and Behavioral Sciences, vol. 111, pp. 28–37, 2014.
- N. Rabbitt and B. Ghosh, “Economic and environmental impacts of organised car sharing services: a case study of ireland,” Research in Transportation Economics, vol. 57, pp. 3–12, 2016.
- B. P. Bruck, V. Incerti, M. Iori, and M. Vignoli, “Minimizing CO2 emissions in a practical daily carpooling problem,” Computers & Operations Research, vol. 81, pp. 40–50, 2017.
- J. Firnkorn and M. Müller, “Free-floating electric carsharing-fleets in smart cities: The dawning of a post-private car era in urban environments?” Environmental Science & Policy, vol. 45, pp. 30–40, 2015.
- Y. Wang, B. Zheng, and E.-P. Lim, “Understanding the effects of taxi ride-sharing—A case study of Singapore,” Computers, Environment and Urban Systems, vol. 69, pp. 124–132, 2018.
- J. Jung, R. Jayakrishnan, and J. Y. Park, “Dynamic shared-taxi dispatch algorithm with hybrid-simulated annealing,” Computer-Aided Civil and Infrastructure Engineering, vol. 31, no. 4, pp. 275–291, 2016.
- D. O. Santos and E. C. Xavier, “Taxi and ride sharing: A dynamic dial-a-ride problem with money as an incentive,” Expert Systems with Applications, vol. 42, no. 19, pp. 6728–6737, 2015.
- D. J. Fagnant and K. M. Kockelman, “Dynamic ride-sharing and fleet sizing for a system of shared autonomous vehicles in Austin, Texas,” Transportation, vol. 45, no. 1, pp. 143–158, 2016.
- H. Ou and T. Tang, “Impacts of carpooling on trip costs under car-following model,” Physica A: Statistical Mechanics and its Applications, vol. 505, pp. 136–143, 2018.
- F. Bachmann, A. Hanimann, J. Artho, and K. Jonas, “What drives people to carpool? Explaining carpooling intention from the perspectives of carpooling passengers and drivers,” Transportation Research Part F: Traffic Psychology and Behaviour, vol. 59, pp. 260–268, 2018.
- J. Żak, M. Hojda, and G. Filcek, “Multiple criteria optimization of the carpooling problem,” Transportation Research Procedia, vol. 37, pp. 139–146, 2019.
- A. Petrillo, P. Carotenuto, I. Baffo, and F. De Felice, “A web-based multiple criteria decision support system for evaluation analysis of carpooling,” Environment, Development and Sustainability, vol. 20, no. 5, pp. 2321–2341, 2018.
- M. V. Ciasullo, O. Troisi, F. Loia, and G. Maione, “Carpooling: travelers’ perceptions from a big data analysis,” TQM Journal, vol. 30, no. 5, pp. 554–571, 2018.
- Y. Park, N. Chen, and G. Akar, “Who is interested in carpooling and why: the importance of individual characteristics, role preferences and carpool markets,” Transportation Research Record, 2018.
- K. M. Sonet, M. M. Rahman, S. R. Mehedy, and R. M. Rahman, “SharY: a dynamic ridesharing and carpooling solution using advanced optimised algorithm,” International Journal of Knowledge Engineering and Data Mining, vol. 6, no. 1, pp. 1–31, 2019.
- W. Zhang, R. He, C. Ma et al., “Research on taxi driver strategy game evolution with carpooling detour,” Journal of Advanced Transportation, vol. 2018, Article ID 2385936, 8 pages, 2018.
- S. A. Shaheen, N. D. Chan, and T. Gaynor, “Casual carpooling in the San Francisco Bay Area: Understanding user characteristics, behaviors, and motivations,” Transport Policy, vol. 51, pp. 165–173, 2016.
- P. Delhomme and A. Gheorghiu, “Comparing French carpoolers and non-carpoolers: Which factors contribute the most to carpooling?” Transportation Research Part D: Transport and Environment, vol. 42, pp. 1–15, 2016.
- S. Malodia and H. Singla, “A study of carpooling behaviour using a stated preference web survey in selected cities of India,” Transportation Planning and Technology, vol. 39, no. 5, pp. 538–550, 2016.
- S. Tahmasseby, L. Kattan, and B. Barbour, “Propensity to participate in a peer-to-peer social-network-based carpooling system,” Journal of Advanced Transportation, vol. 50, no. 2, pp. 240–254, 2016.
- R. Javid, A. Nejat, and M. Salari, “The environmental impacts of carpooling in the United States,” in Proceedings of the Transportation, Land and Air Quality Conference, 2016.
- S. R. I. Sweta, M. Mounika, P. Agrawal et al., “A survey to justify the need for carpooling,” International Journal of Soft Computing and Engineering, vol. 5, no. 2, pp. 117–120, 2015.
- W. Zhang, R. He, Q. Xiao, and C. Ma, “Taxi carpooling model and carpooling effects simulation,” International Journal of Simulation and Process Modelling, vol. 12, no. 3-4, pp. 338–346, 2017.
- J. Jamal, R. Montemanni, D. Huber, M. Derboni, and A. E. Rizzoli, “A multi-modal and multi-objective journey planner for integrating carpooling and public transport,” Journal of Traffic and Logistics Engineering, vol. 5, no. 2, pp. 68–72, 2017.
- M. Mallus, G. Colistra, L. Atzori, M. Murroni, and V. Pilloni, “Dynamic carpooling in urban areas: design and experimentation with a multi-objective route matching algorithm,” Sustainability, vol. 9, no. 2, p. 254, 2017.
- S.-C. Huang, M.-K. Jiau, and C.-H. Lin, “A genetic-algorithm-based approach to solve carpool service problems in cloud computing,” IEEE Transactions on Intelligent Transportation Systems, vol. 16, no. 1, pp. 352–364, 2015.
- I. Chang, S. Hung, and C. Yen, “On design of a dynamic carpooling system based on vehicle information shared through the VANET,” in Proceedings of the Systems, Man, and Cybernetics (SMC), 2016 IEEE International Conference on, pp. 003148–003153, IEEE, Budapest, Hungary, 2016.
- C. Ma, R. He, W. Zhang, and X. Ma, “Path optimization of taxi carpooling,” PLoS ONE, vol. 13, no. 8, Article ID e0203221, pp. 1–15, 2018.
- W. He, K. Hwang, and D. Li, “Intelligent carpool routing for urban ridesharing by mining GPS trajectories,” IEEE Transactions on Intelligent Transportation Systems, vol. 15, no. 5, pp. 2286–2296, 2014.
- Q. Xiao, R.-C. He, W. Zhang, and C.-X. Ma, “Algorithm research of taxi carpooling based on fuzzy clustering and fuzzy recognition,” Journal of Transportation Systems Engineering and Information Technology, vol. 14, no. 5, pp. 119–125, 2014.
Copyright © 2019 Wei Zhang et al. This is an open access article distributed under the Creative Commons Attribution License, which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited.