Thibaut Vidal

Orcid: 0000-0001-5183-8485

Affiliations:
  • Polytechnique Montréal, Canada


According to our database1, Thibaut Vidal authored at least 84 papers between 2012 and 2024.

Collaborative distances:
  • Dijkstra number2 of four.
  • Erdős number3 of four.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2024
Trained Random Forests Completely Reveal your Dataset.
CoRR, 2024

Contextual Stochastic Vehicle Routing with Time Windows.
CoRR, 2024

2023
Electric Vehicle Fleets: Scalable Route and Recharge Scheduling Through Column Generation.
Transp. Sci., May, 2023

Exponential-Size Neighborhoods for the Pickup-and-Delivery Traveling Salesman Problem.
Transp. Sci., March, 2023

Recent advances in vehicle routing with stochastic demands: Bayesian learning for correlated demands and elementary branch-price-and-cut.
Eur. J. Oper. Res., 2023

A Survey of Contextual Optimization Methods for Decision Making under Uncertainty.
CoRR, 2023

Learning-based Online Optimization for Autonomous Mobility-on-Demand Fleet Control.
CoRR, 2023

Regularization and Global Optimization in Model-Based Clustering.
CoRR, 2023

Explainable Data-Driven Optimization: From Context to Decision and Back Again.
Proceedings of the International Conference on Machine Learning, 2023

Neural Networks for Local Search and Crossover in Vehicle Routing: A Possible Overkill?
Proceedings of the Integration of Constraint Programming, Artificial Intelligence, and Operations Research, 2023

Optimal Decision Diagrams for Classification.
Proceedings of the Thirty-Seventh AAAI Conference on Artificial Intelligence, 2023

2022
Vehicle Routing with Stochastic Demands and Partial Reoptimization.
Transp. Sci., 2022

Semi-supervised clustering with inaccurate pairwise annotations.
Inf. Sci., 2022

Bilevel Optimization for Feature Selection in the Data-Driven Newsvendor Problem.
CoRR, 2022

Support Vector Machines with the Hard-Margin Loss: Optimal Training via Combinatorial Benders' Cuts.
CoRR, 2022

Robust Counterfactual Explanations for Random Forests.
CoRR, 2022

Hybrid genetic search for the CVRP: Open-source implementation and SWAP* neighborhood.
Comput. Oper. Res., 2022

2021
Arc Routing with Time-Dependent Travel Times and Paths.
Transp. Sci., 2021

PILS: Exploring high-order neighborhoods by pattern mining and injection.
Pattern Recognit., 2021

Share-a-ride problems: Models and Solution Algorithms.
CoRR, 2021

Community Detection in the Stochastic Block Model by Mixed Integer Programming.
CoRR, 2021

A simple and effective hybrid genetic search for the job sequencing and tool switching problem.
Comput. Oper. Res., 2021

The EURO Meets NeurIPS 2022 Vehicle Routing Competition.
Proceedings of the NeurIPS 2022 Competition Track, 2021

Optimal Counterfactual Explanations in Tree Ensembles.
Proceedings of the 38th International Conference on Machine Learning, 2021

2020
Mathematical Models and Search Algorithms for the Capacitated -Center Problem.
INFORMS J. Comput., 2020

A concise guide to existing and emerging vehicle routing problem variants.
Eur. J. Oper. Res., 2020

The vehicle routing problem with arrival time diversification on a multigraph.
Eur. J. Oper. Res., 2020

On the exact solution of vehicle routing problems with backhauls.
Eur. J. Oper. Res., 2020

Industrial and tramp ship routing problems: Closing the gap for real-scale instances.
Eur. J. Oper. Res., 2020

Born-Again Tree Ensembles.
CoRR, 2020

Assortative-Constrained Stochastic Block Models.
Proceedings of the 25th International Conference on Pattern Recognition, 2020

Born-Again Tree Ensembles.
Proceedings of the 37th International Conference on Machine Learning, 2020

2019
Separable Convex Optimization with Nested Lower and Upper Constraints.
INFORMS J. Optim., January, 2019

HG-means: A scalable hybrid genetic algorithm for minimum sum-of-squares clustering.
Pattern Recognit., 2019

Leveraging single-objective heuristics to solve bi-objective problems: Heuristic box splitting and its application to vehicle routing.
Networks, 2019

On three soft rectangle packing problems with guillotine constraints.
J. Glob. Optim., 2019

Two-Dimensional Phase Unwrapping via Balanced Spanning Forests.
INFORMS J. Comput., 2019

Routing a mix of conventional, plug-in hybrid, and electric vehicles.
Eur. J. Oper. Res., 2019

Benchmark Instances and Branch-and-Cut Algorithm for the Hashiwokakero Puzzle.
CoRR, 2019

Heuristics for vehicle routing problems: Sequence or set optimization?
Comput. Oper. Res., 2019

Workload equity in vehicle routing: The impact of alternative workload resources.
Comput. Oper. Res., 2019

