Optimization Algorithms & Graph Structures Agenda: 6:00 - 6:15: Welcome 6:15 – 7:00: Inventory Optimization 7:00- 7:30 : Graph Databases 7:30 - 8:00: Networking + Q&A

1. Data Science | Design | Technology
(October 24, 2017)
https://www.meetup.com/DSDTMTL
1

2. Agenda 6:00 - 6:15: Welcome
6:15 - 7:00: Inventory Optimization
7:00 - 7:30: Graph Databases
7:30 - 8:00: Q&A + Networking
2
Optimization Algorithms & Graph
Structures
Tools for Better Decision Making

3. Tools for Better
Decision Making
Inventory
Optimization
Data Science | Design | Technology 3
(Source: https://en.wikipedia.org/wiki/Markov_decision_process)

4. 4
INVENTORY OPTIMIZATION :
HOW TO DEAL WITH SLOW-MOVING ITEMS

5. WHAT IS INVENTORY
OPTIMIZATION?
You all do it!

6. 0
10
20
30
40
50
60
demand inventory total inventory
WHAT IS INVENTORY OPTIMIZATION?
s
S
LEADTIME
PREDICTIVE
PRESCRIPTIVE

7. 0
10
20
30
40
50
60
demand inventory total inventory
WHAT IS INVENTORY OPTIMIZATION?
s
S
LEADTIME

8. FORECASTING
Predictive

9. 0
5
10
15
20
25
30
8/8/2017 8/22/2017 9/5/2017 9/19/2017 10/3/2017 10/17/2017 10/31/2017 11/14/2017
Fast moving sales

10. Up to
75%*
of Retail products
are slow Moving
*https://smartech.gatech.edu/bitstream/handle/1853/13469/Managing%20Slow%20Moving%20Perishables%20in%20the%20
Grocery%20Industry.pdf
SLOW-MOVING ITEMS
Slow-movers are products with very
low sales, maybe one unit per week
or even less.
They are important!

11. Where are slow-movers?

12. 0
1
2
3
8/8/2017 8/22/2017 9/5/2017 9/19/2017 10/3/2017 10/17/2017 10/31/2017 11/14/2017
Slow moving sales

13. 0
1
2
3
8/8/2017 8/22/2017 9/5/2017 9/19/2017 10/3/2017 10/17/2017 10/31/2017 11/14/2017
Slow moving sales
0 1 2
0 1 2 3
0 1 2

14. MAXIMUM LIKELIHOOD
ESTIMATION
1
6
1
1

15. MAXIMUM LIKELIHOOD
ESTIMATION
What is the cause most likely to
produce the observed effect.

16. 0
1
2
3
8/8/2017 8/22/2017 9/5/2017 9/19/2017 10/3/2017 10/17/2017 10/31/2017 11/14/2017
Slow moving sales
0 1 2
0 1 2 3
0 1 2
MAXIMUM LIKELIHOOD
ESTIMATION

17. OPTIMIZATION
Prescriptive

18. S
s
Time
But we want the best (s, S) policy!
It must minimize costs and match a service level.
INVENTORY
OPTIMIZATION
(s, S) Policy
When the inventory contains s or less items, an
order is made to reach level S.

19. Order &
shipping cost
Inventory cost Backorders

20. Service level
80%

21. DEMAND
FORECAST
INVENTORY OPTIMIZATION FULFILLMENT
Demand distribution profile
Normal Poisson
(mean, variance) (mean)
Stationary (long term)
demand distribution
Lead time distribution profile
Normal Poisson
(mean, variance) (mean)
Uncertainty profiles
selection
Optimization Inventory
Policy
(s, S)
TRADITIONAL
INVENTORY
OPTIMIZATION

22. Slow moversFast movers
SLOW-MOVERS VS
FAST MOVERS

23. 23
Markov Decision Process vs traditional inventory optimization
Normal Poisson
(mean, variance) (mean)
Uncertainty profiles selection
(s, S)
Optimization Inventory Policy
DEMAND
FORECAST
INVENTORY OPTIMIZATION FULFILLMENT
EOQ
ROP
DISCRETE DEMAND
DISTRIBUTION
PERIOD 1 PERIOD 2 PERIOD 3
1
+0
+1
+2
+3
-1
0
1
2
3
-1
0
1
2
3
2
1
0
3%
20%
77% 1
0
50%
50%
+0
+1
+2
+3
1
0
50%
50%
MARKOV DECISION PROCESS
Empirical Distribution
Distributional Forecast
0 4 5 6 7 10 25
qty
probability
35%
30%
5% 5%
10% 10%
5%
OR

24. MARKOV DECISION PROCESS
• Andrey Andreyevich Markov
• Based on
• the probability to transition from one state to
another
• the possible actions
• The cost associated to each state and action
• What is the best action at each state?
STATES
ACTIONS
INVENTORY QUANTITIES
DEMAND DISTRIBUTION
ORDER QUANTITIES
INVENTORY COSTS
TRANSITIONS
REWARDS

25. 25
2
1
0
3%
20%
77%
Period 2 Period 3
STATES
ACTIONS
INVENTORY QUANTITIES
DEMAND DISTRIBUTION
ORDER QUANTITIES
1
INVENTORY COSTS
TRANSITIONS
REWARDS
0
-1
1
2
3
4
INDIVIDUAL ITEM AT A SINGLE LOCATION OVER 3 PERIODS
MARKOV DECISION PROCESS
2
1
0
3%
20%
77%
2
1
0
3%
20%
77%
0
-1
1
2
3
4
+ 0
+ 1
+ 2
+ 3
Period 1
$60
$60
$60
$10

26. 26
Period 2 Period 3
2 3%
STATES
ACTIONS
INVENTORY QUANTITIES
DEMAND DISTRIBUTION
ORDER QUANTITIES
1
INVENTORY COSTS
0
-1
1
2
3
4
+ 0
+ 1
+ 2
+ 3
$60
$60
$60
$10
Period 1
TRANSITIONS
REWARDS
0
-1
1
2
3
4
+ 0
+ 1
+ 2
+ 3
$1050
$1050
$1050
$1000
INDIVIDUAL ITEM AT A SINGLE LOCATION OVER 3 PERIODS
MARKOV DECISION PROCESS

27. 27
1
0
50%
50%
Period 2 Period 3
STATES
ACTIONS
INVENTORY QUANTITIES
DEMAND DISTRIBUTION
ORDER QUANTITIES
1
INVENTORY COSTS
0
-1
1
2
3
4
+ 0
+ 1
+ 2
+ 3
$60
$60
$60
$10
Period 1
TRANSITIONS
REWARDS
0
-1
1
2
3
4
2 3%
+ 0
+ 1
+ 2
+ 3
$60
$60
$60
$10
0 20%
1 77%
1
0
50%
50%
INDIVIDUAL ITEM AT A SINGLE LOCATION OVER 3 PERIODS
MARKOV DECISION PROCESS

28. 28
Period 2 Period 3
STATES
ACTIONS
INVENTORY QUANTITIES
DEMAND DISTRIBUTION
ORDER QUANTITIES
2
1
0
3%
20%
77%
1
INVENTORY COSTS
0
-1
1
2
3
4
+ 1
$60
Period 1
TRANSITIONS
REWARDS
1
0
50%
50%
+ 0
$10
1
0
50%
50%
+ 0
$20
1
0
50%
50%
+ 3
$60
+ 2
$50
+ 0
$20
+ 3
$60
+ 0
$30
0
-1
1
2
3
4
3%
32%
47%
18%
0
-1
1
2
3
4
INDIVIDUAL ITEM AT A SINGLE LOCATION OVER 3 PERIODS RESULT: DYNAMIC POLICY
MARKOV DECISION PROCESS

29. 29
2
1
0
3%
20%
77%
STATES
ACTIONS
TRANSITIONS
REWARDS
INVENTORY QUANTITIES
DEMAND DISTRIBUTION
EXPECTED LEADTIME
ORDER QUANTITIES
2
1
0
3%
20%
77%
INVENTORY COSTS
2
1
0
3%
20%
77%
0
-1
1
2
3
4
+ 0
+ 1
+ 2
+ 3
$60
$60
$60
$10
INDIVIDUAL ITEM AT A SINGLE LOCATION STEADY STATE
0
-1
1
2
3
4
MARKOV DECISION PROCESS

30. 30
2
1
0
3%
20%
77%
STATES
ACTIONS
TRANSITIONS
REWARDS
INVENTORY QUANTITIES
DEMAND DISTRIBUTION
EXPECTED LEADTIME
ORDER QUANTITIES
2
1
0
3%
20%
77%
INVENTORY COSTS
2
1
0
3%
20%
77%
0
-1
1
2
3
4
+ 0
+ 1
+ 2
+ 3
$70
$70
$70
$20
INDIVIDUAL ITEM AT A SINGLE LOCATION STEADY STATE RESULT: STATIC POLICY
INVENTORY
QUANTITY -1 0 1 2 3 4 5 6
OPTIMAL ORDER
QUANTITY 6 6 5 4 0 0 0 0
(2, 6)
0
-1
1
2
3
4
WHAT IS THE SERVICE LEVEL????
MARKOV DECISION PROCESS

31. Initial states
Final states
Demand probabilities:

32. Expected service level
Order 0 unit
State Expected service level
-2 (1 – 0.0169 – 0.2262) = 0.7569
-1 (1 – 0.0169 – 0.2262) = 0.7569
0 (1 – 0.0169 – 0.2262) = 0.7569
1 (1 – 0.0169 - 0 ) = 0.9831
2 (1 – 0 – 0) = 1.0
… …

33. Inventor optimization is about balancing cost and
service level
Slow movers are a large part of most inventories
They must be handled differently than fast movers
• Through better forecast
• Specialized optimization algorithms
CONCLUSION

34. Tools for Better
Decision Making
Graph Databases
Data Science | Design | Technology 34
(Source: http://docs.janusgraph.org/latest/getting-started.html)

35. Graph Databases,
When Relationships Matter

36. Fraud Detection

37. Recommendation
Engines

38. • Growing processing complexity
• Massive growth in volumes of data
• Greater demand
• Real-time processing constraints
Context

39. Can Relational
DBs Do It?

40. • Identify patterns of relationships between records
• Join relevant tables together
• Number of joins can quickly increase
• Wildcard search cannot be done using SQL queries
Can Relational
DBs Do It?

41. Graph DBs to the
Rescue

42. • A database management system with CRUD
operations working on a graph data model
• Part of the NoSQL family
• Graph data model: composed of vertices, edges and
attributes
• Nodes represent entities
• Edges represent associations between vertices
What is a Graph
Database?

43. Fraud Detection

44. • Neo4j: most popular graph database
• JanusGraph: graph framework with a variety of
storage (BigTable, HBase and Cassandra) and
indexing (Elasticsearch, Solr and Lucene)
backends
• ArangoDB: multi-model (graph, document and
key-value) database
Popular Graph
Databases

45. Let’s Try It On The Cloud

46. • Low latency
• Horizontal autoscaling
• Resilient
Requirements

47. • Configuration 1: Single-node Neo4j DB
• Configuration 2: JanusGraph with a single-node
Cassandra backend
• Configuration 3: JanusGraph with a 3-node HBase
backend
• DB and Java application running on the same
Kubernetes cluster
What We Have
Tried

48. Results Neo4j JanusGraph
Resilience HA cluster with a master-
slave replication setup.
Traffic can be directed to
slave as a failover plan.
Available only in
Enterprise Edition.
Both Cassandra and
HBase provide a
replication mechanism.
Traffic can be directed to
a second JanusGrpah
instance.
Horizontal Autoscaling - Additional nodes can be added at runtime to a HA
cluster
- Both Kubernetes and GKE support horizontal
autoscaling
- Disks cannot be dynamically provisioned on
Kubernetes
Querying the Database - Cypher query
language
- Drivers
- Gremlin query
language
- Java driver

49. • Powerful in analyzing relationships
• Cannot be used as a main data store
• Adds more complexity to code (transaction
management)
• Cluster management requires admin knowledge
• HBase requires knowledge of the Hadoop
ecosystem
• Current stable Kubernetes supports only CPU
autoscaling
Lessons Learned
Based on our constraints
and experiments

50. Demo

51. • BigTable as a backend
• Voice commands
• ArangoDB
Future Work

52. • Meetup group created in April 2017
• Now 952 members (Oct 24th)
• One meetup per month.
• This is your meetup! Propose topics
you would like to present
Data Science | Design | Technology

53. 53
members…..Once we reach
… one lucky participant of our
meetups will win a prize!
Invite your friends to join
the DSDT group

54. Next
Meetup
Nov 14
54
Co-presentation on cloud data
streaming with

55. Merci / Thank You
55
@jdalabsmtl
Data Science | Design | Technology
(Check for next DSDT meetup at https://www.meetup.com/DSDTMTL)