A model and a solution algorithm for the car pooling problem with pre-matching information
Computers and Industrial Engineering
Research on reservation allocation decision method based on neural network
ISNN'05 Proceedings of the Second international conference on Advances in Neural Networks - Volume Part III
A Multi-agent Based Self-adaptive Genetic Algorithm for the Long-term Car Pooling Problem
Journal of Mathematical Modelling and Algorithms
Analysis and evaluation of the slugging form of ridesharing
Proceedings of the 21st ACM SIGSPATIAL International Conference on Advances in Geographic Information Systems
The Vanpool Assignment Problem: Optimization models and solution algorithms
Computers and Industrial Engineering
| Hi-index | 0.00 |
Car pooling is a transportation service organized by a large company which encourages its employees to pick up colleagues while driving to/from work to minimize the number of private cars travelling to/from the company site. The car pooling problem consists of defining the subsets of employees that will share each car and the paths the drivers should follow, so that sharing is maximized and the sum of the path costs is minimized. The special case of the car pooling problem where all cars are identical can be modeled as a Dial-a-Ride Problem. In this paper, we propose both an exact and a heuristic method for the car pooling problem, based on two integer programming formulations of the problem. The exact method is based on a bounding procedure that combines three lower bounds derived from different relaxations of the problem. A valid upper bound is obtained by the heuristic method, which transforms the solution of a Lagrangean lower bound into a feasible solution. The computational results show the effectiveness of the proposed methods.