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% TableCompanyInitial Parking lotFinal Parking lot 1j1k1k2 2j2k2k4 3j3k5k3
References Web address (text): http://en.wikipedia.org/wiki/Drag_coefficienthttp://en.wikipedia.org/wiki/Drag_coefficient Web address (map): http://www.transmilenio.gov.co/WebSite/Default.aspx
Your consent to our cookies if you continue to use this website.