His main research interests are relay protection, control and automation of electric power system. Yuansheng Liang received Ph.D. after graduated from South China University of Technology, Guangzhou, 2008. Currently, he is a lecturer in South China University of Technology. His main research interests are relay protection, fault location and automation of electric power system Dehui Zeng received the B.E. degree in electrical engineering from South China University of Technology, Guangzhou, China, in 2010, where he is currently working toward the Ph.D. degree.His research interests are fault analysis, relay protection and development of protection devices.
The time-dependent pollution-routing problem of free pickup and delivery of passengers to the airport service (TDFPDS) is an extension of the time-dependent pollution-routing problems, arising in flight ticket sales companies for the service of free pickup and delivery of airline passengers to the airport. The problem consists of routing a fleet of vehicles in order to deliver a set of customers to the airport considering the traffic congestion, time window constraints, and maximum ride time constraints. The cost function includes fuel consumption and driver costs. We provide an analytical characterization of the optimal solutions for a fixed route and propose a novel heuristic for a given route based on the analysis of the illustrative examples. The heuristic algorithm is embedded into a set-partitioning model to produce high-quality routing plans. Finally, using wide variety of random instances, we present results on the computational performance of the heuristic and also on the impact of the congestion and the maximum ride time constraints.
A static dial-a-ride problem with time windows is investigated, without wait while carrying passengers and maximum ride time constraints as the service quality. A parallel insertion heuristic based on the spatial and temporal aspects is presented. The proposed algorithm firstly sorts the requests based on the earliest pickup time and decentralization index alternately and initializes the routes with seed requests. Then a insertion-rejected-reinsertion operation is performed, in which the spatial aspect as the granular is also considered. Simulation results indicate that the proposed algorithm reduces costs effectively, compared with the algorithms only considering the temporal aspect and no seed requests. Also, sensitivity analysis indicates that the required vehicle number is insensitive to the granular extent and the initial vehicle number.
scite is a Brooklyn-based organization that helps researchers better discover and understand research articles through Smart Citations–citations that display the context of the citation and describe whether the article provides supporting or contrasting evidence. scite is used by students and researchers from around the world and is funded in part by the National Science Foundation and the National Institute on Drug Abuse of the National Institutes of Health.