Document Type

Project

Publication Date

Winter 2018

Instructor

Timothy Anderson

Course Title

Operations Research

Course Number

ETM 540/640

Subjects

Travel -- Decision making, Choice of transportation, Linear programming, Operational research

Abstract

This paper aims to minimize total drive time between members and their respective group leader. Given a limit on group size and days available, how can a formulation of a group occur such that the sum of the total drive time is minimized. To accomplish this task a Linear Program (LP) is implemented that includes three sets of binary decisions variables summing to 4100 variables and a variety of constraints summing between 4200 and 4341 depending on the constraints enforced. For 200 members and 15 leaders the minimized average commuting time was found to be between 4.99 and 5.36 minutes depending on the distribution of availability assumed.

Rights

In Copyright. URI: http://rightsstatements.org/vocab/InC/1.0/ This Item is protected by copyright and/or related rights. You are free to use this Item in any way that is permitted by the copyright and related rights legislation that applies to your use. For other uses you need to obtain permission from the rights-holder(s).

Persistent Identifier

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

Download

Share

COinS