• Branch-and-price-and-cut methods for the electric vehicle routing problem with time windows 

  Duman, Ece Naz; Taş, Duygu; Çatay, Bülent (Taylor and Francis, 2021)

  In this paper, we address the electric vehicle routing problem with time windows and propose two branch-and-price-and-cut methods based on a column generation algorithm. One is an exact algorithm whereas the other is a ...

• Determining and evaluating new store locations using remote sensing and machine learning 

  Höke, Berkan; Turgay, Zeynep Zerrin; Ünsalan, Cem; Küçükaydın, Hande (Tübitak, 2021)

  Decision making for store locations is crucial for retail companies as the profit depends on the location. The key point for correct store location is profit approximation, which is highly dependent on population of the ...

• Prioritization of public services for digitalization using fuzzy Z-AHP and fuzzy Z-WASPAS 

  Sergi, Duygu; Ucal Sarı, İrem (Springer, 2021)

  In this paper, public services are analyzed for implementations of Industry 4.0 tools to satisfy citizen expectations. To be able to prioritize public services for digitalization, fuzzy Z-AHP and fuzzy Z-WASPAS are used ...

• Analysis of a new business model to fundraise non-governmental organizations using fuzzy cognitive maps 

  Ucal Sari, Irema; Sergi, Duygu; Aytore, Can (IOS Press, 2020)

  Fundraising is one of the most critical issues for non-governmental organizations (NGOs) to carry out their projects. In this paper, a search engine project which aims to find additional financial sources and increase ...

• Büyük ölçekli etki enbüyükleme problemi için lagrange gevşetmesi tabanlı etkin bir çözüm yöntemi 

  Güney, Evren (AKÜ FEMÜBİD, 2020)

  Etki Enbüyükleme Problemi (EEP) büyük bir sosyal ağ içindeki en etkin K tane kişiyi seçen zor bir stokastik kombinatoryal eniyileme problemidir. Son yıllarda pek çok araştırmacının ilgisini çeken bu problem için çok sayıda ...

• Large-scale influence maximization via maximal covering location 

  Güney, Evren; Leitner, Markus; Ruthmair, Mario; Sinnl, Markus (Elsevier, 2020)

  Influence maximization aims at identifying a limited set of key individuals in a (social) network which spreads information based on some propagation model and maximizes the number of individuals reached. We show that ...

• Gradual covering location problem with multi-type facilities considering customer preferences 

  Küçükaydın, Hande; Aras, Necati (Elsevier, 2020)

  In this paper, we address a discrete facility location problem where a retailer aims at locating new facilities with possibly different characteristics. Customers visit the facilities based on their preferences which are ...

• Consumer loans' first payment default detection: a predictive model 

  Koç, Utku; Sevgili, Türkan (TUBITAK SCIENTIFIC & TECHNICAL RESEARCH COUNCIL, 2020)

  A default loan (also called nonperforming loan) occurs when there is a failure to meet bank conditions and repayment cannot be made in accordance with the terms of the loan which has reached its maturity. In this study, ...

• Stokastik süreler içeren kapasite kısıtlı parti büyüklüğü belirleme problemi 

  Taş, Duygu (EJOSAT - DergiPark, 2019)

  Bu makalede üretim ve kurulum süreleri stokastik olan kapasite kısıtlı çok ürünlü dinamik parti büyüklüğü belirleme problemi ele alınmıştır. Bu problemde tüm sürelerin stokastik olduğu durum göz önünde bulundurularak hem ...

• Electric vehicle routing with flexible time windows: a column generation solution approach 

  Taş, Duygu (Taylor & Francis, 2020)

  In this paper, we introduce the Electric Vehicle Routing Problem with Flexible Time Windows (EVRPFTW) in which vehicles are allowed to serve customers before and after the earliest and latest time window bounds, respectively. ...

• An efficient linear programming based method for the influence maximization problem in social networks (vol 503, pg 589, 2019) 

  Güney, Evren (Elsevier, 2020)

  The influence maximization problem (IMP) aims to determine the most influential individuals within a social network. In this study first we develop a binary integer program thatapproximates the original problem by Monte ...

• Minimizing the misinformation spread in social networks 

  Tanınmış, Kübra; Aras, Necati; Kuban, İ. Kuban Altınel; Güney, Evren (Taylor and Francis, 2019)

  The Influence Maximization Problem has been widely studied in recent years, due to rich application areas including marketing. It involves finding k nodes to trigger a spread such that the expected number of influenced ...

• An efficient linear programming based method for the influence maximization problem in social networks 

  Güney, Evren (Elsevier, 2019)

  The influence maximization problem (IMP) aims to determine the most influential individuals within a social network. In this study first we develop a binary integer program that approximates the original problem by Monte ...

• A strong integer programming formulation for hybrid flowshop scheduling 

  Ünal, A. Tamer; Ağralı, Semra; Taşkın, Z. Caner (Taylor & Francis, 2019)

  We consider a hybrid flowshop scheduling problem that includes parallel unrelated discrete machines or batch processing machines in different stages of a production system. The problem is motivated by a bottleneck process ...

• Column generation based matheuristics for a vehicle routing problem with time windows and variable start time 

  Küçükaydın, Hande (DergiPark, 2019)

  In this study, a vehicle routing problem with time windows is investigated, where the costs depend on the total duration of vehicle routes and the starting time from the depot for each vehicle is determined by a decision ...

• Grounding probability in narrow waterways 

  Özlem, Şirin; Altan, Yiğit Can; Otay, Emre N.; Or, İlhan (Cambridge University Press, 2019)

  The Strait of Istanbul is one of the world's busiest, narrowest and most winding waterways. As such, there is a high grounding probability for vessels. Although a number of grounding probability models exist, they have ...

• Increasing procurement efficiency through optimal e-commerce enablement scheduling 

  Cholette, Susan; Clark, Andrew G; Özlük, Özgür (Emerald Group Publishing Ltd., 2019)

  Purpose: This study aims to show how cost savings can be achieved through optimizing the scheduling of e-commerce enablements. The University of California is one of the largest, most prestigious public education and ...

• Carbon price forecasting models based on big data analytics 

  Yahşi, Mustafa; Çanakoğlu, Ethem; Ağralı, Semra (Taylor and Francis Ltd., 2019)

  After the establishment of the European Union's Emissions Trading System (EU-ETS) carbon pricing attracted many researchers. This paper aims to develop a prediction model that anticipates future carbon prices given a ...

• Optimal keyword bidding in search-based advertising with budget constraint and stochastic ad position 

  Küçükaydın, Hande; Selçuk, Barış; Özlük, Özgür (Taylor & Francis, 2019)

  This paper analyses the search-based advertising problem from an advertiser’s view point, and proposes optimal bid prices for a set of keywords targeted for the advertising campaign. The advertiser aims to maximise its ...

• Risk averse investment strategies for a private electricity generating company in a carbon constrained environment 

  Adıyeke, Esra; Çanakoğlu, Ethem; Ağralı, Semra (Taylor & Francis, 2019)

  We study a private electricity generating company that plans to enter a partially regulated market that operates under an active cap and trade system. There are different types of thermal and renewable power plants that ...

View more