Hit papers significantly outperform the citation benchmark for their cohort. A paper qualifies
if it has ≥500 total citations, achieves ≥1.5× the top-1% citation threshold for papers in the
same subfield and year (this is the minimum needed to enter the top 1%, not the average
within it), or reaches the top citation threshold in at least one of its specific research
topics.
Vehicle Routing Problem with Time Windows, Part I: Route Construction and Local Search Algorithms
2005747 citationsOlli Bräysy, Michel GendreauTransportation Scienceprofile →
Vehicle Routing Problem with Time Windows, Part II: Metaheuristics
2005569 citationsOlli Bräysy, Michel GendreauTransportation Scienceprofile →
Peers — A (Enhanced Table)
Peers by citation overlap · career bar shows stage (early→late)
cites ·
hero ref
This map shows the geographic impact of Olli Bräysy's research. It shows the number of citations coming from papers published by authors working in each country. You can also color the map by specialization and compare the number of citations received by Olli Bräysy with the expected number of citations based on a country's size and research output (numbers larger than one mean the country cites Olli Bräysy more than expected).
This network shows the impact of papers produced by Olli Bräysy. Nodes represent research fields, and links connect fields that are likely to share authors. Colored nodes show fields that tend to cite the papers produced by Olli Bräysy. The network helps show where Olli Bräysy may publish in the future.
Co-authorship network of co-authors of Olli Bräysy
This figure shows the co-authorship network connecting the top 25 collaborators of Olli Bräysy.
A scholar is included among the top collaborators of Olli Bräysy based on the total number of
citations received by their joint publications. Widths of edges
represent the number of papers authors have co-authored together.
Node borders
signify the number of papers an author published with Olli Bräysy. Olli Bräysy is excluded from
the visualization to improve readability, since they are connected to all nodes in the network.
All Works
20 of 20 papers shown
1.
Bräysy, Olli & Geir Hasle. (2013). Software tools and emerging technologies for vehicle routing and intermodal transportation. Data Archiving and Networked Services (DANS).10 indexed citations
2.
Bräysy, Olli, et al.. (2012). Planning Strategies for Home Care Services. Theseus (Ammattikorkeakoulujen).1 indexed citations
Bräysy, Olli, Michel Gendreau, Geir Hasle, & Arne Løkketangen. (2008). A Survey of Heuristics for the Vehicle Routing Problem Part II: Demand Side Extensions. Duo Research Archive (University of Oslo).11 indexed citations
Bräysy, Olli, Michel Gendreau, Geir Hasle, & Arne Løkketangen. (2008). A Survey of Heuristics for the Vehicle Routing Problem Part I: Basic Problems and Supply Side Extensions. Duo Research Archive (University of Oslo).10 indexed citations
Bräysy, Olli, Jean Berger, Mohamed Barkaoui, & Wout Dullaert. (2003). A Threshold Accepting Metaheuristic for the Vehicle Routing Problem with Time Windows.. Central European Journal of Operations Research. 11(4). 369–387.11 indexed citations
Bräysy, Olli. (2001). Local search and variable neighborhood search algorithms for the vehicle routing problem with time windows. Osuva (University of Vaasa).15 indexed citations
19.
Bräysy, Olli, Michel Gendreau, & Geir Hasle. (2001). Route Construction and Local Search Algorithms for the Vehicle Routing Problem with Time Windows.25 indexed citations
20.
Bräysy, Olli. (1999). A new algorithm for the vehicle routing problem with time windows based on the hybridization of a genetic algorithm and route construction heuristics. Osuva (University of Vaasa).9 indexed citations
Rankless uses publication and citation data sourced from OpenAlex, an open and comprehensive
bibliographic database. While OpenAlex provides broad and valuable coverage of the global
research landscape, it—like all bibliographic datasets—has inherent limitations. These include
incomplete records, variations in author disambiguation, differences in journal indexing, and
delays in data updates. As a result, some metrics and network relationships displayed in
Rankless may not fully capture the entirety of a scholar's output or impact.