Year-end Sale % OFF 
Abstract
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.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
