Thibaut Vidal

Modern implementation of the hybrid genetic search (HGS) algorithm specialized to the capacitated vehicle routing problem (CVRP). This code also includes an additional neighborhood called SWAP*.

vidalt

Born-Again Tree Ensembles: Transforms a random forest into a single, minimal-size, tree with exactly the same prediction function in the entire feature space (ICML 2020).

vidalt

Hybrid Genetic Search for Arc Routing Problems. From "Node, edge, arc routing and turn penalties : Multiple problems - One neighborhood extension, Operations Research, 65(4), 2017", by Thibaut Vidal.

vidalt

Source code associated with the paper: "Vidal, T., Martinelli, R., Pham, T. A., & Hà, M. H. (2021). Arc routing with time-dependent travel times and paths. Transportation Science."

vidalt

OCEAN: Optimal Counterfactual Explanations in Tree Ensembles (ICML 2021)

vidalt

Code and data from the paper "Exponential-size neighborhoods for the pickup-and-delivery traveling salesman problem", authored by T. Pacheco, R. Martinelli, A. Subramanian, T. Toffolo, and T. Vidal

vidalt

Library of Split algorithms, including the O(n) (linear time) algorithm for the CVRP, from "Vidal, Thibaut (2016). Technical note: Split algorithm in O(n) for the capacitated vehicle routing problem....

vidalt