A cross entropy multiagent learning algorithm for solving vehicle routing problems with time windows

Authors:
Tai-Yu Ma
Affiliations:
LET, ISH, Lyon Cedex
Venue:
ICCL'11 Proceedings of the Second international conference on Computational logistics
Year:
2011

Citing 13
Cited 0

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

Operations Research
VRP with Time Windows

The vehicle routing problem
Evolutionary Algorithms for the Vehicle Routing Problem with Time Windows

Journal of Heuristics
Effective Local Search Algorithms for Routing and Scheduling Problems with General Time-Window Constraints

Transportation Science
Sequential search and its application to vehicle-routing problems

Computers and Operations Research
A general heuristic for vehicle routing problems

Computers and Operations Research
The vehicle routing problem with flexible time windows and traveling times

Discrete Applied Mathematics - Special issue: Discrete algorithms and optimization, in honor of professor Toshihide Ibaraki at his retirement from Kyoto University
Vehicle Routing Problem with Time Windows, Part I: Route Construction and Local Search Algorithms

Transportation Science
Vehicle Routing Problem with Time Windows, Part II: Metaheuristics

Transportation Science
Simulation and the Monte Carlo Method (Wiley Series in Probability and Statistics)

Simulation and the Monte Carlo Method (Wiley Series in Probability and Statistics)
Subset-Row Inequalities Applied to the Vehicle-Routing Problem with Time Windows

Operations Research
Agents towards vehicle routing problems

Proceedings of the 9th International Conference on Autonomous Agents and Multiagent Systems: volume 1 - Volume 1
An iterated local search algorithm for the time-dependent vehicle routing problem with time windows

Discrete Optimization

Quantified Score

Hi-index	0.00

Visualization

Abstract

The vehicle routing problem with time windows (VRPTW) has been the subject of intensive study because of its importance in real applications. In this paper, we propose a cross entropy multiagent learning algorithm, which considers an optimum solution as a rare event to be learned. The routing policy is node-distributed, controlled by a set of parameterized probability distribution functions. Based on the performance of experienced tours of vehicle agents, these parameters are updated iteratively by minimizing Kullback-Leibler cross entropy in order to generate better solutions in next iterations. When applying the proposed algorithm on Solomon's 100-customer problem set, it shows outperforming results in comparison with the classical cross entropy approach. Moreover, this method needs only very small number of parameter settings. Its implementation is also relatively simple and flexible to solve other vehicle routing problems under various dynamic scenarios.