Abstract
Carpooling is an environmentally friendly transportation system. It can efficaciously help resolve a variety of societal concerns of the urban areas, ranging from traffic congestion to environmental pollution. In this paper, we propose a new mathematical model to solve the carpooling problem. The model simultaneously minimizes the costs of travel times, the vehicle use, and the vehicle delays. An exact solution method based on Branch-and-Bound (B&B) algorithm is proposed to efficiently obtain the optimal solution of the problem. In order to find the near-optimal solutions for large-scale problems, a heuristic beam search algorithm is introduced, which is based on the partial relaxation of some fathoming criteria applied in our proposed B&B. The computational experiments are conducted, based upon the transportation network of Isfahan city, Iran. The results demonstrate the great capability of the proposed exact solution method in terms of both computational solving time required and the number of the evaluated nodes, in comparison with CPLEX software package. The findings of this research can be applied to solve the carpooling problem compatible to the real-life situations.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have