Researcher profile

Trevor Bihl

Trevor Bihl contributes to research discovery and scholarly infrastructure.

ResearcherAffiliation not importedOpen to collaborate

Trust snapshot

Quick read

Trust 13 - UnverifiedVerification L1Unclaimed author
2works
0followers
2topics
4close collaborators

Actions

Decide how to stay connected

Follow researcher0

Identity and collaboration

How to connect with this researcher

Claiming links this public author record to a researcher profile and unlocks direct collaboration workflows.

Log in to claim

Direct collaboration

Open a focused conversation when the fit is right

Claim this author entity first to unlock direct invitations.

Research graph

See the researcher in context

Open full explorer

Inspect adjacent work, topics, institutions and collaborators without jumping out to a separate graph page.

Building this graph slice

BZPEER is loading the nearby papers, people, topics and institutions for this page.

Published work

2 published item(s)

preprint2026arXiv

Preliminary Insights in Chronos Frequency Data Understanding and Reconstruction

This paper presents a preliminary analysis of the ability of Chronos foundation model to process and internally represent frequency domain information. Foundation models that process time-series data offer practitioners a unified architecture capable of learning generic temporal representations across diverse tasks and domains, reducing the need for task-specific feature engineering and enabling transfer across signal modalities. Despite their growing adoption, the extent to which such models encode fundamental signal properties remains insufficiently characterised. We address this gap by analysing Chronos under controlled conditions, starting from the simplest class of signals: discrete sinusoids generated at fixed frequencies. Using lightweight online minimum description length probes applied to the decoder architecture, we test for the presence and separability of frequency information in the model's internal representations. The results provide insight into how frequential content is captured across the frequency spectrum and highlight regimes in which representation quality may degrade or require particular care. These findings offer practical guidance for users of Chronos in signal processing and information fusion contexts, and contribute to ongoing efforts to improve the interpretability and evaluation of foundation models for temporal data.

preprint2023arXiv

Heuristic for Min-Max Heterogeneous Multi-Vehicle Multi-Depot Traveling Salesman Problem

In this article, a heuristic is proposed for a min-max heterogeneous multi-vehicle multi-depot traveling salesman problem (TSP), wherein heterogeneous vehicles start from given depot positions and need to cover a given set of targets. The vehicles should cover given targets such that the maximum tour time is minimized. In the considered problem, vehicles considered can be functionally heterogeneous, wherein specific targets must be covered by a particular vehicle, structurally heterogeneous, wherein the vehicles can travel at different speeds, or both. The proposed heuristic generalizes the MD heuristic for the min-max homogeneous multi-vehicle multi-depot TSP and has three stages: an initialization stage to generate a feasible solution, a local search stage in which the vehicle with the maximum tour time is improved, and a perturbation stage to break from a local minimum. The proposed heuristic is benchmarked with the optimal solution obtained by solving a mixed integer linear program using branch and cut for instances considering three vehicles covering thirty targets. Variations in the percentage of vehicle-target assignments and the number of vehicles starting at the same depot are studied to show the heuristic's effectiveness in producing high-quality solutions. It was observed that the heuristic generated feasible solutions within 4% of the optimum on average for the considered instances.