Multiobjective Vehicle Routing Problem with Route Balance Based on Genetic Algorithm

Abstract EN

This study proposes a genetic algorithm to solve the biobjective vehicle routing problem with time windows simultaneously considering total distance and distance balance of active vehicle fleet.

A new complex chromosome is used to present the active vehicle route.

Through tournament selection, one-point crossover, and migrating mutation operator, the solution of the problem is solved.

In experiment on Solomon’s benchmark problems, considering the total distance and distance balance, the results are improved in all classes of problems.

According to the experimental results, the suggested approach is sufficient and the average GA performance is good.