A COMPARATIVE STUDY ON THE EFFECTIVENESS OF DIJKSTRA AND GREEDY

ALGORITHM ON MOBILE BASED GROCERY ITEM LOCATOR WITH AISLE

MAPPING


By
Kim Paulene A. Opulencia
John Kenneth Anderson Deriquito


Submitted in partial fulfilment of the requirements for the degree of
Bachelor of Science in Computer Science

In the

COLLEGE OF COMPUTER STUDIES

At the
SAN PABLO COLLEGES
Date of submission
June 30, 2014

A comparative study on the effectiveness of Diksjtra and Greedy Algorithm on Mobile
Based Grocery Item Locator with Aisle Mapping

ABSTRACT

Our smart phones are great at helping us manage our busy lives and doing
regular things like creating your own shopping lists from a grocery store. In recent
years, the basic shopping list has evolved into a variety of tools and mobile applications,
each with different improvements over the classic pen and paper version. All of these
tools have great ideas but no mobile android application has done an item locator for a
grocery.
We propose a mobile based grocery item locator application for android phones
that will be done through the use of greedy algorithm. Greedy algorithm is any algorithm
that follows the problem solving metaheuristic of making the locally optimal choice at
each stage with the hope of finding the global optimum. This kind of algorithm will be
used by means of this application that combines shopping list functionality with saving
time by using its feature that will get the possible shortest path of every item in a
shopping lists but in order to achieve this, users need to create or setup first the
supermarket aisle mapping to determine the items in-store location.
Supermarket aisle mapping is like designing your prototype grocery in your
android phones that will locate you the nearest way to get the items in your lists. It is
flexible because you can save different groceries prototype on your phones. This app
also will let its users to create and manage shopping lists. Grocery item locator handles
this all for you and even calculating the item prices so that you can monitor your budget.
It will support all this great functionalities and can be among the best grocery friendly
application.



















INTRODUCTION

A Greedy algorithm is any algorithm that follows the problem
solving metaheuristic of making the locally optimal choice at each stage with the hope of
finding the global optimum.It will choose the location within the closest distance step by
step from starting location until found a destination while Dijkstra's algorithm computes
length of the shortestpath from the source to each of the remaining vertices in the
graph.This algorithm locates the closestpath with thelowest cost distancefrom the initial
point considering many factors like cost, maximum speed etc.The way Djikstra's
Algorithm work is similar to the underlying principle of Greedy Algorithms.

The purpose of this study is to find possible shortest path of every item in their
respective aisle in a grocery with Greedy and Dijkstra Algorithm. This is amobile
application for android phonesthat will let the users to create and manage shopping lists
anddesign their own supermarket prototype called aisle mapping. This aisle mapping
norm is like an in-store map of the different sections or aisles inside the grocery.Users
allow in making their own designs of the grocery sections depending on how they see
groceries manage their aislesand make changes on itbecause this feature is
customizable. Users need to set or select their starting pointfirst from the shopping lists
they made and the starting node will be like a circle green then it will generate and
locate the next nearest itemsfrom it.From the point of origin, the shortest path of the
items will be shown in a red line.The application is flexible because it will save different
supermarket prototypes in a databaseand an additional feature is,it willalso compute
items price total as the users input it to theapplication to monitor their budget.

Now, we can know the advantages and disadvantages of Greedy and Dijkstra
Algorithm will be tackled to find the shortest location and arrived the best solution
possible from the two algorithms, it will then be compared and proposed to be used in
the final functionality of mobile grocery locator with aisle mapping.












OBJECTIVES OF THE STUDY
Understand the searching behaviour of Greedy Algorithm to locate the shortest
direction
Understand the searching behaviour of Dijkstra Algorithm to locate the shortest
direction
Determine the advantages and disadvantages of Greedy and Dijkstra Algorithm
in locating the shortest path
Compare the study between Greedy Algorithm and Dijkstra Algorithm and opt
which of these two algorithm could be better of use to the proposed application









REVIEW OF RELATED LITERATURE


In this literature review, we study and analyze differentshortest path problems.
According to the site wolfram.com Shortest Path Problem (SPP) is the problem of
finding the shortest path (a.k.a. graph geodesic) connecting two specific vertices (u, v)
of a directed or undirected graph. The length of the graph geodesic between these
points is called the graph distance between and .On the other hand, SPP
defined by Wikipedia ascan be defined for graphs whether undirected, directed, or
mixed. Itis defined here for undirected graphs; for directed graphs the definition of path
requires that consecutive vertices be connected by an appropriate directed edge.
Common algorithms for solving the shortest path problem include the Greedy Algorithm
and Dijkstras Algorithm.
One of the related problems of SPP is Travelling Salesman Problem (TSP).This
TSPis an NP-hard problem in combinatorial optimization studied in operations
research and theoretical computer science. Given a list of cities and their distances, the
task is to find a shortest possible tour that visits each city exactly once.TSP can be
modelled as an undirected weighted graph, such that cities are the graph's vertices,
paths are the graph's edges, and a path's distance is the edge's length. It is a
minimization problem starting and finishing at a specified vertex after having visited
each other vertex exactly once. Often, the model is a complete graph(i.e. each pair of
vertices is connected by an edge). If no path exists between two cities, adding an
arbitrarily long edge will complete the graph without affecting the optimal tour.
By looking into action item tracking software programs, you can keep track of all
those things to do that you need to track down in a much easier and streamlined way.
Action items are like tasks or "to dos" only they are associated with a project. An action
item might be programming a certain amount of code, or it might involve calling
someone to follow up on a marketing quote. While you can use many android
applications readily available on your phone that will make life easier, you can also find
many action item tracking programs that are already set up for the specific purpose of
tracking your action items.

