A research into location routing problem based on hybrid genetic simulated annealing algorithm

Chengduan Wang 

School of computer engineering, Weifang University, 261061, Weifang, China

With the diversified and personalized commodity requirements as well as small batch dispatch and frequent dispatch features under the circumstance of E-commerce, the environment for logistics dispatching system becomes increasingly complicated and the inter-influence between different subsystems in logistics system optimization becomes increasingly significant. As a result, judged from the aspect of logistics system integration, after taking customer’s personalized dispatching time into consideration, it’s necessary to establish location routing problem with changeable softtime windows model. Based on the feature of the model, this paper adopts hybrid genetic simulated annealing algorithm to gain solution. The experimental result shows that this algorithm is much better than gaining solution solely by adopting hybrid genetic algorithm or simulated annealing algorithm in the aspect of optimal solution, solution quality, calculating efficiency and algorithm stability.