Journal articles

My main research interests relate to combinatorial and continuous optimization, for applications related to vehicle routing, scheduling and timing, resource allocation, signal processing and machine learning. The associated journal publications are listed in the following.
Many of these articles are made available as technical reports (CIRRELT or ArXiV) or post-print. To access these documents, simply click on the small PDF icon under the citation.

(The list takes a few seconds to load)
  2019 (16)
The electric two-echelon vehicle routing problem. Breunig, U.; Baldacci, R.; Hartl, R.; and Vidal, T. Computers & Operations Research, 103: 198–210. 2019.
The electric two-echelon vehicle routing problem [pdf]Paper   doi   bibtex
On three soft rectangle packing problems with guillotine constraints. Bui, Q.; Vidal, T.; and Hà, M. Journal of Global Optimization, 74(1). 2019.
On three soft rectangle packing problems with guillotine constraints [pdf]Paper   doi   bibtex
Benchmark instances and branch-and-cut algorithm for the Hashiwokakero puzzle. Coelho, L.; Laporte, G.; Lindbeck, A.; and Vidal, T. Technical Report PUC-Rio, 2019.
Benchmark instances and branch-and-cut algorithm for the Hashiwokakero puzzle [pdf]Paper   bibtex   abstract
To team up or not – Single versus team driving in European road freight transport. Goel, A.; Vidal, T.; and Kok, A. Technical Report PUC–Rio, Rio de Janeiro, Brasil, 2019.
To team up or not – Single versus team driving in European road freight transport [pdf]Paper   bibtex
HG-means: A scalable hybrid metaheuristic for minimum sum-of-squares clustering. Gribel, D.; and Vidal, T. Pattern Recognition, 88: 569–583. 2019.
HG-means: A scalable hybrid metaheuristic for minimum sum-of-squares clustering [pdf]Paper   doi   bibtex   abstract
Two-dimensional phase unwrapping via balanced spanning forests. Herszterg, I.; Poggi, M.; and Vidal, T. INFORMS Journal on Computing, Articles in Advance. 2019.
Two-dimensional phase unwrapping via balanced spanning forests [pdf]Paper   doi   bibtex   abstract
Restriction policies for sustainable city logistics. Hiermann, G.; Hartl, R.; Puchinger, J.; Schiffer, M.; and Vidal, T. Technical Report University of Vienna, Austria, 2019.
bibtex
Routing a mix of conventional, plug-in hybrid, and electric vehicles. Hiermann, G.; Hartl, R.; Puchinger, J.; and Vidal, T. European Journal of Operational Research, 272(1): 235–248. 2019.
Routing a mix of conventional, plug-in hybrid, and electric vehicles [link]Paper   doi   bibtex
Mathematical models and search algorithms for the capacitated p-center problem. Kramer, R.; Iori, M.; and Vidal, T. INFORMS Journal on Computing, Forthcoming. 2019.
Mathematical models and search algorithms for the capacitated p-center problem [pdf]Paper   bibtex   abstract
Leveraging single-objective heuristics to solve multi-objective problems: Heuristic box splitting and its application to vehicle routing. Matl, P.; Hartl, R.; and Vidal, T. Networks, 73(4): 382–400. 2019.
doi   bibtex
Workload equity in vehicle routing: The impact of alternative workload resources. Matl, P.; Hartl, R.; and Vidal, T. Computers & Operations Research, 110: 116–129. 2019.
Workload equity in vehicle routing: The impact of alternative workload resources [pdf]Paper   doi   bibtex
A hybrid heuristic for a broad class of vehicle routing problems with heterogeneous fleet. Penna, P.; Subramanian, A.; Ochi, L.; Vidal, T.; and Prins, C. Annals of Operations Research, 273(1-2): 5–74. 2019.
A hybrid heuristic for a broad class of vehicle routing problems with heterogeneous fleet [pdf]Paper   doi   bibtex
The vehicle routing problem with arrival time diversification on a multigraph. Soriano, A.; Vidal, T.; Gansterer, M.; and Doerner, K. Technical Report University of Vienna, Austria, 2019.
bibtex
Heuristics for vehicle routing problems: Sequence or set optimization?. Toffolo, T.; Vidal, T.; and Wauters, T. Computers & Operations Research, 105: 118–131. 2019.
Heuristics for vehicle routing problems: Sequence or set optimization? [pdf]Paper   doi   bibtex   abstract
Separable convex optimization with nested lower and upper constraints. Vidal, T.; Gribel, D.; and Jaillet, P. INFORMS Journal on Optimization, 1(1): 71–90. 2019.
Separable convex optimization with nested lower and upper constraints [pdf]Paper   doi   bibtex   abstract
A concise guide to existing and emerging vehicle routing problem variants. Vidal, T.; Laporte, G.; and Matl, P. Technical Report Pontifical Catholic University of Rio de Janeiro, 2019.
A concise guide to existing and emerging vehicle routing problem variants [link]Paper   bibtex   abstract
  2018 (10)
