default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDBülent Çatay
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[j26]Raci Berk Islim
, Bülent Çatay:
An effective matheuristic approach for solving the electric traveling salesperson problem with time windows and battery degradation. Eng. Appl. Artif. Intell. 132: 107943 (2024)- 2023
- [j25]Sina Rastani, Bülent Çatay:
A large neighborhood search-based matheuristic for the load-dependent electric vehicle routing problem with time windows. Ann. Oper. Res. 324(1): 761-793 (2023) - [j24]Nima Moradi, Ihsan Sadati, Bülent Çatay:
Last mile delivery routing problem using autonomous electric vehicles. Comput. Ind. Eng. 184: 109552 (2023) - [j23]Bülent Çatay, Ihsan Sadati:
An improved matheuristic for solving the electric vehicle routing problem with time windows and synchronized mobile charging/battery swapping. Comput. Oper. Res. 159: 106310 (2023) - 2022
- [j22]Mir Ehsan Hesam Sadati, Vahid Akbari, Bülent Çatay:
Electric vehicle routing problem with flexible deliveries. Int. J. Prod. Res. 60(13): 4268-4294 (2022) - [j21]Ece Naz Duman, Duygu Tas, Bülent Çatay:
Branch-and-price-and-cut methods for the electric vehicle routing problem with time windows. Int. J. Prod. Res. 60(17): 5332-5353 (2022) - [j20]Umman Mahir Yildirim, Bülent Çatay:
An Enhanced Network-Consistent Travel Speed Generation Scheme on Time-Dependent Shortest Path and Routing Problems. IEEE Trans. Intell. Transp. Syst. 23(2): 873-884 (2022) - 2021
- [j19]Merve Keskin, Bülent Çatay, Gilbert Laporte:
A simulation-based heuristic for the electric vehicle routing problem with time windows and stochastic waiting times at recharging stations. Comput. Oper. Res. 125: 105060 (2021) - [j18]Mir Ehsan Hesam Sadati, Bülent Çatay, Deniz Aksen:
An efficient variable neighborhood search with tabu shaking for a class of multi-depot vehicle routing problems. Comput. Oper. Res. 133: 105269 (2021)
2010 – 2019
- 2019
- [j17]Merve Keskin, Gilbert Laporte, Bülent Çatay:
Electric Vehicle Routing Problem with Time-Dependent Waiting Times at Recharging Stations. Comput. Oper. Res. 107: 77-94 (2019) - [c11]Merve Keskin, Raha Akhavan-Tabatabaei, Bülent Çatay:
Electric Vehicle Routing Problem with Time Windows and Stochastic Waiting Times at Recharging Stations. WSC 2019: 1649-1659 - 2018
- [j16]Merve Keskin, Bülent Çatay:
A matheuristic method for the electric vehicle routing problem with time windows and fast chargers. Comput. Oper. Res. 100: 172-188 (2018) - [c10]Umut Can Çakmak, Bülent Çatay, Mehmet Serkan Apaydin:
A neural network approach for predicting speeds on road networks. SIU 2018: 1-4 - 2017
- [c9]Bülent Çatay, Merve Keskin:
The impact of quick charging stations on the route planning of Electric Vehicles. ISCC 2017: 152-157 - [c8]Umut Can Çakmak, Mehmet Serkan Apaydin, Bülent Çatay:
Traffic Speed Prediction with Neural Networks. OR 2017: 737-743 - 2016
- [j15]Ugur Emeç, Bülent Çatay, Burçin Bozkaya:
An Adaptive Large Neighborhood Search for an E-grocery Delivery Routing Problem. Comput. Oper. Res. 69: 109-125 (2016) - 2015
- [j14]Murodzhon Akhmedov, Bülent Çatay, Mehmet Serkan Apaydin:
Automating unambiguous NOE data usage in NVR for NMR protein structure-based assignments. J. Bioinform. Comput. Biol. 13(6): 1550020:1-1550020:14 (2015) - [c7]Umman Mahir Yildirim, Bülent Çatay:
An Ant Colony-Based Matheuristic Approach for Solving a Class of Vehicle Routing Problems. ICCL 2015: 105-119 - [c6]Wei Shi, Thomas Weise, Raymond Chiong, Bülent Çatay:
Hybrid PACO with Enhanced Pheromone Initialization for Solving the Vehicle Routing Problem with Time Windows. SSCI 2015: 1735-1742 - [c5]Basak Tozlu, Rebi Daldal, Tonguç Ünlüyurt, Bülent Çatay:
Crew Constrained Home Care Routing Problem with Time Windows. SSCI 2015: 1751-1757 - 2014
- [j13]Liang Wen, Bülent Çatay, Richard W. Eglese:
Finding a minimum cost path between a pair of nodes in a time-varying road network with a congestion charge. Eur. J. Oper. Res. 236(3): 915-923 (2014) - 2013
- [c4]Jeyhun Aslanov, Bülent Çatay, Mehmet Serkan Apaydin:
An ant colony optimization approach for solving the nuclear magnetic resonance structure based assignment problem. GECCO (Companion) 2013: 1609-1616 - [c3]Murodzhon Akhmedov, Bülent Çatay, Mehmet Serkan Apaydin:
Distinguishing the type of NOE for NMR protein Structure-Based Assignments. SIU 2013: 1-4 - 2012
- [j12]Umman Mahir Yildirim, Bülent Çatay:
A time-based pheromone approach for the ant system. Optim. Lett. 6(6): 1081-1099 (2012) - [j11]Ayfer Basar, Bülent Çatay, Tonguç Ünlüyurt:
A taxonomy for emergency service station location problem. Optim. Lett. 6(6): 1147-1160 (2012) - [j10]Gizem Çavuslar, Bülent Çatay, Mehmet Serkan Apaydin:
A Tabu Search Approach for the NMR Protein Structure-Based Assignment Problem. IEEE ACM Trans. Comput. Biol. Bioinform. 9(6): 1621-1628 (2012) - 2011
- [j9]Mehmet Serkan Apaydin, Bülent Çatay, Nicholas Patrick, Bruce Randall Donald:
NVR-BIP: Nuclear Vector Replacement using Binary Integer Programming for NMR Structure-Based Assignments. Comput. J. 54(5): 708-716 (2011) - [j8]Bülent Çatay, Özgür Özlük, Tonguç Ünlüyurt:
TestAnt: An ant colony system approach to sequential testing under precedence constraints. Expert Syst. Appl. 38(12): 14945-14951 (2011) - [j7]Tamer Doyuran, Bülent Çatay:
A robust enhancement to the Clarke-Wright savings algorithm. J. Oper. Res. Soc. 62(1): 223-231 (2011) - [j6]Ayfer Basar, Bülent Çatay, Tonguç Ünlüyurt:
A multi-period double coverage approach for locating the emergency medical service stations in Istanbul. J. Oper. Res. Soc. 62(4): 627-637 (2011) - [j5]Bülent Çatay:
Siting new fire stations in Istanbul: A risk-based optimization approach. OR Insight 24(2): 77-89 (2011) - 2010
- [j4]Bülent Çatay:
A new saving-based ant algorithm for the Vehicle Routing Problem with Simultaneous Pickup and Delivery. Expert Syst. Appl. 37(10): 6809-6817 (2010) - [c2]Mehmet Çagri Çalpur, Hakan Erdogan, Bülent Çatay, Bruce Randall Donald, Mehmet Serkan Apaydin:
Developing a Scoring Function for NMR Structure-based Assignments using Machine Learning. ISCIS 2010: 87-90
2000 – 2009
- 2009
- [c1]Mehmet Serkan Apaydin, Bülent Çatay, Nicholas Patrick, Bruce Randall Donald:
NVR-BIP: Nuclear vector replacement using binary integer programming for NMR structure-based assignments. ISCIS 2009: 177-182 - [p1]Bülent Çatay:
Ant Colony Optimization and Its Application to the Vehicle Routing Problem with Pickups and Deliveries. Natural Intelligence for Scheduling, Planning and Packing Problems 2009: 219-244 - 2006
- [j3]Pinar Yilmaz, Bülent Çatay:
Strategic level three-stage production distribution planning with capacity expansion. Comput. Ind. Eng. 51(4): 609-620 (2006) - 2003
- [j2]Bülent Çatay, S. Selçuk Erengüç, Asoo J. Vakharia:
Tool capacity planning in semiconductor manufacturing. Comput. Oper. Res. 30(9): 1349-1366 (2003)
1990 – 1999
- 1997
- [j1]Asoo J. Vakharia, Bülent Çatay:
Two Machine Openshop Scheduling with Machine-dependent Processing Times. Discret. Appl. Math. 73(3): 283-288 (1997)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-10-07 22:14 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
