Research on VRP of Optimization Based on Improved Two Phase Algorithm under Electronic Commerce
With the rapid development of electronic commerce, as one of bottlenecks of electronic commerce development, the logistic distribution arouses wide attention. Vehicle routing problem (VRP) plays key role in logistic distribution system. The logistic distribution under electronic commerce environment has the character of dispersive customer positions, large order forms, little batches and many repeated routes. The traditional optimizing route methods meet with diversified problems in different extents and are difficult to play their roles. Therefore, according to the particularity of logistic distribution under electronic commerce environment, the improved two-phase algorithm needs to be adopted to get solutions. Namely, the customer group can be divided into several regions using hierarchy clustering method in first phase. And in every region it can be decomposed into small scale subsets according with some restraint conditions using scan algorithm. In second phase, get the solutions of the customer point in every group using the improved genetic algorithm. In fact it is route optimization problems of several single TSP model. In the end, the test proves the validity of this improved algorithm combining with examples