In my Bio-Computing Course Presentation, I explored Solving the Quadratic Assignment Problem Using Bio-Inspired Algorithms.

What is Quadratic Assignment Problem?

The Quadratic Assignment Problem (QAP) is a well-known combinatorial optimization problem in the field of operations research and computer science. It involves the assignment of a set of facilities to a set of locations in such a way as to minimize the total cost or distance, where each facility has an associated flow and distance to every other facility.

For example, Imagine a situation where you need to assign multiple facilities (like factories) to various locations (such as warehouses). The objective is to find the best way to make these assignments while minimizing the overall cost. This cost is usually computed by adding up the products of the flows between the facilities and the distances to the locations they are allocated.

Table of Contents

  1. What’s QAP? Understanding the Quadratic Assignment Problem (QAP)
  2. Bio-Inspired Algorithms
  3. Solving QAP with:
    • Genetic Algorithm (GA)
    • Ant Colony Optimization (ACO)
    • Particle Swarm Optimization (PSO)
    • Bee Algorithm

🔗Download Slides (in Persian)