Skip to content

Implements a traveling salesperson problem (TSP) approximation algorithm in order to optimize routes for package deliveries. Written in Python. Supports multiple delivery vehicles, real time changes to delivery schedules and addresses, and provides detailed status updates for each package at any time before, during, or after delivery.

Notifications You must be signed in to change notification settings

rdtaylorjr/TSP-Algorithm-Delivery-Scheduler

Folders and files

NameName
Last commit message
Last commit date

Latest commit

 

History

15 Commits
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 

Repository files navigation

TSP-Algorithm-Delivery-Scheduler

Implements a traveling salesperson problem (TSP) approximation algorithm in order to optimize package delivery routes for WGU Parcel Service. Supports multiple delivery vehicles, real time changes to delivery schedules and addresses, and provides detailed status updates for each package at any time before, during, or after delivery.

Includes a detailed writeup and analysis of the time and space complexity of the program

Programming language: Python

C950 Data Structures and Algorithms II

About

Implements a traveling salesperson problem (TSP) approximation algorithm in order to optimize routes for package deliveries. Written in Python. Supports multiple delivery vehicles, real time changes to delivery schedules and addresses, and provides detailed status updates for each package at any time before, during, or after delivery.

Topics

Resources

Stars

Watchers

Forks

Releases

No releases published

Packages

No packages published

Languages