August 29, 2013 Maintainer Christoph Bergmeir License GPL-3 | file LICENSE Title Continuous Optimization using Memetic Algorithms with Local Search Chains (MA-LS-Chains) in R LinkingTo Rcpp Type Package LazyLoad yes Author Christoph Bergmeir, Daniel Molina, José M. Benítez Description This package implements an algorithm family for continuous optimization called memet...

This work introduces local search based algorithms as a new technique for the Grid scheduling problem. Specific algorithms based on dispatching rules and local search were proposed and implemented to generate schedule for dynamically arriving jobs. Algorithm performance was compared with typical queue-based algorithms on the basis of objective function optimisation and time required to generate...

Nowadays, large scale optimisation problems arise as a very interesting field of research, because they appear in many real-world problems (bio-computing, data mining, etc.). Thus, scalability becomes an essential requirement for modern optimisation algorithms. In a previous work, we presented memetic algorithms based on local search chains. Local search chain concerns the idea that, at one sta...

cost optimization of the reinforced concrete cantilever soil retaining wall of a given height satisfying some structural and geotechnical design constraints is performed utilizing harmony search and improved harmony search algorithms. the objective function considered is the cost of the structure, and design is based on aci 318-05. this function is minimized subjected to design constraints. a n...

There is a well-developed theory about the algorithmic complexity of optimization problems. Complexity theory provides negative results which typically are based on assumptions like NP 6=P or NP 6=RP. Positive results are obtained by the design and analysis of clever algorithms. These algorithms are well-tuned for their specific domain. Practitioners, however, prefer simple algorithms which are...

Hybrid algorithms formed by the combination of Genetic Algorithms with Local Search methods provide increased performances when compared to real coded GA or Local Search alone. However, the cost of Local Search can be rather high. In this paper we present a new hybrid algorithm which reduces the total cost of local search by avoiding the start of the method in basins of attraction where a local...

one of the most important goals in geomagnetic investigations is detecting local anomaly locations. regional anomaly can be simulating as a trend surface, and local anomalies will be detected by comparison of measured data and simulated trend surface. the problem is trying to find best coefficients of trend surface model using inverse methods based on modern optimization techniques, which are f...

Algorithms based on following local gradient information are surprisingly effective for certain classes of constraint satisfaction problems. Unfortunately, previous local search algorithms are notoriously incomplete: They are not guaranteed to find a feasible solution if one exists and they cannot be used to determine unsatisfiability. We present an algorithmic framework for complete local sear...

In this paper, we propose an effective microaggregation algorithm to produce a more useful protected data for publishing. Microaggregation is mapped to a clustering problem with known minimum and maximum group size constraints. In this scheme, the goal is to cluster n records into groups of at least k and at most 2k_1 records, such that the sum of the within-group squ...

We present several heuristic algorithms based on tabu search for solving the multi-stage sequence-dependent group scheduling (SDGS) problem by considering minimization of makespan as the criterion. As the problem is recognized to be strongly NP-hard, several meta (tabu) search-based solution algorithms are developed to efficiently solve industry-size problem instances. Also, two different initi...