Distributed planning for the on-line dial-a-ride problem

Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

2 Scopus citations

Abstract

This paper describes the experiments and results obtained from distributing an improved insertion heuristic for the scheduling of passengers' trip requests over a fleet of vehicles. The distribution has been obtained by means of an agent architecture implemented over Jade. Agents make use of the contractnet protocol as base coordination mechanism for the planning and scheduling of passenger trips. In particular, this paper focuses on the insertion heuristic implementation details within the agent-based architecture and its performance in diverse distributed scenarios when varying the number of hosts.

Original languageEnglish
Title of host publicationFrontiers in Algorithmics - First Annual International Workshop, FAW 2007, Proceedings
Pages124-135
Number of pages12
StatePublished - 1 Dec 2007
Event1st International Frontiers in Algorithmics Workshop, FAW 2007 - Lanzhou, China
Duration: 1 Aug 20073 Aug 2007

Publication series

NameLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volume4613 LNCS
ISSN (Print)0302-9743
ISSN (Electronic)1611-3349

Conference

Conference1st International Frontiers in Algorithmics Workshop, FAW 2007
CountryChina
CityLanzhou
Period1/08/073/08/07

Fingerprint Dive into the research topics of 'Distributed planning for the on-line dial-a-ride problem'. Together they form a unique fingerprint.

Cite this