DocumentCode :
620473
Title :
Dynamic backhaul problem in B2C electronic commerce and two-stage algorithm
Author :
Lin Li ; Tao Liu
Author_Institution :
Coll. of Sci., Shenyang Aerosp. Univ., Shenyang, China
fYear :
2013
fDate :
25-27 May 2013
Firstpage :
4272
Lastpage :
4275
Abstract :
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.
Keywords :
Internet; customer services; electronic commerce; mathematical programming; vehicle routing; B2C electronic commerce; Internet; adaptive memory programming algorithm; customers demands; dynamic backhaul problem; local optimal method; mathematical model; saving insert algorithm; static backhaul problem; subtime interval; time division adaptive method; two-stage algorithm; Algorithm design and analysis; Electronic commerce; Heuristic algorithms; Programming; Routing; Vehicle dynamics; Vehicles; Adaptive memory programming algorithm; B2C Electronic Commerce; Dynamic backhaul problem; Saving insert algorithm;
fLanguage :
English
Publisher :
ieee
Conference_Titel :
Control and Decision Conference (CCDC), 2013 25th Chinese
Conference_Location :
Guiyang
Print_ISBN :
978-1-4673-5533-9
Type :
conf
DOI :
10.1109/CCDC.2013.6561702
Filename :
6561702
Link To Document :
بازگشت