Resumo

ELIZONDO-CORTES, M  e  ACEVES-GARCIA, R. Separable cross decomposition to solve the assign-routing problem. Ing. invest. y tecnol. [online]. 2008, vol.9, n.1, pp.77-83. ISSN 2594-0732.

The Inventory-Routing Problem emerges on a logistical context, that is presented into the companies and that it seeks to satisfy the demands of a group of clients distributed geographically, using a flotilla of vehicles of limited capacity, which are in a central ware house, at the small est possible cost. The IRP is a NP-hard problem that is usually great size in real applications. For its solution was designed an strategy that uses of combined form, the crossed de composition and the separable Lagrangean relaxation in order to solve the assign-distribution phase, with what it is obtained a ping-pong type scheme between two subproblems, which are from transport type, with which it is obtained a very efficient algorithm of order O(n³) and easy to implement for the complete problem.

Palavras-chave : Supply chain; distribution; routing; separable cross decomposition.