Object-based hyperspectral image classification using a new latent block model based on hidden Markov random fields

Pattern Analysis and Applications - Efficient high-dimensional analyses of hyperspectral datasets and their utilization within classification algorithms is a popular topic in the field of data...     

Simultaneous solving of balancing and sequencing problems with station-dependent assembly times for mixed-model assembly lines

In spite of many studies, investigating balancing and sequencing problems in Mixed-Model Assembly Line (MMAL) individually, this paper solves them simultaneously aiming to minimize total utility work. A new Mixed-Integer Linear Programming (MILP) model is developed to provide the exact solution of the problem with station-dependent assembly times. Because of NP-hardness, a Simulated Annealing (SA) is applied and compared to the Co-evolutionary Genetic Algorithm (Co-GA) from the literature. To strengthen the search process, two main hypotheses, namely simultaneous search and feasible search, are developed contrasting Co-GA. Various parameters of SA are reviewed to calibrate the algorithm by means of Taguchi design of experiments. Numerical results statistically show the efficiency and effectiveness of the proposed SA in terms of both the quality of solution and the time of achieving the best solution. Finally, the contribution of each hypothesis in this superiority is analyzed.     

Design,Facile Synthesis and Characterization of Porphyrin-Zirconium-Ferrite@SiO2 Core-Shell and Catalytic Application in Cyclohexane Oxidation

Silicon - In this study, a new magnetic ZrFe2O4@SiO2-TCPP nanocatalyst with high efficiency was used for the oxidation of cyclohexane to cyclohexanone (Ke) and cyclohexanol (Al). The mesoporous...     

GSAGA: A hybrid algorithm for task scheduling in cloud infrastructure

Cloud computing is becoming a very popular form of distributed computing, in which digital resources are shared via the Internet. The user is provided with an overview of many available resources. Cloud providers want to get the most out of their resources, and users are inclined to pay less for better performance. Task scheduling is one of the most important aspects of cloud computing. In order to achieve high performance from cloud computing systems, tasks need to be scheduled for processing by appropriate computing resources. The large search space of this issue makes it an NP-hard problem, and more random search methods are required to solve this problem. Multiple solutions have been proposed with several algorithms to solve this problem until now. This paper presents a hybrid algorithm called GSAGA to solve the Task Scheduling Problem (TSP) in cloud computing. Although it has a high ability to search the problem space, the Genetic Algorithm (GA) performs poorly in terms of stability and local search. It is therefore possible to create a stable algorithm by combining the general search capacities of the GA with the Gravitational Search Algorithm (GSA). Our experimental results indicate that the proposed algorithm can solve the problem with higher efficiency compared with the state-of-the-art.

     

Fatigue behaviour and modelling of talc‐filled and short glass fibre reinforced thermoplastics,including temperature and mean stress effects

Effects of temperature and mean stress on fatigue behaviour of talc‐filled polypropylene (PP‐T) and short glass fibre reinforced polypropylene (PP‐G), polyamide‐66 (PA66), and a blend of polyphenylene ether and polystyrene (PPE/PS) were investigated. Load‐controlled fatigue tests were conducted under positive stress ratios (R = 0.1 and 0.3) and at several temperatures (T = 23, 85 and 120 °C). Larson–Miller parameter was used and a shift factor of Arrhenius type was developed to correlate fatigue data at various temperatures. Effect of mean stress on fatigue life was significant for some of the studied materials; however, for the PPE/PS blend no effect of mean stress was observed. Modified Goodman and Walker mean stress equations were evaluated for their ability to correlate mean stress data. A general fatigue life prediction model was also used to account for the effects of mean stress, temperature, anisotropy and frequency.     

Bi-objective parallel machines scheduling with sequence-dependent setup times using hybrid metaheuristics and weighted min–max technique

In the literature of multi-objective problem, there are different algorithms to solve different optimization problems. This paper presents a min–max multi-objective procedure for a dual-objective, namely make span, and sum of the earliness and tardiness of jobs in due window machine scheduling problems, simultaneously. In formulation of min–max method when this method is combined with the weighting method, the decision maker can have the flexibility of mixed use of weights and distance parameter to yield a set of Pareto-efficient solutions. This research extends the new hybrid metaheuristic (HMH) to solve parallel machines scheduling problems with sequence-dependent setup time that comprises three components: an initial population generation method based on an ant colony optimization (ACO), a simulated annealing (SA) as an evolutionary algorithm employs certain probability to avoid becoming trapped in a local optimum, and a variable neighborhood search (VNS) which involves three local search procedures to improve the population. In addition, two VNS-based HMHs, which are a combination of two methods, SA/VNS and ACO/VNS, are also proposed to solve the addressed scheduling problems. A design of experiments approach is employed to calibrate the parameters. The non-dominated sets obtained from HMH and two best existing bi-criteria scheduling algorithms are compared in terms of various indices and the computational results show that the proposed algorithm is capable of producing a number of high-quality Pareto optimal scheduling plans. Aside, an extensive computational experience is carried out to analyze the different parameters of the algorithm.     

A high performing metaheuristic for job shop scheduling with sequence-dependent setup times

This paper investigates scheduling job shop problems with sequence-dependent setup times under minimization of makespan. We develop an effective metaheuristic, simulated annealing with novel operators, to potentially solve the problem. Simulated annealing is a well-recognized algorithm and historically classified as a local-search-based metaheuristic. The performance of simulated annealing critically depends on its operators and parameters, in particular, its neighborhood search structure. In this paper, we propose an effective neighborhood search structure based on insertion neighborhoods as well as analyzing the behavior of simulated annealing with different types of operators and parameters by the means of Taguchi method. An experiment based on Taillard benchmark is conducted to evaluate the proposed algorithm against some effective algorithms existing in the literature. The results show that the proposed algorithm outperforms the other algorithms.     

Parallel-machine scheduling problems with sequence-dependent setup times using an ACO,SA and VNS hybrid algorithm

This paper proposes a hybrid metaheuristic for the minimization of makespan in scheduling problems with parallel machines and sequence-dependent setup times. The solution approach is robust, fast, and simply structured, and comprises three components: an initial population generation method based on an ant colony optimization (ACO), a simulated annealing (SA) for solution evolution, and a variable neighborhood search (VNS) which involves three local search procedures to improve the population. The hybridization of an ACO, SA with VNS, combining the advantages of these three individual components, is the key innovative aspect of the approach. Two algorithms of a hybrid VNS-based algorithm, SA/VNS and ACO/VNS, and the VNS algorithm presented previously are used to compare with the proposed hybrid algorithm to highlight its advantages in terms of generality and quality for large instances.     

Studying the electronic and phononic structure of penta-graphane

In this paper, we theoretically consider a two dimensional nanomaterial which is a form of hydrogenated penta-graphene; we call it penta-graphane. This structure is obtained by adding hydrogen atoms to the sp² bonded carbon atoms of penta-graphene. We investigate the thermodynamic and mechanical stability of penta-graphane. We also study the electronic and phononic structure of penta-graphane. Firstly, we use density functional theory with the revised Perdew–Burke–Ernzerhof approximation to compute the band structure. Then one–shot GW (G₀W₀) approach for estimating accurate band gap is applied. The indirect band gap of penta-graphane is 5.78 eV, which is close to the band gap of diamond. Therefore, this new structure is a good electrical insulator. We also investigate the structural stability of penta-graphane by computing the phonon structure. Finally, we calculate its specific heat capacity from the phonon density of states. Penta-graphane has a high specific heat capacity, and can potentially be used for storing and transferring energy.