When looking into action item software for your projects, be sure to look for
software that is compatible with project management - especially if you have action
items from different projects to track. There are many software programs like
Remember the Milk, but these programs are not necessarily project-manager friendly.
These are the programs are friendly and compatible with anyones need that is kind of
related and hopefully will be useful to this thesis topic.
Toodledo allows you to track your action items and arrange action items by
project, or goal. The great thing about Toodledo is it allows users to do a variety of
action item tracking activities, including scheduling action item deadlines and giving
different action items different priorities. Toodledo works on the iPhone and other mobile
devices, and you can access your action item list from any computer. This kind of
applications adds value to Cognos Applications and Deployments.
Pros:
Toodledo offers an easy solution for organizing action items and tasks
Toodledo allows you to take your action items list with you wherever you go
Toodledo allows you to set alarms and reminders for action items
Cons:
While inexpensive, Toodledo only stores your completed action items for 6 months
in the free version
You cannot import action items from project management software programs
Nozbeis a program that allows users to track action items associated with
contexts and organize action items in terms of projects. This can be a great help, as not
only can you track what project an action item is associated with, but you can also track
what context the item should be part of. For example, phone calls, office, home, email,
and errands can all be considered contexts.
Pros:
Nozbe allows users to work in a variety of contexts - this makes it easier to group
action items by type
Nozbe allows users to track projects and to group actions based upon projects
Nozbe is easy to use and those using the program can find much support for the
program's use
Nozbe's free newsletter offers many great productivity tips
Create tasks and action items from emails




Cons:
The program is costly, so if you're unsure you will use it, you may want to stick to the
free trial
The program doesn't interface with project management software programs

VIP Task Manager Professional is a great tool for managing action items related
to projects. This program allows users to create elaborate work breakdown structures,
associate resources with each action item, track the history of the action item, make
comments, and ensure due dates are assigned for each item. The program also
features multiple templates for your tasks and for your project scheduling.You can also
manage your tasks in the manner that works best for you: either in the calendar view or
the task list view. Finally, you can add you own custom fields to meet your needs.
Pros:
Notifications are sent by email
You can create different sets of permissions for different users
Customizable
Get the ability to make calculations
Cons:
Too expensive for just the home office worker
The user interface isn't as attractive as it is in some of the other programs on the
market

ActionHerois an on-demand action item tracking application. This application
allows users to see the status of any action item on the dashboard. Additionally, you
can go through past items that you have already marked as completed. Categorize
tasks by type, manage users, and store documents associated with the different tasks.
Assigning tasks to human resources is made easy due to the ability to group connected
tasks together and have them assigned to one person.
Moreover, if you have made a work breakdown structure using Microsoft Excel (or
another spreadsheet creation program), you can then import the spreadsheet into
ActionHero, thus saving you a significant amount of time.
Pros:
The program is delivered on demand so you can access your information no matter
what computer you are using
Create an unlimited number of projects
Keep a trail of action items
Customize the interface
Effectively manage resources and action items
Import defined action items from a spreadsheet program
Cons:
ActionHero is quite expensive, so small businesses will want to use a different
program
ActionHero may have too many features for those who want a more straightforward
approach to action item tracking software
Pocket Plan by Twiddlebit is a program where you can track your action items.
What makes this program unique is that it was specifically created for use on Palm
Pilots and other mobile devices. The program works both by itself as a standalone
action item tracker that also allows you to create Gantt charts and schedule for holidays,
and it can be used with Microsoft Project as a companion program. You can use this
program to access all your MS Project files on your mobile device.
Pros:
Carry your action items everywhere with you and track progress on the completion
of various tasks
Interface with MS Project
Use the program both on your mobile device and on your desktop
Cons:
For updated tracking of project progress first you must be sure that you update the
program every time you sync with your desktop
If everyone uses this program, reports might not be completely up to date in terms of
action item progress.







REFERENCES

http://www.cs.nyu.edu/courses/summer07/G22.2340-
001/Presentations/Puthuparampil.pdf
http://www.c3.lanl.gov/mega-math/gloss/compute/greedy.html
http://apps.topcoder.com/forums/?module=Thread&threadID=783211&start=0&mc=4
http://mathworld.wolfram.com/ShortestPathProblem.html
http://en.wikipedia.org/wiki/Shortest_path_problemhttps://www.princeton.edu/~achaney/
tmve/wiki100k/docs/Travelling_salesman_problem.html
SYNTHESIS


The literature cited serves as the basis of study about the effectiveness of greedy
algorithm and dijsktra algorithm in the grocery item locator that will manage and create
the shopping list, to design their supermarket prototype and provide the shortest path of
the android application.
The review of related literature supported the study by providing the necessary
key points in the research like; how the grocery item locator will be analyze using the
greedy and dijsktra algorithm and what will be the purpose and uses of this grocery item
locator.

THEORETICAL FRAME WORK

INPUT PROCESS OUTPUT








Figure 1 Shows that the input, process and output can be used by the user in anytime.
-User
-Name of store
-List of Goods/Items
-Section of Goods
-Payment

-Read all the goods
-Using the greedy
algorithm and dijsktra
find/compute the
shortest path
-Aisle mapping to
reconstruct the
sections



-All the goods have
bought
-The shortest path have
proven


Conceptual Framework

This study focuses on how the application will be run using the greedy algorithm
and dijkstra algorithm with aisle mapping and to allow the user to create and manage a
customizable grocery sections and lists of items.









Figure 2 Shows that the Computation of Greedy and dijkstra Algorithm also the aisle
mapping focuses the study.
Greedy/Dijkstra
computation
Aisle mapping

USER
Input grocery items
FRAMEWORK OF
THE APPLICATION