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

4Citations
Citations of this article
7Readers
Mendeley users who have this article in their library.
Get full text

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. © 2011 Springer-Verlag.

Cite

CITATION STYLE

APA

Ma, T. Y. (2011). A cross entropy multiagent learning algorithm for solving vehicle routing problems with time windows. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 6971 LNCS, pp. 59–73). https://doi.org/10.1007/978-3-642-24264-9_5

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free