Displaying similar documents to “A novel generalized oppositional biogeography-based optimization algorithm: application to peak to average power ratio reduction in OFDM systems”

Editorial

Clarisse Dhaenens, Patrick Siarry, El-Ghazali Talbi (2008)

RAIRO - Operations Research

Similarity:

High-performance simulation-based algorithms for an alpine ski racer's trajectory optimization in heterogeneous computer systems

Roman Dębski (2014)

International Journal of Applied Mathematics and Computer Science

Similarity:

Effective, simulation-based trajectory optimization algorithms adapted to heterogeneous computers are studied with reference to the problem taken from alpine ski racing (the presented solution is probably the most general one published so far). The key idea behind these algorithms is to use a grid-based discretization scheme to transform the continuous optimization problem into a search problem over a specially constructed finite graph, and then to apply dynamic programming to find an...

Ant Colony Optimisation: models and applications.

Oscar Cordón, Francisco Herrera, Thomas Stützle (2002)

Mathware and Soft Computing

Similarity:

Ant Colony Optimization (ACO) is a metaheuristic that is inspired by the shortest path searching behavior of various ant species [1,2]. The initial work of Dorigo, Maniezzo and Colorni [3,4] who proposed the first ACO algorithm called Ant System, has stimulated a still strongly increasing number of researchers to develop more sophisticated and better performing ACO algorithms that are used to successfully solve a large number of hard combinatorial optimization problems such as the traveling...

Exact and heuristic approaches to solve the Internet shopping optimization problem with delivery costs

Mario C. Lopez-Loces, Jedrzej Musial, Johnatan E. Pecero, Hector J. Fraire-Huacuja, Jacek Blazewicz, Pascal Bouvry (2016)

International Journal of Applied Mathematics and Computer Science

Similarity:

Internet shopping has been one of the most common online activities, carried out by millions of users every day. As the number of available offers grows, the difficulty in getting the best one among all the shops increases as well. In this paper we propose an integer linear programming (ILP) model and two heuristic solutions, the MinMin algorithm and the cellular processing algorithm, to tackle the Internet shopping optimization problem with delivery costs. The obtained results improve...

Learnheuristics: hybridizing metaheuristics with machine learning for optimization with dynamic inputs

Laura Calvet, Jésica de Armas, David Masip, Angel A. Juan (2017)

Open Mathematics

Similarity:

This paper reviews the existing literature on the combination of metaheuristics with machine learning methods and then introduces the concept of learnheuristics, a novel type of hybrid algorithms. Learnheuristics can be used to solve combinatorial optimization problems with dynamic inputs (COPDIs). In these COPDIs, the problem inputs (elements either located in the objective function or in the constraints set) are not fixed in advance as usual. On the contrary, they might vary in a predictable...

A review on the ant colony optimization metaheuristic: basis, models and new trends.

Oscar Cordón, Francisco Herrera, Thomas Stützle (2002)

Mathware and Soft Computing

Similarity:

Ant Colony Optimization (ACO) is a recent metaheuristic method that is inspired by the behavior of real ant colonies. In this paper, we review the underlying ideas of this approach that lead from the biological inspiration to the ACO metaheuristic, which gives a set of rules of how to apply ACO algorithms to challenging combinatorial problems. We present some of the algorithms that were developed under this framework, give an overview of current applications, and analyze the relationship...

Experiments with variants of ant algorithms.

Thomas Stützle, Sebastian Linke (2002)

Mathware and Soft Computing

Similarity:

A number of extensions of Ant System, the first ant colony optimization (ACO) algorithm, were proposed in the literature. These extensions typically achieve much improved computational results when compared to the original Ant System. However, many design choices of Ant System are left untouched including the fact that solutions are constructed, that real-numbers are used to simulate pheromone trails, and that explicit pheromone evaporation is used. In this article we experimentally...