TRANS- Max is a mathematical model that maximizes the overall service value of a route rather than attempting to minimize cost. Cost or distance is considered as a constraint on the extent of the route. The service value of a route is a function of the service values on nodes which are intersections of the street network, and the service values of the arcs connecting those nodes. Service values can be a function of the population, employment opportunities, and other measures of route attractiveness given their access to the bus route. The mathematical formulation of the TRANSMax model borrows from the structure of linear programming problems designed for both the traveling salesman problem and the vehicle routing problem. [...] This method serves to not only make the transit routing problem tractable by dividing the problem into smaller sub-problems, but it also provides a range of high-quality alternate routes for consideration in the decision making process.
The Transit Route Arc-Node Service Maximization problem, Kevin M. Curtin & Steve Biba (2010)
Final project topic selected finally. Closing all those tabs felt good.
