TITLE: ANNABELLE’S DESTINATION ITINERARY SIMULATION

SPECIFIC OUTPUT: The group shall perform an Itinerary Presentation Simulation and submit
a Diorama representation of Cebu featuring different Hamiltonian Paths.

PROJECT DESCRIPTION:

The project involves a simulated scenario of a tourism company named “Annabelle’s

Destination” which offers different transportation services and tour bundles for their customers. In
line with the simulated company’s business operations, the group shall present different tour bundles
covering different areas of Cebu Island such as 1. Fort San Pedro, 2. Cebu Country Club, 3. Temple
of Leah, 4. Buhisan Reservoir, and 5. Jumalon Butterfly Sanctuary. The itinerary will involve
Hamiltonian Paths as possible routes of the transport buses. The prospective customers will be given
a chance to choose between two different tour bundles with the same destinations but different
pathways. In choosing the routes with a better offer, two algorithms will be used to aid the customers
which include the Greedy Algorithm and Edge-Picking Algorithm.

MATHEMATICAL CONCEPTS:

1.Graph Theory- the study of graphs, which are mathematical structures used for pairwise comparison
2.Hamiltonian Path- a trail which starts and ends at the same vertex visiting every other vertex once
3.Greedy Algorithm – going through the least possible edge values while starting at a specific point
4.Edge-Picking Algorithm- finding all possible path values and choosing the one with the least value

SIGNIFICANCE OF THE PROJECT:

The project aims to present the competence of the members in applying different concepts of
Graph Theory and integrating these concepts in real-life situations most especially in career-oriented
scenarios. The creation of a simulated tourism company with different itineraries involving
Hamiltonian Paths is a direct representation of the group’s understanding on how the Graph Theory
works in the business setting. This competency is further evident in the detailed routes with different
distance values which all the more signifies the application of two important algorithms in choosing
cost efficient routes such as the Greedy and Edge-Picking Algorithm. This project is necessary and
significant to the group because as aspiring entrepreneurs/accountants, it is important for them to
know the different applications of the Graph Theory in creating cost efficient decisions like routes
along with the basic steps in managing customer demands through a simulated Itinerary Presentation.

1
PROCEDURE/ EXECUTION:

1. The simulation shall begin with a group of customers entering the Tour Company’s premises
2. The front desk officers shall entertain the customers by showing them the tour packages.
3. The tour packages shall be presented in the form of a Diorama featuring a miniature version
of the destinations with their corresponding distance in kilometers
a. The dioramas are hand crafted by the members themselves through clay molding and
paper folding
b. There will be two sets of dioramas presented wherein one follows the Greedy
Algorithm while the other follows the Edge Picking Algorithm
4. The customers will then be given an option between the two tour packages based on their
preferred prices and routes
5. Mathematical concepts will also be explained by the front desk officers during the simulation

TASKS OF MEMBERS:

Name of the Member Simulation Role Diorama

Araneta, Erikka Joan
Armecin, Aprilgrace
Boncales, Kate
Camasura, Marie Ila
Castillo, Clark Peter
Front Desk Officer 1 Clay Molder, Temple of Leah Crafter
Customer 1 Clay Molder, Flag & Distance Marker
Customer 2 Clay Molder, Company Logo Maker
Customer 3 Clay Molder, Boat and Design Maker
Front Desk Officer 2 Clay Molder, Document Encoder

LOGISTICAL NEEDS:

DIORAMA:

1. Cardboard SIMULATION:
2. Molding Clay (Green and Brown)
1. Costumes for Respective Roles
3. Pebbles
2. Logo of Company
4. Water Cellophane (Blue)
(Annabelle’s Destination)
5. Scissors
3. Memorized Script for the Simulation
6. Glue