Multi-agent approach to dynamic pick-up and delivery problem with uncertain knowledge about future transport demands

Authors:
Jaroslaw Koźlak;Jean-Charles Créput;Vincent Hilaire;Abder Koukam
Affiliations:
Department of Computer Science, AGH University of Science and Technology, Kraków, Poland;Systems and Transportation Laboratory, University of Technology of Belfort-Montbeliard Belfort, France;Systems and Transportation Laboratory, University of Technology of Belfort-Montbeliard Belfort, France;Systems and Transportation Laboratory, University of Technology of Belfort-Montbeliard Belfort, France
Venue:
Fundamenta Informaticae - Special issue on theory and applications of soft computing (TASC04)
Year:
2006

Citing 0
Cited 3

Collective intelligence for demand-responsive transportation systems: a self organization model

NOTERE '08 Proceedings of the 8th international conference on New technologies in distributed systems
Simulating Activities of the Transportation Company through Multi-Agent System Solving the Dynamic Vehicle Routing Problem

KES-AMSTA '09 Proceedings of the Third KES International Symposium on Agent and Multi-Agent Systems: Technologies and Applications
Agent-based system with learning capabilities for transport problems

ICCCI'11 Proceedings of the Third international conference on Computational collective intelligence: technologies and applications - Volume Part II

Quantified Score

Hi-index	0.00

Visualization

Abstract

This work focuses on the dynamic Pickup and Delivery Problem with Time Windows (PDPTW). The transport requests should be performed using the available fleet of vehicles. The vehicles move between the nodes of a road network. The aim of this work is to propose a model which allows, during a transport plan creation, to take into account predictable events. Particularly, we consider the frequency of requests at any node in the road network and the construction of vehicle routes that will allow new requests to be inserted without any significant route modification. Therefore, we construct routes that pass near the nodes where transport requests are most frequently generated.