Fabien Lehuédé

1.7k total citations
29 papers, 1.2k citations indexed

About

Fabien Lehuédé is a scholar working on Industrial and Manufacturing Engineering, Automotive Engineering and Building and Construction. According to data from OpenAlex, Fabien Lehuédé has authored 29 papers receiving a total of 1.2k indexed citations (citations by other indexed papers that have themselves been cited), including 26 papers in Industrial and Manufacturing Engineering, 19 papers in Automotive Engineering and 16 papers in Building and Construction. Recurrent topics in Fabien Lehuédé's work include Vehicle Routing Optimization Methods (26 papers), Transportation and Mobility Innovations (19 papers) and Urban and Freight Transport Logistics (15 papers). Fabien Lehuédé is often cited by papers focused on Vehicle Routing Optimization Methods (26 papers), Transportation and Mobility Innovations (19 papers) and Urban and Freight Transport Logistics (15 papers). Fabien Lehuédé collaborates with scholars based in France, Canada and United States. Fabien Lehuédé's co-authors include Olivier Péton, Renaud Masson, Louis-Martin Rousseau, Philippe Grangier, Michel Gendreau, Anna Trentini, Houda Tlahig, Nicolas Malhéné, Fabien Tricoire and Nathalie Bostel and has published in prestigious journals such as European Journal of Operational Research, Journal of the Operational Research Society and Transportation Research Part C Emerging Technologies.

In The Last Decade

Fabien Lehuédé

28 papers receiving 1.1k citations

Author Peers

Peers are selected by citation overlap in the author's most active subfields. citations · hero ref

Author Last Decade Papers Cites
Fabien Lehuédé 929 711 671 234 63 29 1.2k
Diego Cattaruzza 751 0.8× 394 0.6× 470 0.7× 115 0.5× 25 0.4× 35 906
Victor Pillac 720 0.8× 526 0.7× 321 0.5× 198 0.8× 37 0.6× 7 978
Matthew E.H. Petering 1.1k 1.2× 311 0.4× 586 0.9× 325 1.4× 62 1.0× 28 1.3k
Stefan Schwerdfeger 668 0.7× 644 0.9× 600 0.9× 191 0.8× 134 2.1× 27 1.2k
Nilson Herazo-Padilla 805 0.9× 449 0.6× 431 0.6× 172 0.7× 28 0.4× 12 1.0k
Diana G. Ramirez-Ríos 554 0.6× 328 0.5× 349 0.5× 191 0.8× 25 0.4× 25 841
Zhixing Luo 643 0.7× 389 0.5× 256 0.4× 96 0.4× 38 0.6× 32 816
Canhong Lin 546 0.6× 386 0.5× 273 0.4× 132 0.6× 33 0.5× 12 761
María Sol 544 0.6× 379 0.5× 233 0.3× 110 0.5× 35 0.6× 9 705
Michael Drexl 1.2k 1.3× 633 0.9× 610 0.9× 180 0.8× 21 0.3× 23 1.4k

Countries citing papers authored by Fabien Lehuédé

Since Specialization
Citations

This map shows the geographic impact of Fabien Lehuédé'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 Fabien Lehuédé with the expected number of citations based on a country's size and research output (numbers larger than one mean the country cites Fabien Lehuédé more than expected).

Fields of papers citing papers by Fabien Lehuédé

Since Specialization
Physical SciencesHealth SciencesLife SciencesSocial Sciences

This network shows the impact of papers produced by Fabien Lehuédé. 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 Fabien Lehuédé. The network helps show where Fabien Lehuédé may publish in the future.

Co-authorship network of co-authors of Fabien Lehuédé

