This paper proposes a simulated annealing (SA) algorithm based optimization approach to search a minimum-interference multicast tree which satisfies the end-to-end delay constraint and optimizes the usage of the scarce radio network resource in wireless mesh networks. In the proposed SAmulticast algorithm, the path-oriented encoding method is adopted and each candidate solution is represented b...

Control and synchronization of chaotic systems are important issues in nonlinear sciences. This paper proposes an effective estimation of distribution algorithm (EDA)-based memetic algorithm (MA) to direct the orbits of discrete chaotic dynamical systems as well as to synchronize chaotic systems, which could be formulated as complex multi-modal numerical optimization problems. In EDA-based MA (...

To compute Burrows-Wheeler Transform (BWT), one usually builds a suffix array (SA) first, and then obtains BWT using SA, which requires much redundant working space. In previous studies to compute BWT directly [6, 13], one constructs BWT incrementally, which requires O(n logn) time where n is the length of the input text. We present an algorithm for computing BWT directly in linear time by modi...

Prediction of building energy consumption using mathematical modeling is crucial for improving the efficiency utilization, assisting in planning and scheduling, further achieving goal conservation emission reduction. In consideration non-linear non-smooth characteristics time series data, a short-term, hybrid prediction model combining variational mode decomposition (VMD), simulated annealing (...

This paper addresses the single machine early/ tardy problem with unrestricted common due date and sequence-dependent setup times. Two algorithms are introduced to reach near-optimum solutions: the SAPT, a heuristic tailored for the problem, and a simulated annealing (SA) algorithm. It will be shown that SA provides solutions with slightly better quality; however, SAPT requires much less comput...

In this study, for the loads supplied by three thermic plants, power of thermic plants, supplying the minimum values of the cost of energy used for an hour, have been found with Simulated Annealing (SA) which is a metaheuristic optimasition method. Firstly solution have been found with classical Lagrange Method. Later solution have also been found with SA algorithm. Solutions found with two dif...

The problem of scheduling n jobs with a large common due date on a single machine is addressed. The objective is to minimize the jobs’ total earliness and tardiness. In this paper, sequence-dependent setup times are considered, which makes the problem NP-Hard. Therefore, exact algorithms are very unlikely to optimally solve large problems within reasonable computational time. A Simulated Anneal...

This paper presents a Simulated Annealing (SA) algorithm for solving the Environmental/Economic Dispatch Problem (EED). This problem is formulated as a multi-objective one with two competing functions, namely economic cost and emission functions, subject to different constraints. The inequality constraints considered are maximum and minimum limits of power generation while the equality constrai...