G
Güvenç Şahin
Researcher at Sabancı University
Publications - 41
Citations - 1076
Güvenç Şahin is an academic researcher from Sabancı University. The author has contributed to research in topics: Crew & Column generation. The author has an hindex of 14, co-authored 36 publications receiving 923 citations. Previous affiliations of Güvenç Şahin include University of Florida.
Papers
More filters
Journal ArticleDOI
A review of hierarchical facility location models
Güvenç Şahin,Haldun Süral +1 more
TL;DR: This study reviews the selected material in the literature, including more than 70 studies dated 1986 or later, and investigates the applications, mixed integer programming models, and solution methods presented for the hierarchical facility location models.
Journal ArticleDOI
Locational analysis for regionalization of Turkish Red Crescent blood services
TL;DR: This study develops several mathematical models to solve the location–allocation decision problems in regionalization of blood services of the Turkish Red Crescent Society.
Journal ArticleDOI
Hybrid simulation-analytical modeling approaches for the reverse logistics network design of a third-party logistics provider
TL;DR: This study considers a manufacturer that has strategically decided to outsource the company specific reverse logistics activities to a third-party logistics service provider and presents two hybrid simulation-analytical modeling approaches for the RL network design of the 3PL.
Journal ArticleDOI
An agent-based simulation of power generation company behavior in electricity markets under different market-clearing mechanisms
TL;DR: In this article, the authors investigate the strategic behavior of power generation companies under different market-clearing mechanisms using an agent-based simulation model which integrates a game-theoretical understanding of the auction mechanism in the electricity market and generation companies' learning mechanism.
Journal IssueDOI
New approaches for solving the block-to-train assignment problem
TL;DR: This paper shows that it can obtain an optimal solution of the block-to-train assignment problem within a few minutes of computational time, and can obtain heuristic solutions with 1–2p deviations from the optimal solutions within a a few seconds.