 | Monter d'un niveau |
Albuquerque, M., & Vidal, T. (2018). An efficient matheuristic for the minimum-weight dominating set problem. Applied Soft Computing, 72, 527-538. Lien externe
Bouvier, L., Dalle, G., Parmentier, A., & Vidal, T. (2023). Solving a Continent-Scale Inventory Routing Problem at Renault. Transportation Science, 22 pages. Lien externe
Borthen, T., Loennechen, H., Fagerholt, K., Wang, X., & Vidal, T. (2019). Bi-objective offshore supply vessel planning with costs and persistence objectives. Computers & Operations Research, 111, 285-296. Lien externe
Breunig, U., Baldacci, R., Hartl, R. F., & Vidal, T. (2019). The electric two-echelon vehicle routing problem. Computers & Operations Research, 103, 198-210. Lien externe
Bui, Q. T., Vidal, T., & Hà, M. H. (2019). On three soft rectangle packing problems with guillotine constraints. Journal of Global Optimization, 74(1), 45-62. Lien externe
Borthen, T., Loennechen, H., Wang, X., Fagerholt, K., & Vidal, T. (2018). A genetic search-based heuristic for a fleet size and periodic routing problem with application to offshore supply planning. EURO Journal on Transportation and Logistics, 7(2), 121-150. Lien externe
Bulhões, T., Hà, M. H., Martinelli, R., & Vidal, T. (2018). The vehicle routing problem with service level constraints. European Journal of Operational Research, 265(2), 544-558. Lien externe
Breunig, U., Schmid, V., Hartl, R. F., & Vidal, T. (2016). A large neighbourhood based heuristic for two-echelon routing problems. Computers & Operations Research, 76, 208-225. Lien externe
Capua, R., Frota, Y., Ochi, L. S., & Vidal, T. (2018). A study on exponential-size neighborhoods for the bin packing problem with conflicts. Journal of Heuristics, 24(4), 667-695. Lien externe
Cattaruzza, D., Absi, N., Feillet, D., & Vidal, T. (2014). A memetic algorithm for the Multi Trip Vehicle Routing Problem. European Journal of Operational Research, 236(3), 833-848. Lien externe
Crainic, T. G., Crisan, G. C., Gendreau, M., Lahrichi, N., Rei, W., & Vidal, T. (juillet 2009). A concurrent evolutionary approach for rich combinatorial problems [Communication écrite]. Genetic and Evolutionary Computation Conference (GECC 2009), Montréal, Québec. Lien externe
Crainic, T. G., Crisan, G. C., Gendreau, M., Lahrichi, N., Rei, W., & Vidal, T. (juillet 2009). Integrative cooperative meta-heuristics for rich combinatorial problems [Communication écrite]. VIII Metaheuristic International Conference (MIC 2009), Hambourg, Allemagne. Non disponible
Crainic, T. G., Crisan, G. C., Gendreau, M., Lahrichi, N., Rei, W., & Vidal, T. (mai 2009). Multi-thread cooperative optimization for rich combinatorial problems [Communication écrite]. 23rd IEEE international Parallel & Distributed Processing Symposium (IPDPS 2009), Rome, Italy (8 pages). Lien externe
El Hachemi, N., Crainic, T. G., Lahrichi, N., Rei, W., & Vidal, T. (2015). Solution integration in combinatorial optimization with applications to cooperative search and rich vehicle routing. Journal of Heuristics, 21(5), 663-685. Lien externe
El Hachemi, N., Crainic, T. G., Lahrichi, N., Rei, W., & Vidal, T. (2014). Solution integration in combinatorial optimization with applications to cooperative search and rich vehicle routing. (Rapport technique n° CIRRELT-2014-40). Lien externe
Florio, A. M., Gendreau, M., Hartl, R. F., Minner, S., & Vidal, T. (2023). Recent advances in vehicle routing with stochastic demands: Bayesian learning for correlated demands and elementary branch-price-and-cut. European Journal of Operational Research, 306(3), 1081-1093. Lien externe
Forel, A., Parmentier, A., & Vidal, T. (juillet 2023). Explainable Data-Driven Optimization: From Context to Decision and Back Again [Communication écrite]. 40th International Conference on Machine Learning (ICML 2023), Honolulu, HI, USA (18 pages). Lien externe
Florio, A. M., Martins, P., Schiffer, M., Serra, T., & Vidal, T. (février 2023). Optimal Decision Diagrams for Classification [Communication écrite]. 37th AAAI Conference on Artificial Intelligence (AAAI 2023) and 35th Conference on Innovative Applications of Artificial Intelligence (IAAI 2023) and 13th Symposium on Educational Advances in Artificial Intelligence (EAAAI 2023), Washington, DC, USA. Lien externe
Florio, A. M., Feillet, D., Poggi, M., & Vidal, T. (2022). Vehicle Routing with Stochastic Demands and Partial Reoptimization. Transportation Science, 1393-1408. Lien externe
Fontoura, L., Martinelli, R., Poggi, M., & Vidal, T. (2018). The minimum distance superset problem: formulations and algorithms. Journal of Global Optimization, 72(1), 27-53. Lien externe
Guillen Reyes, F. O., Potvin, J.-Y., Gendreau, M., & Vidal, T. (2023). Impact of distance data inaccuracies on vehicle routing algorithms: An experimental study. (Rapport annuel n° CIRRELT-2023-21). Lien externe
Gribel, D., Gendreau, M., & Vidal, T. (2022). Semi-supervised clustering with inaccurate pairwise annotations. Information Sciences, 607, 441-457. Lien externe
Goel, A., Vidal, T., & Kok, A. L. (2021). To team up or not: single versus team driving in European road freight transport. Flexible Services and Manufacturing Journal, 33(4), 879-913. Disponible
Gribel, D., Vidal, T., & Gendreau, M. (janvier 2021). Assortative-constrained stochastic block models [Communication écrite]. 25th International Conference on Pattern Recognition (ICPR 2020), Milan, Italy. Lien externe
Gribel, D., & Vidal, T. (2019). HG-means: A scalable hybrid genetic algorithm for minimum sum-of-squares clustering. Pattern Recognition, 88, 569-583. Lien externe
Goel, A., & Vidal, T. (2014). Hours of Service Regulations in Road Freight Transport: An Optimization-Based International Assessment. Transportation Science, 48(3), 391-412. Lien externe
Goel, A., & Vidal, T. (2012). Hours of service regulations in road freight transport: An optimization-based international assessment. (Rapport technique n° CIRRELT-2012-08). Lien externe
Homsi, G., Martinelli, R., Vidal, T., & Fagerholt, K. (2020). Industrial and tramp ship routing problems: Closing the gap for real-scale instances. European Journal of Operational Research, 283(3), 972-990. Lien externe
Hiermann, G., Hartl, R. F., Puchinger, J., & Vidal, T. (2019). Routing a mix of conventional, plug-in hybrid, and electric vehicles. European Journal of Operational Research, 272(1), 235-248. Lien externe
Herszterg, I., Poggi, M., & Vidal, T. (2019). Two-Dimensional Phase Unwrapping via Balanced Spanning Forests. INFORMS Journal on Computing, 31(3), 527-543. Lien externe
Haddad, M. N., Martinelli, R., Vidal, T., Martins, S., Ochi, L. S., Souza, M. J. F., & Hartl, R. (2018). Large neighborhood-based metaheuristic and branch-and-price for the pickup and delivery problem with split loads. European Journal of Operational Research, 270(3), 1014-1027. Lien externe
Kool, W., Bliek, L., Numeroso, D., Zhang, Y., Catshoek, T., Tierney, K., Vidal, T., & Gromicho, J. (novembre 2022). Vehicle routing heuristics : a quick tour d'horizon [Communication écrite]. The EURO Meets NeurIPS 2022 Vehicle Routing Competition (45 pages). Non disponible
Kramer, R., Iori, M., & Vidal, T. (2020). Mathematical Models and Search Algorithms for the Capacitated p-Center Problem. INFORMS Journal on Computing, 32(2), 444-460. Lien externe
Kramer, R., Subramanian, A., Vidal, T., & Cabral, L. A. F. (2015). A matheuristic approach for the Pollution-Routing Problem. European Journal of Operational Research, 243(2), 523-539. Lien externe
Kramer, R., Maculan, N., Subramanian, A., & Vidal, T. (2015). A speed and departure time optimization algorithm for the pollution-routing problem. European Journal of Operational Research, 247(3), 782-787. Lien externe
Lahrichi, N., Crainic, T. G., Gendreau, M., Rei, W., Crişan, G. C., & Vidal, T. (2015). An integrative cooperative search framework for multi-decision-attribute combinatorial optimization: Application to the MDPVRP. European Journal of Operational Research, 246(2), 400-412. Lien externe
Laporte, G., Ropke, S., & Vidal, T. (2014). Heuristics for the Vehicle Routing Problem. Dans Vehicle Routing (87-116). Lien externe
Lahrichi, N., Crainic, T. G., Gendreau, M., Rei, W., Crişan, G. C., & Vidal, T. (2012). An integrative cooperative search framework for multi-decision-attribute combinatorial optimization. (Rapport technique n° CIRRELT-2012-42). Lien externe
Mecler, J., Subramanian, A., & Vidal, T. (2021). A simple and effective hybrid genetic search for the job sequencing and tool switching problem. Computers & Operations Research, 127, 105153-105153. Lien externe
Matl, P., Hartl, R. F., & Vidal, T. (2019). Leveraging single-objective heuristics to solve bi-objective problems: Heuristic box splitting and its application to vehicle routing. Networks, 73(4), 382-400. Lien externe
Matl, P., Hartl, R. F., & Vidal, T. (2019). Workload equity in vehicle routing: The impact of alternative workload resources. Computers & Operations Research, 110, 116-129. Lien externe
Matl, P., Hartl, R. F., & Vidal, T. (2018). Workload Equity in Vehicle Routing Problems: A Survey and Analysis. Transportation Science, 52(2), 239-260. Lien externe
Masson, R., Vidal, T., Michallet, J., Penna, P. H. V., Petrucci, V., Subramanian, A., & Dubedout, H. (2013). An iterated local search heuristic for multi-capacity bin packing and machine reassignment problems. Expert Systems With Applications, 40(13), 5266-5275. Lien externe
Masson, R., Vidal, T., Michallet, J., Vaz Penna Puca, H., Petrucci, V., Subramanian, A., & Dubedout, H. (2012). An iterated local search heuristic for multi-capacity bin packing and machine reassignment problems. (Rapport technique n° CIRRELT-2012-70). Lien externe
Nekooghadirli, N., Gendreau, M., Potvin, J.-Y., & Vidal, T. (2022). Workload equity in multi-period vehicle routing problems. (Rapport technique n° CIRRELT-2022-22). Lien externe
Parmentier, A., Martinelli, R., & Vidal, T. (2023). Electric Vehicle Fleets: Scalable Route and Recharge Scheduling Through Column Generation. Transportation Science, 57(3), 631-646. Lien externe
Pacheco, T., Martinelli, R., Subramanian, A., Toffolo, T. A. M., & Vidal, T. (2023). Exponential-Size Neighborhoods for the Pickup-and-Delivery Traveling Salesman Problem. Transportation Science, 57(2), 463-481. Lien externe
Parmentier, A., & Vidal, T. (juillet 2021). Optimal counterfactual explanations in tree ensembles [Communication écrite]. 38th International Conference on Machine Learning (ICML 2021). Lien externe
Penna, P. H. V., Subramanian, A., Ochi, L. S., Vidal, T., & Prins, C. (2019). A hybrid heuristic for a broad class of vehicle routing problems with heterogeneous fleet. Annals of Operations Research, 273(1), 5-74. Lien externe
Paes, F. G., Pessoa, A. A., & Vidal, T. (2017). A hybrid genetic algorithm with decomposition phases for the Unequal Area Facility Layout Problem. European Journal of Operational Research, 256(3), 742-756. Lien externe
Queiroga, E., Frota, Y., Sadykov, R., Subramanian, A., Uchoa, E., & Vidal, T. (2020). On the exact solution of vehicle routing problems with backhauls. European Journal of Operational Research, 287(1), 76-89. Lien externe
Ribeiro, G. M., Desaulniers, G., Desrosiers, J., Vidal, T., & Vieira, B. S. (2014). Efficient heuristics for the workover rig routing problem with a heterogeneous fleet and a finite horizon. Journal of Heuristics, 20(6), 677-708. Lien externe
Serrano, B., Minner, S., Schiffer, M., & Vidal, T. (2024). Bilevel optimization for feature selection in the data-driven newsvendor problem. European Journal of Operational Research, 315(2), 703-714. Disponible
Serrano, B., Minner, S., Schiffer, M., & Vidal, T. (2024). Bilevel optimization for feature selection in the data-driven newsvendor problem. European Journal of Operational Research, 315(2), 703-714. Lien externe
Sampaio, R. A., Dias Garcia, J., Poggi, M., & Vidal, T. (2024). Regularization and optimization in model-based clustering. Pattern Recognition, 150, 110310 (14 pages). Lien externe
Santini, A., Schneider, M., Vidal, T., & Vigo, D. (2023). Decomposition Strategies for Vehicle Routing Heuristics. INFORMS Journal on Computing, 35(3), 543-559. Lien externe
Soriano, A., Vidal, T., Gansterer, M., & Doerner, K. (2020). The vehicle routing problem with arrival time diversification on a multigraph. European Journal of Operational Research, 286(2), 564-575. Lien externe
Silva, M. M., Subramanian, A., Vidal, T., & Ochi, L. S. (2012). A simple and effective metaheuristic for the Minimum Latency Problem. European Journal of Operational Research, 221(3), 513-520. Lien externe
Uchoa, E., Pecin, D., Pessoa, A., Poggi, M., Vidal, T., & Subramanian, A. (2017). New benchmark instances for the Capacitated Vehicle Routing Problem. European Journal of Operational Research, 257(3), 845-858. Lien externe
Vidal, T. (2022). Hybrid genetic search for the CVRP: Open-source implementation and SWAP* neighborhood. Computers & Operations Research, 140, 105643-105643. Lien externe
Vidal, T., Martinelli, R., Anh Pham, T., & Hoàng Hà, M. (2021). Arc Routing with Time-Dependent Travel Times and Paths. Transportation Science, 55(3), 706-724. Lien externe
Vidal, T., Pacheco, T., & Schiffer, M. (juillet 2020). Born-Again Tree Ensembles [Communication écrite]. 37th International Conference on Machine Learning (ICML). Non disponible
Vidal, T., Laporte, G., & Matl, P. (2020). A concise guide to existing and emerging vehicle routing problem variants. European Journal of Operational Research, 286(2), 401-416. Lien externe
Vidal, T., Gribel, D., & Jaillet, P. (2019). Separable Convex Optimization with Nested Lower and Upper Constraints. INFORMS Journal on Optimization, 1(1), 71-90. Lien externe
Vidal, T. (2017). Node, Edge, Arc Routing and Turn Penalties: Multiple Problems—One Neighborhood Extension. Operations Research, 65(4), 992-1010. Lien externe
Vidal, T., Jaillet, P., & Maculan, N. (2016). A Decomposition Algorithm for Nested Resource Allocation Problems. SIAM Journal on Optimization, 26(2), 1322-1340. Lien externe
Vidal, T., Maculan, N., Satoru Ochi, L., & Huachi Vaz Penna, P. (2016). Large Neighborhoods with Implicit Customer Selection for Vehicle Routing Problems with Profits. Transportation Science, 50(2), 720-734. Lien externe
Vidal, T. (2016). Technical note: Split algorithm in O(n) for the capacitated vehicle routing problem. Computers & Operations Research, 69, 40-47. Lien externe
Vidal, T., Battarra, M., Subramanian, A., & Erdogˇan, G. (2015). Hybrid metaheuristics for the Clustered Vehicle Routing Problem. Computers & Operations Research, 58, 87-99. Lien externe
Vidal, T., Crainic, T. G., Gendreau, M., & Prins, C. (2015). Time-window relaxations in vehicle routing heuristics. Journal of Heuristics, 21(3), 329-358. Lien externe
Vidal, T., Crainic, T. G., Gendreau, M., & Prins, C. (2015). Timing problems and algorithms: Time decisions for sequences of activities. Networks, 65(2), 102-128. Lien externe
Vidal, T. (2014). General solution approaches for multi-attribute vehicle routing and scheduling problems. 4OR, 12(1), 97-98. Lien externe
Vidal, T., Crainic, T. G., Gendreau, M., & Prins, C. (2014). Implicit depot assignments and rotations in vehicle routing heuristics. European Journal of Operational Research, 237(1), 15-28. Lien externe
Vidal, T., Crainic, T. G., Gendreau, M., & Prins, C. (2014). A unified solution framework for multi-attribute vehicle routing problems. European Journal of Operational Research, 234(3), 658-673. Lien externe
Vidal, T., Crainic, T. G., Gendreau, M., & Prins, C. (2013). Time-window relaxations in vehicle routing heuristics. (Rapport technique n° CIRRELT-2013-43). Lien externe
Vidal, T., Crainic, T. G., Gendreau, M., & Prins, C. (2013). A unified solution framework for multi-attribute vehicle routing problems. (Rapport technique n° CIRRELT-2013-22). Lien externe
Vidal, T., Crainic, T. G., Gendreau, M., & Prins, C. (2013). Heuristics for multi-attribute vehicle routing problems: A survey and synthesis. European Journal of Operational Research, 231(1), 1-21. Lien externe
Vidal, T., Crainic, T. G., Gendreau, M., & Prins, C. (2013). A hybrid genetic algorithm with adaptive diversity management for a large class of vehicle routing problems with time-windows. Computers & Operations Research, 40(1), 475-489. Lien externe
Vidal, T., Crainic, T. G., Gendreau, M., & Prins, C. (2012). Implicit depot assignments and rotations in vehicle routing heuristics. (Rapport technique n° CIRRELT-2012-60). Lien externe
Vidal, T., Crainic, T. G., Gendreau, M., & Prins, C. (2012). A unifying view on timing problems and algorithms. (Rapport technique n° CIRRELT-2012-59). Lien externe
Vidal, T., Crainic, T. G., Gendreau, M., & Prins, C. (2012). A unified solution framework for multi-attribute vehicle routing problems. (Rapport technique n° CIRRELT-2012-23). Lien externe
Vidal, T., Crainic, T. G., Gendreau, M., & Prins, C. (2012). Heuristics for multi-attribute vehicle routing problems: A survey and synthesis. (Rapport technique n° CIRRELT-2012-05). Lien externe
Vidal, T., Crainic, T. G., Gendreau, M., Lahrichi, N., & Rei, W. (2012). A hybrid genetic algorithm for multidepot and periodic vehicle routing problems. Operations Research, 60(3), 611-624. Lien externe
Vidal, T., Crainic, T. G., Gendreau, M., & Prins, C. (2011). A hybrid genetic algorithm with adaptive diversity management for a large class of vehicle routing problems with time windows. (Rapport technique n° CIRRELT-2011-61). Lien externe
Vidal, T., Crainic, T. G., Gendreau, M., & Prins, C. (2011). A Unifying View on Timing Problems and Algorithms. (Rapport technique n° CIRRELT-2011-43). Lien externe
Vidal, T., Crainic, T. G., Gendreau, M., & Prins, C. (2011). Heuristiques pour les problèmes de tournées de véhicules multi-attributs. (Rapport technique n° CIRRELT-2011-12). Lien externe
Vidal, T., Crainic, T. G., Gendreau, M., Lahrichi, N., & Rei, W. (2011). A Hybrid Genetic Algorithm for Multi-Depot and Periodic Vehicle Routing Problems. (Rapport technique n° CIRRELT-2011-05). Lien externe
Vidal, T., Crainic, T. G., Gendreau, M., Lahrichi, N., & Rei, W. (2010). A hybrid genetic algorithm for multi-depot and periodic vehicle routing problems. (Rapport technique n° CIRRELT-2010-34). Lien externe
