Soft Time Windows Associated Vehicles Routing Problems of Logistics Distribution Center Using Genetic Simulated Annealing Algorithm

Under the situations of distribution center and customer demand, a mathematical model of Vehicle Routing Problem with Time Windows(VRPTW) is set up, where the main factors of less total distance of vehicles driving and less delayed time of vehicles are considered. For the "premature" convergence in Genetic Algorithms, Simulated Annealing Algorithm is introduced, and GSA is designed to optimize and analyse the VRPTW examples. It is shown that the performance of GSA is better than Genetic Annealing(GA).

Download Full-text

Logistics Distribution Routing Optimization Algorithm

Applied Mechanics and Materials ◽

10.4028/www.scientific.net/amm.513-517.1740 ◽

2014 ◽

Vol 513-517 ◽

pp. 1740-1743 ◽

Cited By ~ 1

Author(s):

Zhang Chun Hua ◽

Hua Xin ◽

Zhang Wei

Keyword(s):

Genetic Algorithm ◽

Simulated Annealing ◽

Simulated Annealing Algorithm ◽

Search Algorithm ◽

Memory Function ◽

Memory Device ◽

Routing Problem ◽

Logistics Distribution ◽

Genetic Simulated Annealing Algorithm ◽

Annealing Algorithm

Logistics distribution involves preparing goods in the distribution center or logistics node for most reasonable delivery according to the requirements of customers. Genetic algorithm is a random global search algorithm based on the principle of natural evolution. It can be a good solution to optimize the distribution routes. This paper combines genetic algorithm and the simulated annealing algorithm, to which memory device is added, in order to avoid best result losing in the crossover operator of the genetic algorithm. The experimental results show that a memory function with this genetic simulated annealing algorithm in solving the logistics distribution routing problem, can not only get a higher qualified solution, but can also significantly reduce the evolutionary generation that algorithm requires, and obtain solution to the problem in less time.

Download Full-text

Optimizing Research of an Improved Simulated Annealing Algorithm to Soft Time Windows Vehicle Routing Problem with Pick-up and Delivery

Systems Engineering - Theory & Practice ◽

10.1016/s1874-8651(10)60049-x ◽

2009 ◽

Vol 29 (5) ◽

pp. 186-192 ◽

Cited By ~ 10

Author(s):

Ai-min DENG ◽

Chao MAO ◽

Yan-ting ZHOU

Keyword(s):

Simulated Annealing ◽

Vehicle Routing ◽

Vehicle Routing Problem ◽

Simulated Annealing Algorithm ◽

Time Windows ◽

Routing Problem ◽

Soft Time Windows ◽

Annealing Algorithm

Download Full-text

An Improved Simulated Annealing Algorithm and its Application in the Logistics Distribution Center Location Problem

Applied Mechanics and Materials ◽

10.4028/www.scientific.net/amm.389.990 ◽

2013 ◽

Vol 389 ◽

pp. 990-994 ◽

Cited By ~ 1

Author(s):

Yue Guang Li

Keyword(s):

Simulated Annealing ◽

Location Problem ◽

Simulated Annealing Algorithm ◽

Time Window ◽

Influence Factors ◽

Distribution Center ◽

Logistics Distribution ◽

Distribution Logistics ◽

Annealing Algorithm ◽

Selection Operator

In this paper, according to the characteristics and influence factors of the distribution logistics and distribution center problem, a mathematical model of the distribution center of the LRTWP (Location and Routing with Time Window Problem) was established. An improved simulated annealing algorithm was used to solve the model, the parameter and selection operator in the algorithm is setted reasonably. Simulations and results indicate that the improved simulated annealing algorithm has better feasibility and validity for solving the LRTWP.

Download Full-text