Multi-depot vehicle routing problem with time windows (MDVRPTW) is a valuable practical issue in urban logistics. However, heuristic methods may fail to generate high-quality solutions for massive problems instantly. Thus, this article presents a novel reinforcement learning algorithm integrated with a multi-head attention mechanism and a local search strategy to solve the problem efficiently. The routing optimization was regarded as a vehicle tour generation process and an encoder-decoder was used to generate routes for vehicles departing from different depots iteratively. A multi-head attention strategy was employed for mining complex spatiotemporal correlations within time windows in the encoder. Then, a decoder with multi-agent was designed to generate solutions by optimizing reward and observing transition state. Meanwhile, a local search strategy was employed to improve the quality of solutions. The experiments results demonstrate that the proposed method can significantly outperform traditional methods in effectiveness and robustness.
20 April 2017 in Journal of Ambient Intelligence and Humanized Computing
Aimed to improve the efficiency of computing offloading in internet of vehicles (IoV), a collaborative multi-task computing offloading decision mechanism with adaptive estimation of distribution algorithm for MEC-IoV was proposed in this paper. The algorithm considered the energy and time consumption as well as priority among different tasks. It presented a local search strategy and an adaptive learning rate according to the characteristics of the problem to improve the estimation of distribution algorithm. Experimental results show that compared with other offloading strategies, the proposed offloading strategy has obvious effects on the total cost optimization; the solutions quality of AEDA is 86.6% of PSO and 67.3% of GA.