Team orienteering problem with stochastic time-dependent travel time

Simple item page
buir.advisorÇavuş İyigün, Özlem
dc.contributor.authorÇelik, Şifanur
dc.date.accessioned2021-08-19T05:24:31Z
dc.date.available2021-08-19T05:24:31Z
dc.date.copyright2021-07
dc.date.issued2021-07
dc.date.submitted2021-08-16
dc.descriptionCataloged from PDF version of article.en_US
dc.descriptionThesis (Master's): Bilkent University, Department of Industrial Engineering, İhsan Doğramacı Bilkent University, 2021.en_US
dc.descriptionIncludes bibliographical references (leaves 64-71).en_US
dc.description.abstractAccording to United Nations, human population living in urban areas is expected to increase in the coming years. This increase will have an effect on the traffic density in the urban areas. This motivates employees whose job is to visit customers during the day, such as logistics company employees, to consider the impact of traffic density on the travel times while visiting customers. This study aims to find prior optimal tours for more than one agent to visit customers and to maxi-mize total expected profit within a given time limit while taking the uncertainties in travel times caused by traffic congestion into account. Agents are not required to visit every customer and the tour of each agent starts and ends at a certain depot node. It is assumed that the travel time to go from a customer to another customer is random and depends on the departure. We use a time-dependent travel time model that has first-in-first-out property while calculating the travel times. We propose a two-stage stochastic mixed-integer program to formulate the problem and suggest Integer L-shaped method in order to solve large-scale problem instances. In our computational study, we analyze the benefit of using stochastic solutions, and observe that Integer L-shaped method is superior to CPLEX in terms of computational time.en_US
dc.description.provenanceSubmitted by Betül Özen (ozen@bilkent.edu.tr) on 2021-08-19T05:24:31Z No. of bitstreams: 1 10410186.pdf: 1971037 bytes, checksum: 8f6e4c6375c68b2ea1b4f6a3f6540585 (MD5)en
dc.description.provenanceMade available in DSpace on 2021-08-19T05:24:31Z (GMT). No. of bitstreams: 1 10410186.pdf: 1971037 bytes, checksum: 8f6e4c6375c68b2ea1b4f6a3f6540585 (MD5) Previous issue date: 2021-07en
dc.description.statementofresponsibilityby Şifanur Çeliken_US
dc.format.extentxi, 76 leaves : illustrations ; 30 cm.en_US
dc.identifier.itemidB133985
dc.identifier.urihttp://hdl.handle.net/11693/76463
dc.language.isoEnglishen_US
dc.rightsinfo:eu-repo/semantics/openAccessen_US
dc.subjectTwo-stage stochastic programmingen_US
dc.subjectOrienteering problemen_US
dc.subjectInteger L-shaped methoden_US
dc.subjectTime-dependent stochastic travel timeen_US
dc.titleTeam orienteering problem with stochastic time-dependent travel timeen_US
dc.title.alternativeZamana bağlı rassal yolculuk sürel takım oryantiring problemien_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:
10410186.pdf
Size:
1.88 MB
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.69 KB
Format:
Item-specific license agreed upon to submission
Description:
Download

Collections

Graduate School of Engineering and Science