Optimization for courier delivery service network design based on frequency delay. (January 2020)

• Record Type: Journal Article
• Authors: Lin, Boliang; Zhao, Yinan; Lin, Ruixi
• Is Part Of: Computers & industrial engineering. Volume 139(2020)
• Publication Date: 2020-01
• Subjects: Courier delivery network -- Transfer chain -- Frequency delay -- Nonlinear 0–1 programming -- Simulated annealing; Engineering -- Data processing -- Periodicals; Industrial engineering -- Periodicals; 620.00285
• DOI: 10.1016/j.cie.2019.106144
• Languages: English
• ISSNs: 0360-8352

Abstract

Highlights: Frequency delay in sorting process is formulated related to standard courier units. Transfer chain derived from recursive formula is used to express uniqueness condition. A nonlinear 0–1 integer programming model is proposed based on the transfer chain. Abstract: The courier industry is one of the most essential parts of the modern logistics. Meanwhile, the delivery network is one of the most important infrastructures of courier enterprises to take participate into operation. This paper presents a combinatorial optimization model for the courier delivery network design problem, and the aim of optimization is to determine the transportation organization mode for each courier flow considering the frequency delay of accumulation in the sorting process. A nonlinear zero-one integer programming model is formulated to describe the problem. The objective function of the model is intended to minimize the total cost including accumulation cost, transportation cost and transfer cost. Besides, we use the transfer chain achieved by a recursive formula to express the uniqueness condition for each courier flow. Also, the limited capacity of facilities is considered in this model. We take the real courier delivery network in China as an example to illustrate the efficiency of our algorithm. A total of 32 transfer and sorting centers are considered and 36 local and distribution centers are included in the numerical example of this paper. A simulated annealing algorithm has been developed for achieving an approximate optimal solution after pre-processing and an acceptable result has been achieved.