MINIMIZING DISTANCE IN DISTRIBUTING PRODUCTS TO SM MARKETS IN CAVITE

A research paper to be submitted to:

Ms. Jovele B. Baccay
Professor, MATH151 – Graph Theory

Submitted by:
Esquillo, Rafael Antonio U.
Jayloni, John Amiel M.
Ternate, Mathew V.
BSE43 – Major in Mathematics

May 29, 2019

 TABLE OF CONTENTS
CHAPTER I: INTRODUCTION .............................................................................................................. 1
1.1. Background of the Study ................................................................................................................. 1
1.2. Conceptual Framework ................................................................................................................... 2
1.3. Statement of the Problem ................................................................................................................ 2
1.4. Significance of the Study ................................................................................................................. 2
1.5. Scope and Limitations ..................................................................................................................... 3
1.6. Definition of Terms .......................................................................................................................... 3
CHAPTER II: METHODOLOGY............................................................................................................ 4
2.1. Research Design ............................................................................................................................... 4
2.2. Research Procedure ......................................................................................................................... 4
2.3. Data Gathering ................................................................................................................................. 4
CHAPTER III: PRESENTATION, ANALYSIS AND INTERPRETATION OF DATA .................... 5
3.1. Results ............................................................................................................................................... 5
3.2. Discussion.......................................................................................................................................... 9
CHAPTER IV: SUMMARY, CONCLUSION AND RECOMMENDATIONS.................................. 10
4.1. Summary......................................................................................................................................... 10
4.2. Conclusion ...................................................................................................................................... 10
4.3. Recommendations .......................................................................................................................... 10
APPENDIX ................................................................................................................................................ 12
BIBLIOGRAPHY ..................................................................................................................................... 16
 CHAPTER I

INTRODUCTION

This chapter includes the background of the study, conceptual framework, statement of the

problem, significance of the study, scope and limitations and definition of terms.

1.1. Background of the Study

Different manufacturers and distributors of products are being transported to different SM

Markets. There are many routes to consider in distributing these products and different permutation

of SM Markets. With that, the researchers are patterned to determine the route that will give the

minimum distance that the distributors and manufacturers will take to deliver their products to SM

Markets in Cavite.

In solving this kind of problem, Traveling Salesman Problem best describe this which is a

type of problem in graph theory. A Traveling Salesman Problem is an algorithmic problem of

finding a minimum cost Hamiltonian cycle in a weighted graph G (Agnarsson & Greenlaw, 2007).

To find the route that will give the minimum distance in which every targeted SM Markets in

Cavite is to be distributed, the algorithm for Traveling Salesman Problem will be best used for this

study.

1
1.2. Conceptual Framework

The researchers made use of the following framework:

INPUT PROCESS OUTPUT

Location of SM Algorithm for Proposed
Markets in Cavite Traveling Salesman Schedule of
Problem Delivery
Distances between
SM Markets in
Cavite

Fig 1. Paradigm of the Study

The input variables for this study will be the location of SM Markets in Cavite and distances

between all SM Markets. The process will be the algorithm in solving the traveling salesman

problem. The output will be the proposed delivery schedule.

1.3. Statement of the Problem

The main objective of this study is to minimize the distance covered in delivering products

to SM Markets in Cavite. With that, this study will answer the following questions:

1.3.1. What are the locations of the selected SM Markets in Cavite?

1.3.2. For each pair of SM Markets in Cavite, what is the minimum distance?

1.3.3. What is the minimum distance covered in delivering products to selected SM Markets in

Cavite?

1.4. Significance of the Study

This study will benefit the following:

2
 1.4.1. Product suppliers of SM Markets. This study will benefit the manufacturers and

distributors that deliver to SM Markets in Cavite. They will determine the minimum

distance to cover in distributing to each SM Markets.

1.4.2. SM Corporation. This study will help the manufacturers to distribute products in SM

Markets that will contribute to the income of SM Corporation.

1.4.3. Further researchers. This study will benefit further researchers that will also conduct study

relating to traveling salesman problem.

1.5. Scope and Limitations

This study investigates the route that will give the distributors the minimum distance in

distributing products to the SM Markets in the province of Cavite. This study does not cover the

time, capacity of the vehicles, and other variables that will take place during the delivery. This

study only covers the 17 out of 19 SM Malls in Cavite as to be shown in the next chapters.

1.6. Definition of Terms

SM Markets. These are the malls owned by the SM Corporation.

Cavite. This is the province in Cavite, Philippines.