This figure shows the co-authorship network connecting the top 25 collaborators of Fabien Lehuédé. A scholar is included among the top collaborators of Fabien Lehuédé 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 Fabien Lehuédé. Fabien Lehuédé 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.
Lehuédé, Fabien, et al.. (2025). Learning implicit multiple time windows in the Traveling Salesman Problem. Transportation research procedia. 82. 2795–2814.
2.
Dolgui, Alexandre, et al.. (2024). Approximate Kernel Learning Uncertainty Set for Robust Combinatorial Optimization. INFORMS journal on computing. 36(3). 900–917. 1 indexed citations
3.
Lehuédé, Fabien, et al.. (2023). Small and large neighborhood search for the park-and-loop routing problem with parking selection. European Journal of Operational Research. 308(3). 1233–1248. 13 indexed citations
4.
Dolgui, Alexandre, et al.. (2022). Improving the Tractability of SVC-based Robust Optimization. IFAC-PapersOnLine. 55(10). 719–724. 2 indexed citations
5.
Irnich, Stefan, et al.. (2022). A matheuristic for a 2-echelon vehicle routing problem with capacitated satellites and reverse flows. European Journal of Operational Research. 305(1). 64–84. 16 indexed citations
6.
Lehuédé, Fabien, et al.. (2022). The Dial-a-Ride Problem with School Bell Time Adjustment. Transportation Science. 57(1). 156–173. 1 indexed citations
7.
Lehuédé, Fabien, et al.. (2021). The time‐consistent dial‐a‐ride problem. Networks. 79(4). 452–478. 4 indexed citations
8.
Irnich, Stefan, et al.. (2021). Hybridizing large neighborhood search and exact methods for generalized vehicle routing problems with time windows. EURO Journal on Transportation and Logistics. 10. 100040–100040. 16 indexed citations
9.
Lehuédé, Fabien, et al.. (2021). A large neighborhood search approach to the vehicle routing problem with delivery options. Transportation Research Part B Methodological. 144. 103–132. 75 indexed citations
10.
Lehuédé, Fabien, Olivier Péton, & Fabien Tricoire. (2019). A lexicographic minimax approach to the vehicle routing problem with route balancing. European Journal of Operational Research. 282(1). 129–147. 29 indexed citations
11.
Grangier, Philippe, Michel Gendreau, Fabien Lehuédé, & Louis-Martin Rousseau. (2019). The vehicle routing problem with cross-docking and resource constraints. Journal of Heuristics. 27(1-2). 31–61. 24 indexed citations
12.
Lehuédé, Fabien, et al.. (2018). The fleet size and mix dial-a-ride problem with reconfigurable vehicle capacity. Transportation Research Part C Emerging Technologies. 91. 99–123. 32 indexed citations
13.
Hewitt, Mike, et al.. (2018). Integrating long-haul and local transportation planning: the Service Network Design and Routing Problem. EURO Journal on Transportation and Logistics. 8(2). 119–145. 21 indexed citations
14.
Lehuédé, Fabien, et al.. (2017). Network design of a multi-period collaborative distribution system. International Journal of Machine Learning and Cybernetics. 10(2). 279–290. 14 indexed citations
15.
Grangier, Philippe, Michel Gendreau, Fabien Lehuédé, & Louis-Martin Rousseau. (2016). An adaptive large neighborhood search for the two-echelon multiple-trip vehicle routing problem with satellite synchronization. European Journal of Operational Research. 254(1). 80–91. 207 indexed citations
16.
Lehuédé, Fabien, et al.. (2016). Location of distribution centers in a multi-period collaborative distribution network. Electronic Notes in Discrete Mathematics. 52. 293–300. 2 indexed citations
17.
Masson, Renaud, Anna Trentini, Fabien Lehuédé, et al.. (2015). Optimization of a city logistics transportation system with mixed passengers and goods. EURO Journal on Transportation and Logistics. 6(1). 81–109. 161 indexed citations
18.
Masson, Renaud, Fabien Lehuédé, & Olivier Péton. (2013). The Dial-A-Ride Problem with Transfers. Computers & Operations Research. 41. 12–23. 128 indexed citations
19.
Masson, Renaud, Stefan Røpke, Fabien Lehuédé, & Olivier Péton. (2013). A branch-and-cut-and-price approach for the pickup and delivery problem with shuttle routes. European Journal of Operational Research. 236(3). 849–862. 41 indexed citations
20.
Feillet, Dominique, et al.. (2010). A new time-consistent vehicle routing problem for the transportation of handicapped persons. SPIRE - Sciences Po Institutional REpository. 1 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.

Explore authors with similar magnitude of impact

Rankless by CCL
2026