MULTI-OBJECTIVE DISTRIBUTION ROUTING OPTIMIZATION WITH TIME WINDOW BASED ON IMPROVED GENETIC ALGORITHM
DOI:
https://doi.org/10.52292/j.laar.2018.218Keywords:
logistics distribution, genetic algorithm, Vehicle Routing Problem with Time Windows (VRPTW).Abstract
In order to solve the shortcomings of the traditional genetic algorithm in solving the problem of logistics distribution path, a modified genetic algorithm is proposed to solve the Vehicle Routing Problem with Time Windows (VRPTW) under the condition of vehicle load and time window. In the crossover process, the best genes can be preserved to reduce the inferior individuals resulting from the crossover, thus improving the convergence speed of the algorithm. A mutation operation is designed to ensure the population diversity of the algorithm, reduce the generation of infeasible solutions, and improve the global search ability of the algorithm. The algorithm is implemented on Matlab 2016a. The example shows that the improved genetic algorithm reduces the transportation cost by about 10% compared with the traditional genetic algorithm and can jump out of the local convergence and obtain the optimal solution, thus providing a more reasonable vehicle route.
Published
Issue
Section
License
Once a paper is accepted for publication, the author is assumed to have transferred its copyright to the Publisher. The Publisher will not, however, put any limitation on the personal freedom of the author to use material from the paper in other publications. From September 2019 it is required that authors explicitly sign a copyright release form before their paper gets published. The Author Copyright Release form can be found here
