Séminaire conjoint CIRRELT-Chaire de recherche du Canada en distributique-Chaire en logistique et en transport
TITRE : A Decomposition Heuristic for the Production Routing Problem in a Make-to-Order Company
CONFÉRENCIER : Pedro Luis Miranda Lugo, Universidade Federal de Sao Carlos, Brésil
DATE et ENDROIT : 29 mars 2017, 10h30, salle 5441, Pavillon André-Aisenstadt, Campus de l’Université de Montréal
RESPONSABLE : Jean-François Cordeau
RÉSUMÉ : In this talk we present a decomposition -based heuristic to solve a rich production routing problem arising in the context of a make -to-order company. The problem considers several important features, such as sequence -dependent setup times, a heterogeneous fleet of vehicles, routes extending over one or more periods, multiple time windows, customers deadlines, among others. An integrated mathematical model is presented and is used as basis to develop the heuristic, which solves the problem by decomposing it in two parts that are solved iteratively. We use a large set of random instances to benchmark our heuristic against a general-purpose solver. Numerical results show that our method provides, in shorter computing times, solutions of similar quality to those obtained by the solver for instances with up to 15 customers. For larger instances, with 20 to 50 customers, the heuristic clearly outperforms the solver, which in most of the cases cannot find any solution after 24 hours of computing time.