Show simple item record

dc.contributor.advisorYıldırım, Emre Alperen_US
dc.contributor.authorKoca, Esraen_US
dc.date.accessioned2016-01-08T19:45:22Z
dc.date.available2016-01-08T19:45:22Z
dc.date.issued2010
dc.identifier.urihttp://hdl.handle.net/11693/16244
dc.descriptionAnkara : The Department of Industrial Engineering and the Institute of Engineering and Sciences of Bilkent University, 2010.en_US
dc.descriptionThesis (Master's) -- Bilkent University, 2010.en_US
dc.descriptionIncludes bibliographical references leaves 62-66.en_US
dc.description.abstractIn this thesis, we consider a multicommodity distribution problem. We assume that there is a central depot which houses a number of different types of items. There is a finite number of geographically dispersed demand points which place orders for these items on a daily basis. The demand of these demand points should be satisfied from this central depot. We assume that a finite number of identical trucks with predetermined destinations are used for the distribution of the items from the central depot to each demand point. The demand of each demand point can be split among several trucks and a single truck is allowed to visit several demand points. Our objective is to satisfy the demand of each demand point with the minimum total distribution cost while respecting the capacity of each truck. The cost structure is dictated by the final destinations of trucks used in the distribution of the items and the set of demand points visited by each truck. We propose two different solution approaches. The first approach, called the Direct Approach, is aimed at solving the problem directly using a mixed integer linear programming formulation. Since the Direct Approach becomes computationally infeasible for real-life problems, we propose a so-called Hierarchical Approach that is aimed at solving the problem in two stages using an aggregation followed by a disaggregation scheme. We study the properties of the solutions computed with the Hierarchical Approach. We perform extensive computational studies on a data set adapted from a major automotive manufacturing company in Turkey in an attempt to compare the performances of the two approaches. Our results reveal that the Hierarchical Approach significantly outperforms the Direct Approach on the vast majority of the instances.en_US
dc.description.statementofresponsibilityKoca, Esraen_US
dc.format.extentx, 91 leavesen_US
dc.language.isoEnglishen_US
dc.rightsinfo:eu-repo/semantics/openAccessen_US
dc.subjectmulticommodity distributionen_US
dc.subjecttransportationen_US
dc.subjectlogisticsen_US
dc.subject.lccHE199.A2 K63 2010en_US
dc.subject.lcshFreight and freightage.en_US
dc.subject.lcshTransportation--Mathematical models.en_US
dc.subject.lcshTransportation--Planning.en_US
dc.subject.lcshPhysical distribution of goods.en_US
dc.subject.lcshBusiness logistics.en_US
dc.titleA two stage solution approach to spare parts distribution under a special cost structureen_US
dc.typeThesisen_US
dc.departmentDepartment of Industrial Engineeringen_US
dc.publisherBilkent Universityen_US
dc.description.degreeM.S.en_US


Files in this item

Thumbnail

This item appears in the following Collection(s)

Show simple item record