Show simple item record

dc.contributor.advisorAlp, Osmanen_US
dc.contributor.authorUzun, Emreen_US
dc.date.accessioned2016-01-08T18:09:15Z
dc.date.available2016-01-08T18:09:15Z
dc.date.issued2009
dc.identifier.urihttp://hdl.handle.net/11693/14835
dc.descriptionAnkara : The Department of Industrial Engineering and the Institute of Engineering and Science of Bilkent University, 2009.en_US
dc.descriptionThesis (Master's) -- Bilkent University, 2009.en_US
dc.descriptionIncludes bibliographical references leaves 54-56.en_US
dc.description.abstractIn this study, we examine an integrated routing and scheduling problem that arises in the context of transportation of hazardous materials. The purpose of the problem is to find a minimum risk route between an origin and a destination point on a given network and to build a schedule on this route that determines where and how long to stop for a truck carrying hazardous materials. The objective is to minimize the risk imposed to the society while completing the path within a given time limit. The risk is defined as the expected population exposure in the presence of an accident which varies different times in a day. There are exact algorithms available in the literature that solve the problem. However, these algorithms are not capable of solving large sized networks due to memory constraints. Our aim is to develop a heuristic procedure that can handle larger networks. We separate the problem into two independent components, routing and scheduling, and propose solution algorithms which would communicate each other when running the algorithm. For the routing component we define a neighborhood structure that can be used to generate several paths around a given path on a network. The search procedure takes an initial path and improves it by generating different paths in the defined neighborhood. For the scheduling component, we discuss mixed integer programming, dynamic programming and heuristic approaches. We run the proposed heuristic algorithm on several test networks and compare its performance with the optimal solutions. We also present the application of the heuristic procedure on a large sized Turkey Road Network.en_US
dc.description.statementofresponsibilityUzun, Emreen_US
dc.format.extentxiii, 67 leaves, tablesen_US
dc.language.isoEnglishen_US
dc.rightsinfo:eu-repo/semantics/openAccessen_US
dc.subjectIntegrated Routing and Scheduling Problemen_US
dc.subjectDynamic Programmingen_US
dc.subjectHeuristic Proceduresen_US
dc.subject.lccQA402.6 .U98 2009en_US
dc.subject.lcshVehicle routing problem.en_US
dc.subject.lcshTransportation--Mathematical models.en_US
dc.subject.lcshTransportation problems (Programming)en_US
dc.subject.lcshScheduling (Management)--Mathematical models.en_US
dc.subject.lcshTransportation--Planning.en_US
dc.titleA heuristic algorithm for an integrated routing and scheduling problem with stops en-routeen_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