The robust shortest path problem with interval data uncertainties

Simple item page
buir.advisorPınar, Mustafa Ç.
dc.contributor.authorKaraman, Abdullah Sıddık
dc.date.accessioned2016-07-01T11:01:21Z
dc.date.available2016-07-01T11:01:21Z
dc.date.issued2001
dc.departmentDepartment of Industrial Engineeringen_US
dc.descriptionCataloged from PDF version of article.en_US
dc.description.abstractIn this study, we investigate the well-known shortest path problem on directed acyclic graphs under arc length uncertainties. We structure data uncertainty by taking the arc lengths as interval ranges. In order to handle uncertainty in the decision making process, we believe that a robustness approach is appropriate to use. The robustness criteria we used are the minimax (absolute robustness) criterion and the minimax regret (relative robustness) criterion. Under these criteria, we de ne and identify paths which perform satisfactorily under any likely input data and give mixed integer programming formulation to nd them. In order to simplify decision making, we classify arcs based on the realization of the input data. We show that knowing which arcs are always on shortest paths and which arcs are never on shortest paths we can preprocess a graph for robust path problems. Computational results support our claim that the preprocessing of graphs helps us signi cantly in solving the robust path problems.en_US
dc.description.degreeM.S.en_US
dc.description.provenanceMade available in DSpace on 2016-07-01T11:01:21Z (GMT). No. of bitstreams: 1 0001745.pdf: 336884 bytes, checksum: aec30661cadde734be7ffcb97df6237d (MD5) Previous issue date: 2001en
dc.description.statementofresponsibilityKaraman, Abdullah Sıddıken_US
dc.format.extent48 leaves, tablesen_US
dc.identifier.itemidBILKUTUPB059529
dc.identifier.urihttp://hdl.handle.net/11693/29557
dc.language.isoEnglishen_US
dc.publisherBilkent Universityen_US
dc.rightsinfo:eu-repo/semantics/openAccessen_US
dc.subjectShortest Path Problemen_US
dc.subjectDirected Acyclic Graphsen_US
dc.subjectLayered Graphsen_US
dc.subjectInterval Dataen_US
dc.subjectRobust Optimizationen_US
dc.subject.lccQA402.5 .K37 2001en_US
dc.subject.lcshCombinatorial optimization.en_US
dc.titleThe robust shortest path problem with interval data uncertaintiesen_US
dc.typeThesisen_US

Files

Original bundle
Now showing 1 - 1 of 1
Thumbnail Image
Name:
0001745.pdf
Size:
328.99 KB
Format:
Adobe Portable Document Format
Description:
Full printable version
Download

Collections

Dept. of Industrial Engineering - Master's degree