Improved Harmony Search Algorithm For Color Image CompressionÂ

No Abstrac

Using harmony search for optimising university shuttle bus driver scheduling for better operational management

Managing human resource to achieve specific goal in an organisation is a crucial task. One of various aspects in managing human resource is preparing optimum scheduling to perform certain tasks. The main objective of this paper is to illustrate the preparation and the work of optimum scheduling for university shuttle bus driver using a recently develop meta-heuristic technique known as Harmony Search. A mathematical formulation for the university shuttle bus driver scheduling problem based on the requirement and the preference of the university is illustrated. The optimum schedule is generated using Harmony Search, an optimisation approach inspired by the processes in music improvisation with less mathematical computation. It can be seen that the result produced using harmony search approach to automate the optimum university shuttle bus driver scheduling is quite promising because it yield better value of objective function compared with the one being done manually. Automation of the optimum university bus driver scheduling certainly can enhanced the operational management processes. This work can be regarded as a multidisciplinary work which several domains such as computer science, mathematics, operational research and management are involved

Full factorial experimental design for parameters selection of Harmony Search Algorithm

AbstractMetaheuristic may be defined as an iterative search process that intelligently performs the exploration and exploitationin the solution space aiming to efficiently find near optimal solutions. Various natural intelligences and inspirations have been artificially embedded into the iterative process. In this work, Harmony Search Algorithm (HSA), which is based on the melody fine tuning conducted by musicians for optimising the synchronisation of the music, was adopted to find optimal solutions of nine benchmarking non-linear continuous mathematical models including two-, three- and four-dimensions. Considering the solution space in a specified region, some models contained a global optimum and multi local optima. A series of computational experiments was used to systematically identify the best parameters of HSA and to compare its performance with other metaheuristics including the Shuffled Frog Leaping (SFL) and the Memetic Algorithm (MA) in terms of the mean and variance ofthe solutions obtained

A hybrid algorithm for university course timetabling problem

A hybrid algorithm combining the genetic algorithm with the iterated local search algorithm is developed for solving university course timetabling problem. This hybrid algorithm combines the merits of genetic algorithm and iterated local search algorithm for its convergence to global optima at the same time avoiding being get trapped into local optima. This leads to intensification of the involved search space for solutions. It is applied on a number of benchmark university course timetabling problem instances of various complexities. Keywords: timetabling, optimization, metaheuristics, genetic algorithm, iterative local searc

Harmony annealing algorithm for curriculum-based course timetabling problem

This research article presents the adaption of the harmony annealing algorithm for solving timetabling problems, with particular focus on the curriculum-based course timetabling that formed part of the competition track 3 of the 2nd International Timetabling Competition in 2007 (ITC-2007). An attempt to solve these problems was made via an approach broken down into two parts; first, constructive algorithm with saturation degree approach was used to ensure a feasible solution, where the hard constraints are satisfied.Secondly, Harmony annealing algorithm was used to further improve the results obtained.The algorithm produced results that were not comparatively better than those previously known as best solution.With proper modification in terms of the approach in this algorithm would make the algorithm perform better on curriculum-based course timetabling

Feature Selection Inspired Classifier Ensemble Reduction

Classifier ensembles constitute one of the main research directions in machine learning and data mining. The use of multiple classifiers generally allows better predictive performance than that achievable with a single model. Several approaches exist in the literature that provide means to construct and aggregate such ensembles. However, these ensemble systems contain redundant members that, if removed, may further increase group diversity and produce better results. Smaller ensembles also relax the memory and storage requirements, reducing system's run-time overhead while improving overall efficiency. This paper extends the ideas developed for feature selection problems to support classifier ensemble reduction, by transforming ensemble predictions into training samples, and treating classifiers as features. Also, the global heuristic harmony search is used to select a reduced subset of such artificial features, while attempting to maximize the feature subset evaluation. The resulting technique is systematically evaluated using high dimensional and large sized benchmark datasets, showing a superior classification performance against both original, unreduced ensembles, and randomly formed subsets. ? 2013 IEEE

Multiobjective optimization of post-tensioned concrete box-girder road bridges considering cost, CO2 emissions, and safety

This paper presents a multiobjective optimization of post-tensioned concrete road bridges in terms of cost, CO2 emissions, and overall safety factor. A computer tool links the optimization modulus with a set of modules for the finite-element analysis and limit states verification. This is applied for the case study of a three-span continuous post-tensioned box-girder road bridge, located in a coastal region. A multiobjective harmony search is used to automatically search a set of optimum structural solutions regarding the geometry, concrete strength, reinforcing and post-tensioned steel. Diversification strategies are combined with intensification strategies to improve solution quality. Results indicate that cost and CO2 emissions are close to each other for any safety range. A one-euro reduction, involves a 2.34 kg CO2 emissions reduction. Output identifies the best variables to improve safety and the critical limit states. This tool also provides bridge managers with a set of trade-off optimum solutions, which balance their preferences most closely, and meet the requirements previously defined.The authors acknowledge the financial support of the Spanish Ministry of Economy and Competitiveness, along with FEDER funding (BRIDLIFE Project: BIA2014-56574-R) and the Research and Development Support Program of Universitat Politecnica de Valencia (PAID-02-15).García Segura, T.; Yepes, V. (2016). Multiobjective optimization of post-tensioned concrete box-girder road bridges considering cost, CO2 emissions, and safety. Engineering Structures. 125:325-336. https://doi.org/10.1016/j.engstruct.2016.07.012S32533612

Hybridizing Cartesian Genetic Programming and Harmony Search for Adaptive Feature Construction in Supervised Learning Problems

The advent of the so-called Big Data paradigm has motivated a flurry of research aimed at enhancing machine learning models by following very di- verse approaches. In this context this work focuses on the automatic con- struction of features in supervised learning problems, which differs from the conventional selection of features in that new characteristics with enhanced predictive power are inferred from the original dataset. In particular this manuscript proposes a new iterative feature construction approach based on a self-learning meta-heuristic algorithm (Harmony Search) and a solution encoding strategy (correspondingly, Cartesian Genetic Programming) suited to represent combinations of features by means of constant-length solution vectors. The proposed feature construction algorithm, coined as Adaptive Cartesian Harmony Search (ACHS), incorporates modifications that allow exploiting the estimated predictive importance of intermediate solutions and, ultimately, attaining better convergence rate in its iterative learning proce- dure. The performance of the proposed ACHS scheme is assessed and com- pared to that rendered by the state of the art in a toy example and three practical use cases from the literature. The excellent performance figures obtained in these problems shed light on the widespread applicability of the proposed scheme to supervised learning with legacy datasets composed by already refined characteristics

Harmony great deluge for solving curriculum based course timetabling problem

University course timetabling which has been determined as non deterministic polynomial problem that accept widely as problem that are intractable.An efficient algorithm does not exist that is guaranteed to find an optimal solution for such problems.The design of good algorithm to find new methods and techniques to solve such problem is a very active area of research.This paper presents the adaption of the hybridizing between harmony search with great deluge algorithm for solving curriculum-based course timetabling problems.The algorithm can be adapted to the problem.Results were not comparatively better than those previously known as best solution.Proper modification in terms of the approach in this algorithm would make the algorithm perform better on curriculum-based course timetabling