Abstract
Traditionally, product returns have been viewed as an unavoidable cost of distribution systems. Up to now there are few studies to address the problem of determining the number and location of centralized product return centers where returned products from retailers or end-customers are collected for manufacturers’ or distributors’ repair facilities while considering the distribution system. To fill the void in such a line of research, this paper proposes a nonlinear mixed-integer programming model and a genetic algorithm that can solve the distribution problem with forward and reverse logistics simultaneously. Compared with a partly enumeration method, the numerical analysis shows the effectiveness of the proposed model and its genetic algorithm approach.
Preview
Unable to display preview. Download preview PDF.
Similar content being viewed by others
References
Dowlatshahi, S.: Developing a theory of reverse logistics. Interfaces 30, 43–55 (2000)
Stock, J.R.: Reverse logistics, White Paper, Oak Brook. Council of Logistics Management, IL (1992)
Krumwiede, D.W., Sheu, C.: A model for logistics entry by third-party providers. Omega 30, 325–333 (2002)
Mirchandani, P.B., Francis, R.L.: Discrete Location Theory. Wiley, New York (1989)
Min, H., Ko, H.J., Ko, C.S.: A genetic algorithm approach to developing the mult-echelon reverse logistics network for product returns. Omega (2005) (forthcoming issue)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2005 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Zhou, G., Cao, Z., Cao, J., Meng, Z. (2005). A Genetic Algorithm Approach on Reverse Logistics Optimization for Product Return Distribution Network. In: Hao, Y., et al. Computational Intelligence and Security. CIS 2005. Lecture Notes in Computer Science(), vol 3801. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11596448_38
Download citation
DOI: https://doi.org/10.1007/11596448_38
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-30818-8
Online ISBN: 978-3-540-31599-5
eBook Packages: Computer ScienceComputer Science (R0)