An efficient matheuristic for the minimum-weight dominating set problem. Albuquerque, M.; and Vidal, T. Applied Soft Computing, 72: 527–538. 2018.
An efficient matheuristic for the minimum-weight dominating set problem [pdf]Paper   doi   bibtex   abstract
Bi-objective Offshore Supply Vessel Planning with Costs and Persistence Objectives. Borthen, T.; Loennechen, H.; Fagerholt, K.; Wang, X.; and Vidal, T. Technical Report Norwegian University of Science and Technology, 2018.
bibtex
A genetic search-based heuristic for a fleet size and periodic routing problem with application to offshore supply planning. Borthen, T.; Loennechen, H.; Wang, X.; Fagerholt, K.; and Vidal, T. EURO Journal on Transportation and Logistics, 7(2): 121–150. 2018.
A genetic search-based heuristic for a fleet size and periodic routing problem with application to offshore supply planning [link]Paper   doi   bibtex   abstract
The vehicle routing problem with service level constraints. Bulhões, T.; Hà, M.; Martinelli, R.; and Vidal, T. European Journal of Operational Research, 265(2): 544–558. 2018.
The vehicle routing problem with service level constraints [pdf]Paper   bibtex   abstract
A study on exponential-size neighborhoods for the bin packing problem with conflicts. Capua, R.; Frota, Y.; Ochi, L.; and Vidal, T. Journal of Heuristics, 24(4): 667–695. 2018.
A study on exponential-size neighborhoods for the bin packing problem with conflicts [pdf]Paper   doi   bibtex
The minimum distance superset problem: Formulations and algorithms. Fontoura, L.; Martinelli, R.; Poggi, M.; and Vidal, T. Journal of Global Optimization, 72(1): 27–53. 2018.
The minimum distance superset problem: Formulations and algorithms [pdf]Paper   doi   bibtex   abstract
Large neighborhood-based metaheuristic and branch-and-price for the pickup and delivery problem with split loads. Haddad, M.; Martinelli, R.; Vidal, T.; Martins, S.; Ochi, L.; Souza, M.; and Hartl, R. European Journal of Operational Research, 270(3): 1014–1027. 2018.
Large neighborhood-based metaheuristic and branch-and-price for the pickup and delivery problem with split loads [pdf]Paper   doi   bibtex
Industrial and Tramp Ship Routing Problems: Closing the Gap for Real-Scale Instances. Homsi, G.; Martinelli, R.; Vidal, T.; and Fagerholt, K. Technical Report 2018.
Industrial and Tramp Ship Routing Problems: Closing the Gap for Real-Scale Instances [pdf]Paper   bibtex
Workload equity in vehicle routing problems: A survey and analysis. Matl, P.; Hartl, R.; and Vidal, T. Transportation Science, 52(2): 239–260. 2018.
Workload equity in vehicle routing problems: A survey and analysis [link]Paper   bibtex
On a Fixed-Route Lateral Transhipment Problem with Piecewise Linear Profits. Romauch, M.; Vidal, T.; and Hartl, R. Technical Report 2018.
bibtex
  2017 (4)
