scholarly journals An Improved Shuffled Frog Leaping Algorithm for Multiload AGV Dispatching in Automated Container Terminals

2020 ◽  
Vol 2020 ◽  
pp. 1-13
Author(s):  
Xiaoyang Ma ◽  
Yongming Bian ◽  
Fei Gao
Keyword(s):  
Mathematical Model ◽  
Container Terminals ◽  
Operating Efficiency ◽  
Container Transportation ◽  
Shuffled Frog Leaping Algorithm ◽  
Exploration Process ◽  
Single Carrier ◽  
Agv Dispatching ◽  
Shuffled Frog Leaping ◽  
Improved Model

Multiload AGVs, which can carry more than one container at a time, are widely used in automated container terminals. The dispatching decisions for multiload AGVs serving in automated container terminals on the target of minimum travel distance are significant in the process of container transportation in terms of improving operating efficiency. Previous work usually focused on AGVs working in a single-carrier mode, which was not only inconsistent with actual circumstances but also a waste of resources. In this paper, we establish a new mathematical model to describe multiload AGVs operating in automated container terminals, which is closer to the actual situation in real terminals. Based on this improved model, we propose a priority rule-based algorithm, termed as shuffled frog leaping algorithm with a mutant process (SFLAMUT), which can increase the diversity of the population and improve the convergence rate. Experiments were carried out based on data generated randomly according to the working properties of container terminals, and it is observed that the proposed SFLAMUT presents an effective and efficient exploration process and yields promising results in solving the proposed mathematical model.

Shuffled Frog Leaping Applied to Optimal Deployment of Radar Network

2014 ◽  
Vol 624 ◽  
pp. 512-515
Author(s):  
Yu Juan Cui ◽  
Hao Cha ◽  
Hao Shen
Keyword(s):  
Mathematical Model ◽  
Optimization Problem ◽  
Ant Colony Algorithm ◽  
Optimal Detection ◽  
Shuffled Frog Leaping Algorithm ◽  
Radar Network ◽  
Shuffled Frog Leaping ◽  
Optimal Deployment ◽  
Weighting Coefficients ◽  
The Given

In order to achieve the optimal detection performance with the limited radar resources in the given defense area, the reasonable and effective deployment of radar netting is needed. According to the degree of importance of the detection region and the setting of the appropriate weighting coefficients of each of coverage, a mathematical model is established at the beginning. And then, on the base ofthe shuffled frog leaping algorithm (SFLA) principle, the solving process ofthe SFLA for this optimization problem is discussed in detail and the SFLA to expedite the solving velocity is presented. Finally, by analyzing an example and comparing the resultswith that of the ant colony algorithm (ACA), it comes to a conclusion that several network schemes can be obtained much more quickly in this way with better operability.

New Method of Optimal Deployment of Radar Network

2014 ◽  
Vol 716-717 ◽  
pp. 1043-1046 ◽  
Author(s):  
Yu Juan Cui
Keyword(s):  
Mathematical Model ◽  
Detection Performance ◽  
New Method ◽  
Shuffled Frog Leaping Algorithm ◽  
Radar Network ◽  
Shuffled Frog Leaping ◽  
Optimal Deployment ◽  
The Given ◽  
Searching Performance

In order to improve the detection performance with the limited radar resources in the given defense zone, it is necessary to make reasonable and effective deployment of radar network. According to the principles of radar network deployment, its mathematical model is established at the beginning. And then, on the base of the shuffled frog leaping algorithm (SFLA) principle, a new method-improved shuffled frog leaping algorithm (ISFLA) is introduced through the technique of algorithm hybrid. By integrating updated strategy and chaotic optimization into SFLA, it greatly enhances the local searching efficiency and global searching performance. Moreover, the frogs are divided into two types and perform different operations to co-evolve. Finally, by analyzing an example and comparing the results with those algorithms, it comes to a conclusion that several network schemes can be obtained much more quickly by this way with better operability.

scholarly journals A cooperated shuffled frog-leaping algorithm for distributed energy-efficient hybrid flow shop scheduling with fuzzy processing time

2021 ◽  
Author(s):  
Jingcao Cai ◽  
Deming Lei
Keyword(s):  
Energy Efficient ◽  
Flow Shop ◽  
Flow Shop Scheduling ◽  
Hybrid Flow Shop ◽  
Distributed Energy ◽  
Shuffled Frog Leaping Algorithm ◽  
Shop Scheduling ◽  
Fuzzy Processing Time ◽  
Hybrid Flow Shop Scheduling ◽  
Shuffled Frog Leaping

AbstractDistributed hybrid flow shop scheduling problem (DHFSP) has attracted some attention; however, DHFSP with uncertainty and energy-related element is seldom studied. In this paper, distributed energy-efficient hybrid flow shop scheduling problem (DEHFSP) with fuzzy processing time is considered and a cooperated shuffled frog-leaping algorithm (CSFLA) is presented to optimize fuzzy makespan, total agreement index and fuzzy total energy consumption simultaneously. Iterated greedy, variable neighborhood search and global search are designed using problem-related features; memeplex evaluation based on three quality indices is presented, an effective cooperation process between the best memeplex and the worst memeplex is developed according to evaluation results and performed by exchanging search times and search ability, and an adaptive population shuffling is adopted to improve search efficiency. Extensive experiments are conducted and the computational results validate that CSFLA has promising advantages on solving the considered DEHFSP.

Sign in / Sign up

Export Citation Format

Share Document