Vehicle Routing Problem with Time Windows Study

XUE-HUI WANG, HAN-PING HOU, JIAN ZHANG, JIAN-LIANG YANG, XUE LI

Abstract


Customer demands of logistics timeliness is getting higher and higher. The research on vehicle routing problem with time windows, can improve the level of logistics services. This paper studies the optimization of vehicle routing problem with time window based on the above background. Thesis assumes that customers tend to be in a specific time period to accept delivery services, beyond the delivery service time will give punishment cost of time, in order to reflect a decrease in the level of service. The paper takes the minimum of total cost as the target, establishes the nonlinear distribution path model, and in the model, corrects the errors of the time constraint in the literature. Finally, the practical case is introduced, the model is established, the genetic algorithm is used to solve the problem, and the optimal distribution path is obtained.

Keywords


Logistics Distribution; Time Window; Vehicle Routing Problem


DOI
10.12783/dtssehs/icssd2017/19224

Full Text:

PDF