110 likes | 401 Vues
This document discusses the optimization process for assigning kilometers to seven companies within the Transmilenio public transportation system using linear optimization techniques. The problem is framed around equitable participation by each company and minimizing the operational constraints such as limited parking capacity and bus types. The simplex algorithm is employed to identify an optimal solution, followed by the branch and bound method for achieving integer solutions. The result includes a significant reduction of the kilometers buses are not in service, improving efficiency.
E N D
Optimization in public transportation José Fernando RománGuzmán 11/28/12
The Problem • Kilometers assign to each company is equal to the participation times the total kilometers of all the “tables”. • Assign all of the “tables” to the seven companies according to their participation • Minimize the hlp
Restrictions • Limited capacity in the parking lots • Different type of buses • Special requirement form the companies
The Solution • Linear Optimization using the simplex algorithm to find the real solution and then the branch and bound algorithm to find the integer solution • Only one person is responsible for the assignation of whole system • Reduction of the HLP(kilometers when the buses are not in service) of 25%
References • Web address (text): http://en.wikipedia.org/wiki/Drag_coefficient • Web address (map): http://www.transmilenio.gov.co/WebSite/Default.aspx