Open vehicle routing problem: Determination of M.T.A. service routes
Is this your thesis?
This record came from a bulk archive import. If it’s yours, link it to your profile.
Abstract (EN)
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
Author
Mehmet Çağlar Ünsal
How to Cite
Mehmet Çağlar Ünsal (Master Thesis). Open vehicle routing problem: Determination of M.T.A. service routes, 2010, Gazi University.
Keywords
License
Tüm Hakları Saklıdır
This work is shared under the specified license terms.
More theses from Gazi University
- Experimental development of the interfacial bond-slip model between textile reinforced mortar strips and masonry walls(2025)
- Occupational accident analysis and modelling in oil and gas drilling sector Turkey(2021)
- The ideological construction of regime debate in Turkey by the press in the context of 2007 presidential elections(2012)
- XVI. yüzyıl Anadolu'sunda Oğuzların Karkın Boyu(2004)
- Sharing of real life geometry samples via a social learning environment: A case study(2021)
- Evaluatıon of calcium hydroxide removal efficiency of two different irrigation activation techniques from artificial internal resorption cavities prepared at different root levels(2021)