The auction algorithm: a distributed relaxation method for the assignment problem
Annals of Operations Research - Special Issue: Parallel Optimization on Novel Computer Architectures
Rules of encounter: designing conventions for automated negotiation among computers
Rules of encounter: designing conventions for automated negotiation among computers
Collaborative assignment: a multiagent negotiation approach using BDI concepts
Proceedings of the first international joint conference on Autonomous agents and multiagent systems: part 1
An adaptive solution to dynamic transport optimization
Proceedings of the fourth international joint conference on Autonomous agents and multiagent systems
Decentralized Assignment Reasoning Using Collaborative Local Mediation
IEEE Transactions on Knowledge and Data Engineering
Developing Multi-Agent Systems with JADE (Wiley Series in Agent Technology)
Developing Multi-Agent Systems with JADE (Wiley Series in Agent Technology)
Information Sciences: an International Journal
Mobile phone location determination and its impact on intelligent transportation systems
IEEE Transactions on Intelligent Transportation Systems
Investigation for a global AVL system
IEEE Transactions on Intelligent Transportation Systems
Performance analysis of caching and prefetching strategies for palmtop-based navigational tools
IEEE Transactions on Intelligent Transportation Systems
Optimal vehicle routing with real-time traffic information
IEEE Transactions on Intelligent Transportation Systems
A review of the applications of agent technology in traffic and transportation systems
IEEE Transactions on Intelligent Transportation Systems
Engineering Applications of Artificial Intelligence
| Hi-index | 0.00 |
An empirical and comparative evaluation of multiagent taxi dispatch with extended (E) runtime taxi availability is presented. A taxi in operation is said to be E-runtime available if it has a passenger alighting in δx 0 minutes' time or is empty, but has no new committed taxi request to service next. In a multiagent architecture, we consider a new operation policy wherein agents of E-runtime available taxis are allowed to negotiate in individual groups of size N for new taxi requests. The main objective is to present an evaluation of the multiagent system performance gains provided by different times-to-arrival of δx, under a discrete range of demand rates for several N-group sizes, as compared with the base case when δx = 0. It is shown that the proposed policy can effectively reduce customer waiting time and empty taxi cruising time by up to about 60% and 96%, respectively, when the service demand is high for a 1000-strong taxi fleet. It is observed that the value selection for the policy parameter dx is an important aspect for improving the general performance of multiagent taxi dispatch.