Novel Metaheuristic Based on Iterated Constructive Stochastic Heuristic: Dhouib-Matrix-3 (DM3)

This paper presents a new metaheuristic named Dhouib-Matrix-3 (DM3) inspired by our recently developed constructive stochastic heuristic Dhouib-Matrix-TSP2 (DM-TSP2) and characterized by only one parameter: the number of iterations. The proposed metaheuristic DM3 is an iterative algorithm in which every iteration is based on two relay hybridization techniques. At first, the constructive stochastic heuristic DM-TSP2 starts by generating a different initial basic feasible solution and then each solution is intensified by the novel procedure Far-to-Near which exchanges far cities by closer ones using three perturbation techniques: insertion, exchange, and 2-opt. Experimental results carried out on the classical travelling salesman problem using the well-known TSP-LIB benchmark instances demonstrate that our approach DM3 outclasses the simulated annealing algorithm, the genetic algorithm, and the cellular genetic algorithm. Furthermore, the proposed DM3 is statistically concurrent to the hybrid simulated annealing cellular genetic algorithm. Nevertheless, DM3 is easier to implement and needs only one parameter to identify (the maximum number of iterations).

Energy efficient routing and task scheduling for autonomous transfer vehicles in intra logistics

Autonomous Transfer Vehicles (ATVs) are becoming increasingly prevalent in intra logistics. Industry 4.0 is bringing us closer to the efficient routing and scheduling of autonomous multi robot systems which perform transportation tasks. In this study, an energy efficient routing and scheduling system is proposed to minimize the total energy that the vehicles spend. Not only travelled distance but also the load of the vehicle is considered between two points. The routes of vehicles are obtained by using the proposed Hybrid Simulated Annealing Algorithm. An algorithm for the initial solution is also proposed for determining of the minimum number of vehicles for pickup and delivery requests. The performance of the algorithm is compared with the best solutions of the test problems in the literature. Besides, the proposed energy efficient routing and task scheduling model is compared with the classical distance model for routing and scheduling with backhauls. An analysis of trade-offs between energy and distance is proposed for intra logistics.

Fault diagnosis of railway freight car wheelset based on deep belief network and cuckoo search algorithm

As the key running part of the railway freight transportation system, the wheel not only bears the load of the vehicle, but also ensures the running and steering of the car body on the rails. The frequent high-speed friction with the rail and brake is the main reason for early failure of wheelset tread. Therefore, real-time status monitoring and early fault diagnosis of wheel treads have become key technical issues that must be solved in the reform of the railway freight maintenance system. In this paper, an adaptive hybrid Simulated Annealing Cuckoo Search algorithm (SA-ACS) is proposed and applied to the Deep Belief Network (DBN). The SA-ACS-DBN algorithm is used to improve the training speed and convergence accuracy of the diagnosis model. Finally, it is found through the comparison experiment of wheel tread fault data that the data results prove the feasibility of the SA-ACS-DBN model in the application of wheelset fault diagnosis.

A Peptides Prediction Methodology for Tertiary Structure Based on Simulated Annealing

The Protein Folding Problem (PFP) is a big challenge that has remained unsolved for more than fifty years. This problem consists of obtaining the tertiary structure or Native Structure (NS) of a protein knowing its amino acid sequence. The computational methodologies applied to this problem are classified into two groups, known as Template-Based Modeling (TBM) and ab initio models. In the latter methodology, only information from the primary structure of the target protein is used. In the literature, Hybrid Simulated Annealing (HSA) algorithms are among the best ab initio algorithms for PFP; Golden Ratio Simulated Annealing (GRSA) is a PFP family of these algorithms designed for peptides. Moreover, for the algorithms designed with TBM, they use information from a target protein’s primary structure and information from similar or analog proteins. This paper presents GRSA-SSP methodology that implements a secondary structure prediction to build an initial model and refine it with HSA algorithms. Additionally, we compare the performance of the GRSAX-SSP algorithms versus its corresponding GRSAX. Finally, our best algorithm GRSAX-SSP is compared with PEP-FOLD3, I-TASSER, QUARK, and Rosetta, showing that it competes in small peptides except when predicting the largest peptides.

A Quality of Service (Qos) Load Balanced Hybrid Simulated Annealing -Stochastic Diffusion Search (Sa-Sds) Network Backbone for Manet

The Mobile Ad hoc Networks (MANET) are those networks that do not have the infrastructure and are formed dynamically by means of an autonomous system of some mobile nodes connected through wireless links. All routers are left free to be able to randomly move and arbitrarily organize themselves. So, the wireless topology of the network can have unpredictable and rapid changes. In these types of networks, the provisioning of services based on Quality of Service (QoS) can pose to be very challenging. The work further presented a newer approach that was based on a hybrid Simulated Annealing (SA) along with a Stochastic Diffusion Search (SDS) based multi-path routing network which backbones in giving support to the enhanced QoS in the MANETs. This multipath routing had the objective of improving the dependability and the throughput along with load balancing. The SA is used for solving the problem of the Minimum Dominating Set (MDS). This SDS heuristic gives an algorithm which is simple in its structure and also provides a high exploration level along with fast convergence in comparison with the other algorithms. SA algorithms are also used for improving the diversity of agent and for avoiding it from being trapped within the local optimum. The results of the experiment proved that the SA-SDS method proposed had a better performance compared to the Connected Dominating Set (CDS)-SA.

Embodied Energy Optimization of Buttressed Earth-Retaining Walls with Hybrid Simulated Annealing

The importance of construction in the consumption of natural resources is leading structural design professionals to create more efficient structure designs that reduce emissions as well as the energy consumed. This paper presents an automated process to obtain low embodied energy buttressed earth-retaining wall optimum designs. Two objective functions were considered to compare the difference between a cost optimization and an embodied energy optimization. To reach the best design for every optimization criterion, a tuning of the algorithm parameters was carried out. This study used a hybrid simulated optimization algorithm to obtain the values of the geometry, the concrete resistances, and the amounts of concrete and materials to obtain an optimum buttressed earth-retaining wall low embodied energy design. The relation between all the geometric variables and the wall height was obtained by adjusting the linear and parabolic functions. A relationship was found between the two optimization criteria, and it can be concluded that cost and energy optimization are linked. This allows us to state that a cost reduction of €1 has an associated energy consumption reduction of 4.54 kWh. To achieve a low embodied energy design, it is recommended to reduce the distance between buttresses with respect to economic optimization. This decrease allows a reduction in the reinforcing steel needed to resist stem bending. The difference between the results of the geometric variables of the foundation for the two-optimization objectives reveals hardly any variation between them. This work gives technicians some rules to get optimum cost and embodied energy design. Furthermore, it compares designs obtained through these two optimization objectives with traditional design recommendations.