Solving dynamic vehicle routing problem via evolutionary search with learning capability
Abstract
To date, dynamic vehicle routing problem (DVRP) has attracted great research attentions due to its wide range of real world applications. In contrast to traditional static vehicle routing problem, the whole routing information in DVRP is usually unknown and obtained dynamically during the routing execution process. To solve DVRP, many heuristic and metaheuristic methods have been proposed in the literature. In this paper, we present a novel evolutionary search paradigm with learning capability for solving DVRP. In particular, we propose to capture the structured knowledge from optimized routing solution in early time slot, which can be further reused to bias the customer-vehicle assignment when dynamic occurs. By extending our previous research work, the learning of useful knowledge, and the scheduling of dynamic customer requests are detailed here. Further, to evaluate the efficacy of the proposed search paradigm, comprehensive empirical studies on 21 commonly used DVRP instances with diverse properties are also reported.
Authors: Lei Zhou, Liang Feng, Abhishek Gupta, Yew-Soon Ong, Kun Liu, Caishun Chen, Edwin H.‐M. Sha, Bo Yuan Yang, B. W. Yan
Published in: IEEE Congress on Evolutionary Computation (CEC) (2017)