RyanAllen

• 

  HillPark

  INEG 22203 Computing Methods II, fall 2026. Team of three.

  A web app that tells a University of Arkansas student where to park for their class schedule. It ranks the lots your permit allows by walking time, driving time and traffic, checks whether a park-and-ride bus would be faster, and uses an integer program to pick the best lots for your whole week. Its score is minutes of walking and traffic delay, plus a penalty for lots likely to be full.

  • 16%lower week score with two lots instead of one (178 to 149)
  • 35automated tests, including brute-force checks of the week plan
  • 0.51R² of the traffic forecast on unseen days, vs 0.32 for averages

  Read about HillPark →

• Campus parking permit model

  INEG 26103 Introduction to Operations Research, fall 2026. Team of two.

  The university sells more car permits than it has spaces. We're building a mixed-integer model that decides which permit each campus lot should serve, to shorten walks without sending everyone down the same road. Approved at the October milestone; results come in December.

  • 1.44car permits sold for every parking space
  • 110lots and garages in our dataset, with permit rules and sizes
  • 87.4%unsatisfied with parking in a 2024 campus study

  Read about the permit model →

Course assignments

• Race-car performance model

  INEG 22203, Assignment 4. Individual.

  I trained three machine-learning models on 60,000 simulated races, then used the one I could explain to spend a fixed 1,000-point upgrade budget on a car and driver.

  • 70.5points per race for my car in the season simulation
  • 47.5average for the racers in the data
  Read about the race-car model →

• Four ways to solve one shipping problem

  INEG 22203, Assignment 5. Individual.

  One transportation problem solved as an integer program, a constraint program, a linear program and with a greedy heuristic I wrote. Only 15 suppliers and 15 outlets had anything to ship, so trimming the empty ones would cut the model from 25 million variables to 225.

  • 1.0%above optimal for my greedy heuristic, in 19 ms
  • 7×faster as a linear program than with SCIP, same optimum
  Read about the solver comparison →

• Introduction to Operations ResearchINEG 26103Linear and integer programming, standard form, modeling in AMPL
• Computing Methods for Industrial Engineers IIINEG 22203Object-oriented Java, Tablesaw data analysis, Smile machine learning, OR-Tools optimization, Vaadin web interfaces
• Production Planning and ControlINEG 35503Aggregate planning, EOQ and quantity discounts, the newsvendor problem, (Q, R) inventory systems, master production scheduling
• Engineering Economic AnalysisINEG 24103Time value of money, loans and variable interest rates, cost of capital
• Linear AlgebraMATH 30803Matrices, linear systems and vector spaces, the math underneath linear programming