Search results

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.

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 solve the problem of job scheduling and multi automated guided vehicle (AGV) cooperation in intelligent manufacturing workshops.

In this study, an algorithm for job scheduling and cooperative work of multiple AGVs is designed. In the first part, with the goal of minimizing the total processing time and the total power consumption, the niche multi-objective evolutionary algorithm is used to determine the processing task arrangement on different machines. In the second part, AGV is called to transport workpieces, and an improved ant colony algorithm is used to generate the initial path of AGV. In the third part, to avoid path conflicts between running AGVs, the authors propose a simple priority-based waiting strategy to avoid collisions.

The experiment shows that the solution can effectively deal with job scheduling and multiple AGV operation problems in the workshop.

In this paper, a collaborative work algorithm is proposed, which combines the job scheduling and AGV running problem to make the research results adapt to the real job environment in the workshop.

This study addresses resilient mixed supply chain network design (SCND) and aims to minimize the expected total cost of the supply chain (SC) considering disruptions. The capacity of facilities is considered uncertain. In order to get closer to real-world situations, competition between SCs is considered.

A two-stage stochastic programming model is developed for designing the SC network. The location of facilities and selection of suppliers are considered first-stage decisions, and the determination of materials and products flows are second-stage decisions. Some resilience strategies are applied to mitigate the negative impacts of disruptions.

The results indicate that considering resilience and applying the related strategies are vitally important, and resilience strategies can significantly improve the SC objective and maintain market share. Also, it is confirmed that unrealistic decisions will be made without considering the competition.

This study contributes to the literature by proposing a novel mathematical model for the resilient mixed SCND problem. The other contribution is considering the chain-to-chain competition in collecting returned products and selling recycled products to other SCs in a mixed SC under disruptions. Also, a novel hybrid metaheuristic is developed to cope with the complexity of the model.

Metaheuristic algorithms based on biology, evolutionary theory and physical principles, have been widely developed for complex global optimization. This paper aims to present a new hybrid optimization algorithm that combines the characteristics of biogeography-based optimization (BBO), invasive weed optimization (IWO) and genetic algorithms (GAs).

The significant difference between the new algorithm and original optimizers is a periodic selection scheme for offspring. The selection criterion is a function of cyclic discharge and the fitness of populations. It differs from traditional optimization methods where the elite always gains advantages. With this method, fitter populations may still be rejected, while poorer ones might be likely retained. The selection scheme is applied to help escape from local optima and maintain solution diversity.

The efficiency of the proposed method is tested on 13 high-dimensional, nonlinear benchmark functions and a homogenous slope stability problem. The results of the benchmark function show that the new method performs well in terms of accuracy and solution diversity. The algorithm converges with a magnitude of 10-4, compared to 102 in BBO and 10-2 in IWO. In the slope stability problem, the safety factor acquired by the analogy of slope erosion (ASE) is closer to the recommended value.

This paper introduces a periodic selection strategy and constructs a hybrid optimizer, which enhances the global exploration capacity of metaheuristic algorithms.

The development of information technologies has led to a considerable transformation in human resource management from conventional or commonly known as personnel management to modern one. Data mining technology, which has been widely used in several applications, including those that function on the web, includes clustering algorithms as a key component. Web intelligence is a recent academic field that calls for sophisticated analytics and machine learning techniques to facilitate information discovery, particularly on the web. Human resource data gathered from the web are typically enormous, highly complex, dynamic, and unstructured. Traditional clustering methods need to be upgraded because they are ineffective. Standard clustering algorithms are enhanced and expanded with optimization capabilities to address this difficulty by swarm intelligence, a subset of nature-inspired computing. We collect the initial raw human resource data and preprocess the data wherein data cleaning, data normalization, and data integration takes place. The proposed K-C-means-data driven cuckoo bat optimization algorithm (KCM-DCBOA) is used for clustering of the human resource data. The feature extraction is done using principal component analysis (PCA) and the classification of human resource data is done using support vector machine (SVM). Other approaches from the literature were contrasted with the suggested approach. According to the experimental findings, the suggested technique has extremely promising features in terms of the quality of clustering and execution time.

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.

This study aims to apply for the first time in literature a new multi-objective sensor selection and placement optimization methodology based on the multi-objective Lichtenberg algorithm and test the sensors' configuration found in a delamination identification case study.

This work aims to study the damage identification in an aircraft wing using the Lichtenberg and multi-objective Lichtenberg algorithms. The former is used to identify damages, while the last is associated with feature selection techniques to perform the first sensor placement optimization (SPO) methodology with variable sensor number. It is applied aiming for the largest amount of information about using the most used modal metrics in the literature and the smallest sensor number at the same time.

The proposed method was not only able to find a sensor configuration for each sensor number and modal metric but also found one that had full accuracy in identifying delamination location and severity considering triaxial modal displacements and minimal sensor number for all wing sections.

This study demonstrates for the first time in the literature how the most used modal metrics vary with the sensor number for an aircraft wing using a new multi-objective sensor selection and placement optimization methodology based on the multi-objective Lichtenberg algorithm.

This paper aims to focus on solving the path optimization problem by modifying the probabilistic roadmap (PRM) technique as it suffers from the selection of the optimal number of nodes and deploy in free space for reliable trajectory planning.

Traditional PRM is modified by developing a decision-making strategy for the selection of optimal nodes w.r.t. the complexity of the environment and deploying the optimal number of nodes outside the closed segment. Subsequently, the generated trajectory is made smoother by implementing the modified Bezier curve technique, which selects an optimal number of control points near the sharp turns for the reliable convergence of the trajectory that reduces the sum of the robot’s turning angles.

The proposed technique is compared with state-of-the-art techniques that show the reduction of computational load by 12.46%, the number of sharp turns by 100%, the number of collisions by 100% and increase the velocity parameter by 19.91%.

The proposed adaptive technique provides a better solution for autonomous navigation of unmanned ground vehicles, transportation, warehouse applications, etc.