原文传递
Carpooling problem: A new mathematical model, branch-and-bound, and heuristic beam search algorithm
| 题名： | Carpooling problem: A new mathematical model, branch-and-bound, and heuristic beam search algorithm |
| 正文语种： | 英文 |
| 作者： | Mohammad Tamannaei; Iman Irandoost |
| 作者单位： | Department of Transportation Engineering, Isfahan University of Technology, Isfahan, Iran; Department of Electrical and Computer Engineering, Isfahan University of Technology, Isfahan, Iran |
| 关键词： | Beam search algorithm; carpooling; exact solution method; mathematical model; transportation |
| 摘要： | 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. |
| 出版年： | 2019 |
| 期刊名称： | Journal of Intelligent Transportation Systems Technology Planning and Operations |
| 卷： | 23 |
| 期： | 3 |
| 页码： | 203-215 |
相关文献
- Optimizing a vehicle’s route in an on-demand ridesharing system in which users might walk
- Strategic Planning of Urban Network Evacuation with Balanced Signal Control and Crosselimination Strategies
- Designing a Flexible Feeder Transit System Serving Irregularly Shaped and Gated Communities: Determining Service Area and Feeder Route Planning
- Recursive Hybrid Heuristic Algorithm for Routing a Track-Geometry Car through a Large-Scale Urban Subway Network
- Optimal Design of Midblock Crosswalk to Achieve Trade-Off between Vehicles and Pedestrians
- Tabu Search Strategies for Variable Speed Limit Control at a Lane Drop Bottleneck
检索历史
应用推荐
