This paper presents a mathematical model adapted from literature for the crop rotation problem with demand constraints (CRP-D). The main aim of the present work is to study metaheuristics and their performance in a real ...

Metaheuristics Algorithms are widely recognized as one of most practical approaches for Combinatorial Optimization Problems. This paper presents a comparison between two metaheuristics to solve a problem of Phase ...

Usually, metaheuristic algorithms are adapted to a large set of problems by applying few modifications on parameters for each specific case. However, this flexibility demands a huge effort to correctly tune such parameters. ...

In this letter, a genetic algorithm (GA) is applied to solve - the static and multistage transmission expansion planning (TEP) problem. The characteristics of the proposed GA to solve the TEP problem are presented. Results ...

Globally optimal triangulations are difficult to be found by deterministic methods as, for most type of criteria, no polynomial algorithm is known. In this work, we consider the Minimum Weight Triangulation (MWT) problem ...

We investigate how to make a simpler version of an existing algorithm, named 'C POT. 3'E, from Consensus between Classification and Clustering Ensembles, more user-friendly by automatically tuning its main parameters with ...

This paper presents a study on the use of metaheuristics for the treatment of the NP-hard problem known as the Intercity Public Transport Problem. The study aimed at optimizing the bus routes and frequencies through two ...

A lot sizing and scheduling problem prevalent in small market-driven foundries is studied. There are two related decision levels: (1) the furnace scheduling of metal alloy production, and (2) moulding machine planning which ...