Vehicle Disposition and Routing Optimization of Reverse Logistics Based on Improved Genetic Algorithm

Author(s):  
Shengping Zhao ◽  
Jingrui Li ◽  
Jing Wang
2021 ◽  
Vol 2021 ◽  
pp. 1-9
Author(s):  
Zhaohui Gao ◽  
Caiyun Ye

In the reverse logistics recycling process, considering the diversity of recycling types, a variety of vehicle models are used to meet the reverse logistics recycling requirements. Therefore, this paper considers the fixed costs, transportation costs, carbon emission costs during driving, and time penalty costs in the reverse logistics process under multiple constraints such as multiple vehicle types and time windows in the recycling center. The recovery point is the recovery model, and an improved genetic algorithm is used to solve it. Drawing lessons from the idea of greed, the superiority of the initial population is improved; the entry matrix and the exit matrix of the iterative population are constructed, and the crossover operator is improved based on this, and the forward insertion method is introduced to design the hybrid crossover operation to speed up the population. At the same time, the improvement of the mutation operator is proposed to increase the diversity of the population. The experimental results show that the multivehicle mixed delivery mode can reduce costs more effectively than single-vehicle models, and the improved genetic algorithm has better convergence and stability.


2014 ◽  
Vol 998-999 ◽  
pp. 1169-1173
Author(s):  
Chang Lin He ◽  
Yu Fen Li ◽  
Lei Zhang

A improved genetic algorithm is proposed to QoS routing optimization. By improving coding schemes, fitness function designs, selection schemes, crossover schemes and variations, the proposed method can effectively reduce computational complexity and improve coding accuracy. Simulations are carried out to compare our algorithm with the traditional genetic algorithms. Experimental results show that our algorithm converges quickly and is reliable. Hence, our method vastly outperforms the traditional algorithms.


2014 ◽  
Vol 556-562 ◽  
pp. 5328-5332
Author(s):  
Lin Zhu ◽  
Xiao Dun ◽  
Can Shi Zhu

Affected with various factors in wartime, the time during which the transport vehicles of military supplies pass through a certain section of a route is an uncertain parameter, whose optimization objective functions and constraints cannot be defined and solved through the traditional method of deterministic planning. In response to the problem, a routing optimization model is put forward herein for the timing uncertainty of wartime transportation and a method is devised for the Improved Genetic Algorithm to solve the routing optimization model with respect to timing uncertainty. Examples are also cited to verify the rationality of the algorithm as well as the correctness of the model.


2019 ◽  
Vol 53 (6) ◽  
pp. 572-572
Author(s):  
Liyi Zhang ◽  
Yang Gao ◽  
Yunshan Sun ◽  
Teng Fei ◽  
Yujing Wang

2019 ◽  
Vol 53 (2) ◽  
pp. 169-180 ◽  
Author(s):  
Liyi Zhang ◽  
Yang Gao ◽  
Yunshan Sun ◽  
Teng Fei ◽  
Yujing Wang

2018 ◽  
Vol 48 (3) ◽  
pp. 151-156
Author(s):  
S. WU ◽  
C. CHEN

In order to solve the shortcomings of the traditional genetic algorithm in solving the problem of logistics distribution path, a modified genetic algorithm is proposed to solve the Vehicle Routing Problem with Time Windows (VRPTW) under the condition of vehicle load and time window. In the crossover process, the best genes can be preserved to reduce the inferior individuals resulting from the crossover, thus improving the convergence speed of the algorithm. A mutation operation is designed to ensure the population diversity of the algorithm, reduce the generation of infeasible solutions, and improve the global search ability of the algorithm. The algorithm is implemented on Matlab 2016a. The example shows that the improved genetic algorithm reduces the transportation cost by about 10% compared with the traditional genetic algorithm and can jump out of the local convergence and obtain the optimal solution, thus providing a more reasonable vehicle route.


Sign in / Sign up

Export Citation Format

Share Document