Please cite this article as: J. Borges, M.S. Rodrigues, C. Lopes, D. Costa, F.M. Couto, T. Kubart, B. Martins, N. Duarte, J.P. Dias, A. Cavaleiro, T. Polcar, F. Macedo, F. Vaz, Thin films composed of Ag nanoclusters dispersed in TiO2: influence of composition and thermal annealing on the microstructure and physical responses, Applied Surface Science (2015), http://dx.doi.org/10.1016/j.apsusc.20...

In this work, we present a simple model for the automated cryptanalysis of cryptographic protocols based on meta-heuristic search. We illustrate our approach with a straightforward application in the form of an attack against a slightly simplified version of an ultra-lightweight authentication protocol for RFID environments called SASI. We show how an attack based on Simulated Annealing can eff...

The logical configuration of a WDM network can be changed by reassigning wavelengths to tunable transceivers of nodes. In this paper, we develop reconfiguration algorithms to obtain an optimal node placement of multihop networks with regular topology. The algorithms are based on meta-heuristics such as simulated annealing, threshold acceptance, and multistart local search. We compare the perfor...

The scheduling problem is one of the most challenging problems faced in many different areas of everyday life. This problem can be formulated as a combinatorial optimization problem, and it has been solved with various methods using meta-heuristics and intelligent algorithms. We present in this paper a solution to the scheduling problem using two different heuristics namely Simulated Annealing ...

Economic lot scheduling problem has been an important topic in production planning and scheduling research for more than four decades. The problem is known to be NP-hard due to its combinatorial nature. In this paper, a meta-heuristics algorithm based on Simulated Annealing (SA) is proposed. Besides on explaining how to use SA, the effects of changing in production frequency on sequence and als...

The purpose of this article is to review the literature on the topic of deterministic vehicle routing problem (VRP) and to give a review on the exact and approximate solution techniques. More specifically the approximate (meta-heuristic) solution techniques are classified into: tabu search, simulated annealing, genetic algorithm, evolutionary algorithm, hybrid algorithm, and Ant Colony Optimiza...

Since the logistics is an industry with relatively higher energy consumption, the building industry lowcarbon logistics ought to attract wide attentions from the building enterprises. Simulated annealing is an effective intelligent algorithm for optimizing the building materials logistics route. This paper analyzes the similarities between the process of the building materials logistics route o...

The Capacitated Vehicle Routing Problem (CVRP) is a combinatorial optimization problem where a fleet of delivery vehicles must service known customer demands from a common depot at a minimum transit cost without exceeding the capacity constraint of each vehicle. In this paper, we present a meta-heuristic approach for solving the CVRP based on simulated annealing. The algorithm uses a combinatio...

Fuzzy Cognitive Maps (FCMs) have successfully been applied in numerous domains to show the relations between essential components in complex systems. In this paper, a novel learning method is proposed to construct FCMs based on historical data and by using meta-heuristic: Genetic Algorithm (GA), Simulated Annealing (SA), and Tabu Search (TS). Implementation of the proposed method has demonstrat...