Vehicle routing optimization problem is one of the major research topics in logistics distribution field. Suitable vehicle routing selection is vital to reduce the logistics cost. The paper presents a hybrid optimization method to solve the vehicle routing problem with time windows. In the hybrid optimization method, discrete particle swarm optimization algorithm is used to assign the customers on routes and simulated annealing (SA) algorithm to avoid becoming trapped in local optimum. The simulation results have shown that the proposed method is feasible and effective for the vehicle routing problem with time windows.
Logistics Distribution Vehicle Routing Problem with Time Windows
Advanced Materials Research ; 468-471 ; 2047-2051
27.02.2012
5 pages
Aufsatz (Zeitschrift)
Elektronische Ressource
Englisch
Reliable Vehicle Routing and Scheduling with Time Windows towards City Logistics
British Library Conference Proceedings | 2003
|Agents Toward Vehicle Routing Problem With Time Windows
Taylor & Francis Verlag | 2015
|