Add to ORKGIn this paper we discuss the results of a plan merging algorithm. This algorithm coordinates the plans of multiple, autonomous agents, each able to independently find a plan. This algorithm is evaluated using realistic data from a taxi company. We show that when we allow passengers to be a few minutes later at their destination and share rides, we can obtain more than 5% reduction of the taxi driving distance. When we allow for a delay of 15 minutes (a common amount of time in subsidized transport) we can gain up to 30%.Software Computer TechnologyElectrical Engineering, Mathematics and Computer Scienc
In an increasing urbanizing world the need for efficient transportation methods is growing. Rideshar...
— Recently, ridesharing mobile applications, which dynamically match passengers to drivers, have beg...
In a multi-agent system, agents are carrying out certain tasks by executing plans. Consequently, the...
In this paper we discuss the results of a plan merging algorithm. This algorithm coordinates the pla...
We discuss a resource-based planning framework where agents are able to merge plans by exchanging re...
Abstract We discuss a resource-based planning framework where agents are able to merge plans by exch...
Travel sharing, i.e., the problem of finding parts of routes which can be shared by several travelle...
Taxi-sharing is admittedly a promising solution to reduce travel costs and mitigate congestion. Howe...
Taxis are a quick and reliable mean of transportation, especially in those cities where the public t...
In many major cities, fixed route transit systems such as bus and rail serve millions of trips per d...
The taxi dispatching problem has been a hot topic in recent years. All taxi operating companies are ...
Abstract—Ridesharing offers the opportunity to make more efficient use of vehicles while preserving ...
Ridesharing offers the opportunity to make more efficient use of vehicles while preserving the benef...
Reducing the number of cars driving on roads is an important objective for smart sustainable cities,...
This paper deals with a combinatorial optimization problem that models situations of both dynamic ri...
In an increasing urbanizing world the need for efficient transportation methods is growing. Rideshar...
— Recently, ridesharing mobile applications, which dynamically match passengers to drivers, have beg...
In a multi-agent system, agents are carrying out certain tasks by executing plans. Consequently, the...
In this paper we discuss the results of a plan merging algorithm. This algorithm coordinates the pla...
We discuss a resource-based planning framework where agents are able to merge plans by exchanging re...
Abstract We discuss a resource-based planning framework where agents are able to merge plans by exch...
Travel sharing, i.e., the problem of finding parts of routes which can be shared by several travelle...
Taxi-sharing is admittedly a promising solution to reduce travel costs and mitigate congestion. Howe...
Taxis are a quick and reliable mean of transportation, especially in those cities where the public t...
In many major cities, fixed route transit systems such as bus and rail serve millions of trips per d...
The taxi dispatching problem has been a hot topic in recent years. All taxi operating companies are ...
Abstract—Ridesharing offers the opportunity to make more efficient use of vehicles while preserving ...
Ridesharing offers the opportunity to make more efficient use of vehicles while preserving the benef...
Reducing the number of cars driving on roads is an important objective for smart sustainable cities,...
This paper deals with a combinatorial optimization problem that models situations of both dynamic ri...
In an increasing urbanizing world the need for efficient transportation methods is growing. Rideshar...
— Recently, ridesharing mobile applications, which dynamically match passengers to drivers, have beg...
In a multi-agent system, agents are carrying out certain tasks by executing plans. Consequently, the...