A comprehensive review of firefly algorithms

I Fister, I Fister Jr, XS Yang, J Brest - Swarm and evolutionary computation, 2013 - Elsevier
The firefly algorithm has become an increasingly important tool of Swarm Intelligence that
has been applied in almost all areas of optimization, as well as engineering practice. Many …

Tabu search: A tutorial

F Glover - Interfaces, 1990 - pubsonline.informs.org
Tabu search is a “higher level” heuristic procedure for solving optimization problems,
designed to guide other methods (or their component processes) to escape the trap of local …

A novel hybrid arithmetic optimization algorithm for solving constrained optimization problems

BS Yıldız, S Kumar, N Panagant, P Mehta… - Knowledge-Based …, 2023 - Elsevier
The present study aims to optimize the engineering design and manufacturing problems
with a novel hybrid optimizer named: AOA-NM (Arithmetic optimization-Nelder mead). To …

[KNIHA][B] Tabu search

F Glover, M Laguna - 1998 - Springer
Faced with the challenge of solving hard optimization problems that abound in the real
world, classical methods often encounter great difficulty. Vitally important applications in …

Tabu search—part I

F Glover - ORSA Journal on computing, 1989 - pubsonline.informs.org
This paper presents the fundamental principles underlying tabu search as a strategy for
combinatorial optimization problems. Tabu search has achieved impressive practical …

Biogeography-based optimization

D Simon - IEEE transactions on evolutionary computation, 2008 - ieeexplore.ieee.org
Biogeography is the study of the geographical distribution of biological organisms.
Mathematical equations that govern the distribution of organisms were first discovered and …

[KNIHA][B] Guide to graph colouring

R Lewis - 2021 - Springer
Graph colouring is one of those rare examples in the mathematical sciences of a problem
that, while easy to state and visualise, has many aspects that are exceptionally difficult to …

Metaheuristics: A bibliography

IH Osman, G Laporte - Annals of Operations research, 1996 - Springer
Metaheuristics are the most exciting development in approximate optimization techniques of
the last two decades. They have had widespread successes in attacking a variety of difficult …

A survey of automated timetabling

A Schaerf - Artificial intelligence review, 1999 - Springer
The timetabling problem consists in scheduling a sequence of lectures between teachers
and students in a prefixed period of time (typically a week), satisfying a set of constraints of …

Simulated annealing: a tool for operational research

RW Eglese - European journal of operational research, 1990 - Elsevier
This paper describes the Simulated Annealing algorithm and the physical analogy on which
it is based. Some significant theoretical results are presented before describing how the …