Chapter Two: Optimization problems
Abstract
Before we move on to the discussion of metaheuristic algorithms, a brief overview is given in this chapter to make it clear what an optimization problem is. It begins with the general definition of an optimization problem that is composed of the objective function, constraint, and solution. The most widely known problems are certainly the so-called combinatorial and continuous optimization problems. The combinatorial optimization problems described herein include the one-max, 0-1 knapsack, binary to decimal, and traveling salesman problems, whereas the continuous optimization problems described herein include the so-called single-objective and multi-objective optimization problems. In addition to the ...
Get Handbook of Metaheuristic Algorithms now with the O’Reilly learning platform.
O’Reilly members experience books, live events, courses curated by job role, and more from O’Reilly and nearly 200 top publishers.
