As the development of world economy, how to realize the reasonable vehicle logistics routing path problem with time window constrain is the key issue in promoting the prosperity and development of modern logistics industry. Through the research of vehicle logistics routing path 's demand, particle swarm optimization with a novel particle presentation is designed to solve the problem which is improved, effective and adept to the normal vehicle logistics routing. The simulation results of example indicate that the algorithm has more search speed and stronger optimization ability.
Study on Vehicle Logistics Routing Path Problem with Time Windows Based on Particle Swarm Optimization
Applied Mechanics and Materials ; 687-691 ; 5161-5164
2014-11-27
4 pages
Article (Journal)
Electronic Resource
English
2-path Cuts for the Vehicle Routing Problem with Time Windows
British Library Online Contents | 1999
|A Particle Swarm Optimization Algorithm with Path Relinking for the Location Routing Problem
British Library Online Contents | 2008
|Time-Dependent Electric Vehicle Routing Problem with Time Windows and Path Flexibility
DOAJ | 2020
|An Adaptive Particle Swarm Optimization Algorithm for the Vehicle Routing Problem with Time Window
BASE | 2014
|Study on Multi-Depot Vehicle Routing Problem Based on Cloud Adaptive Particle Swarm Optimization
British Library Conference Proceedings | 2013
|