Solution methods for the taxi pooling problem

NCUIR > Engineering College > Department of Civil Engineering > journal & Dissertation > Item 987654321/99687

Please use this identifier to cite or link to this item: https://ir.lib.ncu.edu.tw/handle/987654321/99687

Title:	Solution methods for the taxi pooling problem
Authors:	顏上堯;Yan, Shangyao;Chen, Chun-Ying;Wu, Chuan-Che
Contributors:	工學院土木工程學系
Keywords:	Applied sciences;Automobiles;Car pools;Case studies;destinations;Economic Geography;Economics;Economics and Finance;Engineering Economics;Exact sciences and technology;Gender;Genetic algorithms;Ground, air and sea transportation, marine construction;Heuristic;Innovation/Technology Management;Lagrangian relaxation;Logistics;Marketing;Matching;Mathematical methods;Mathematical programming;Methodology;Methods;Modelling;Multiple commodity network flow problem;Multiple origins;Operating costs;Organization;Passengers;Regional/Spatial Science;Relaxation;Road traffic;Road transport;Road transportation and traffic;Strategic planning;Studies;Taiwan;Taxi pooling;Taxicabs;Travel;Urban transport;Vehicles
Date:	2012-05-01
Issue Date:	2026-04-21 13:27:43 (UTC+8)
Publisher:	Springer Netherlands;Boston: Springer US
Abstract:	摘要： In Taiwan, taxi pooling is currently performed by some taxi companies using a trial-and-error experience-based method, which is neither effective nor efficient. There is, however, little in the literature on effective models and solution methods for solving the taxi pooling problem. Thus, in this study we employ network flow techniques and a mathematical programming method to develop a taxi pooling solution method. This method is composed of three models. First, a fleet routing/scheduling model is constructed to produce fleet/passenger routes and schedules. A solution algorithm, based on Lagrangian relaxation, a sub-gradient method and a heuristic to find the upper bound of the solution, is proposed to solve the fleet routing/scheduling model. Then, two single taxi-passenger matching models are constructed with the goals of decreasing number of passenger transfers and matching all passengers and taxis. These two taxi-passenger matching models are directly solved using a mathematical programming solver. For comparison with the solution method, we also develop another heuristic by modifying a heuristic recently proposed for solving a one-to-many taxi pooling problem. The performance of the solution method and the additional heuristic are evaluated by carrying out a case study using real data and suitable assumptions. The test results show that these two solution methods could be useful in practice. 其他題名： Transportation 出版者： Boston: Springer US 出版日期： 2012-05-01 出處： Transportation (Dordrecht), 2012-05, Vol.39 (3), p.723-748 資源來源： EBSCOhost OmniFile Full Text Select 版權： Springer Science+Business Media, LLC. 2011 版權： 2015 INIST-CNRS 版權： Springer Science+Business Media, LLC. 2012 識別號： ISSN: 0049-4488 識別號： EISSN: 1572-9435 識別號： DOI: 10.1007/s11116-011-9354-9 識別號： CODEN: TNPRDN
Appears in Collections:	[Department of Civil Engineering] journal & Dissertation

Files in This Item:

File	Description	Size	Format
index.html		0Kb	HTML	20	View/Open

社群 sharing

Loading...