Bülent Çatay

Orcid: 0000-0001-5950-3321

According to our database1, Bülent Çatay authored at least 36 papers between 1997 and 2023.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

On csauthors.net:

Bibliography

2023
An improved matheuristic for solving the electric vehicle routing problem with time windows and synchronized mobile charging/battery swapping.
Comput. Oper. Res., November, 2023

Last mile delivery routing problem using autonomous electric vehicles.
Comput. Ind. Eng., October, 2023

A large neighborhood search-based matheuristic for the load-dependent electric vehicle routing problem with time windows.
Ann. Oper. Res., May, 2023

2022
An Enhanced Network-Consistent Travel Speed Generation Scheme on Time-Dependent Shortest Path and Routing Problems.
IEEE Trans. Intell. Transp. Syst., 2022

Electric vehicle routing problem with flexible deliveries.
Int. J. Prod. Res., 2022

Branch-and-price-and-cut methods for the electric vehicle routing problem with time windows.
Int. J. Prod. Res., 2022

2021
An efficient variable neighborhood search with tabu shaking for a class of multi-depot vehicle routing problems.
Comput. Oper. Res., 2021

A simulation-based heuristic for the electric vehicle routing problem with time windows and stochastic waiting times at recharging stations.
Comput. Oper. Res., 2021

2019
Electric Vehicle Routing Problem with Time-Dependent Waiting Times at Recharging Stations.
Comput. Oper. Res., 2019

Electric Vehicle Routing Problem with Time Windows and Stochastic Waiting Times at Recharging Stations.
Proceedings of the 2019 Winter Simulation Conference, 2019

2018
A matheuristic method for the electric vehicle routing problem with time windows and fast chargers.
Comput. Oper. Res., 2018

A neural network approach for predicting speeds on road networks.
Proceedings of the 26th Signal Processing and Communications Applications Conference, 2018

2017
Traffic Speed Prediction with Neural Networks.
Proceedings of the Operations Research Proceedings 2017, 2017

The impact of quick charging stations on the route planning of Electric Vehicles.
Proceedings of the 2017 IEEE Symposium on Computers and Communications, 2017

2016
An Adaptive Large Neighborhood Search for an E-grocery Delivery Routing Problem.
Comput. Oper. Res., 2016

2015
Automating unambiguous NOE data usage in NVR for NMR protein structure-based assignments.
J. Bioinform. Comput. Biol., 2015

Crew Constrained Home Care Routing Problem with Time Windows.
Proceedings of the IEEE Symposium Series on Computational Intelligence, 2015

Hybrid PACO with Enhanced Pheromone Initialization for Solving the Vehicle Routing Problem with Time Windows.
Proceedings of the IEEE Symposium Series on Computational Intelligence, 2015

An Ant Colony-Based Matheuristic Approach for Solving a Class of Vehicle Routing Problems.
Proceedings of the Computational Logistics - 6th International Conference, 2015

2014
Finding a minimum cost path between a pair of nodes in a time-varying road network with a congestion charge.
Eur. J. Oper. Res., 2014

2013
Distinguishing the type of NOE for NMR protein Structure-Based Assignments.
Proceedings of the 21st Signal Processing and Communications Applications Conference, 2013

An ant colony optimization approach for solving the nuclear magnetic resonance structure based assignment problem.
Proceedings of the Genetic and Evolutionary Computation Conference, 2013

2012
A Tabu Search Approach for the NMR Protein Structure-Based Assignment Problem.
IEEE ACM Trans. Comput. Biol. Bioinform., 2012

A time-based pheromone approach for the ant system.
Optim. Lett., 2012

A taxonomy for emergency service station location problem.
Optim. Lett., 2012

2011
Siting new fire stations in Istanbul: A risk-based optimization approach.
OR Insight, 2011

A robust enhancement to the Clarke-Wright savings algorithm.
J. Oper. Res. Soc., 2011

A multi-period double coverage approach for locating the emergency medical service stations in Istanbul.
J. Oper. Res. Soc., 2011

TestAnt: An ant colony system approach to sequential testing under precedence constraints.
Expert Syst. Appl., 2011

NVR-BIP: Nuclear Vector Replacement using Binary Integer Programming for NMR Structure-Based Assignments.
Comput. J., 2011

2010
A new saving-based ant algorithm for the Vehicle Routing Problem with Simultaneous Pickup and Delivery.
Expert Syst. Appl., 2010

Developing a Scoring Function for NMR Structure-based Assignments using Machine Learning.
Proceedings of the Computer and Information Sciences, 2010

2009
Ant Colony Optimization and Its Application to the Vehicle Routing Problem with Pickups and Deliveries.
Proceedings of the Natural Intelligence for Scheduling, Planning and Packing Problems, 2009

2006
Strategic level three-stage production distribution planning with capacity expansion.
Comput. Ind. Eng., 2006

2003
Tool capacity planning in semiconductor manufacturing.
Comput. Oper. Res., 2003

1997
Two Machine Openshop Scheduling with Machine-dependent Processing Times.
Discret. Appl. Math., 1997


  Loading...