Tolga Bektas
Orcid: 0000-0003-0634-144XAffiliations:
- University of Liverpool, UK
- University of Southampton, UK (former)
According to our database1,
Tolga Bektas
authored at least 71 papers
between 2004 and 2024.
Collaborative distances:
Collaborative distances:
Timeline
Legend:
Book In proceedings Article PhD thesis Dataset OtherLinks
Online presence:
-
on zbmath.org
-
on orcid.org
On csauthors.net:
Bibliography
2024
Improving last-mile parcel delivery through shared consolidation and portering: A case study in London.
J. Oper. Res. Soc., June, 2024
2023
Networks, December, 2023
Designing a multi-modal and variable-echelon delivery system for last-mile logistics.
Eur. J. Oper. Res., June, 2023
2022
Node-based Lagrangian relaxations for multicommodity capacitated fixed-charge network design.
Discret. Appl. Math., 2022
2020
J. Sched., 2020
Comput. Oper. Res., 2020
Compact formulations for multi-depot routing problems: Theoretical and computational comparisons.
Comput. Oper. Res., 2020
Optimised solutions to the last-mile delivery problem in London using a combination of walking and driving.
Ann. Oper. Res., 2020
Ann. Oper. Res., 2020
Last-Mile Logistics in Urban Areas.
Proceedings of the 6th International Conference on Vehicle Technology and Intelligent Transport Systems, 2020
2019
J. Oper. Res. Soc., 2019
Revisiting the Hamiltonian p-median problem: A new formulation on directed graphs and a branch-and-cut algorithm.
Eur. J. Oper. Res., 2019
Eur. J. Oper. Res., 2019
Eur. J. Oper. Res., 2019
Ann. Oper. Res., 2019
Park And Parcel: An Agent-Based Exploration Of Last-Mile Freight Delivery Behavior As It Relates To Parking.
Proceedings of the 2019 Spring Simulation Conference, 2019
2018
Path and Speed Optimization for Conflict-Free Pickup and Delivery Under Time Windows.
Transp. Sci., 2018
INFORMS J. Comput., 2018
Multicommodity flows and Benders decomposition for restricted continuous location problems.
Eur. J. Oper. Res., 2018
Proceedings of the 5th International Conference on Information and Communication Technology for Sustainability, 2018
Proceedings of the 2018 CHI Conference on Human Factors in Computing Systems, 2018
2017
J. Heuristics, 2017
Eur. J. Oper. Res., 2017
A New Formulation for the Combined Maritime Fleet Deployment and Inventory Management Problem.
Proceedings of the Computational Logistics - 8th International Conference, 2017
2016
A multiperiod location-routing problem arising in the collection of Olive Oil Mill Wastewater.
J. Oper. Res. Soc., 2016
A modelling framework for solving restricted planar location problems using phi-objects.
J. Oper. Res. Soc., 2016
Int. Trans. Oper. Res., 2016
A cycle-based evolutionary algorithm for the fixed-charge capacitated multi-commodity network design problem.
Eur. J. Oper. Res., 2016
The fleet size and mix location-routing problem with time windows: Formulations and a heuristic algorithm.
Eur. J. Oper. Res., 2016
2015
Networks, 2015
Matheuristics for solving a multi-attribute collection problem for a charity organisation.
J. Oper. Res. Soc., 2015
A hybrid evolutionary algorithm for heterogeneous fleet vehicle routing problems with time windows.
Comput. Oper. Res., 2015
2014
A simheuristic algorithm for the Single-Period Stochastic Inventory-Routing Problem with stock-outs.
Simul. Model. Pract. Theory, 2014
Eur. J. Oper. Res., 2014
Eur. J. Oper. Res., 2014
Routing fleets with multiple driving ranges: Is it possible to use greener fleet configurations?
Appl. Soft Comput., 2014
2013
Proceedings of the IEEE Symposium on Computational Intelligence In Production And Logistics Systems, 2013
2012
Eur. J. Oper. Res., 2012
Formulations and Benders decomposition algorithms for multidepot salesmen problems with load balancing.
Eur. J. Oper. Res., 2012
Combining biased randomization with meta-heuristics for solving the multi-depot vehicle routing problem.
Proceedings of the Winter Simulation Conference, 2012
Combining Monte Carlo simulation with heuristics for solving the inventory routing problem with stochastic demands.
Proceedings of the Winter Simulation Conference, 2012
2011
Formulations and Branch-and-Cut Algorithms for the Generalized Vehicle Routing Problem.
Transp. Sci., 2011
Look, here comes the library van! Optimising the timetable of the mobile library service on the Isle of Wight.
OR Insight, 2011
2010
Lagrangean-based decomposition algorithms for multicommodity network design problems with penalized constraints.
Networks, 2010
Minimizing greenhouse gas emissions in intermodal freight transport: an application to rail service design.
J. Oper. Res. Soc., 2010
2009
Integrated cellular manufacturing systems design with production planning and dynamic system reconfiguration.
Eur. J. Oper. Res., 2009
2008
A two-level simulated annealing algorithm for efficient dissemination of electronic content.
J. Oper. Res. Soc., 2008
Lagrangean-based solution approaches for the generalized problem of locating capacitated warehouses.
Int. Trans. Oper. Res., 2008
Exact algorithms for the joint object placement and request routing problem in content distribution networks.
Comput. Oper. Res., 2008
2007
J. Oper. Res. Soc., 2007
Une heuristique de recherche avec tabous pour la conception de réseaux de distribution de contenu électronique.
INFOR Inf. Syst. Oper. Res., 2007
A Lagrangean relaxation and decomposition algorithm for the video placement and routing problem.
Eur. J. Oper. Res., 2007
Comput. Oper. Res., 2007
2006
Simulation optimization based DSS application: A diamond tool production line in industry.
Simul. Model. Pract. Theory, 2006
IEEE Commun. Lett., 2006
Integer linear programming formulations of multiple salesman problems and its variations.
Eur. J. Oper. Res., 2006
2005
Proceedings of the Computational Science, 2005
A Pathway for Process Improvement Activities in a Production Environment: A Case Study in a Rework Department.
Proceedings of the Business Process Management, 3rd International Conference, 2005
2004
A note on the lifted Miller-Tucker-Zemlin subtour elimination constraints for the capacitated vehicle routing problem.
Eur. J. Oper. Res., 2004