Search results

The purpose of this paper is to introduce an improved system identification method for small unmanned helicopters combining adaptive ant colony optimization algorithm and Levy’s method and to solve the problem of low model prediction accuracy caused by low-frequency domain curve fitting in the small unmanned helicopter frequency domain parameter identification method.

This method uses the Levy method to obtain the initial parameters of the fitting model, uses the global optimization characteristics of the adaptive ant colony algorithm and the advantages of avoiding the “premature” phenomenon to optimize the initial parameters and finally obtains a small unmanned helicopter through computational optimization Kinetic models under lateral channel and longitudinal channel.

The algorithm is verified by flight test data. The verification results show that the established dynamic model has high identification accuracy and can accurately reflect the dynamic characteristics of small unmanned helicopter flight.

This paper presents a novel and improved frequency domain identification method for small unmanned helicopters. Compared with the conventional method, this method improves the identification accuracy and reduces the identification error.

Adsorption parameters (e.g. Langmuir constant, mass transfer coefficient and Thomas rate constant) are involved in the design of aqueous-media adsorption treatment units. However, the classic approach to estimating such parameters is perceived to be imprecise. Herein, the essential features and performances of the ant colony, bee colony and elephant herd optimisation approaches are introduced to the experimental chemist and chemical engineer engaged in adsorption research for aqueous systems. Key research and development directions, believed to harness these algorithms for real-scale water treatment (which falls within the wide-ranging coverage of the Sustainable Development Goal 6 (SDG 6) ‘Clean Water and Sanitation for All’), are also proposed. The ant colony, bee colony and elephant herd optimisations have higher precision and accuracy, and are particularly efficient in finding the global optimum solution. It is hoped that the discussions can stimulate both the experimental chemist and chemical engineer to delineate the progress achieved so far and collaborate further to devise strategies for integrating these intelligent optimisations in the design and operation of real multicomponent multi-complexity adsorption systems for water purification.

Ant Colony Optimization and Particle Swarm Optimization represent two widely used Swarm Intelligence (SI) optimization techniques. Information processing using Multiple-Valued Logic (MVL) is carried out using more than two discrete logic levels. In this paper, we compare two the SI-based algorithms in synthesizing MVL functions. A benchmark consisting of 50,000 randomly generated 2-variable 4-valued functions is used for assessing the performance of the algorithms using the benchmark. Simulation results show that the PSO outperforms the ACO technique in terms of the average number of product terms (PTs) needed. We also compare the results obtained using both ACO-MVL and PSO-MVL with those obtained using Espresso-MV logic minimizer. It is shown that on average, both of the SI-based techniques produced better results compared to those produced by Espresso-MV. We show that the SI-based techniques outperform the conventional direct-cover (DC) techniques in terms of the average number of product terms required.

The purpose of this study is to examine the dimensions of strategic intent (SI; see Appendix 1) according to the Hamel and Prahalad model as a building for the future, relying on today’s knowledge-based and proactive strategic directions of management as long-term and deep-perspective creative directions, objective vision and rational analysis, integrative in work, survival structure and comprehensiveness in perception.

The quantitative approach was used based on research, detection and proof, as data were collected from leaders amounting to 70 respondents and analyzed in the SPSS program and ant colony optimization (see Appendix 1) algorithm and interpretation of the results.

It was found that the SI dimensions are poorly available due to problems related to foresight, capabilities and the strategic structure that represents the head of strategic objectives.

The empirical evaluation view of the study is valuable for leaders to draw a future strategy of advantage for organizations in developing countries to enrich their core capabilities by activating the SI dimensions.

It stems from a vital issue related to strategic dimensions aimed at a better future for strategic executive work, especially after the crisis that led to a significant decline in the level of performance of organizations.

This study aims to propose an efficient dual-robot task collaboration strategy to address the issue of low work efficiency and inability to meet the production needs of a single robot during construction operations.

