Distribution Coordination Between Suppliers and Customers with a Consolidation Center

Haiqing Song (), Vernon N. Hsu () and Raymond K. Cheung ()
Additional contact information
Haiqing Song: Lingnan College, Sun Yat-sen University, Guangzhou, China 510275
Vernon N. Hsu: Australian School of Business, The University of New South Wales, Sydney, Australia, and School of Management, George Mason University, Fairfax, Virginia 22030
Raymond K. Cheung: Department of Industrial Engineering and Logistics Management, The Hong Kong University of Science and Technology, Hong Kong, China

Operations Research, 2008, vol. 56, issue 5, 1264-1277

Abstract: We study a problem faced by a third-party logistics provider (3PL) who needs to coordinate shipments between suppliers and customers through a consolidation center in a distribution network. Products from a supplier have one release time and are consolidated into a single shipment to the consolidation center. At the center, products to the same destination are also consolidated into a single shipment, and the consolidation time can be as early as possible or as late as possible, depending on the customer requirement and cost structure. The 3PL needs to determine the pickup times from the suppliers, delivery times to the customers, and the transportation options while considering product release times, latest arrival times, different consolidation policies, and the transportation and storage costs involved. In this paper, we formulate this problem as a nonlinear optimization problem, show it is an NP-hard problem, and develop a dual-based solution method for the general problem. Utilizing the problem's special structure, we show that the Lagrangian dual of the general problem can be solved optimally as a linear program, thus allowing us to accelerate the computation of a lower bound to the optimal objective function value. The experimental results show that the dual-based algorithm provides solutions with objective function values, which are on average within 3.24% of optimality. We also consider a version of the problem where each customer orders products from all suppliers, for which we develop a polynomial-time algorithm.

Keywords: shipment consolidation; distribution network optimization; logistics coordination (search for similar items in EconPapers)
Date: 2008
References: View references in EconPapers View complete reference list from CitEc
Citations: View citations in EconPapers (9)

Downloads: (external link)
http://dx.doi.org/10.1287/opre.1070.0488 (application/pdf)

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:inm:oropre:v:56:y:2008:i:5:p:1264-1277

Access Statistics for this article

More articles in Operations Research from INFORMS Contact information at EDIRC.
Bibliographic data for series maintained by Chris Asher ().