A Two Stage Solution Procedure for Real-Life Location-Routing Problem

dc.contributor.author	YAŞAR, Esra
dc.contributor.author	BOTSALI, Aahmet Reha
dc.date.accessioned	2019-07-10T12:16:04Z
dc.date.available	2019-07-10T12:16:04Z
dc.date.issued	2018-04
dc.identifier.uri	https://hdl.handle.net/20.500.12498/1120
dc.description.abstract	Warehouse location selection and vehicle routing are two important problems that are studied in supply chain literature. Although it is possible to solve the classical warehouse location selection problem at the optimal level for most cases, the vehicle routing problem is more difficult to solve. The simplest version of vehicle routing problem is the travelling salesman problem (TSP) which is NP-Hard. Recently, warehouse location selection and vehicle routing problems are analyzed together as an integrated problem referred as location-routing problem. In this study, we analyzed this integrated problem for a food manufacturer in Konya, Turkey and display a two stage solution procedure based on mathematical programming.	en_US
dc.language.iso	en	en_US
dc.publisher	7th International Conference on Advanced Technology and Science (ICAT 2018)	en_US
dc.title	A Two Stage Solution Procedure for Real-Life Location-Routing Problem	en_US
dc.type	Konferans Bildirisi	en_US