A hybrid genetic algorithm with decomposition phases for the unequal area facility layout problem. Paes, F.; Pessoa, A.; and Vidal, T. European Journal of Operational Research, 256(3): 742–756. 2017.
A hybrid genetic algorithm with decomposition phases for the unequal area facility layout problem [link]Paper   doi   bibtex   abstract
New benchmark instances for the capacitated vehicle routing problem. Uchoa, E.; Pecin, D.; Pessoa, A.; Poggi, M.; Subramanian, A.; and Vidal, T. European Journal of Operational Research, 257(3): 845–858. 2017.
New benchmark instances for the capacitated vehicle routing problem [pdf]Paper   doi   bibtex   abstract
Node, edge, arc routing and turn penalties: Multiple problems – One neighborhood extension. Vidal, T. Operations Research, 65(4): 992–1010. 2017.
Node, edge, arc routing and turn penalties: Multiple problems – One neighborhood extension [pdf]Paper   doi   bibtex   abstract
Corrigendum to “Hybrid metaheuristics for the clustered vehicle routing problem [Comput. Oper. Res., 58 (2015): 87–99]”. Vidal, T.; Battarra, M.; Subramanian, A.; and Erdoǧan, G. Computers & Operations Research,1–2. 2017.
Corrigendum to “Hybrid metaheuristics for the clustered vehicle routing problem [Comput. Oper. Res., 58 (2015): 87–99]” [link]Paper   doi   bibtex
  2016 (4)
A large neighbourhood based heuristic for the two-echelon vehicle routing problem. Breunig, U.; Schmid, V.; Hartl, R.; and Vidal, T. Computers & Operations Research, 76: 208–225. 2016.
A large neighbourhood based heuristic for the two-echelon vehicle routing problem [pdf]Paper   doi   bibtex   abstract
Technical note: Split algorithm in O(n) for the capacitated vehicle routing problem. Vidal, T. Computers & Operations Research, 69: 40–47. 2016.
Technical note: Split algorithm in O(n) for the capacitated vehicle routing problem [pdf]Paper   doi   bibtex   abstract
A decomposition algorithm for nested resource allocation problems. Vidal, T.; Jaillet, P.; and Maculan, N. SIAM Journal on Optimization, 26(2): 1322–1340. 2016.
A decomposition algorithm for nested resource allocation problems [pdf]Paper   doi   bibtex   abstract
Large neighborhoods with implicit customer selection for vehicle routing problems with profits. Vidal, T.; Maculan, N.; Ochi, L.; and Penna, P. Transportation Science, 50(2): 720–734. 2016.
Large neighborhoods with implicit customer selection for vehicle routing problems with profits [pdf]Paper   doi   bibtex   abstract
  2015 (7)
Solution integration in combinatorial optimization with applications to cooperative search and rich vehicle routing. El Hachemi, N.; Crainic, T.; Lahrichi, N.; Rei, W.; and Vidal, T. Journal of Heuristics, 21(5): 663–685. 2015.
Solution integration in combinatorial optimization with applications to cooperative search and rich vehicle routing [pdf]Paper   doi   bibtex   abstract
A speed and departure time optimization algorithm for the pollution-routing problem. Kramer, R.; Maculan, N.; Subramanian, A.; and Vidal, T. European Journal of Operational Research, 247(3): 782–787. 2015.
A speed and departure time optimization algorithm for the pollution-routing problem [pdf]Paper   doi   bibtex   abstract
A matheuristic approach for the pollution-routing problem. Kramer, R.; Subramanian, A.; Vidal, T.; and Cabral, L. European Journal of Operational Research, 243(2): 523–539. 2015.
A matheuristic approach for the pollution-routing problem [pdf]Paper   doi   bibtex   abstract
An integrative cooperative search framework for multi-decision-attribute combinatorial optimization: Application to the MDPVRP. Lahrichi, N.; Crainic, T.; Gendreau, M.; Rei, W.; Crisan, G.; and Vidal, T. European Journal of Operational Research, 246(2): 400–412. 2015.
An integrative cooperative search framework for multi-decision-attribute combinatorial optimization: Application to the MDPVRP [pdf]Paper   doi   bibtex   abstract
Hybrid metaheuristics for the clustered vehicle routing problem. Vidal, T.; Battarra, M.; Subramanian, A.; and Erdogan, G. Computers & Operations Research, 58(1): 87–99. 2015.
Hybrid metaheuristics for the clustered vehicle routing problem [pdf]Paper   doi   bibtex   abstract
Time-window relaxations in vehicle routing heuristics. Vidal, T.; Crainic, T.; Gendreau, M.; and Prins, C. Journal of Heuristics, 21(3): 329–358. 2015.
Time-window relaxations in vehicle routing heuristics [pdf]Paper   doi   bibtex   abstract
Timing problems and algorithms: Time decisions for sequences of activities. Vidal, T.; Crainic, T.; Gendreau, M.; and Prins, C. Networks, 65(2): 102–128. 2015.
Timing problems and algorithms: Time decisions for sequences of activities [pdf]Paper   doi   bibtex   abstract
  2014 (6)