A hybrid task allocation method based on integer programming and auction algorithms, with the aim of achieving a balanced workload between two robots has been proposed. In addition, while ensuring reasonable workload allocation between the two robots, an improved dual ant colony algorithm was used to solve the dual traveling salesman problem, and the global path planning of the two robots was determined, resulting in an efficient and collision-free path for the dual robots to operate. Meanwhile, an improved fast Random tree rapidly-exploring random tree algorithm is introduced as a local obstacle avoidance strategy.

The proposed method combines randomization and iteration techniques to achieve an efficient task allocation strategy for two robots, ensuring the relative optimal global path of the two robots in cooperation and solving complex local obstacle avoidance problems.

This method is applied to the scene of steel bar tying in construction work, with the workload allocation and collaborative work between two robots as evaluation indicators. The experimental results show that this method can efficiently complete the steel bar banding operation, effectively reduce the interference between the two robots and minimize the interference of obstacles in the environment.

Nature’s evolution has shaped intelligent behaviors in creatures like insects and birds, inspiring the field of Swarm Intelligence. Researchers have developed bio-inspired algorithms to address complex optimization problems efficiently. These algorithms strike a balance between computational efficiency and solution optimality, attracting significant attention across domains.

Bio-inspired optimization techniques for feature engineering and its applications are systematically reviewed with chief objective of assessing statistical influence and significance of “Bio-inspired optimization”-based computational models by referring to vast research literature published between year 2015 and 2022.

The Scopus and Web of Science databases were explored for review with focus on parameters such as country-wise publications, keyword occurrences and citations per year. Springer and IEEE emerge as the most creative publishers, with indicative prominent and superior journals, namely, PLoS ONE, Neural Computing and Applications, Lecture Notes in Computer Science and IEEE Transactions. The “National Natural Science Foundation” of China and the “Ministry of Electronics and Information Technology” of India lead in funding projects in this area. China, India and Germany stand out as leaders in publications related to bio-inspired algorithms for feature engineering research.

The review findings integrate various bio-inspired algorithm selection techniques over a diverse spectrum of optimization techniques. Anti colony optimization contributes to decentralized and cooperative search strategies, bee colony optimization (BCO) improves collaborative decision-making, particle swarm optimization leads to exploration-exploitation balance and bio-inspired algorithms offer a range of nature-inspired heuristics.

Cross-layer approach in media access control (MAC) layer will address interference and jamming problems. Hybrid distributed MAC can be used for simultaneous voice, data transmissions in wireless sensor network (WSN) and Internet of Things (IoT) applications. Choosing the correct objective function in Nash equilibrium for game theory will address fairness index and resource allocation to the nodes. Game theory optimization for distributed may increase the network performance. The purpose of this study is to survey the various operations that can be carried out using distributive and adaptive MAC protocol. Hill climbing distributed MAC does not need a central coordination system and location-based transmission with neighbor awareness reduces transmission power.

Distributed MAC in wireless networks is used to address the challenges like network lifetime, reduced energy consumption and for improving delay performance. In this paper, a survey is made on various cooperative communications in MAC protocols, optimization techniques used to improve MAC performance in various applications and mathematical approaches involved in game theory optimization for MAC protocol.

Spatial reuse of channel improved by 3%–29%, and multichannel improves throughput by 8% using distributed MAC protocol. Nash equilibrium is found to perform well, which focuses on energy utility in the network by individual players. Fuzzy logic improves channel selection by 17% and secondary users’ involvement by 8%. Cross-layer approach in MAC layer will address interference and jamming problems. Hybrid distributed MAC can be used for simultaneous voice, data transmissions in WSN and IoT applications. Cross-layer and cooperative communication give energy savings of 27% and reduces hop distance by 4.7%. Choosing the correct objective function in Nash equilibrium for game theory will address fairness index and resource allocation to the nodes.

Other optimization techniques can be applied for WSN to analyze the performance.

Game theory optimization for distributed may increase the network performance. Optimal cuckoo search improves throughput by 90% and reduces delay by 91%. Stochastic approaches detect 80% attacks even in 90% malicious nodes.

