Open vehicle routing problem: Determination of M.T.A. service routes

The vehicle routing problem (VRP) is a problem which calls for the determination of the optimal routes used by a fleet of vehicles, based at one or more depots, to serve a set of customers.The open vehicle routing problem (OVRP) is a type of the VRP. In the OVRP, vehicles do not return to the depot after servicing the last customer on a route.In this thesis, total travel distance and total number of vehicles are tried to minimize of rented personel transportation vehicles of M.T.A. (General Directorate Of Mineral Research and Exploration). When solving the OVRP, integer lineer programming model is used to determine the routes of vehicles. The problem has been solved by using GAMS program and the results are discussed