scholarly journals Structural superposition of proteins with unknown alignment and detection of topological similarity using a six-dimensional search algorithm

1995 ◽  
Vol 23 (2) ◽  
pp. 187-195 ◽  
Author(s):  
Kay Diederichs
Keyword(s):  
Search Algorithm ◽  
Topological Similarity ◽  
Structural Superposition

Optimal broadcast scheduling method for VANETs: An adaptive discrete firefly approach

2020 ◽  
Vol 39 (6) ◽  
pp. 8125-8137
Author(s):  
Jackson J Christy ◽  
D Rekha ◽  
V Vijayakumar ◽  
Glaucio H.S. Carvalho
Keyword(s):  
Intelligent Transportation System ◽  
Search Algorithm ◽  
Mac Protocol ◽  
High Mobility ◽  
Optimal Solution ◽  
Cuckoo Search ◽  
Cuckoo Search Algorithm ◽  
Traffic Density ◽  
Scheduling Problem ◽  
Broadcast Scheduling

Vehicular Adhoc Networks (VANET) are thought-about as a mainstay in Intelligent Transportation System (ITS). For an efficient vehicular Adhoc network, broadcasting i.e. sharing a safety related message across all vehicles and infrastructure throughout the network is pivotal. Hence an efficient TDMA based MAC protocol for VANETs would serve the purpose of broadcast scheduling. At the same time, high mobility, influential traffic density, and an altering network topology makes it strenuous to form an efficient broadcast schedule. In this paper an evolutionary approach has been chosen to solve the broadcast scheduling problem in VANETs. The paper focusses on identifying an optimal solution with minimal TDMA frames and increased transmissions. These two parameters are the converging factor for the evolutionary algorithms employed. The proposed approach uses an Adaptive Discrete Firefly Algorithm (ADFA) for solving the Broadcast Scheduling Problem (BSP). The results are compared with traditional evolutionary approaches such as Genetic Algorithm and Cuckoo search algorithm. A mathematical analysis to find the probability of achieving a time slot is done using Markov Chain analysis.

Comparison of Meta-heuristic Algorithms on Benchmark Functions

2019 ◽  
Vol 2 (3) ◽  
pp. 508-517
Author(s):  
FerdaNur Arıcı ◽  
Ersin Kaya
Keyword(s):  
Heuristic Algorithms ◽  
Optimization Problems ◽  
Search Algorithm ◽  
Optimization Algorithms ◽  
Gravitational Search Algorithm ◽  
Differential Evolution Algorithm ◽  
Population Based ◽  
Time Interval ◽  
Bee Colony ◽  
Different Characteristics

Optimization is a process to search the most suitable solution for a problem within an acceptable time interval. The algorithms that solve the optimization problems are called as optimization algorithms. In the literature, there are many optimization algorithms with different characteristics. The optimization algorithms can exhibit different behaviors depending on the size, characteristics and complexity of the optimization problem. In this study, six well-known population based optimization algorithms (artificial algae algorithm - AAA, artificial bee colony algorithm - ABC, differential evolution algorithm - DE, genetic algorithm - GA, gravitational search algorithm - GSA and particle swarm optimization - PSO) were used. These six algorithms were performed on the CEC’17 test functions. According to the experimental results, the algorithms were compared and performances of the algorithms were evaluated.

An Improved Version of Algebraic Codebook Search Algorithm for an AMR-WB Speech Coder

Informatica ◽  
2017 ◽  
Vol 28 (2) ◽  
pp. 403-414 ◽  
Author(s):  
Ming-Che Yeh ◽  
Cheng-Yu Yeh ◽  
Shaw-Hwa Hwang
Keyword(s):  
Search Algorithm ◽  
Speech Coder

Analysis of Optimal Power Flow Using Gravitational Search Algorithm

2016 ◽  
Vol 3 (4) ◽  
pp. 1-11
Author(s):  
M. Lakshmikantha Reddy ◽  
◽  
M. Ramprasad Reddy ◽  
V.C. Veera Reddy ◽  
◽  
...  
Keyword(s):  
Power Flow ◽  
Optimal Power Flow ◽  
Search Algorithm ◽  
Gravitational Search Algorithm ◽  
Optimal Power ◽  
Gravitational Search

Determination of Optimal Public Transportation Routes Using Firefly and Tabu Search Algorithms

2020 ◽  
Vol 4 (5) ◽  
pp. 884-891
Author(s):  
Salwa Salsabila Mansur ◽  
Sri Widowati ◽  
Mahmud Imrona
Keyword(s):  
Tabu Search ◽  
Public Transportation ◽  
Traffic Congestion ◽  
Search Algorithm ◽  
Urban Transportation ◽  
The Public ◽  
Comparison Results ◽  
Congestion Problems ◽  
Transportation Routes

Traffic congestion problems generally caused by the increasing use of private vehicles and public transportations. In order to overcome the situation, the optimization of public transportation’s route is required particularly the urban transportation. In this research, the performance analysis of Firefly and Tabu Search algorithm is conducted to optimize eleven public transportation’s routes in Bandung. This optimization aims to increase the dispersion of public transportation’s route by expanding the scope of route that are crossed by public transportation so that it can reach the entire Bandung city and increase the driver’s income by providing the passengers easier access to public transportations in order to get to their destinations. The optimal route is represented by the route with most roads and highest number of incomes. In this research, the comparison results between the reference route and the public transportation’s optimized route increasing the dispersion of public transportation’s route to 60,58% and increasing the driver’s income to 20,03%.

Sign in / Sign up

Export Citation Format

Share Document