Study on Time-Dependent Vehicle Routing Problem With The third party Logistics Based on AFPSO
Download as PDF
DOI: 10.25236/icbdai.2018.001
Author(s)
Mingliang Zhang
Corresponding Author
Mingliang Zhang
Abstract
In this study, using intelligent algorithms to solve the dynamic network vehicle route, establish a dynamic mathematical model of network routing problem. Setting up and establishing a dynamic time-dependent function of network problems. Based on a comprehensive analysis of the time-dependent function, using Particle Swarm Optimization and Nearest Neighbor Method, to solve the vehicle routing problem in dynamic networks. An Adaptive Fuzzy Particle Swarm Optimization(AFPSO) based on the uncertainty of the PSO is proposed. The algorithm adds mutation operation in iteration process and adjusts the inertia weighting factor to enhance its ability to break away from local optimum, and the mutation probability is adjusted by variance of the population's fitness.
Keywords
Dynamic Network, Vehicle Routing Problem, AFPSO