Research on Route Deviation Transit Operation Scheduling—A Case Study in Suburb No. 5 Road of Harbin

Route deviation transit is a flexible “door-to-door” service method that combines the efficiency of conventional public transport modes and the flexibility of demand response modes, meeting the travel needs of people with low travel density and special groups. In this paper, the minimum value of the sum of vehicle operating cost and passenger travel cost was the optimal goal, and the RDT multi-vehicle operation scheduling model was constructed. Taking the available relaxation time as the control parameter of the RDT system and considering the insertion process of the random travel demand of the passengers during the operation process, we used a heuristic search algorithm to solve the scheduling model. This paper took Suburb No. 5 Road of Harbin as an example, using MATLAB to simulate the RDT operation scheduling model to verify the stability and feasibility of the RDT system under different demands. The results showed that under different demand conditions, the system indicators such as passenger travel time, waiting time, and vehicle mileage in the RDT system fluctuated very little, and the system performance was relatively stable. Under the same demand conditions, the per capita cost of the RDT system was 5.9% to 10.8% less than that of the conventional bus system. When the demand ρ is 20~40 person/hour, the RDT system is more effective than the conventional bus for the 5 bus in the suburbs of Harbin.

Input-Output Example-Guided Data Deobfuscation on Binary

Data obfuscation is usually used by malicious software to avoid detection and reverse analysis. When analyzing the malware, such obfuscations have to be removed to restore the program into an easier understandable form (deobfuscation). The deobfuscation based on program synthesis provides a good solution for treating the target program as a black box. Thus, deobfuscation becomes a problem of finding the shortest instruction sequence to synthesize a program with the same input-output behavior as the target program. Existing work has two limitations: assuming that obfuscated code snippets in the target program are known and using a stochastic search algorithm resulting in low efficiency. In this paper, we propose fine-grained obfuscation detection for locating obfuscated code snippets by machine learning. Besides, we also combine the program synthesis and a heuristic search algorithm of Nested Monte Carlo Search. We have applied a prototype implementation of our ideas to data obfuscation in different tools, including OLLVM and Tigress. Our experimental results suggest that this approach is highly effective in locating and deobfuscating the binaries with data obfuscation, with an accuracy of at least 90.34%. Compared with the state-of-the-art deobfuscation technique, our approach’s efficiency has increased by 75%, with the success rate increasing by 5%.

Development of Computational Approaches with a Fragment-Based Drug Design Strategy: In Silico Hsp90 Inhibitors Discovery

A semi-exhaustive approach and a heuristic search algorithm use a fragment-based drug design (FBDD) strategy for designing new inhibitors in an in silico process. A deconstruction reconstruction process uses a set of known Hsp90 ligands for generating new ones. The deconstruction process consists of cutting off a known ligand in fragments. The reconstruction process consists of coupling fragments to develop a new set of ligands. For evaluating the approaches, we compare the binding energy of the new ligands with the known ligands.

Dynamic Pathfinding for a Swarm Intelligence Based UAV Control Model Using Particle Swarm Optimisation

In recent years unmanned aerial vehicles (UAVs) have become smaller, cheaper, and more efficient, enabling the use of multiple autonomous drones where previously a single, human-operated drone would have been used. This likely includes crisis response and search and rescue missions. These systems will need a method of navigating unknown and dynamic environments. Typically, this would require an incremental heuristic search algorithm, however, these algorithms become increasingly computationally and memory intensive as the environment size increases. This paper used two different Swarm Intelligence (SI) algorithms: Particle Swarm Optimisation and Reynolds flocking to propose an overall system for controlling and navigating groups of autonomous drones through unknown and dynamic environments. This paper proposes Particle Swarm Optimisation Pathfinding (PSOP): a dynamic, cooperative algorithm; and, Drone Flock Control (DFC): a modular model for controlling systems of agents, in 3D environments, such that collisions are minimised. Using the Unity game engine, a real-time application, simulation environment, and data collection apparatus were developed and the performances of DFC-controlled drones—navigating with either the PSOP algorithm or a D* Lite implementation—were compared. The simulations do not consider UAV dynamics. The drones were tasked with navigating to a given target position in environments of varying size and quantitative data on pathfinding performance, computational and memory performance, and usability were collected. Using this data, the advantages of PSO-based pathfinding were demonstrated. PSOP was shown to be more memory efficient, more successful in the creation of high quality, accurate paths, more usable and as computationally efficient as a typical incremental heuristic search algorithm when used as part of a SI-based drone control model. This study demonstrated the capabilities of SI approaches as a means of controlling multi-agent UAV systems in a simple simulation environment. Future research may look to apply the DFC model, with the PSOP algorithm, to more advanced simulations which considered environment factors like atmospheric pressure and turbulence, or to real-world UAVs in a controlled environment.

