Skip to main content
SpringerLink
Log in

Differential Evolution: A Handbook for Global Permutation-Based Combinatorial Optimization

  • Book
  • © 2009

Overview

Editors:
  1. Godfrey C. Onwubolu

    1. Richmond Hill, Canada

    View editor publications

    You can also search for this editor in PubMed   Google Scholar

  2. Donald Davendra

    1. Department of Applied Informatics, Tomas Bata Univerzity in Zlin, Zlin, Czech Republic

    View editor publications

    You can also search for this editor in PubMed   Google Scholar

  • Presents a complete introduction to differential evolution
  • Includes the continuous space DE formulation and the permutative-based combinatorial DE formulation

Part of the book series: Studies in Computational Intelligence (SCI, volume 175)

This is a preview of subscription content, log in via an institution to check access.

Access this book

Log in via an institution
eBook USD 84.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever

Tax calculation will be finalised at checkout

Other ways to access

Licence this eBook for your library

Institutional subscriptions

Table of contents (7 chapters)

  1. Front Matter

    Pages I-XVII
    Download chapter PDF

  2. Motivation for Differential Evolution for Permutative—Based Combinatorial Problems

    • Godfrey Onwubolu, Donald Davendra
    Pages 1-11

  3. Differential Evolution for Permutation—Based Combinatorial Problems

    • Godfrey Onwubolu, Donald Davendra
    Pages 13-34

  4. Forward Backward Transformation

    • Donald Davendra, Godfrey Onwubolu
    Pages 35-80

  5. Relative Position Indexing Approach

    • Daniel Lichtblau
    Pages 81-120

  6. Smallest Position Value Approach

    • Fatih Tasgetiren, Angela Chen, Gunes Gencyilmaz, Said Gattoufi
    Pages 121-138

  7. Discrete/Binary Approach

    • Fatih Tasgetiren, Yun-Chia Liang, Quan-Ke Pan, Ponnuthurai Suganthan
    Pages 139-162

  8. Discrete Set Handling

    • Ivan Zelinka
    Pages 163-205

  9. Back Matter

    Pages 207-213
    Download chapter PDF
Back to top

Keywords

About this book

What is combinatorial optimization? Traditionally, a problem is considered to be c- binatorial if its set of feasible solutions is both ?nite and discrete, i. e. , enumerable. For example, the traveling salesman problem asks in what order a salesman should visit the cities in his territory if he wants to minimize his total mileage (see Sect. 2. 2. 2). The traveling salesman problem’s feasible solutions - permutations of city labels - c- prise a ?nite, discrete set. By contrast, Differential Evolution was originally designed to optimize functions de?ned on real spaces. Unlike combinatorial problems, the set of feasible solutions for real parameter optimization is continuous. Although Differential Evolution operates internally with ?oating-point precision, it has been applied with success to many numerical optimization problems that have t- ditionally been classi?ed as combinatorial because their feasible sets are discrete. For example, the knapsack problem’s goal is to pack objects of differing weight and value so that the knapsack’s total weight is less than a given maximum and the value of the items inside is maximized (see Sect. 2. 2. 1). The set of feasible solutions - vectors whose components are nonnegative integers - is both numerical and discrete. To handle such problems while retaining full precision, Differential Evolution copies ?oating-point - lutions to a temporary vector that, prior to being evaluated, is truncated to the nearest feasible solution, e. g. , by rounding the temporary parameters to the nearest nonnegative integer.

Editors and Affiliations

  • Richmond Hill, Canada

    Godfrey C. Onwubolu

  • Department of Applied Informatics, Tomas Bata Univerzity in Zlin, Zlin, Czech Republic

    Donald Davendra

Bibliographic Information

Publish with us

Policies and ethics

Back to top

Search

Navigation