By Topic

A Model With a Heuristic Algorithm for Solving the Long-Term Many-to-Many Car Pooling Problem

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$33 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

3 Author(s)
Shangyao Yan ; Department of Civil Engineering, National Central University, Jhongli, Taiwan ; Chun-Ying Chen ; Yu-Fang Lin

Long-term car pooling is defined as the sharing of a private vehicle by more than one user who need to reach a destination following a semicommon route between the individuals' points of origin and destination in a specific period. In this paper, we employ a network flow technique to systematically develop a long-term many-to-many car pooling model. The model is formulated as a special integer multiple-commodity network flow problem. A Lagrangian relaxation-based algorithm is also developed to solve the model. The performance of the heuristic algorithm is evaluated by carrying out a case study using real data and suitable assumptions. The test results confirm the usefulness of the model and the heuristic algorithm and that they could be useful in practice.

Published in:

IEEE Transactions on Intelligent Transportation Systems  (Volume:12 ,  Issue: 4 )