Time constrained VRP: an agent environment-perception model

Authors:
Mahdi Zargayouna
Affiliations:
Inrets institute and Paris-Dauphine University, France, email: zargayou@inrets.fr
Venue:
Proceedings of the 2006 conference on ECAI 2006: 17th European Conference on Artificial Intelligence August 29 -- September 1, 2006, Riva del Garda, Italy
Year:
2006

Citing 5
Cited 0

Algorithms for the vehicle routing and scheduling problems with time window constraints

Operations Research
Analysis of Symbolic Data: Exploratory Methods for Extracting Statistical Information from Complex Data

Analysis of Symbolic Data: Exploratory Methods for Extracting Statistical Information from Complex Data
Toward a Multi-agent Modelling Approach for Urban Public Transportation Systems

ESAW '01 Proceedings of the Second International Workshop on Engineering Societies in the Agents World II
Environments for multiagent systems state-of-the-art and research challenges

E4MAS'04 Proceedings of the First international conference on Environments for Multi-Agent Systems
Agent information server: a middleware for traveler information

ESAW'05 Proceedings of the 6th international conference on Engineering Societies in the Agents World

Quantified Score

Hi-index	0.00

Visualization

Abstract

In this paper, we present a multiagent model in which agents have a perception upon their shared environment, a measure is associated to the agents' perception field. We apply the model on the Vehicle Routing Problem with Time Windows (VRPTW). The overall process adopts the general schema of parallel insertion methods and it uses the contracting of perception's field of the vehicle agents as a new distance between them. This new measure expresses the feasibility universe of the vehicles and is used as a criterion of choice between candidates vehicles for the insertion of a customer in their plan. Our approach provides a new method to tackle the Time constrained VRP in which the solving process is focused on the future and constitutes an alternative for handling the dynamic version of the problem.