A memetic algorithm for the multi trip vehicle routing problem. Cattaruzza, D.; Absi, N.; Feillet, D.; and Vidal, T. European Journal of Operational Research, 236(3): 833–848. 2014.
A memetic algorithm for the multi trip vehicle routing problem [pdf]Paper   doi   bibtex   abstract   7 downloads
Hours of service regulations in road freight transport: An optimization-based international assessment. Goel, A.; and Vidal, T. Transportation Science, 48(3): 391–412. 2014.
Hours of service regulations in road freight transport: An optimization-based international assessment [link]Paper   doi   bibtex   abstract
Heuristics for the vehicle routing problem. Laporte, G.; Ropke, S.; and Vidal, T. In Toth, P.; and Vigo, D., editor(s), Vehicle Routing: Problems, Methods, and Applications, 4, pages 87–116. Society for Industrial and Applied Mathematics, 2014.
Heuristics for the vehicle routing problem [link]Paper   doi   bibtex   abstract
Efficient heuristics for the workover rig routing problem with a heterogeneous fleet and a finite horizon. Ribeiro, G.; Desaulniers, G.; Desrosiers, J.; Vidal, T.; and Vieira, B. Journal of Heuristics, 20(6): 677–708. 2014.
Efficient heuristics for the workover rig routing problem with a heterogeneous fleet and a finite horizon [link]Paper   doi   bibtex   abstract
Implicit depot assignments and rotations in vehicle routing heuristics. Vidal, T.; Crainic, T.; Gendreau, M.; and Prins, C. European Journal of Operational Research, 237(1): 15–28. 2014.
Implicit depot assignments and rotations in vehicle routing heuristics [pdf]Paper   doi   bibtex   abstract   2 downloads
A unified solution framework for multi-attribute vehicle routing problems. Vidal, T.; Crainic, T.; Gendreau, M.; and Prins, C. European Journal of Operational Research, 234(3): 658–673. 2014.
A unified solution framework for multi-attribute vehicle routing problems [pdf]Paper   doi   bibtex   abstract   46 downloads
  2013 (4)
An iterated local search heuristic for multi-capacity bin packing and machine reassignment problems. Masson, R.; Vidal, T.; Michallet, J.; Penna, P.; Petrucci, V.; Subramanian, A.; and Dubedout, H. Expert Systems with Applications, 40(13): 5266–5275. 2013.
An iterated local search heuristic for multi-capacity bin packing and machine reassignment problems [pdf]Paper   doi   bibtex   abstract   2 downloads
General solution approaches for multi-attribute vehicle routing and scheduling problems. Vidal, T. 4OR, 12(1): 97–98. 2013.
General solution approaches for multi-attribute vehicle routing and scheduling problems [link]Paper   doi   bibtex   9 downloads
A hybrid genetic algorithm with adaptive diversity management for a large class of vehicle routing problems with time-windows. Vidal, T.; Crainic, T.; Gendreau, M.; and Prins, C. Computers & Operations Research, 40(1): 475–489. 2013.
A hybrid genetic algorithm with adaptive diversity management for a large class of vehicle routing problems with time-windows [pdf]Paper   doi   bibtex   abstract   36 downloads
Heuristics for multi-attribute vehicle routing problems: A survey and synthesis. Vidal, T.; Crainic, T.; Gendreau, M.; and Prins, C. European Journal of Operational Research, 231(1): 1–21. 2013.
Heuristics for multi-attribute vehicle routing problems: A survey and synthesis [pdf]Paper   doi   bibtex   abstract   8 downloads
  2012 (2)
A simple and effective metaheuristic for the minimum latency problem. Silva, M.; Subramanian, A.; Vidal, T.; and Ochi, L. European Journal of Operational Research, 221(3): 513–520. 2012.
A simple and effective metaheuristic for the minimum latency problem [pdf]Paper   doi   bibtex   abstract   2 downloads
A hybrid genetic algorithm for multidepot and periodic vehicle routing problems. Vidal, T.; Crainic, T.; Gendreau, M.; Lahrichi, N.; and Rei, W. Operations Research, 60(3): 611–624. 2012.
A hybrid genetic algorithm for multidepot and periodic vehicle routing problems [pdf]Paper   doi   bibtex   abstract   31 downloads