Hamiltonian cycle. In graph theory, Hamiltonian cycle is a circuit in which each vertices of

a graph are passed through.

Traveling Salesman Problem. In graph theory, this is an algorithmic problem of finding a

minimum cost Hamiltonian cycle in a weighted graph G (Agnarsson & Greenlaw, 2007).

3
 CHAPTER II

METHODOLOGY

2.1. Research Design

The researchers will utilize the descriptive method that features the description of the

distance that the delivery truck needed to travel one mall to another.

According to QuestionPro Survey Software, descriptive research focuses more on the

“what” of the research rather than they “why” (2019). As seen on the problem statement, the

questions focus on the “what”.

2.2. Research Procedure

The researcher used the Traveling Salesman problem to solve for the minimum distance of

delivering products in SM markets in Cavite. The researchers used the Excel Solver in MS excel

to solve the proper order of SM markets to minimize the distance of round trip.

2.3. Data Gathering

The researchers look for the SM markets in Cavite that most of the supplier deliver

oftentimes. The researchers identified 17 SM markets and in order to come up with an accurate

result, the researcher look for the distance between the SM markets in Cavite using Google Maps.

4
 CHAPTER III

PRESENTATION, INTERPRETATION AND ANALYSIS OF DATA

This chapter presents the findings, analysis and interpretation of the data gathered

regarding the minimizing distance to cover in distributing products to SM Markets in Cavite.

3.1. Results

Problem 1. What are the locations of the selected SM Markets in Cavite?

The researchers picked the following 17 SM Markets in Cavite to be part of this study.

SM Market Location (Google Maps, 2019)

SM Hypermarket Naic Naic, Cavite
SM Hypermarket Primark Town Center, Tagaytay - Nasugbu Hwy,
Tagaytay Tagaytay, 4120 Cavite
SM Hypermarket Imus Emilio Aguinaldo Hwy, Imus, Cavite
SM Hypermarket Kadiwa D-BBB Congressional Road, Dasmariñas, Cavite
SM Hypermarket Molino Barangay Molino IV, Molino IV, Bacoor, Cavite
SM Supermarket Bacoor E.Aguinaldo Hi-way Cor Tirona Hiway, Ilabay, Bacoor,
4102 Cavite
SM Supermarket Governor’s Drive Corner, Aguinaldo Highway, Brgy.
Dasmariñas Sampaloc I, Dasmariñas, Cavite
SM Supermarket Rosario General Trias Drive Corner, Costa Verde Access Road,
Tejeros Convention, Rosario, Cavite
SM Supermarket Trece Governors Drive, cor Capitol Rd, Trece Martires, Cavite
SM Center Imus N.I.A. Rd, Brgy. Alapan IC, Imus, Cavite
SM Savemore Amadeo Amadeo Junction Agrivet Supply, 6, Crisanto M. De
Los Reyes Ave, Amadeo, Cavite
SM Savemore Salitran Emilio Aguinaldo Hwy, Salitran, Dasmariñas, Cavite
SM Savemore Lumina Lumina Point, Emilio Aguinaldo Highway corner,
Nuevo Avenue, Imus, Cavite
SM Savemore Kawit Magdiwang Hwy, Tabon II, Kawit, Cavite
SM Savemore Salawag Molino-Paliparan Road, Salawag, Dasmariñas, Cavite
SM Savemore Lancaster Advincula Avenue, Imus, Cavite
SM Savemore Silang Brgy. Tartaria, Sta. Rosa-Tagaytay Road, Silang, Cavite
Table 3.1. Selected 17 SM Markets in Cavite

5
Problem 2. For each pair of SM Markets in Cavite, what is the minimum distance?

The researchers made the distance matrix below to represent the minimum distances

between each pair of SM Markets. Each SM Market has corresponding letter.

