Multi-Constrained Vehicle Routing Problem with Time Windows of Optimization for Electronic Commerce

Electronic commerce, as a new commercial mode, will face with modern market of multiple batches, small volume, high time requirement and individuation demand. And it is difficult in accurately measuring for complex relationship. Considering the specialties of logistics distribution under electronic commerce, the traditional vehicle scheduling model is modified in order to reduce the distribution cost, objective function is modified based on minimum expense, namely, considering routine and overtime expense, vehicle waiting expense, personnel expenses and so on. For vehicle scheduling problem is NP puzzle, get the optimization solution through adopting improved genetic algorithm. In the final, it is proved that improved algorithm has good performance through experiment and calculation combining with concrete examples.