Modeling and empirical analysis of regional hub-and-spoke road-rail combined transport network based on uncertain cost-time-demand

2020 ◽  
Vol 39 (5) ◽  
pp. 7293-7313
Author(s):  
Junxiang Xu ◽  
Jin Zhang ◽  
Jingni Guo
Keyword(s):  
Genetic Algorithm ◽  
Transportation Cost ◽  
Credibility Measure ◽  
Improved Genetic Algorithm ◽  
Hub And Spoke ◽  
Non Linear Programming ◽  
Global Space ◽  
Local Space ◽  
Total Transportation Cost ◽  
In Transit

Taking into account the uncertainties of the factors of in-transit transportation cost, hub transshipment cost, hub construction cost, in-transit transportation time, hub transshipment time, and demand, this study uses triangular fuzzy numbers, expected value criteria, and distribution of credibility measure to minimise the total transportation cost of the hub-and-spoke road-rail combined transport (RRCT) network and the maximum transportation limit time between the origin and destination of the network. Firstly, a non-linear programming mathematical model is constructed for the regional hub-and-spoke RRCT network based on uncertain cost-time-demand. Then, an improved genetic algorithm is designed to obtain an optimized scheme. The algorithm uses genetic algorithm to search the global space, and uses two local search methods, i.e. shift and exchange, to search the local space. Finally, the RRCT network along the Yaan-Linzhi section of the Sichuan-Tibet Railway is used as the research object to verify the applicability and effectiveness of the regional hub-and-spoke RRCT network model and the algorithm proposed in the study.

scholarly journals MULTI-OBJECTIVE DISTRIBUTION ROUTING OPTIMIZATION WITH TIME WINDOW BASED ON IMPROVED GENETIC ALGORITHM

2018 ◽  
Vol 48 (3) ◽  
pp. 151-156
Author(s):  
S. WU ◽  
C. CHEN
Keyword(s):  
Genetic Algorithm ◽  
Time Window ◽  
Time Windows ◽  
Optimal Solution ◽  
Transportation Cost ◽  
Population Diversity ◽  
Improved Genetic Algorithm ◽  
Routing Problem ◽  
Logistics Distribution ◽  
Routing Optimization

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.

Task scheduling algorithm based on improved genetic algorithm in cloud computing environment

2020 ◽  
Vol 13 ◽  
Author(s):  
Ge Weiqing ◽  
Cui Yanru
Keyword(s):  
Genetic Algorithm ◽  
Cloud Computing ◽  
Task Scheduling ◽  
Scheduling Algorithm ◽  
Task Completion ◽  
Improved Genetic Algorithm ◽  
Fitness Functions ◽  
Task Scheduling Algorithm ◽  
Simulation Results

Background: In order to make up for the shortcomings of the traditional algorithm, Min-Min and Max-Min algorithm are combined on the basis of the traditional genetic algorithm. Methods: In this paper, a new cloud computing task scheduling algorithm is proposed, which introduces Min-Min and Max-Min algorithm to generate initialization population, and selects task completion time and load balancing as double fitness functions, which improves the quality of initialization population, algorithm search ability and convergence speed. Results: The simulation results show that the algorithm is superior to the traditional genetic algorithm and is an effective cloud computing task scheduling algorithm. Conclusion: Finally, this paper proposes the possibility of the fusion of the two quadratively improved algorithms and completes the preliminary fusion of the algorithm, but the simulation results of the new algorithm are not ideal and need to be further studied.

Combining improved genetic algorithm and matrix semi-tensor product (STP) in color image encryption

2021 ◽  
Vol 183 ◽  
pp. 108041
Author(s):  
Xiuli Chai ◽  
Xiangcheng Zhi ◽  
Zhihua Gan ◽  
Yushu Zhang ◽  
Yiran Chen ◽  
...  
Keyword(s):  
Genetic Algorithm ◽  
Tensor Product ◽  
Image Encryption ◽  
Color Image ◽  
Improved Genetic Algorithm ◽  
Color Image Encryption
Sign in / Sign up

Export Citation Format

Share Document