Ant colony optimization for dynamic combinatorial optimization problems

Ant colony optimization for dynamic combinatorial optimization problems

For access to this article, please select a purchase option:

Buy chapter PDF
(plus tax if applicable)
Buy Knowledge Pack
10 chapters for £75.00
(plus taxes if applicable)

IET members benefit from discounts to all IET publications and free access to E&T Magazine. If you are an IET member, log in to your account and the discounts will automatically be applied.

Learn more about IET membership 

Recommend Title Publication to library

You must fill out fields marked with: *

Librarian details
Your details
Why are you recommending this title?
Select reason:
Swarm Intelligence - Volume 1: Principles, current algorithms and methods — Recommend this title to your library

Thank you

Your recommendation has been sent to your librarian.

The ant colony optimization (ACO) meta-heuristic was inspired from the foraging behaviour of real ant colonies. In particular, real ants communicate indirectly via pheromone trails and find the shortest path. Although real ants proved that they can find the shortest path when the available paths are known a prior, they may face serious challenges when some paths are made available after the colony has converged to a path. This is because the colony may continue to follow the current path rather than exploring the new paths in case a shorter path is available. For the ACO meta-heuristic, the challenges are similar when applied to dynamic optimization problems (DOPs). Once the algorithm converges, it loses its adaptation capabilities and may have poor performance in DOPs. Several strategies have been integrated with ACO to address difficult combinatorial DOPs. Their performance proved that ACO is a powerful computational technique for combinatorial DOPs once enhanced. This chapter investigates the applications of ACO for combinatorial DOPs.

Chapter Contents:

  • Abstract
  • 5.1 Introduction
  • 5.2 Dynamic optimization problems
  • 5.2.1 DOP definition
  • 5.2.2 Dynamic characteristics
  • 5.2.3 Generate dynamic environments
  • Travelling salesman problem
  • Vehicle routing problem
  • Job-shop scheduling problem
  • Binary-encoded functions
  • Knapsack problem
  • 5.3 Ant colony optimization meta-heuristic
  • 5.3.1 Construct solutions
  • 5.3.2 Local search
  • 5.3.3 Pheromone update
  • 5.3.4 Main ACO algorithms
  • MAX–MIN ant system
  • Ant colony system
  • Population-based ant colony optimization
  • 5.4 ACO for DOPs
  • 5.4.1 Increasing diversity after a change
  • 5.4.2 Maintain diversity during the execution
  • 5.4.3 Memory schemes
  • 5.4.4 Multi-colony schemes
  • 5.4.5 Hybridizations
  • 5.4.6 Discussion
  • 5.5 ACO in real-world DOP applications
  • 5.6 Conclusions
  • Acknowledgement
  • References

Inspec keywords: combinatorial mathematics; search problems; ant colony optimisation

Other keywords: ACO meta-heuristic; ant colony optimization meta-heuristic; dynamic combinatorial optimization problems; combinatorial DOP; foraging behaviour

Subjects: Optimisation techniques; Combinatorial mathematics; Optimisation techniques; Combinatorial mathematics

Preview this chapter:
Zoom in

Ant colony optimization for dynamic combinatorial optimization problems, Page 1 of 2

| /docserver/preview/fulltext/books/ce/pbce119f/PBCE119F_ch5-1.gif /docserver/preview/fulltext/books/ce/pbce119f/PBCE119F_ch5-2.gif

Related content

This is a required field
Please enter a valid email address