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. © Springer-Verlag Berlin Heidelberg 2007.
CITATION STYLE
Cubillos, C., Crawford, B., & Rodríguez, N. (2007). Distributed planning for the on-line dial-a-ride problem. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 4613 LNCS, pp. 124–135). Springer Verlag. https://doi.org/10.1007/978-3-540-73814-5_12
Mendeley helps you to discover research relevant for your work.