Channel allocations in centralized or static manner must be based on traffic demands whether dynamic traffic or fluctuated traffic. Usage of multimedia devices also increased which in turn increased the demand for high throughput. Cochannel interference keep on changing or mitigations occur which can be handled by proper resource allocations. Network survival is by efficient usage of valid patis in the network by avoiding transmission failures and time slots’ effective usage.

Literature survey is carried out to find the methods which give better performance.

Being the final end of the logistic distribution, attended home delivery (AHD) plays an important role in the distribution network. AHD typically refers to the service provided by the distribution service provider to the recipient's doorstep. Researchers have always identified AHD as a bottleneck for last-mile delivery. This paper addresses a real-life stochastic multi-objective AHD problem in the context of the Indian public distribution system (PDS).

Two multi-objective models are proposed. Initially, the problem is formulated in a deterministic environment, and later on, it is extended to a multi-objective AHD model with stochastic travel and response time. This stochastic AHD model is used to extensively analyze the impact of stochastic travel time and customer response time on the total expected cost and time-window violation. Due to the NP-hard nature of the problem, an ant colony optimization (ACO) algorithm, tuned via response surface methodology (RSM), is proposed to solve the problem.

Experimental results show that a change in travel time and response time does not significantly alter the service level of an AHD problem. However, it is strongly correlated with the planning horizon and an increase in the planning horizon reduces the time-window violation drastically. It is also observed that a relatively longer planning horizon has a lower expected cost per delivery associated.

The paper does not consider the uncertainty of supply from the warehouse. Also, stochastic delivery failure probabilities and randomness in customer behavior have not been taken into consideration in this study.

In this paper, the role of uncertainty in an AHD problem is extensively studied through a case of the Indian PDS. The paper analyzes the role of uncertain travel time and response time over different planning horizons in an AHD system. Further, the impact of the delivery planning horizon, travel time and response time on the overall cost and service level of an AHD system is also investigated.

This paper investigates a unique and practical AHD problem in the context of Indian PDS. In the present context of AHD, this study is highly relevant for real-world applications and can help build a more efficient delivery system. The findings of this study will be of particular interest to the policy-makers to build a more robust PDS in India.

The most challenging part of an AHD problem is the requirement of the presence of customers during the time of delivery, due to which the probability of failed delivery drastically increases if the delivery deviates from the customer's preferred time slot. The paper modelled an AHD system to incorporate uncertainties to attain higher overall performance and explore the role of uncertainty in travel and response time with respect to the planning horizon in an AHD, which has not been considered by any other literature.

This research explores mitigating carbon emissions and integrating sustainability in e-commerce logistics by optimizing the multi-depot pollution routing problem with time windows (MDPRPTW). A proposed model contrasts non-collaborative and collaborative decision-making for order assignment among logistics service providers (LSPs), incorporating low-carbon considerations.

The model is substantiated using improved adaptive large neighborhood search (IALNS), tabu search (TS) and oriented ant colony algorithm (OACA) within the context of e-commerce logistics. For model validation, a normal distribution is employed to generate random demand and inputs, derived from the location and requirements files of LSPs.

This research validates the efficacy of e-commerce logistics optimization and IALNS, TS and OACA algorithms, especially when demand follows a normal distribution. It establishes that cooperation among LSPs can substantially reduce carbon emissions and costs, emphasizing the importance of integrating sustainability in e-commerce logistics optimization.

This paper proposes a meta-heuristic algorithm to solve the NP-hard problem. Methodologies such as reinforcement learning can be investigated in future work.

This research can help logistics managers understand the status of sustainable and cost-effective logistics operations and provide a basis for optimal decision-making.

This paper describes the complexity of the MDPRPTW model, which addresses both carbon emissions and cost reduction. Detailed information about the algorithm, methodology and computational studies is investigated. The research problem encompasses various practical aspects related to routing optimization in e-commerce logistics, aiming for sustainable development.