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