Products Allocation Optimization using Jellyfish

Search Algorithm

Presented by:
Ahmed Hashem Yahya, M.Sc. Student
1

Ali kalakech, Ph.D.

 Outline

01 Introduction

02 Objectives

03 Problem Statement

04 Possible Solution

05 Proposed Algorithm

06 Implementation and Results

07 Conclusion and Future Work

1
Introduction

 Product allocation coordinates the availability of products with the demand in

order to fulfill orders in the most timely and cost-effective manner.

 The Product Allocation Problem (PAP) mainly concerns with: Stockout and
Overstock

2
 Objectives

01 Maximize the profit while simultaneously reducing the cost.

02 Investigate solutions for the product allocation in multi-warehouses

Determine the optimal allocation for distribution of the products to N storage warehouses.
03

3
Problem Statement

 Study the effectiveness of the artificial Jellyfish search algorithm to solve product
allocation problem (PAP) for multi-warehouse supply chain.

 The new product allocation problem (PAP) optimization algorithm is proposed by

combining:
• Logistic chaotic map
• Modified artificial Jellyfish search optimization algorithm

4
 Product Allocation Problem

The product allocation problem can be modeled as the following optimization

problem:

Where:
• is a line vector representing the product allocation
• is a line vector representing the expected demands
• is a line vector representing the unit price of a product
• is a line vector representing the unit cost of a product
• The indices of the vectors represent the warehouses

5
 Possible Solutions
 Brute force: Optimal solution intractable for large problems

 Genetic algorithm

 Jellyfish Optimization algorithm

6
 Proposed Solution: Modified Jellyfish Algorithm

Assumptions:
1. All locations starts with zero amount of products
2. Unlimited storage place
3. Upper and lower bounds of product allocation at a given location

The fitness function to be used is given by:

𝑇 𝑇
Fitness Value=min ( 𝑿 , 𝑫 ) . 𝑷 − 𝑿 .𝑪
Motion equations are replaced by crossover/swap mechanism

7
Algorithm Design - Chaotic Logistic Map
The logistic map is one of the most widely recognized 1D chaotic
maps

Its mathematical structure is basic, but its chaotic behavior is complex.

The logistic map is defined as:

where r is a system variable with a value ranging from 0 to 4.

With r ϵ [3.57, 4], the logistic map displays chaotic behavior.

8
Artificial Jellyfish Search Algorithm

9
 Time control mechanism
The time control mechanism is provided by:

• Ocean current: c(t) > C0

• Swarm: c(t) < C0
• Passive: rand(0,1) > (1 - c(t) )
• Active: rand(0,1) < (1 - c(t) )
• Passive motion is more probable at the beginning
• Active motion is the preferred motion later on

10
 Artificial Jellyfish Search Algorithm

1- Jellyfish in ocean, i.e. Initialization:

1

2- Ocean currents:

3- Swarms: Passive or Active motion depending on the time control mechanism

4- Passive motion:

5- Active motion:
Toward Xj

Away from Xj
11
State Representation

State Representation:

A 1D vector X of size N is used as the Jellyfish position

N is the number of locations/warehouses.
The values inside the vector X represent the amount of that product to be allocated for this specific location

12
Modified Jellyfish Algorithm - The Swap Operation
Active motion swap operation: Toward neighbor
Active motion swap operation: Away from neighbor

Randomly selected neighbor

Passive motion swap operation: Swapping of two

random selected elements

13
Modified Jellyfish Algorithm - The Swap Operation

Active motion swap operation: Away from neighbor

• Move away from neighbor if current fitness is better than neighbor

fitness:
1. Find a value inside the current allocation state that matches that
of the neighbor and in the same index
2. Swap with a randomly selected index
3. If no similarity no swap is needed

14
Modified Jellyfish Algorithm - The Swap Operation
Active motion swap operation: Toward neighbor

• Move toward neighbor if his fitness is better than current fitness:

1. Randomly select an index within the neighbor representation
2. Search for the index inside the current representation having the
same value as the selected neighbor index
3. Swap the two indices within the current allocation state
4. If no similarity no swap is needed

Note: Moving with ocean current is basically an active move toward the Jellyfish with
the best fitness function

15
Results: Scenario
Given:

W 1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20

D 110 218 221 12 155 198 110 38 100 160 231 83 18 178 133 7 98 108 23 218

P 20 27 25 22 34 28 32 20 21 28 34 36 36 21 20 30 21 23 25 20

C 18 23 20 22 19 22 25 18 19 23 22 23 26 22 25 22 22 18 18 23

Product:
X 13 20 23 25 36 86 96 105 111 116 118 133 161 165 184 200 222 224 226 237

16
Results:
N=9, Jellyfish iterations 600
Algorithm Fitness Computation Time in seconds
Brute Force 5962 4.2
GA 5962 2.8
Jellyfish 5962 0.3

N=10, Jellyfish iterations 600

Algorithm 3 Fitness Computation Time in seconds
Brute Force 6663 34
GA 6663 2.9
Jellyfish 6663 0.33
18

N=11, Jellyfish iterations 600

Algorithm Fitness Computation Time in seconds
Brute Force 9303 220
GA 9303 3.1
Jellyfish 9303 0.35

17
Results:
Variable N
N 12 15 20
Fitness GA 10313 9400 8957
Time GA 3.2 3.37 3.5
Fitness Jellyfish 10313 9400 8957
Iteration Jellyfish 600 600 5000
Time Jellyfish 0.35 0.36 1.1

N=100, Jellyfish iterations 5000

Algorithm Fitness Time in seconds
GA 42751 3-4
Jellyfish1 48844 5-7
Jellyfish2 45770 3-4

18
Results:

20

5 sec 1 sec 1 sec 1 sec

19
Proposed Allocation State Information

20
 Conclusion and Future Work

• A modified Jellyfish algorithm is proposed for the PAP in multiple warehouses

• The proposed algorithm provided comparable results with GA algorithm and with better
computational complexity for small problems

• For large problem the modified Jellyfish algorithm provided better results for the given parameters

• Optimizing the number of Iterations based on the problem size

• Variable allocations based on the original Jellyfish algorithm is to be studied

21
THANK YOU
F O R Y O U R AT T E N T I O N