Travel -- Decision making, Choice of transportation, Linear programming, Operational research
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.
Payne, Kevin; Kumari, Kritika; Huddleston, Levi; and Hassan, Rabi, "Minimizing Commute Distance for Small Groups: A Linear Programming Approach" (2018). Engineering and Technology Management Student Projects. 2104.