In-time agent-based vehicle routing with a stochastic improvement heuristic
AAAI '99/IAAI '99 Proceedings of the sixteenth national conference on Artificial intelligence and the eleventh Innovative applications of artificial intelligence conference innovative applications of artificial intelligence
MACS-VRPTW: a multiple ant colony system for vehicle routing problems with time windows
New ideas in optimization
An agent architecture for vehicle routing problems
Proceedings of the 2001 ACM symposium on Applied computing
Parallel Tabu Search for Real-Time Vehicle Routing and Dispatching
Transportation Science
A general heuristic for vehicle routing problems
Computers and Operations Research
Active guided evolution strategies for large-scale vehicle routing problems with time windows
Computers and Operations Research
The Contract Net Protocol: High-Level Communication and Control in a Distributed Problem Solver
IEEE Transactions on Computers
Subset-Row Inequalities Applied to the Vehicle-Routing Problem with Time Windows
Operations Research
A penalty-based edge assembly memetic algorithm for the vehicle routing problem with time windows
Computers and Operations Research
Parallel simulated annealing for the vehicle routing problem with time windows
EUROMICRO-PDP'02 Proceedings of the 10th Euromicro conference on Parallel, distributed and network-based processing
Hi-index | 0.00 |
Vehicle Routing problems are highly complex problems for which different Artificial Intelligence techniques have been used. In this paper, we propose two agent-oriented self-organization models for the dynamic version of the problem with time windows. The first model relies on a spatial representation, and the second is based on a space-time representation of the agents' action zones, which are able to maintain a good distribution of the vehicles on the environment. This distribution provides better results than traditional methods by allowing the agents to take their decisions while anticipating future changes in the system's parameters.