scholarly journals Improved Compact Cuckoo Search Algorithm Applied to Location of Drone Logistics Hub

Mathematics ◽  
2020 ◽  
Vol 8 (3) ◽  
pp. 333 ◽  
Author(s):  
Jeng-Shyang Pan ◽  
Pei-Cheng Song ◽  
Shu-Chuan Chu ◽  
Yan-Jun Peng

Drone logistics can play an important role in logistics at the end of the supply chain and special environmental logistics. At present, drone logistics is in the initial development stage, and the location of drone logistics hubs is an important issue in the optimization of logistics systems. This paper implements a compact cuckoo search algorithm with mixed uniform sampling technology, and, for the problem of weak search ability of the algorithm, this paper combines the method of recording the key positions of the search process and increasing the number of generated solutions to achieve further improvements, as well as implements the improved compact cuckoo search algorithm. Then, this paper uses 28 test functions to verify the algorithm. Aiming at the problem of the location of drone logistics hubs in remote areas or rural areas, this paper establishes a simple model that considers the traffic around the village, the size of the village, and other factors. It is suitable for selecting the location of the logistics hub in advance, reducing the cost of drone logistics, and accelerating the large-scale application of drone logistics. This paper uses the proposed algorithm for testing, and the test results indicate that the proposed algorithm has strong competitiveness in the proposed model.

Author(s):  
Veeramani C ◽  
sharanya senthil

This paper presents an efficient metaheuristic approach for optimizing the generalized ratio problems such as the sum and multiplicative of linear or nonlinear ratio objective function with affine constraints. This paper focuses on the significance of hybrid techniques, which are implemented by using GA and ER-WCA to increase efficiency and robustness for solving linear and nonlinear generalized ratio problems. Initially, GA starts with an initial random population and it is processed by genetic operators. ER-WCA will observe and preserve the GAs fittest chromosome in each cycle and every generation. This Genetic ER-WCA algorithm is provided with better optimal solutions while solving constrained ratio optimization problems. Also, the effectiveness of the proposed genetic ER-WCA algorithm is analyzed while solving the large scale ratio problems. The results and performance of the proposed algorithm ensures a strong optimization and improves the exploitative process when compared to the other existing metaheuristic techniques. Numerical problems and applications are used to test the performance of the convergence and the accuracy of the approached method. The behavior of this Genetic ER-WCA algorithm is compared with those of evolutionary algorithms namely Neural Network Algorithm, Grey Wolf Optimization, ER-WCA, Water Cycle Algorithm, Firefly algorithm, Cuckoo search algorithm. The evaluated results show that the proposed algorithm increases the convergence and accuracy more than other existing algorithms.


Author(s):  
Venkateswarlu Chimmiri

Optimization is of great interest and it has widespread applications in engineering and science. It has become a major technology contributor to the growth of industry. It is extensively used in solving a wide variety of problems in design, operation, and analysis of engineering and technological processes. Optimization of large-scale problems pose difficulties concerning to dimensionality, differentiability, multimodality and nonlinearity in objective functions and constraints. In order to overcome such difficulties, there has been a rapidly growing interest in advanced optimization algorithms. Stochastic and evolutionary optimization algorithms are increasingly used to solve challenging optimization problems. These algorithms include genetic algorithm, simulated annealing, differential evolution, ant colony optimization, tabu search, particle swarm optimization, artificial bee colony algorithm, and cuckoo search algorithm. These algorithms are typically inspired by some phenomena from nature and they are robust. These algorithms do not require any gradient information and are even suitable to solve discrete optimization problems. These methods are extensively used to solve the optimization problems concerning to systems that are highly nonlinear, high dimensional, and noisy or for solving problems that are not easily solved by classical deterministic methods of optimization.


2020 ◽  
Vol 6 (2) ◽  
pp. 132-144 ◽  
Author(s):  
Nihad Hasan Talib ◽  
Khalid Bin Hasnan ◽  
Azli Bin Nawawi ◽  
Haslina Binti Abdullah ◽  
Adel Muhsin Elewe

