Document Type

Closed Project

Publication Date

Winter 2012

Instructor

Timothy Anderson

Course Title

Operations Research

Course Number

ETM 540/640

Subjects

Traveling-salesman problem -- Applications to operations research, Willamette Dental -- Information technology -- Management, Operation research -- Case studies

Abstract

On September 17, 2012, Willamette Dental will have electronic patient health records and charts in all fifty-four clinical offices. In order to make this happen, over 600 PC’s will need to be installed into the office operatories in the most efficient manner. The clinical offices are located in Oregon, Washington (each with a quantity of 25), and Idaho (with a quantity of 4). To find the best route and least distance to install all of the equipment into the fifty-four clinical offices, this paper will utilize the Traveling Salesman Problem (TSP). The TSP has been a very important topic of study for operations researchers and mathematicians for decades. [9] Computer hardware and software advances in recent years have provided multiple alternative approaches to this classic combinatorial challenge.

Description

This project is only available to students, staff, and faculty of Portland State University

Persistent Identifier

http://archives.pdx.edu/ds/psu/22137

Share

COinS