Robust capacity expansion and routing in networks

Simple item page
buir.advisorKaraşan, Oya Ekin
dc.contributor.authorKahramanoğlu, İbrahim Evren
dc.date.accessioned2016-07-01T11:07:43Z
dc.date.available2016-07-01T11:07:43Z
dc.date.issued2006
dc.descriptionCataloged from PDF version of article.en_US
dc.description.abstractIn this thesis, we consider a robust capacity expansion-routing problem with uncertain demand. Given a network with source and demand nodes and a capacity budget, the capacity expansion problem is related to the determination of the arcs on which additional capacity will be installed in order to minimize the overall routing cost while satisfying the demand of the nodes. We make use of the Robust Counterpart (RC) approach in the literature in order to make capacity installation and routing decisions. RC approach is important since it does not allow any constraint violation for any realization of the uncertainty and such approaches are often necessary in engineering applications in real life. We apply the classical RC formulation to our problem that results in a simple one-stage model. The two-stage version of the RC formulation, namely the Adjustable Robust Counterpart (ARC), is also applicable to our problem. The formulation of the ARC is given but since it is not computationally tractable, an approximation to ARC developed recently, namely Affinely Adjustable Robust Counterpart (AARC) formulation, is applied to our problem and solved. The efficiencies of the RC formulation and AARC formulation are tested via two different sets of numerical studies in the experimental part. The main model that allows capacity installation in continuous amounts as well as two extensions that make use of the modular capacity approach are used in the experimental study. The computational experiments illustrate that AARC approach provides robust solutions at a much cheaper cost in terms of objective function value when compared to RC approach. In addition the loss of optimality due to application of AARC formulation is minor.en_US
dc.description.provenanceMade available in DSpace on 2016-07-01T11:07:43Z (GMT). No. of bitstreams: 1 0003170.pdf: 346758 bytes, checksum: e4d483203aeb4d3e84c415774b996dc0 (MD5) Previous issue date: 2006en
dc.description.statementofresponsibilityKahramanoğlu, İbrahim Evrenen_US
dc.format.extentx, 78 leaves, tablesen_US
dc.identifier.itemidBILKUTUPB100078
dc.identifier.urihttp://hdl.handle.net/11693/29880
dc.language.isoEnglishen_US
dc.rightsinfo:eu-repo/semantics/openAccessen_US
dc.subjectRobust Optimizationen_US
dc.subjectCapacity Expansion Problem Robust Counterparten_US
dc.subjectAdjustable Robust Counterparten_US
dc.subjectAffinely Adjustable Robust Counterparten_US
dc.subject.lccHD69.C3 K34 2006en_US
dc.subject.lcshIndustrial capacity Mathematical models.en_US
dc.titleRobust capacity expansion and routing in networksen_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:
0003170.pdf
Size:
338.63 KB
Format:
Adobe Portable Document Format
Description:
Full printable version
Download

Collections

Graduate School of Engineering and Science