Abstract Condition monitoring is used as a tool for maintenance management and function as input to decision support. Thus the key parameters in preventing severe damage to railway assets can be determined by automatic real-time monitoring. The technique of radio-frequency identification (RFID) is increasingly applied for the automatic real-time monitoring and control of railway assets, which employs radio waves without the use of physical contact. In this work, a 243-km2 area of Kuala Lumpur was selected. Because of its large size, determining the locations in which to install the RFID readers for monitoring the bogie components in the Kuala Lumpur railway system is a very complex task. The task involved three challenges: first, finding an optimal evolutionary method for railway network planning in order to deploy the RFID system in a large-area; second, identifying the large area that involved functional features; third, determining which station or stations should be given priority in applying the RFID system to achieve the most effective monitoring of the trains. The first challenge was solved by using a gradient-base cuckoo search algorithm for RFID system deployment. The second challenge was solved by determining all necessary information using geographic information system (GIS) resources. Because of the huge volume of data collected from GIS, it was found that the best method for eliminating data was to develop a new clustering model to separate the useful from the unuseful data and to identify the most suitable stations. Finally, the data set was reduced by developing a specific filter, and the information collected was tested by an analytic hierarchy process as a technique to determine the best stations for system monitoring and control. The results showed the success of the proposed method in solving the significant challenge of large-scale area conditions correlated with multi-objective RFID functions. The method provides high reliability in working with complex and dynamic data.


Author(s):  
Phan Nguyen Vinh ◽  
Bach Hoang Dinh ◽  
Van-Duc Phan ◽  
Hung Duc Nguyen ◽  
Thang Trung Nguyen

Wind power plants (WPs) play a very important role in the power systems because thermal power plants (TPs) suffers from shortcomings of expensive cost and limited fossil fuels. As compared to other renewable energies, WPs are more effective because it can produce electricity all a day from the morning to the evening. Consequently, this paper integrates the optimal power generation of TPs and WPs to absolutely exploit the energy from WPs and reduce the total electricity generation cost of TPs. The target can be reached by employing a proposed method, called one evaluation-based cuckoo search algorithm (OEB-CSA), which is developed from cuckoo search algorithm (CSA). In addition, conventional particle swarm optimization (PSO) is also implemented for comparison. Two test systems with thirty TPs considering prohibited working zone and power reserve constraints are employed. The first system has one wind power plant (WP) while the second one has two WPs. The result comparisons indicate that OEB-CSA can be the best method for the combined systems with WPs and TPs.


Author(s):  
Khai Phuc Nguyen ◽  
Goro Fujita ◽  
Vo Ngoc Dieu

Abstract This paper presents an application of Cuckoo search algorithm to determine optimal location and sizing of Static VAR Compensator. Cuckoo search algorithm is a modern heuristic technique basing Cuckoo species’ parasitic strategy. The Lévy flight has been employed to generate random Cuckoo eggs. Moreover, the objective function is a multiobjective problem, which minimizes loss power, voltage deviation and investment cost of Static VAR Compensator while satisfying other operating constraints in power system. Cuckoo search algorithm is evaluated on three case studies and compared with the Teaching-learning-based optimization, Particle Swarm optimization and Improved Harmony search algorithm. The results show that Cuckoo search algorithm is better than other optimization techniques and its performance is also better.


Cloud computing is a new technology created for complex systems with massive service sharing. It is not easy to analyze the cloud model due to its complex and large scale structure. To meet the user's requirement along with the quality of service (QoS) parameters become the most dominating research issue. The QoS parameters are affected due to various issues such as load balancing, Virtual Machine (VM), makespan, throughput, Utilization of Hosts’ Processing Capability (UHPC) and many more. The allocation policy of VM mainly used to place VMs on hosts at various datacenters. This article outlines the new VM allocation policy using Modified Best Fit Decreasing (MBFD) along with with Cuckoo Search (CS) algorithm that delivers the VM burden between hosts to improve the handling capability and the cloud system performance. The test results are obtained using CloudSim trace simulation and the QoS are compared with existing allocation policies of VM.


2020 ◽  
Vol 39 (6) ◽  
pp. 8125-8137
Author(s):  
Jackson J Christy ◽  
D Rekha ◽  
V Vijayakumar ◽  
Glaucio H.S. Carvalho

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.


Sign in / Sign up

Export Citation Format

Share Document