Karamanoğlu, Yunus Emre2016-07-012016-07-012004http://hdl.handle.net/11693/29491Cataloged from PDF version of article.The aim of this study is to find the optimum distances traveled by the vehicles distributing goods to the military units, belonging to a command center, in one day and the appropriate fleet types and sizes for each Command Center. We examine the differences in the total distances traveled by the vehicles when the types and number of the vehicles are changed in the fleet. A mixed integer programming model is proposed, and for the implementation of the model, optimization modeling software GAMS is used. The proposed model is obtained from the current system elements and shows the differences between the current distribution system and the solution of the proposed model. How the total distances are affected when distribution is made from one center is investigated, and ideal main supply routes, ideal sequences of supply plans, and fleet sizes are proposed.xi, 81 leavesEnglishinfo:eu-repo/semantics/openAccessMixed integer ProgrammingRegional Ring Transportation SystemFleet Size and Capacitated Vehicle RoutingHE147.7 .K37 2004Trucks Routes Mathematical models.ThesisBILKUTUPB083567