Following decades of sustained improvement, metaheuristics are one of the great success
stories of optimization research. However, in order for research in metaheuristics to avoid …

We propose that the development of standardized, explicit, machine-readable descriptions
of metaheuristics will greatly advance scientific progress in the field. In particular, we …

In this study, we present a new hybrid heuristic algorithm for the Clustered Traveling
Salesman Problem (CTSP). The CTSP is NP-hard because it includes the well-known …

In this study, we introduce the Selective Clustered Travelling Salesman Problem, an
extension of the well-known Travelling Salesman Problem where customers are grouped in …

Abstract Design patterns capture the essentials of recurring best practice in an abstract form.
Their merits are well established in domains as diverse as architecture and software …

This paper proposes a hybrid heuristic algorithm, based on the metaheuristics Greedy
Randomized Adaptive Search Procedure, Iterated Local Search and Variable Neighborhood …

Modern optimization approaches have attracted an increasing number of scientists, decision
makers, and researchers. As new issues in this field emerge, different optimization …

There is a pressing need for a higher-level architectural per-spective in metaheuristics
research. This article proposes a purely functional collection of component signatures as a …

The NP‐hard cover printing problem addressed here consists in determining the number
and composition of equal size impression grids, as well as the number of times each grid is …

Standard approaches to developing optimisation algorithms tend to involve selecting an
algorithm and tuning it to work well on a large set of problem instances from the domain of …