Author(s)

Xuanying Zhang

Corresponding Author

Xuanying Zhang

ABSTRACT

For the two-echelon vehicle routing problem with soft time windows (2E-VRPSTW). Aiming at minimizing the total distance and maximizing the on-time rate as the goals, a multi-objective genetic algorithm was proposed to solve the problem, and the goal was optimized by bottom-up approach. In the second-echelon vehicle routing, a variable neighborhood search is integrated on the basis of improved multi-objective genetic algorithm(IMOGA)to enhance the local search ability of the algorithm; in the first-echelon vehicle routing, each satellite is determined according to the customers served in the second level The volume of satellite is solved using the nearest neighbor principle and optimized using local search.Experimental results verify the effectiveness of the algorithm.

KEYWORDS

Two-echelon vehicle routing problem; soft time windows; multi-objective; improved genetic algorithm