C950 Task-1 WGUPS Algorithm Overview
C950 Task-1 WGUPS Algorithm Overview
(Task-1: The planning phase of the WGUPS Routing Program)
Trayvonious Pendleton
ID 011205284
WGU Email:
9/5/2024
C950 Data Structures and Algorithms II
Page 1 of 8
, C950 Task-1 WGUPS Algorithm Overview
Introduction
For this WGUPS Routing Program, I recommend using a nearest
neighbor greedy algorithm with a self-adjusting data structure as a hash
table. The closest neighbor greedy algorithm can adjust its route by picking
the following closet location, which ensures a traversal of delivery
addresses. A hash table can store and manage package information, such
as addresses, deadlines, and delivery status.
A. Algorithm Identification
The nearest neighbor greedy algorithm is a self-adjusting algorithm
that chooses the closest unvisited delivery point at each step, ensuring
trucks follow the most efficient route without starting from scratch. This is
important because it allows the trucks to adapt to changes, such as
updated package addresses, without losing performance.
B. Data Structure Identification
The hash table will store package details, like Package ID, address,
and deadline. The average time complexity is O (1) for lookups, which
makes it a good match for dynamic data access for determining the
delivery point.
Page 2 of 8
C950 Task-1 WGUPS Algorithm Overview
(Task-1: The planning phase of the WGUPS Routing Program)
Trayvonious Pendleton
ID 011205284
WGU Email:
9/5/2024
C950 Data Structures and Algorithms II
Page 1 of 8
, C950 Task-1 WGUPS Algorithm Overview
Introduction
For this WGUPS Routing Program, I recommend using a nearest
neighbor greedy algorithm with a self-adjusting data structure as a hash
table. The closest neighbor greedy algorithm can adjust its route by picking
the following closet location, which ensures a traversal of delivery
addresses. A hash table can store and manage package information, such
as addresses, deadlines, and delivery status.
A. Algorithm Identification
The nearest neighbor greedy algorithm is a self-adjusting algorithm
that chooses the closest unvisited delivery point at each step, ensuring
trucks follow the most efficient route without starting from scratch. This is
important because it allows the trucks to adapt to changes, such as
updated package addresses, without losing performance.
B. Data Structure Identification
The hash table will store package details, like Package ID, address,
and deadline. The average time complexity is O (1) for lookups, which
makes it a good match for dynamic data access for determining the
delivery point.
Page 2 of 8
