Engineering Design Applications of Dichotomous Search in Shuffled Frog-Leaping Algorithm

2014 ◽  
Vol 1 (2) ◽  
Author(s):  
Jitendra Rajpurohit
Keyword(s):  
Engineering Design ◽  
Shuffled Frog Leaping Algorithm ◽  
Dichotomous Search ◽  
Shuffled Frog Leaping

scholarly journals Modified Shuffled Frog Leaping Algorithm by adaptive Step Size: Applications to Constraint Engineering Design Problems

2019 ◽  
Vol 8 (11) ◽  
pp. 1093-1098
Keyword(s):  
Engineering Design ◽  
Global Optimum ◽  
Shuffled Frog Leaping Algorithm ◽  
Step Size ◽  
Design Problems ◽  
Shuffled Complex Evolution ◽  
Engineering Design Problems ◽  
Shuffled Frog Leaping ◽  
Optimum Solution ◽  
Adaptive Step

Shuffled frog leaping algorithm (SFLA) is an ongoing expansion to the group of evolutionary algorithm that imitates the societal and natural conduct of species. Upsides of particle swarm optimization (PSO) and shuffled complex evolution (SCE) is consolidates in SFLA i.e. local searching and information shuffling respectively. In this paper SFLA is improved to solve equality and inequality based constraint engineering design problems using penalty function. In proposed approach linear decreasing function that is adaptive in nature will be utilized to improve worst frog position for better exploration and convergence speed. The simulation results designate the superiority of present study over SFLA in term of global optimum solution and fast convergence rate

Improvement of DV-Hop localization based on shuffled frog leaping algorithm

2011 ◽  
Vol 31 (4) ◽  
pp. 922-924 ◽  
Author(s):  
Yu GE ◽  
Xue-ping WANG ◽  
Jing LIANG
Keyword(s):  
Shuffled Frog Leaping Algorithm ◽  
Shuffled Frog Leaping

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.

A Shuffled Frog Leaping Algorithm for Solving Vehicle Routing Problem

2012 ◽  
Vol 197 ◽  
pp. 529-533 ◽  
Author(s):  
Kai Ping Luo
Keyword(s):  
Vehicle Routing ◽  
Vehicle Routing Problem ◽  
High Efficiency ◽  
Heuristic Optimization ◽  
Optimization Approach ◽  
Shuffled Frog Leaping Algorithm ◽  
Routing Problem ◽  
Shuffled Frog Leaping ◽  
Encoding Method ◽  
Nearest Neighborhood

For vehicle routing problem, its model is easy to state and difficult to solve. The shuffled frog leaping algorithm is a novel meta-heuristic optimization approach and has strong quickly optimal searching power. The paper applies herein this algorithm to solve the vehicle routing problem; presents a high-efficiency encoding method based on the nearest neighborhood list; improves evolution strategies of the algorithm in order to keep excellent characteristics of the best frog. This proposed algorithm provides a new idea for solving VRP.

Sign in / Sign up

Export Citation Format

Share Document