Solving the Homogeneous Probabilistic Traveling Salesman Problem by the ACO Metaheuristic. - Leonora Bianchi; Luca Maria Gambardella; Marco Dorigo (Ant Algorithms, 2002)

An Ant Colony Optimization Approach to the Probabilistic Traveling Salesman Problem. - Leonora Bianchi; Luca Maria Gambardella; Marco Dorigo (PPSN, 2002)

Applications Metaheuristics for the Vehicle Routing Problem with Stochastic Demands. - Leonora Bianchi; Mauro Birattari; Marco Chiarandini; Max Manfrin; Monaldo Mastrolilli; Luís Paquete; Olivia Rossi-Doria; Tommaso Schiavinotto (PPSN, 2004)

Local search for the probabilistic traveling salesman problem: Correction to the 2-p-opt and 1-shift algorithms. - Leonora Bianchi; Joshua D. Knowles; Neill Bowler (Eur. J. Oper. Res., 2005)

Core instances for testing: A case study. - Monaldo Mastrolilli; Leonora Bianchi (Eur. J. Oper. Res., 2005)

Hybrid Metaheuristics for the Vehicle Routing Problem with Stochastic Demands. - Leonora Bianchi; Mauro Birattari; Marco Chiarandini; Max Manfrin; Monaldo Mastrolilli; Luís Paquete; Olivia Rossi-Doria; Tommaso Schiavinotto (J. Math. Model. Algorithms, 2006)

Extension of the 2-p-opt and 1-shift algorithms to the heterogeneous probabilistic traveling salesman problem. - Leonora Bianchi; Ann Melissa Campbell (Eur. J. Oper. Res., 2007)

New Approximation-Based Local Search Algorithms for the Probabilistic Traveling Salesman Problem. - Dennis Weyland; Leonora Bianchi; Luca Maria Gambardella (EUROCAST, 2009)

A survey on metaheuristics for stochastic combinatorial optimization. - Leonora Bianchi; Marco Dorigo; Luca Maria Gambardella; Walter J. Gutjahr (Nat. Comput., 2009)