A GENETIC ALGORITHM FOR THE VEHICLE ROUTING OPTIMIZATION PROBLEM OF LOGISTICS PARK DISTRIBUTION

A GENETIC ALGORITHM FOR THE VEHICLE ROUTING OPTIMIZATION PROBLEM OF LOGISTICS PARK DISTRIBUTION

Wenqiang Chen

School of Economics and Management, Chang’ an University, the middle of South 2nd ring, Xi’an, Shannxi, China

The Vehicle Routing Problem of Logistics park distribution (VRPLPD) is an extension of the vehicle routing problem, which deals with simultaneous distribution of goods to customers. With the increasing importance of logistics activities, it is of great theoretical and practical significance to determine efficient and effective vehicle routes for simultaneous delivery activities. The study attempts to propose a genetic algorithm approach to tackle this problem. Numerical example is presented with parameter settings in order to demonstrate the applicability and feasibility of the proposed approach. The simulation is carried out in Simulink package of MATLAB. It is shown that Genetic Algorithms are highly effective in optimizing vehicle routing problem.