Dynamic backhaul problem in B2C electronic commerce and two-stage algorithm

Considering characteristics of dynamic backhaul problem in B2C Electronic Commerce, the paper converted this problem to special static backhaul problem and constructed corresponding mathematical model. It used time division adaptive method to solve dynamic backhaul problem and designed a two-stage algorithm. In the first stage, it used adaptive memory programming algorithm to solve static backhaul problem at the end of each sub-time interval. In the second stage, it used saving insert algorithm based on evaluation to insert the new appeared pickup demand points into the later routes of all vehicles´ key points at the given time. It used local optimal method to optimize the later routes. Altered data of relevant paper was used to emulate experiments. Experiment results proved rationality of the given model and effectiveness of the algorithm.