Assortment planning in transshipment systems

Simple item page
buir.advisorŞen, Alper
dc.contributor.authorDağ, Hilal
dc.date.accessioned2016-05-03T07:30:06Z
dc.date.available2016-05-03T07:30:06Z
dc.date.copyright2015-08
dc.date.issued2015-08
dc.date.submitted24-11-2015
dc.descriptionCataloged from PDF version of thesis.en_US
dc.descriptionIncludes bibliographical references (leaves 54-58).en_US
dc.descriptionThesis (M.S.): Bilkent University, Department of Industrial Engineering, İhsan Doğramacı Bilkent University, 2015.en_US
dc.description.abstractAssortment planning, i.e., determining the set of products to offer to customers is a challenging task with immediate effects on profitability, market share and customer service. In this thesis, we study a multiple location assortment planning problem in a make-to-order environment. Each location has the exibility to access others' assortments by transshipping products he/she does not keep. This allows them to offer higher variety and increase sales without increasing costs associated with assortment. Customer behavior is defined using exogenous demand model where each arriving customer to a location chooses a product with an exogenous probability among all possible options. In our multiple location setting, we assume that the customer has access to the complete assortment in all locations. If a customer's requested product is not available in that customer's assigned location but available in another location, the firm ships the product to the customer at the same price and incurs a transshipment cost. If his/her first choice product is not offered by any of the locations then he/she switches to a substitute product, which can be either satisfied from customer's assigned location, or by transshipment. Otherwise, it is lost. The problem is then to determine the assortment in each location such that the total expected profit is maximized. We first show that the optimal assortments are nested, i.e., the assortment of a location with a smaller market share is a subset of the assortment of a location with a larger market share. We then show that while the common assortment is in the popular set (i.e., some number of products with highest purchase probabilities), the individual assortments do not necessarily have this property. We also derive a sufficient condition for each assortment to be in the popular set. In the final part of the thesis, we conduct an extensive numerical study to understand the effects of various parameters such as assortment cost and transshipment cost on optimal assortments and effects of allowing transshipments on resulting assortments compared to a no-transshipment system. Finally, we introduce an approximation algorithm that benefits from the structural properties obtained in this study and also test its performance with extensive numerical analyses.en_US
dc.description.provenanceSubmitted by Betül Özen (ozen@bilkent.edu.tr) on 2016-05-03T07:30:06Z No. of bitstreams: 1 Thesis_Hilal_Dag.pdf: 431109 bytes, checksum: 9f85d12522c067cbadab9da075245b66 (MD5)en
dc.description.provenanceMade available in DSpace on 2016-05-03T07:30:06Z (GMT). No. of bitstreams: 1 Thesis_Hilal_Dag.pdf: 431109 bytes, checksum: 9f85d12522c067cbadab9da075245b66 (MD5) Previous issue date: 2015-08en
dc.description.statementofresponsibilityby Hilal Dağ.en_US
dc.embargo.release2017-08-01
dc.format.extentxiii, 69 leaves : charts.en_US
dc.identifier.itemidB151819
dc.identifier.urihttp://hdl.handle.net/11693/29037
dc.language.isoEnglishen_US
dc.rightsinfo:eu-repo/semantics/openAccessen_US
dc.subjectAssortment planningen_US
dc.subjectProduct varietyen_US
dc.subjectTranshipmenten_US
dc.subjectInventory sharingen_US
dc.titleAssortment planning in transshipment systemsen_US
dc.title.alternativeTransfer-satış kullanan sistemlerde ürün çeşitliliği planlamasıen_US
dc.typeThesisen_US
thesis.degree.disciplineIndustrial Engineering
thesis.degree.grantorBilkent University
thesis.degree.levelMaster's
thesis.degree.nameMS (Master of Science)

Files

Original bundle
Now showing 1 - 1 of 1
Thumbnail Image
Name:
Thesis_Hilal_Dag.pdf
Size:
421 KB
Format:
Adobe Portable Document Format
Description:
Full printable version
Download
License bundle
Now showing 1 - 1 of 1
No Thumbnail Available
Name:
license.txt
Size:
1.71 KB
Format:
Item-specific license agreed upon to submission
Description:
Download

Collections

Graduate School of Engineering and Science