A B C D E F G H I J K L M N O P Q
A 0 36.3 25.7 29.1 28.7 25.1 24.7 14.3 13 24.7 28.2 29.1 26 20 31.1 21.3 43.8
B 36.3 0 37.8 30.6 39.9 46 23.1 38.8 25.1 38.9 9 30.7 38.8 44.6 35.9 40.2 19.6
C 25.7 37.8 0 10 7.1 10.2 14.4 15.5 20.7 3.3 30.9 5.8 3.2 10 10.9 5.5 33.4
D 29.1 30.6 10 0 9 19.4 8.4 19.7 15.8 12.2 24.8 3.9 12.1 18.9 5.9 14.1 27.3
E 28.7 39.9 7.1 9 0 13.2 14.7 18.8 22.1 8 32.7 7.5 7.2 17.7 3.8 10.1 32
F 25.1 46 10.2 19.4 13.2 0 18.3 17.1 27.3 6.9 37.3 11.2 3.1 9.3 14.8 9 38.8
G 24.7 23.1 14.4 8.4 14.7 18.3 0 20 10.9 14.8 18.8 7.8 15.1 23.7 11.7 13 22.1
H 14.3 38.8 15.5 19.7 18.8 17.1 20 0 15.4 13 29.7 15.1 14.7 7.1 20.2 10.4 42
I 13 25.1 20.7 15.8 22.1 27.3 10.9 15.4 0 20.5 16.4 17.9 22.8 21.2 22.6 19 32
J 24.7 38.9 3.3 12.2 8 6.9 14.8 13 20.5 0 32.1 7.6 3.9 6.2 13.5 2.9 35.9
K 28.2 9 30.9 24.8 32.7 37.3 18.8 29.7 16.4 32.1 0 25.3 33.4 35.6 29.9 31.2 19.9
L 29.1 30.7 5.8 3.9 7.5 11.2 7.8 15.1 17.9 7.6 25.3 0 8.2 15 5.2 9.9 27.7
M 26 38.8 3.2 12.1 7.2 3.1 15.1 14.7 22.8 3.9 33.4 8.2 0 7.6 11.5 5.9 35.7
N 20 44.6 10 18.9 17.7 9.3 23.7 7.1 21.2 6.2 35.6 15 7.6 0 20.3 6.2 50.7
O 31.1 35.9 10.9 5.9 3.8 14.8 11.7 20.2 22.6 13.5 29.9 5.2 11.5 20.3 0 15.6 26.9
P 21.3 40.2 5.5 14.1 10.1 9 13 10.4 19 2.9 31.2 9.9 5.9 6.2 15.6 0 38.7
Q 43.8 19.6 33.4 27.3 32 38.8 22.1 42 32 35.9 19.9 27.7 35.7 50.7 26.9 38.7 0
A - Hypermaket Naic J - SM Center Imus
B - Hypermaket Tagaytay K - Savemore Amadeo
C - Hypermarket Imus L - Savemore Salitran
D - Hypermarket Kadiwa M - Savemore Lumina
E - Hypermarket Molino N - Savemore Kawit
F - Supermarket Bacoor O - Savemore Salawag
G - Supermarket Dasmarinas P - Savemore Lancaster
H - Supermarket Rosario Q - Savemore Silang
I - Supermarket Trece
Table 3.2. Matrix Representation of Distance for Each Pair of SM Markets

Problem 3. What is the minimum distance covered in delivering products to selected SM

Markets in Cavite?

The matrix above is inserted in MS Excel. At the right of the matrix, this presents the