The electric two-echelon vehicle routing problem.
Comput. Oper. Res., 2019

Bi-objective offshore supply vessel planning with costs and persistence objectives.
Comput. Oper. Res., 2019

A hybrid heuristic for a broad class of vehicle routing problems with heterogeneous fleet.
Ann. Oper. Res., 2019

2018
Workload Equity in Vehicle Routing Problems: A Survey and Analysis.
Transp. Sci., 2018

The minimum distance superset problem: formulations and algorithms.
J. Glob. Optim., 2018

A study on exponential-size neighborhoods for the bin packing problem with conflicts.
J. Heuristics, 2018

Large neighborhood-based metaheuristic and branch-and-price for the pickup and delivery problem with split loads.
Eur. J. Oper. Res., 2018

The vehicle routing problem with service level constraints.
Eur. J. Oper. Res., 2018

A genetic search-based heuristic for a fleet size and periodic routing problem with application to offshore supply planning.
EURO J. Transp. Logist., 2018

2D-Phase Unwrapping via Balanced Spanning Forests.
CoRR, 2018

Mathematical models and search algorithms for the capacitated p-center problem.
CoRR, 2018

An efficient matheuristic for the minimum-weight dominating set problem.
Appl. Soft Comput., 2018

2017
Node, Edge, Arc Routing and Turn Penalties: Multiple Problems - One Neighborhood Extension.
Oper. Res., 2017

New benchmark instances for the Capacitated Vehicle Routing Problem.
Eur. J. Oper. Res., 2017

A hybrid genetic algorithm with decomposition phases for the Unequal Area Facility Layout Problem.
Eur. J. Oper. Res., 2017

Corrigendum to "Hybrid metaheuristics for the clustered vehicle routing problem [Comput. Oper. Res., 58 (2015): 87-99]".
Comput. Oper. Res., 2017

Heuristics for vehicle routing problems: Current challenges and future prospects.
Proceedings of the Eighth International Symposium on Information and Communication Technology, 2017

2016
Large Neighborhoods with Implicit Customer Selection for Vehicle Routing Problems with Profits.
Transp. Sci., 2016

A Decomposition Algorithm for Nested Resource Allocation Problems.
SIAM J. Optim., 2016

Technical note: Split algorithm in O(n) for the capacitated vehicle routing problem.
Comput. Oper. Res., 2016

A large neighbourhood based heuristic for two-echelon routing problems.
Comput. Oper. Res., 2016

2015
Timing problems and algorithms: Time decisions for sequences of activities.
Networks, 2015

Time-window relaxations in vehicle routing heuristics.
J. Heuristics, 2015

Solution integration in combinatorial optimization with applications to cooperative search and rich vehicle routing.
J. Heuristics, 2015

An integrative cooperative search framework for multi-decision-attribute combinatorial optimization: Application to the MDPVRP.
Eur. J. Oper. Res., 2015

A matheuristic approach for the Pollution-Routing Problem.
Eur. J. Oper. Res., 2015

A speed and departure time optimization algorithm for the pollution-routing problem.
Eur. J. Oper. Res., 2015

Technical Note: Split Algorithm in O(n) for the Vehicle Routing Problem.
CoRR, 2015

The lateral transhipment problem with a-priori routes, and a lot sizing application.
CoRR, 2015

A fast large neighbourhood based heuristic for the Two-Echelon Vehicle Routing Problem.
CoRR, 2015

Hybrid metaheuristics for the Clustered Vehicle Routing Problem.
Comput. Oper. Res., 2015

2014
Hours of Service Regulations in Road Freight Transport: An Optimization-Based International Assessment.
Transp. Sci., 2014

Efficient heuristics for the workover rig routing problem with a heterogeneous fleet and a finite horizon.
J. Heuristics, 2014

Implicit depot assignments and rotations in vehicle routing heuristics.
Eur. J. Oper. Res., 2014

A unified solution framework for multi-attribute vehicle routing problems.
Eur. J. Oper. Res., 2014

A memetic algorithm for the Multi Trip Vehicle Routing Problem.
Eur. J. Oper. Res., 2014

General solution approaches for multi-attribute vehicle routing and scheduling problems.
4OR, 2014

Heuristics for the Vehicle Routing Problem.
Proceedings of the Vehicle Routing, 2014

2013
An iterated local search heuristic for multi-capacity bin packing and machine reassignment problems.
Expert Syst. Appl., 2013

Heuristics for multi-attribute vehicle routing problems: A survey and synthesis.
Eur. J. Oper. Res., 2013

A hybrid genetic algorithm with adaptive diversity management for a large class of vehicle routing problems with time-windows.
Comput. Oper. Res., 2013

2012
A Hybrid Genetic Algorithm for Multidepot and Periodic Vehicle Routing Problems.
Oper. Res., 2012

A simple and effective metaheuristic for the Minimum Latency Problem.
Eur. J. Oper. Res., 2012


  Loading...