Agent Based Model for Dynamic Ridesharing

Dynamic ridesharing brings together individuals with similar itineraries to travel together and share the costs. Centralized (binary integer programming) and decentralized (dynamic auction-based multi-agent) optimization algorithms are formulated to match passengers and drivers. An application of these methods on a large scale case study shows that the decentralized approach provides near optimal solutions for single-driver, single-passenger case, with much less computational burden. The decentralized approach is then extended to accommodate both multi passenger matches. The results indicate higher user cost savings and Vehicle Kilometers Traveled (VKT) savings when allowing multi passenger rides.

• Supplemental Notes:
  • This paper was sponsored by TRB committee ABE50 Transportation Demand Management.
• Corporate Authors:

  Transportation Research Board

  500 Fifth Street, NW
  Washington, DC  United States  20001
• Authors:
  • Nourinejad, Mehdi
  • Roorda, Matthew J
• Conference:
  • Transportation Research Board 93rd Annual Meeting
  • Location: Washington DC
  • Date: 2014-1-12 to 2014-1-16
• Date: 2014

Language

• English

Media Info

• Media Type: Digital/other
• Features: Figures; References; Tables;
• Pagination: 16p
• Monograph Title: TRB 93rd Annual Meeting Compendium of Papers

Subject/Index Terms

• TRT Terms: Algorithms; Case studies; Drivers; Passengers; Ridesharing; Savings
• Subject Areas: Passenger Transportation; Planning and Forecasting; Public Transportation; I72: Traffic and Transport Planning;

Filing Info

• Accession Number: 01516547
• Record Type: Publication
• Report/Paper Numbers: 14-1826
• Files: TRIS, TRB, ATRI
• Created Date: Feb 28 2014 1:32PM