0% found this document useful (0 votes)
23 views21 pages

Crow Search Algorithm

The document outlines the Crow Search Algorithm (CSA), a swarm intelligence algorithm that simulates the behavior of crows in searching for food. It details the initialization and phases of the algorithm, including how crows select hiding positions and interact with each other based on random numbers. Additionally, it discusses the application of CSA in route planning for express delivery vehicles with the objective of minimizing total delivery time and adhering to constraints like vehicle capacity and usage time.

Uploaded by

fkem.ortak
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PPTX, PDF, TXT or read online on Scribd
0% found this document useful (0 votes)
23 views21 pages

Crow Search Algorithm

The document outlines the Crow Search Algorithm (CSA), a swarm intelligence algorithm that simulates the behavior of crows in searching for food. It details the initialization and phases of the algorithm, including how crows select hiding positions and interact with each other based on random numbers. Additionally, it discusses the application of CSA in route planning for express delivery vehicles with the objective of minimizing total delivery time and adhering to constraints like vehicle capacity and usage time.

Uploaded by

fkem.ortak
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PPTX, PDF, TXT or read online on Scribd

Crow Search Algorithm

Swarm intelligence algorithm


Swarm intelligence algorithm

Intelligent
Swarm intelligence algorithm

Intelligent Store Food


Swarm intelligence algorithm

Intelligent Store Food Like to steal


HOW THE ALGORITHM
WORKS
Flow – Chart Representation:
Flow – Chart Representation:
Flow – Chart Representation:
Flow – Chart Representation:
Flow – Chart Representation:
Flow – Chart Representation:
Flow – Chart Representation:
Flow – Chart Representation:
Flow – Chart Representation:
Algorithm Steps:
Initialization:
- Create “N “ many crows (X[i][iter])

- Append random hiding position “mi”


Phases:
- Crows randomly select another crow

- Pursuing crow generates a random


number

- If larger than “AP”, then crow X[i]


will follow
crow X[j] to know m[j]
Else:
Crow X[j] will go to a random spot
m[r]
Algorithm Steps:
Initialization:
- Create “N “ many crows (X[i][iter])

- Append random hiding position “mi”


Phases:
- Crows randomly select another crow

- Pursuing crow generates a random


number

- If larger than “AP”, then crow X[i]


will follow
crow X[j] to know m[j]
Else:
Crow X[j] will go to a random spot
m[r]
Algorithm Steps:
Initialization:
- Create “N “ many crows (X[i][iter])

- Append random hiding position “mi”


Phases:
- Crows randomly select another crow

- Pursuing crow generates a random


number

- If larger than “AP”, then crow X[i]


will follow
crow X[j] to know m[j]
Else:
Crow X[j] will go to a random spot
m[r]
Algorithm Steps:
Initialization:
- Create “N “ many crows (X[i][iter])

- Append random hiding position “mi”


Phases:
- Crows randomly select another crow

- Pursuing crow generates a random


number

- If larger than “AP”, then crow X[i]


will follow
crow X[j] to know m[j]
Else:
Crow X[j] will go to a random spot
m[r]
Route Planning for the Express Delivery
Vehicles
Objective:
Minimize total delivery time cost
- vehicle traveling time
- package processing time
- time cost of using vehicles
Constraints:
- Vehicle capacity
- Vehicle usage time
CSA-based route optimization

You might also like