March 2009
Intermediate to advanced
476 pages
14h 28m
English
book
Optimization Techniques for Solving Complex Problems
by Enrique Alba, Christian Blum, Pedro Asasi, Coromoto Leon, Juan Antonio Gomez
Content preview from Optimization Techniques for Solving Complex Problems
Become an O’Reilly member and get unlimited access to this title plus top books and audiobooks from O’Reilly and nearly 200 top publishers, thousands of courses curated by job role, 150+ live events each month,
O’Reilly covers everything we've got, with content to help us build a world-class technology community, upgrade the capabilities and competencies of our teams, and improve overall team performance as well as their engagement.I wanted to learn C and C++, but it didn't click for me until I picked up an O'Reilly book. When I went on the O’Reilly platform, I was astonished to find all the books there, plus live events and sandboxes so you could play around with the technology.I’ve been on the O’Reilly platform for more than eight years. I use a couple of learning platforms, but I'm on O'Reilly more than anybody else. When you're there, you start learning. I'm never disappointed.I'm always learning. So when I got on to O'Reilly, I was like a kid in a candy store. There are playlists. There are answers. There's on-demand training. It's worth its weight in gold, in terms of what it allows me to do.
CHAPTER 21
Exact, Metaheuristic, and Hybrid Approaches to Multidimensional Knapsack Problems
J. E. GALLARDO, C. COTTA, and A. J. FERNÁNDEZ
Universidad de Málaga, Spain
21.1 INTRODUCTION
In this chapter we review our recent work on applying hybrid collaborative techniques that integrate branch and bound (B&B) and memetic algorithms (MAs) in order to design effective heuristics for the multidimensional knapsack problem (MKP). To this end, let us recall that branch and bound (B&B) [102] is an exact algorithm for finding optimal solutions to combinatorial problems that works basically by producing convergent lower and upper bounds for the optimal solution using an implicit enumeration scheme. A different approach to optimization is provided by evolutionary algorithms (EAs) [2–4]. These are powerful heuristics for optimization problems based on principles of natural evolution: namely, adaptation and survival of the fittest. Starting from a population of randomly generated individuals (representing solutions), a process consisting of selection (promising solutions are chosen from the population), reproduction (new solutions are created by combining selected ones), and replacement (some solutions are replaced by new ones) is repeated. A fitness function measuring the quality of the solution is used to guide the process.
A key aspect of EAs is robustness, meaning that they can be deployed ...
Become an O’Reilly member and get unlimited access to this title plus top books and audiobooks from O’Reilly and nearly 200 top publishers, thousands of courses curated by job role, 150+ live events each month,
and much more.
Read now
Unlock full access
More than 5,000 organizations count on O’Reilly
O’Reilly covers everything we've got, with content to help us build a world-class technology community, upgrade the capabilities and competencies of our teams, and improve overall team performance as well as their engagement.Julian F.
I wanted to learn C and C++, but it didn't click for me until I picked up an O'Reilly book. When I went on the O’Reilly platform, I was astonished to find all the books there, plus live events and sandboxes so you could play around with the technology.Addison B.
I’ve been on the O’Reilly platform for more than eight years. I use a couple of learning platforms, but I'm on O'Reilly more than anybody else. When you're there, you start learning. I'm never disappointed.Amir M.
I'm always learning. So when I got on to O'Reilly, I was like a kid in a candy store. There are playlists. There are answers. There's on-demand training. It's worth its weight in gold, in terms of what it allows me to do.