No abstract

No abstract

No abstract

No abstract

We consider the one-warehouse multi-retailer problem (OWMR) and perform both theoretical and computational studies of different formulations for the problem. Several formulations that were not yet directly applied to the OWMR are considered, namely an echelon stock formulation strengthened with valid inequalities, a two-level lot-sizing based formulation strengthened with valid inequalities, a multicommodity formulation and a dynamic programming based formulation. These are also compared with a strengthened echelon stock formulation and the previously best performing formulations available in the literature, a transportation and a shortest path formulations, which were studied in a previous work (Solyali and Süral in Ann Oper Res 196(1):517-541, 2012). The formulations were ordered according to the provided linear relaxation bounds, assuming there is no available stock at the beginning of the planning horizon. Experimental results using a commercial MIP solver indicate that a partial version of the two-level lot-sizing based formulation strengthened with valid inequalities and the multicommodity formulation outperform the others, especially as the sizes of the instances become larger. Besides, these two new best performing formulations allow the solver to prove optimality of instances for which not even the linear relaxation could be solved using the previously best performing formulations. KeywordsOne-warehouse multi-retailer • Mixed-integer programming • Extended formulations • Valid inequalities • Production planning The work of Jesus O. Cunha was supported by the Coordination for the Improvement of Higher Education Personnel (CAPES), Brazil.