distance of Mall A (#1) to Mall B (#2) which is 36.3 km, Mall B (#2) to Mall C (#3) which is 37.8

6
km, Mall C (#3) to Mall D (#4) which is 10 km, …, and Mall Q (#17) to Mall A (#1) which is 43.8

km. The total distance having this cycle is 372.1 km.

Fig.3.1. Matrix Representation in MS Excel

Using Excel Solver, the dialog box appeared. The objective is to minimize the total

distance (Cell U19), having the following constraints as shown in the figure below.

Fig.3.2. Excel Solver Dialog Box in MS Excel

7
 Fig.2.2.3. Results from Excel Solver

With the results, the minimum distance that a distributor can cover in distributing

products to the selected SM Markets in Cavite is 152.2 km. The route of the cycle is shown below.

From To Distance (in km)

SM Center Imus SM Supermarket Bacoor 6.9
SM Supermarket Bacoor SM Savemore Lumina 3.1
SM Savemore Lumina SM Hypermarket Imus 3.2
SM Hypermarket Imus SM Hypermarket Molino 7.1
SM Hypermarket Molino SM Savemore Salawag 3.8
SM Savemore Salawag SM Savemore Salitran 5.2
SM Savemore Salitran SM Hypermarket Kadiwa 3.9
SM Hypermarket Kadiwa SM Supermarket Dasmarinas 8.4
SM Supermarket Dasmarinas SM Savemore Silang 22.1
SM Savemore Silang SM Hypermarket Tagaytay 19.6
SM Hypermarket Tagaytay SM Savemore Amadeo 9.0
SM Savemore Amadeo SM Supermarket Trece 16.4
SM Supermarket Trece SM Hypermarket Naic 13
SM Hypermarket Naic SM Supermarket Rosario 14.3
SM Supermarket Rosario SM Savemore Kawit 7.1
SM Savemore Kawit SM Savemore Lancaster 6.2
SM Savemore Lancaster SM Center Imus 2.9
TOTAL 152.2
Table 3.3. Suggested Route with Minimum Distance Covered

8
3.2. Discussion

The results support the goal of the study. In minimizing distance in distributing products

to SM markets in Cavite, the results show the efficiency of the software used for the study. The

researchers are trying to find a Hamiltonian cycle (since the salesman needs to visit each 17 SM

Markets in Cavite once) in which the salesman will have the shortest distance to travel. The data

from the first table served as the basis in computing for the shortest Hamiltonian Cycle. By

comparison, the Hamiltonian cycle formed through excel is the shortest distance (with 152.2 km

in total) among the rest of possible routes. This is the distance that salesman needed to travel in

able to visit 17 SM markets in Cavite.

9
 CHAPTER IV

SUMMARY, CONCLUSION AND RECOMMENDATIONS

This chapter includes the summary of the study and the conclusion and recommendations of

the researchers.

4.1. Summary

Traveling Salesman Problem is a problem in graph theory that minimizes distance in

covering all the pick-up points. The concept of this problem is applied in the objective of this

research which is to find the route that will give the minimal distance in distributing products to

the selected SM Markets in Cavite. The researchers input the table in MS Excel that presents the

distance (in km) between two SM Markets in Cavite. After that, Excel solver is used in finding the

route that will give the minimum distance, wherein every SM Markets will be delivered.

4.2. Conclusion

The researchers arrived with the following conclusions:

4.2.1. Using Excel Solver, an algorithm for traveling salesman problem can be solved.

4.2.2. The distributors or manufacturers of products that supplies to SM Markets in Cavite

may follow the route that is suggested in this study.

4.2.3. The variable that is optimized in this study is the distance between two cities. Other

variables such as time taken, delivery capacity is not covered in this study.

4.3. Recommendations

4.3.1. The researchers recommend the suggested delivery schedule in this study for them to

cover the minimum distance in distributing products to SM Markets in Cavite.

10
 4.3.2. The distributors may start to any point of their choice (i.e. SM Supermarket Bacoor,

SM Hypermarket Tagaytay) whichever will be convenient to them.

4.3.3. The researchers recommend the future researchers conducting studies on traveling

salesman problem to include the time and capacity as variables to their study.

4.3.4. The results of this study give an optimal route which is a Hamiltonian cycle that

suggests to return to the starting point. It is in the choice of the distributors if they will return back

to their starting point or not.

11
 APPENDIX

Minimum Distance Between Selected SM Markets and Optimal Route

Hypermaket Naic Hypermaket Tagaytay Hypermarket Imus Hypermarket Kadiwa Hypermarket Molino
Hypermaket Naic 0 36.3 25.7 29.1 28.7
Hypermaket Tagaytay 36.3 0 37.8 30.6 39.9
Hypermarket Imus 25.7 37.8 0 10 7.1
Hypermarket Kadiwa 29.1 30.6 10 0 9
Hypermarket Molino 28.7 39.9 7.1 9 0
Supermarket Bacoor 25.1 46 10.2 19.4 13.2
Supermarket Dasmarinas 24.7 23.1 14.4 8.4 14.7
Supermarket Rosario 14.3 38.8 15.5 19.7 18.8
Supermarket Trece 13 25.1 20.7 15.8 22.1
SM Center Imus 24.7 38.9 3.3 12.2 8
Savemore Amadeo 28.2 9 30.9 24.8 32.7
Savemore Salitran 29.1 30.7 5.8 3.9 7.5
Savemore Lumina 26 38.8 3.2 12.1 7.2
Savemore Kawit 20 44.6 10 18.9 17.7
Savemore Salawag 31.1 35.9 10.9 5.9 3.8
Savemore Lancaster 21.3 40.2 5.5 14.1 10.1
Savemore Silang 43.8 19.6 33.4 27.3 32

12
 Supermarket Supermarket Supermarket
Bacoor Dasmarinas Rosario Supermarket Trece SM Center Imus
Hypermaket Naic 25.1 24.7 14.3 13 24.7
Hypermaket Tagaytay 46 23.1 38.8 25.1 38.9
Hypermarket Imus 10.2 14.4 15.5 20.7 3.3
Hypermarket Kadiwa 19.4 8.4 19.7 15.8 12.2
Hypermarket Molino 13.2 14.7 18.8 22.1 8
Supermarket Bacoor 0 18.3 17.1 27.3 6.9
Supermarket Dasmarinas 18.3 0 20 10.9 14.8
Supermarket Rosario 17.1 20 0 15.4 13
Supermarket Trece 27.3 10.9 15.4 0 20.5
SM Center Imus 6.9 14.8 13 20.5 0
Savemore Amadeo 37.3 18.8 29.7 16.4 32.1
Savemore Salitran 11.2 7.8 15.1 17.9 7.6
Savemore Lumina 3.1 15.1 14.7 22.8 3.9
Savemore Kawit 9.3 23.7 7.1 21.2 6.2
Savemore Salawag 14.8 11.7 20.2 22.6 13.5
Savemore Lancaster 9 13 10.4 19 2.9
Savemore Silang 38.8 22.1 42 32 35.9

13
 Savemore
Amadeo Savemore Salitran Savemore Lumina Savemore Kawit Savemore Salawag
Hypermaket Naic 28.2 29.1 26 20 31.1
Hypermaket Tagaytay 9 30.7 38.8 44.6 35.9
Hypermarket Imus 30.9 5.8 3.2 10 10.9
Hypermarket Kadiwa 24.8 3.9 12.1 18.9 5.9
Hypermarket Molino 32.7 7.5 7.2 17.7 3.8
Supermarket Bacoor 37.3 11.2 3.1 9.3 14.8
Supermarket Dasmarinas 18.8 7.8 15.1 23.7 11.7
Supermarket Rosario 29.7 15.1 14.7 7.1 20.2
Supermarket Trece 16.4 17.9 22.8 21.2 22.6
SM Center Imus 32.1 7.6 3.9 6.2 13.5
Savemore Amadeo 0 25.3 33.4 35.6 29.9
Savemore Salitran 25.3 0 8.2 15 5.2
Savemore Lumina 33.4 8.2 0 7.6 11.5
Savemore Kawit 35.6 15 7.6 0 20.3
Savemore Salawag 29.9 5.2 11.5 20.3 0
Savemore Lancaster 31.2 9.9 5.9 6.2 15.6
Savemore Silang 19.9 27.7 35.7 50.7 26.9

14
 Savemore
Lancaster Savemore Silang SM Market Distance
Hypermaket Naic 21.3 43.8 SM Center Imus 22.1
SM Supermarket
Hypermaket Tagaytay 40.2 19.6 Bacoor 8.4
SM Savemore
Hypermarket Imus 5.5 33.4 Lumina 3.9
SM Hypermarket
Hypermarket Kadiwa 14.1 27.3 Imus 5.2
SM Hypermarket
Hypermarket Molino 10.1 32 Molino 3.8
SM Savemore
Supermarket Bacoor 9 38.8 Salawag 7.1
SM Savemore
Supermarket Dasmarinas 13 22.1 Salitran 3.2
SM Hypermarket
Supermarket Rosario 10.4 42 Kadiwa 3.1
SM Supermarket
Supermarket Trece 19 32 Dasmarinas 6.9
SM Center Imus 2.9 35.9 SM Savemore Silang 2.9
SM Hypermarket
Savemore Amadeo 31.2 19.9 Tagaytay 6.2
SM Savemore
Savemore Salitran 9.9 27.7 Amadeo 7.1
SM Supermarket
Savemore Lumina 5.9 35.7 Trece 14.3
SM Hypermarket
Savemore Kawit 6.2 50.7 Naic 13
SM Supermarket
Savemore Salawag 15.6 26.9 Rosario 16.4
Savemore Lancaster 0 38.7 SM Savemore Kawit 9
SM Savemore
Savemore Silang 38.7 0 Lancaster 19.6
TOTAL 152.2

15
 BIBLIOGRAPHY

Agnarsson, G., & Greenlaw, R. (2007). Graph Theory: Modeling, Applications, and Algoritms.

Upper Saddle River, NJ: Pearson Education.

Google. (2019). Google Maps. Retrieved May 20, 2019, from https://www.google.com/maps

QuestionPro Survey Software. (2019). Descriptive Research: Definition. Retrieved May 23, 2019,

from https://www.questionpro.com/blog/descriptive-research/.

SM Supermalls. (2014). SM Markets Store Locator. Retrieved May 23, 2019, from

https://smmarkets.ph/store-locator.

16