원문정보
초록
영어
In allusion to such problems as low accuracy and long convergence time in traditional two-echelon vehicle routing optimization algorithm, a Memetic algorithm (QDEMA) based on Q learning theory and differential evolution is proposed in this article to solve above problems. Firstly, it is necessary to research the two-echelon vehicle routing optimization problem and adopt the optimal segmentation method to obtain the relatively reasonable distribution plan for the first-echelon SDVRP problem in order to accordingly determine the distribution quantity of the transfer stations; secondly, the second-echelon MDVRP distribution scheme is solved to obtain the total distance and the total number of the distribution vehicles for the two-echelon optimization problem; thirdly, in allusion to the solution of the second-echelon MDVRP distribution scheme, Q learning theory and the differential evaluation algorithm are adopted to design new Memetic algorithm in order to globally optimize MDVRP distribution scheme; finally, the simulation experiment is carried out to verify the algorithm effectiveness.
목차
1. Introduction
2. QDEMA Two-Echelon Vehicle Routing Problem
2.1. Problem Description
2.2. Encoding Mode and Initial Cluster
3. Q Learning Theory and DE Algorithm
3.1. Differential Evolution Algorithm
3.2. Q Learning Theory
4. QDEMA Algorithm
5. Simulation Experiment and Analysis
5.1. QDEMA Algorithm Experiment
5.2. Calculation Example Experiment
6. Conclusion
Acknowledgment
Reference