This Article Full Text (PDF) References Alert me when this article is cited Alert me if a correction is posted Services Email this article to a friend Similar articles in this journal Alert me to new issues of the journal Download to citation manager Citing Articles Citing Articles via HighWire Citing Articles via Google Scholar Google Scholar Articles by Lapierre, S. D. Articles by Soriano, P. Search for Related Content

Designing Distribution Networks: Formulations and Solution Heuristic

Department Mathématiques appliquées et génie industriel, École Polytechnique de Montréal, and Centre for Research on Transportation, Université de Montréal, Montréal, Québec, Canada
U.T. Compiègne, and Centre for Research on Transportation, Université de Montréal, Montréal, Québec, Canada
École des Hautes Études Commerciales, and Centre for Research on Transportation, Université de Montréal, Montréal, Québec, Canada
sophiel{at}crt.umontreal.ca
angel{at}crt.umontreal.ca
patrick{at}crt.umontreal.ca

The fast development of transport activities and the introduction of shipment consolidation have considerably changed the logistics context over the last three decades. Consolidation terminals, also called transshipment centers (TC) or hubs, have justified their presence by improving the loading of trucks in terms of both volume and weight. In addition, the possibility of using external carriers, exclusively or in coordination with a private fleet, can reduce costs and increase customer service. The right combination of these strategies can dramatically impact the cost of transport. However, the complexity of the decisions has also increased and existing models have to be improved to tackle these new challenges. In this paper, after discussing the different formulations for distribution networks with transshipment centers existing in the literature, we present a new model and an efficient metaheuristic that determines the number and the location of TCs as well as the best transportation alternative—LTL, FTL, Parcel, or own fleet—on each segment accounting for both weight and volume metrics. The ability of our heuristic to solve this complex problem comes from a judicious combination of tabu search and variable neighborhood search. The performance of this approach is evaluated on several test data problems generated with real cost structures published by a U.S. carrier. The heuristic solutions are compared to optimal ones obtained by an exact method for small-sized instances of the simpler problems. Finally, we address issues in carrier price structure to achieve efficient shipment practices.

Key Words: distribution networks; hub; metaheuristics; tabu search; variable neighborhood search
History: Received: January 2001; revised: September 2001; accepted: July 2002.

This article has been cited by other articles:

				H. Song, V. N. Hsu, and R. K. Cheung Distribution Coordination Between Suppliers and Customers with a Consolidation Center Operations Research, September 1, 2008; 56(5): 1264 - 1277. [Abstract] [PDF]

				O. Berman and Q. Wang Inbound Logistic Planning: Minimizing Transportation and Inventory Cost Transportation Science, August 1, 2006; 40(3): 287 - 299. [Abstract] [PDF]