Study on improved chaotic particle swarm optimization based logistics and transport scheduling problems with soft time windows

Abstract

Research the Incident Vehicle Routing Problem with Soft Time-windows (IVRP-STW). Associated logistics scheduling problem with soft time windows using the logistic function optimization method to improve the chaotic particle algorithm, compared with the GA and the standard PSO algorithm. Simulation results show that such optimization method can effectively improve the global search of the particles in the particle swarm and the ability of local search is effective in resolving such problems.