COLD STORAGE SYSTEM

(COMPUTERISED SCM)
SYNOPSIS
CONTENTS
What is a cold chain?
Entity-Relationship DIAGRAM

Data Flow Diagram

MODULE WISE DESCRIPTION
CONCLUSION
WHAT IS A COLD CHAIN?

A cold storage is a temperature controlled supply chain

An unbroken cold chain is an uninterrupted series of refrigerated production, storage and
distribution activities
Equipment and logistics which are required to maintain a low temperature are
associated with a cold chain
It is used to preserve and to extend the shelf life of products, such as:
fresh agricultural produce, seafood, frozen food,
photographic film,
chemicals, and pharmaceutical drugs
 Entity-Relationship Diagram

BACK
Data Flow Diagram
BACK
MODULE INVENTORY

Administrator Facing Module

Location of cold storage, type of goods & quantity of goods which need to be
stored in cold storage are taken as input from Allocation module
Interacts with module Allocation
Updates storage details in inventory database
Sends Allocation module, cold storages in that locality having free space & amount
of free space in each of the cold storages.

ER DIAGRAM DFD
 ALGORITHM FOR FINDING BEST 3
PLACES FOR SPACE UTILIZATION
FORMULA

Storage space in cold storage =

Pallets stored at the Ground level * Pallet
module size

Pallets stored at the ground level =

Number of pallets needed to store a certain
good / ( Number of levels needed to stack
a certain good * Division of pallets structure
)

Pallet module size = Pallet module width

* Pallet Module length
MODULE ALLOCATION

User(Provider) Facing Module

Takes input from provider
Interacts with modules warehouse
Updates allocation details in allocation database
Sends request to Transportation module to create route details by taking data from
allocation database
*Provider: The individual or entity supplying perishable products to our establishment

ER DIAGRAM DFD
 ALGORITHM FOR
ALLOCATION
While(1) {
1. WaitForEvent();
2. If(Event(UserRequest))
a. If(AtomicEvent==true)

i. createProcess();
b. else

i. createThread();
}
createProcess() {
1. Take Information from inventory;
2. Calculate min cost;
3. Create transportation details();
4. Update allocation table();
5. Send request to transportation;
}
createThread() {
1. Create a thread;
2. Take Information from inventory;
3. Calculate min cost;
4. Create transportation details();
5. Update allocation table();
6. Send request to transportation;
}
 MODULE
TRANSPORTATION
The demand of trucks is not always
met by supply at a node
We efficiently route the trucks to
meet the demand
The problem can be abstracted as
a graph theory problem where city
is node and edge is road
Each edge has a weight
We use the formula
Normalised weight = (Normalised
weight*distance covered)

ER DIAGRAM DFD
Problem 1: Route every truck efficiently to meet every requests made. We greedily
schedule the trucks with respect to the minimum cost that will be needed.

Problem 2: How exactly the sharing takes place?

Keep track of every truck passing through a city . If space available in them again
greedily allocate them the truck.

Problem 3: Give an estimate of time complete delivery of the goods will be made.
Take note of last scheduled jobs in normal case and during sharing , the one to finish later
will be total time taken for a complete job.
 MODULE DISTRIBUTION

One of the important purposes of this project is to regulate the input

output flow of goods in a cold storage system.

This module is an user facing module which, takes input from a

wholesaler about the amount of product he/she wants to buy and the
source and destination cities.

It gives the output to the transportation module specifying the source

and destination with the shortest route between them.

ER DIAGRAM DFD
Algorithmic Approach
For Efficient Distribution
Input taken from consumer.

Location pin pointed.

Nearby cold storage is searched first in adaptable radius. Data

taken from Cold Storage Database. If no cold storage found,
then redo step 3 with next adaptable radius.

Check for availability of product in cold storage from Inventory

database. If product unavailable go to step 3.

Routes calculated expressways, national highway, and state

highway. If distance less than shortest route (which is initially
INFINITY) then go to step 6 else go to step 3.

Check quantity of food to be sent. If it is large enough go to step

8 else wait until large enough quantity (i.e., redo steps 1-5) is
demanded on route and go to step 7.

If drop points and pick up points are multiple calculate all routes
possible and hence calculate the shortest route possible using
Dijkstras Algorithm.

Send the shortest route to transportation module with exact

pickup and drop points and go to step 1 for next input.
SCREENSHOTS

HOMEPAGE
DEMONSTRATION
LOGIN PAGE
COLD STORAGE DETAILS
SEARCH RESULTS
INFRASTRUCTURE PAGE
SIGN UP PAGE
CONFIRMATION
RECIPT
RATE CHART
LOG OUT
BUY ITEM
CONCLUSION
Hence, the benefits from the project are:~

Enhanced transparency

Efficient algorithms replace rule of thumb

Maintenance of steady supply of goods

Less fluctuation of commodity price