S
Forum 'Annonces' - Sujet créé le 2015-03-12
Bonjour à tous,
Vendredi 27 mars, nous aurons l'honneur d'accueillir le Professeur Paolo Toth de l'Université de Bologne. Il donnera un seminaire à 11h dans la salle A709 à l'Université Paris Dauphine.
Titre: A Reduced-Cost Iterated Local Search Heuristic for the Fixed Charge Transportation Problem
The Fixed Charge Transportation Problem (FCTP) is a generalization of the Transportation Problem where an additional fixed cost is paid for sending a flow from an origin to a destination. We propose an Iterated Local Search heuristic based on the utilization of reduced costs for guiding the restart phase. The reduced costs are obtained by applying a lower bounding procedure that computes a sequence of non-decreasing lower bounds by solving a three-index mathematical formulation of the problem strengthened with valid inequalities. The proposed method was tested on the sets of benchmark instances from the literature. The proposed heuristic was able to provide, within short computing times, new best-known solutions on all the considered instances.
Nous vous attendons nombreux !
Cordialement
Fabio
Vendredi 27 mars, nous aurons l'honneur d'accueillir le Professeur Paolo Toth de l'Université de Bologne. Il donnera un seminaire à 11h dans la salle A709 à l'Université Paris Dauphine.
Titre: A Reduced-Cost Iterated Local Search Heuristic for the Fixed Charge Transportation Problem
The Fixed Charge Transportation Problem (FCTP) is a generalization of the Transportation Problem where an additional fixed cost is paid for sending a flow from an origin to a destination. We propose an Iterated Local Search heuristic based on the utilization of reduced costs for guiding the restart phase. The reduced costs are obtained by applying a lower bounding procedure that computes a sequence of non-decreasing lower bounds by solving a three-index mathematical formulation of the problem strengthened with valid inequalities. The proposed method was tested on the sets of benchmark instances from the literature. The proposed heuristic was able to provide, within short computing times, new best-known solutions on all the considered instances.
Nous vous attendons nombreux !
Cordialement
Fabio