Carpooling is an emerging alternative transportation mode that is eco-friendly and sustainable as it enables commuters to save time, travel resource, reduce emission and traffic congestion. The procedure of carpooling consists of a number of steps namely (i) create a motive to carpool, (ii) communicate this motive with other interested agents, (iii) negotiate a plan with the interested agents, (iv) execute the agreed plans and (v) provide a feedback to all concerned agents. The state-of-the-art research work on agent-based modeling is limited to a number of technical and empirical studies that are unable to handle the complex agent behavior in terms of coordination, communication and negotiations. In this paper we present a conceptual design of an agent-based model (ABM) for the carpooling application that serves as a proof of concept. Our agent-based model for the carpooling application is a computational model that is used for simulating the interactions of autonomous agents and to analyze the effects of change in factors related to the infrastructure, behavior and cost. In our agent-based carpooling application we use agent profiles and social networks to initiate our agent communication model and then employ a route matching algorithm and a utility function to trigger the negotiation process between agents. We plan to, as a part of the future work, develop a prototype of our agent-based carpooling application on the basis of the work presented in this paper. Furthermore, we also intend to carry out a validation study of our results with real data

Carpooling is thought to be part of the solution to resolve traffic congestion in regions where large companies dominate the traffic situation because coordination and matching between commuters is more likely to be feasible in cases where most people work for a single employer. Moreover, carpooling is not very popular for commuting. In order for car-pooling to be successful, an online service for matching commuter profiles is indispensable due to the large community involved. Such service is necessary but not sufficient because carpooling requires rerouting and activity rescheduling along with candidate matching. We advise to introduce services of this kind using a two step process: (1) an agent-based simulation is used to investigate opportunities and inhibitors and (2) online matching is made available. This paper describes the challenges to build the model and in particular investigates possibilities to derive the data required for commuter behavior modeling from bi g data (such as GSM, GPS and/or Bluetooth)

Carpooling can cut costs and help to solve congestion problems but does not seem to be popular. Behavioral models allow to study the incentives and inhibitors for carpooling and the aggregated effect on the transportation system. In activity based modeling used for travel forecasting, cooperation between actors is important both for schedule planning and revision. Carpooling requires cooperation while commuting which in turn involves co-scheduling and co-routing. The latter requires combinatorial optimization. Agent-based systems used for activity based modeling, contain large amounts of agents. The agent model requires helper algorithms that deliver high quality solutions to embedded optimisation problems using a small amount of resources. Those algorithms are invoked thousands of times during agent society evolution and schedule execution simulation. Solution quality shall be sufficient in order to guarantee realistic agent behavior. This paper focuses on the co-routing problem

An automatic service to match commuting trips has been designed. Candidate carpoolers register their personal profile and a set of periodically recurring trips. The Global CarPooling Matching Service (GCPMS) shall advise registered candidates on how to combine their commuting trips by carpooling. Planned periodic trips correspond to nodes in a graph; the edges are labeled with the probability for negotiation success while trying to merge planned trips by carpooling. The probability values are calculated by a learning mechanism using on one hand the registered person and trip characteristics and on the other hand the negotiation feedback. The GCPMS provides advice by maximizing the expected value for negotiation success. This paper describes possible ways to determine the optimal advice and estimates computational scalability using real data for Flanders