A branch and cut algorithm for the inventory routing problem

Simple item page
buir.advisorPaternotte, Hande Yaman
dc.contributor.authorMahmutoğulları, Özlem
dc.date.accessioned2019-08-08T08:48:28Z
dc.date.available2019-08-08T08:48:28Z
dc.date.copyright2019-07
dc.date.issued2019-07
dc.date.submitted2019-07-16
dc.departmentDepartment of Industrial Engineeringen_US
dc.descriptionCataloged from PDF version of article.en_US
dc.descriptionThesis (M.S.): Bilkent University, Department of Industrial Engineering, İhsan Doğramacı Bilkent University, 2019.en_US
dc.descriptionIncludes bibliographical references (leaves 51-53).en_US
dc.description.abstractThe inventory routing problem arises in vendor managed systems where products are distributed from a supplier to a set of retailers by a homogeneous eet of capacitated vehicles. The routes of the vehicles and the quantities of products sent to each retailer in each time period are determined in such a way that no stockouts occur and total costs arising from inventory holding and transportation are minimized. Different inventory replenishment policies can be used while managing the inventories at retailers. We consider the problem with the maximum level inventory replenishment policy. We present a mixed integer linear programming model and derive valid inequalities using several structured relaxations. We relate our valid inequalities to those in the previous studies. We also propose new valid inequalities, implement a branch and cut algorithm and present computational results on benchmark instances from the literature as well as new randomly generated instances.en_US
dc.description.degreeM.S.en_US
dc.description.statementofresponsibilityby Özlem Mahmutoğullarıen_US
dc.format.extentxiii, 114 leaves : tables ; 30 cm.en_US
dc.identifier.itemidB123493
dc.identifier.urihttp://hdl.handle.net/11693/52322
dc.language.isoEnglishen_US
dc.publisherBilkent Universityen_US
dc.rightsinfo:eu-repo/semantics/openAccessen_US
dc.subjectVendor managed inventoryen_US
dc.subjectLot-sizingen_US
dc.subjectVehicle routingen_US
dc.subjectValid inequalitiesen_US
dc.subjectBranch and cuten_US
dc.titleA branch and cut algorithm for the inventory routing problemen_US
dc.title.alternativeEnvanter rotalama problemi için dal kesi algoritmasıen_US
dc.typeThesisen_US

Files

Original bundle
Now showing 1 - 1 of 1
Thumbnail Image
Name:
mahmutogullari_ozlem_thesis.pdf
Size:
803.4 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

Dept. of Industrial Engineering - Master's degree