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.
https://doi.org/10.1155/2017/1918903Cite as:
@article{Guo_2017,
doi = {10.1155/2017/1918903},
url = {https://doi.org/10.1155%2F2017%2F1918903},
year = 2017,
publisher = {Hindawi Limited},
volume = {2017},
pages = {1--14},
author = {Jingmei Guo and Chao Liu},
title = {Time-Dependent Vehicle Routing of Free Pickup and Delivery Service in Flight Ticket Sales Companies Based on Carbon Emissions},
journal = {Journal of Advanced Transportation}
}