Burak Boyacı
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Previous Organizations / Institutes
The organizations / institutes from the scholar's other articles in the past ten years
Research Subjects
Burak Boyacı has a total of 24 co-authors. Here are the top co-authors by number of shared publications:
Nikolas Geroliminis
6 shared publicationsKonstantinos G. Zografos
3 shared publications- Georgios Aliatimis
STOR-i Centre for Doctoral Training, Lancaster University, Lancaster, UK
2 shared publications - James A. Grant
STOR-i Centre for Doctoral Training Lancaster University UK
2 shared publications - Konstantinos G. Zografos
Centre for Transport and Logistics, Department of Management Science, Lancaster University Management School, Lancaster University, Lancaster LA1 4YX, United Kingdom
2 shared publications - Ruriko Yoshida
Department of Operations Research, Naval Postgraduate School, Monterey, USA
2 shared publications
Latest Publications
- Open Access
- 4 July 2026
- Published by Springer Nature in BMC Bioinformatics
- Vol. 27 (1)
Covariance decomposition for distance based species tree estimation
In phylogenomics, species-tree methods must contend with two major sources of noise; stochastic gene-tree variation under the multispecies coalescent model (MSC) and finite-sequence substitutional noise. Fast agglomerative methods such as GLASS, STEAC, and METAL combine multi-locus information via distance-based clustering. We derive the exact covariance matrix of these pairwise distance estimates under a joint MSC-plus-substitution model and leverage it for reliable confidence estimation, and we algebraically decompose it into components attributable to coalescent variation versus sequence-level stochasticity. Our theory identifies parameter regimes where one source of variance greatly exceeds the other. For both very low and very high mutation rates, substitutional noise dominates, while coalescent variance is the primary contributor at intermediate mutation rates. Moreover, the interval over which coalescent variance dominates becomes narrower as the species-tree height increases. These results imply that in some settings one may legitimately ignore the weaker noise source when designing methods or collecting data. In particular, when gene-tree variance is dominant, adding more loci is most beneficial, while when substitution noise dominates, longer sequences or imputation are needed. Finally, leveraging the derived covariance matrix, we implement a Gaussian-sampling procedure to generate split support values for METAL trees and demonstrate empirically that this approach yields more reliable confidence estimates than traditional bootstrapping.
- 4 July 2026
- Published by Springer Nature in BMC Bioinformatics
- Vol. 27 (1)
Open AccessCovariance decomposition for distance based species tree estimation
In phylogenomics, species-tree methods must contend with two major sources of noise; stochastic gene-tree variation under the multispecies coalescent model (MSC) and finite-sequence substitutional noise. Fast agglomerative methods such as GLASS, STEAC, and METAL combine multi-locus information via distance-based clustering. We derive the exact covariance matrix of these pairwise distance estimates under a joint MSC-plus-substitution model and leverage it for reliable confidence estimation, and we algebraically decompose it into components attributable to coalescent variation versus sequence-level stochasticity. Our theory identifies parameter regimes where one source of variance greatly exceeds the other. For both very low and very high mutation rates, substitutional noise dominates, while coalescent variance is the primary contributor at intermediate mutation rates. Moreover, the interval over which coalescent variance dominates becomes narrower as the species-tree height increases. These results imply that in some settings one may legitimately ignore the weaker noise source when designing methods or collecting data. In particular, when gene-tree variance is dominant, adding more loci is most beneficial, while when substitution noise dominates, longer sequences or imputation are needed. Finally, leveraging the derived covariance matrix, we implement a Gaussian-sampling procedure to generate split support values for METAL trees and demonstrate empirically that this approach yields more reliable confidence estimates than traditional bootstrapping.
- Open Access
- 3 June 2026
- Published by Elsevier in Sustainable Technology and Entrepreneurship
- Vol. 5 (3)
Logistics as entrepreneurial infrastructure in the sustainable rural economy: A two-phase analogue–digital framework for remote agroforestry systems
- 3 June 2026
- Published by Elsevier in Sustainable Technology and Entrepreneurship
- Vol. 5 (3)
Open AccessLogistics as entrepreneurial infrastructure in the sustainable rural economy: A two-phase analogue–digital framework for remote agroforestry systems
- Open Access
- 2 July 2024
- Published by Springer Nature in Bulletin of Mathematical Biology
- Vol. 86 (8) , 1-42
Tropical Logistic Regression Model on Space of Phylogenetic Trees
Classification of gene trees is an important task both in the analysis of multi-locus phylogenetic data, and assessment of the convergence of Markov Chain Monte Carlo (MCMC) analyses used in Bayesian phylogenetic tree reconstruction. The logistic regression model is one of the most popular classification models in statistical learning, thanks to its computational speed and interpretability. However, it is not appropriate to directly apply the standard logistic regression model to a set of phylogenetic trees, as the space of phylogenetic trees is non-Euclidean and thus contradicts the standard assumptions on covariates. It is well-known in tropical geometry and phylogenetics that the space of phylogenetic trees is a tropical linear space in terms of the max-plus algebra. Therefore, in this paper, we propose an analogue approach of the logistic regression model in the setting of tropical geometry. Our proposed method outperforms classical logistic regression in terms of Area under the ROC Curve in numerical examples, including with data generated by the multi-species coalescent model. Theoretical properties such as statistical consistency have been proved and generalization error rates have been derived. Finally, our classification algorithm is proposed as an MCMC convergence criterion for . Unlike the convergence metric used by which is only dependent on tree topologies, our method is sensitive to branch lengths and therefore provides a more robust metric for convergence. In a test case, it is illustrated that the tropical logistic regression can differentiate between two independently run MCMC chains, even when the standard metric cannot.
- 2 July 2024
- Published by Springer Nature in Bulletin of Mathematical Biology
- Vol. 86 (8) , 1-42
Open AccessTropical Logistic Regression Model on Space of Phylogenetic Trees
Classification of gene trees is an important task both in the analysis of multi-locus phylogenetic data, and assessment of the convergence of Markov Chain Monte Carlo (MCMC) analyses used in Bayesian phylogenetic tree reconstruction. The logistic regression model is one of the most popular classification models in statistical learning, thanks to its computational speed and interpretability. However, it is not appropriate to directly apply the standard logistic regression model to a set of phylogenetic trees, as the space of phylogenetic trees is non-Euclidean and thus contradicts the standard assumptions on covariates. It is well-known in tropical geometry and phylogenetics that the space of phylogenetic trees is a tropical linear space in terms of the max-plus algebra. Therefore, in this paper, we propose an analogue approach of the logistic regression model in the setting of tropical geometry. Our proposed method outperforms classical logistic regression in terms of Area under the ROC Curve in numerical examples, including with data generated by the multi-species coalescent model. Theoretical properties such as statistical consistency have been proved and generalization error rates have been derived. Finally, our classification algorithm is proposed as an MCMC convergence criterion for . Unlike the convergence metric used by which is only dependent on tree topologies, our method is sensitive to branch lengths and therefore provides a more robust metric for convergence. In a test case, it is illustrated that the tropical logistic regression can differentiate between two independently run MCMC chains, even when the standard metric cannot.
- 1 October 2021
- Published by Elsevier in Transportation Research Part B: Methodological
- Vol. 152, 118-139
Enhancing the performance of one-way electric carsharing systems through the optimum deployment of fast chargers
- 1 October 2021
- Published by Elsevier in Transportation Research Part B: Methodological
- Vol. 152, 118-139
Enhancing the performance of one-way electric carsharing systems through the optimum deployment of fast chargers
- Open Access
On matchings, T‐joins, and arc routing in road networks
Matchings and T‐joins are fundamental and much‐studied concepts in graph theory and combinatorial optimization. One important application of matchings and T‐joins is in the computation of strong lower bounds for arc routing problems (ARPs). An ARP is a special kind of vehicle routing problem, in which the demands are located along edges or arcs, rather than at nodes. We point out that the literature on applying matchings and T‐joins to ARPs does not fully exploit the structure of real‐life road networks. We propose some ways to exploit this structure. Computational results show significant running time improvements, without deteriorating the quality of the lower bounds.
Open AccessOn matchings, T‐joins, and arc routing in road networks
Matchings and T‐joins are fundamental and much‐studied concepts in graph theory and combinatorial optimization. One important application of matchings and T‐joins is in the computation of strong lower bounds for arc routing problems (ARPs). An ARP is a special kind of vehicle routing problem, in which the demands are located along edges or arcs, rather than at nodes. We point out that the literature on applying matchings and T‐joins to ARPs does not fully exploit the structure of real‐life road networks. We propose some ways to exploit this structure. Computational results show significant running time improvements, without deteriorating the quality of the lower bounds.
- Open Access
Exact and hyper‐heuristic solutions for the distribution‐installation problem from the VeRoLog 2019 challenge
This work tackles a rich vehicle routing problem (VRP) problem integrating a capacitated vehicle routing problem with time windows (CVRPTW), and a service technician routing and scheduling problem (STRSP) for delivering various equipment based on customers' requests, and the subsequent installation by a number of technicians. The main objective is to reduce the overall costs of hired resources, and the total transportation costs of trucks/technicians. The problem was the topic of the fourth edition of the VeRoLog Solver Challenge in cooperation with the ORTEC company. Our contribution to research is the development of a mathematical model for this problem and a novel hyper‐heuristic algorithm to solve the problem based on a population of solutions. Experimental results on two datasets of small and real‐world size revealed the success of the hyper‐heuristic approach in finding optimal solutions in a shorter computational time, when compared to our exact model. The results of the large size dataset were also compared to the results of the eight finalists in the competition and were found to be competitive, proving the potential of our developed hyper‐heuristic framework.
Open AccessExact and hyper‐heuristic solutions for the distribution‐installation problem from the VeRoLog 2019 challenge
This work tackles a rich vehicle routing problem (VRP) problem integrating a capacitated vehicle routing problem with time windows (CVRPTW), and a service technician routing and scheduling problem (STRSP) for delivering various equipment based on customers' requests, and the subsequent installation by a number of technicians. The main objective is to reduce the overall costs of hired resources, and the total transportation costs of trucks/technicians. The problem was the topic of the fourth edition of the VeRoLog Solver Challenge in cooperation with the ORTEC company. Our contribution to research is the development of a mathematical model for this problem and a novel hyper‐heuristic algorithm to solve the problem based on a population of solutions. Experimental results on two datasets of small and real‐world size revealed the success of the hyper‐heuristic approach in finding optimal solutions in a shorter computational time, when compared to our exact model. The results of the large size dataset were also compared to the results of the eight finalists in the competition and were found to be competitive, proving the potential of our developed hyper‐heuristic framework.
- 1 March 2020
- Published by Elsevier in Transportation Research Part B: Methodological
- Vol. 133, 142-164
An optimisation framework for airline fleet maintenance scheduling with tail assignment considerations
- 1 March 2020
- Published by Elsevier in Transportation Research Part B: Methodological
- Vol. 133, 142-164
An optimisation framework for airline fleet maintenance scheduling with tail assignment considerations
- 1 December 2019
- Published by Elsevier in Transportation Research Part B: Methodological
- Vol. 130, 82-104
Dynamic prediction-based relocation policies in one-way station-based carsharing systems with complete journey reservations
- 1 December 2019
- Published by Elsevier in Transportation Research Part B: Methodological
- Vol. 130, 82-104
Dynamic prediction-based relocation policies in one-way station-based carsharing systems with complete journey reservations
- 1 November 2019
- Published by Elsevier in Transportation Research Part B: Methodological
- Vol. 129, 244-272
Investigating the effect of temporal and spatial flexibility on the performance of one-way electric carsharing systems
- 1 November 2019
- Published by Elsevier in Transportation Research Part B: Methodological
- Vol. 129, 244-272
Investigating the effect of temporal and spatial flexibility on the performance of one-way electric carsharing systems
- Top Cited Papers
- 1 January 2017
- Published by Elsevier in Transportation Research Part B: Methodological
- Vol. 95, 214-237
An integrated optimization-simulation framework for vehicle and personnel relocations of electric carsharing systems with reservations
- 1 January 2017
- Published by Elsevier in Transportation Research Part B: Methodological
- Vol. 95, 214-237
Top Cited PapersAn integrated optimization-simulation framework for vehicle and personnel relocations of electric carsharing systems with reservations