Document Type

Closed Project

Publication Date

Fall 2019


Timothy Anderson

Course Title

Operations Research

Course Number

ETM 540


R (Computer program language), Transportation -- Planning, Vehicle routing problem, McMenamins Pubs & Breweries, Travel time (Traffic engineering) -- Mathematical models


McMenamins is a privately owned chain operating across Oregon and Washington established in 1983. They operate 57 eclectic locations ranging from strip mall locations to fully renovated historical sites. These establishments are pubs, restaurants, historical hotels, movie theaters, concert venues and spas. In 2013 after input from many regulars the McMenamins decided to start a passport program to give back to those already working through their own McMenamins bucket list. This journey takes people from the Southernmost location in Roseburg, Oregon up along the I-5 corridor to the Northernmost location in Mill Creek, Washington. Along the way visiting the 57 locations you must acquire 117 stamps from variations of hidden bars, scavenger hunts and purchase of theater or concert tickets. There are over $200 worth of prizes during the adventure with a grand prize upon completion. The grand prize consists of a 3 night hotel stay, pair of concert tickets, happy hour drink prices Sunday-Thursday for a year, exclusive Tripsters merchandise and an invite to the private Tripsters party.

While there is no restriction to complete the passport within a given time we decided it could still be advantageous to optimize the completion of this multi-variable journey. This is a perfect problem to be tackled using R to minimize time of completion of a given transportation route similar to the goal of any distribution center. We wanted to give the user multiple options on how they would like to complete their journey. At first, we wanted to fully map out the entire route for all locations based on a starting location. This was found to be too difficult based on the time variables of locations. Instead we decided to let the user input what they would like based on the following criteria:

  • Starting location (Fixed to PSU)
  • Starting time
  • User Select locations or Google rating
  • Completion time
  • Optimization method


In Copyright. URI: 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).


Note: This project is only available to students, staff and faculty at Portland State University.

Persistent Identifier