A HYBRID ALGORITHM FOR FORMING THE SHORTEST TRAJECTORY BASED ON THE APPLICATION OF MULTI-AGENT LEARNING WITH REINFORCEMENT, THE SEARCH ALGORITHM A* AND EXCHANGE OF EXPERIENCE

The article presents a hybrid algorithm for the formation of the shortest trajectory for intelligent agents of a multi-agent system, based on the synthesis of methods of the reinforcement learning paradigm, the heuristic search algorithm A*, which has the functions of exchange of experience, as well as the automatic formation of subgroups of agents based on their visibility areas. The experimental evaluation of the developed algorithm was carried out by simulating the task of finding the target state in the maze in the Microsoft Unity environment. The results of the experiment showed that the use of the developed hybrid algorithm made it possible to reduce the time for solving the problem by an average of 12.7 % in comparison with analogs. The differences between the proposed new “hybrid algorithm for the formation of the shortest trajectory based on the use of multi-agent reinforcement learning, search algorithm A* and exchange of experience” from analogs are as follows: – application of the algorithm for the formation of subgroups of subordinate agents based on the “scope” of the leader agent for the implementation of a multi-level hierarchical system for managing a group of agents; – combining the principles of reinforcement learning and the search algorithm A*.

Timetable Scheduling System using Genetic Algorithm for School of Computing (tsuGA)

Current timetable scheduling system in School of Computing(SC), Universiti Teknologi Malaysia(UTM) is done manually which consumes time and human effort. In this project, a Genetic Algorithm (GA) approach is proposed to aid the timetable scheduling process. GA is a heuristic search algorithm which finds the best solution based on current individual characteristics. Using GA and scheduling info such as rooms available and timeslots needed, it is shown that scheduling can be done more efficiently, with less time, effort and errors. As a testbed, a web application is developed to maintain records needed and generate timetables. Introduction of GA helps in generating a timetable automatically based on information such as rooms, subjects, lecturers, student group and timeslot. GA reduces human error and human efforts in the timetable scheduling process.

A Fuzzy Adaptive Firefly Algorithm for Multilevel Color Image Thresholding Based on Fuzzy Entropy

Multilevel thresholding image segmentation has always been a hot issue of research in last several years since it has a plenty of applications. Traditional exhaustive search method consumes a lot of time for searching the optimal multilevel thresholding, color images contain more information, solving multilevel thresholding will become worse. However, the meta-heuristic search algorithm has unique advantages in solving multilevel threshold values. In this paper, a fuzzy adaptive firefly algorithm (FaFA) is proposed to solve the optimal multilevel thresholding for color images, and the fuzzy Kapur's entropy is considered as its objective function. In the FaFA, a fuzzy logical controller is designed to adjust the control parameters. A total of six satellite remote sensing color images are conducted in the experiments. The performance of the FaFA is compared with FA, BWO, SSA, NaFA and ODFA. Some measure metrics are performed in the experiments. The experimental results show that the FaFA obviously outperforms other five algorithms.

A Fuzzy Adaptive Firefly Algorithm for Multilevel Color Image Thresholding Based on Fuzzy Entropy

Multilevel thresholding image segmentation has always been a hot issue of research in last several years since it has a plenty of applications. Traditional exhaustive search method consumes a lot of time for searching the optimal multilevel thresholding, color images contain more information, solving multilevel thresholding will become worse. However, the meta-heuristic search algorithm has unique advantages in solving multilevel threshold values. In this paper, a fuzzy adaptive firefly algorithm (FaFA) is proposed to solve the optimal multilevel thresholding for color images, and the fuzzy Kapur's entropy is considered as its objective function. In the FaFA, a fuzzy logical controller is designed to adjust the control parameters. A total of six satellite remote sensing color images are conducted in the experiments. The performance of the FaFA is compared with FA, BWO, SSA, NaFA and ODFA. Some measure metrics are performed in the experiments. The experimental results show that the FaFA obviously outperforms other five algorithms.

A Meta-Heuristic Search Algorithm based on Infrasonic Mating Displays in Peafowls

Meta-heuristic techniques are important as they are used to find solutions to computationally intractable problems. Simplistic methods such as exhaustive search become computationally expensive and unreliable as the solution space for search algorithms increase. As no method is guaranteed to perform better than all others in all classes of optimization search problems, there is a need to constantly find new and/or adapt old search algorithms. This research proposes an Infrasonic Search Algorithm, inspired from the Gravitational Search Algorithm and the mating behaviour in peafowls. The Infrasonic Search Algorithm identified competitive solutions to 23 benchmark unimodal and multimodal test functions compared to the Genetic Algorithm, Particle Swarm Optimization Algorithm and the Gravitational Search Algorithm.