Resumo

TORO-OCAMPO, Eliana Mirledy; FRANCO-BAQUERO, John Fredy  e  GALLEGO-RENDON, Ramón Alfonso. Mathematical Model for Capacitated Location Routing Problem with Private Fleet and Common Carrier. Ing. invest. y tecnol. [online]. 2016, vol.17, n.3, pp.357-369. ISSN 2594-0732.

The Capacitated Location Routing Problem (CLRP) consists in the selection of depots and routes to serve all the clients such that the minimum cost is obtained. A variant of this problem, where it is considered that there is the possibility of outsourcing the operation of some (or all) routes, is the location routing problem with private fleet and common carrier (CLRPPC). This problem is presented when the own fleet is insufficient to serve the whole demand or part of its own fleet must have maintenance and repairing activities. The CLRPPC objective is to minimize the costs of opening distribution centers (DC), the cost for using their own vehicles and the variable costs associated with the use of the routes traveled by their own fleet or an outsourced fleet. This paper presents a new mathematical model for CLRPPC, where the classical restrictions to prevent sub-tours are replaced by a set of constraints that establish the radio links between customers and depots, solving accurately instances used in the literature using commercial solvers. Moreover, the model can be adapted to solve the Vehicle Routing Problem with Private Fleet and Common Carrier (VRPPC) and Multi-Depot Vehicle Routing Problem with Private Fleet and Common Carrier (MDVRPPC). The models are validated with instances of the literature, where the results show that the proposed formulation gives satisfactory results for these three types of problems despite its high mathematical complexity.

Palavras-chave : capacitated location routing problem; common carrier; distribution strategy; multi-depot vehicle routing problem; own fleet; outsourced fleet; vehicle routing problem.

        · resumo em Espanhol     · texto em Espanhol     · Espanhol ( pdf )