A heuristic solution procedure for the inventory routing problem

dc.contributor	Graduate Program in Industrial Engineering.
dc.contributor.advisor	Or, İlhan.
dc.contributor.author	Yüksel, Remzi.
dc.date.accessioned	2023-03-16T10:29:48Z
dc.date.available	2023-03-16T10:29:48Z
dc.date.issued	1985.
dc.description.abstract	In this study, it is aimed to present a heuristic solution procedure for the Inventory Routing Problem, which is an important extension of the Vehicle Routing Problem. The Inventory Routing Problem has the same basic structure as the Vehicle Routing Problem. However, it leads to a very complex and large mathematical programming formulation since additional consideration is given to vehicle travel time constraints as well as to inventor fluctuations and stockouts. A computer program is developed incbrder to obtain computational results for the suggested heuristic solution procedure.
dc.format.extent	30 cm.
dc.format.pages	viii, 70 leaves;
dc.identifier.other	IE 1985 Y9
dc.identifier.uri	https://hdl.handle.net/20.500.14908/13421
dc.publisher	Thesis (M.S.) - Bogazici University. Institute for Graduate Studies in Science and Engineering, 1985.
dc.relation	Includes appendices.
dc.relation	Includes appendices.
dc.subject.lcsh	Heuristic programming.
dc.title	A heuristic solution procedure for the inventory routing problem

Files

Now showing 1 - 1 of 1