A hybrid solution approach for a multi-objective closed-loop logistics network under uncertainty

Artikel

The design of closed-loop logistics (forward and reverse logistics) has attracted growing attention with the stringent pressures of customer expectations, environmental concerns and economic factors. This paper considers a multi-product, multi-period and multi-objective closed-loop logistics network model with regard to facility expansion as a facility location-allocation problem, which more closely approximates real-world conditions. A multiobjective mixed integer nonlinear programming formulation is linearized by defining new variables and adding new constraints to the model. By considering the aforementioned model under uncertainty, this paper develops a hybrid solution approach by combining an interactive fuzzy goal programming approach and robust counterpart optimization based on three well-known robust counterpart optimization formulations. Finally, this paper compares the results of the three formulations using different test scenarios and parameter-sensitive analysis in terms of the quality of the final solution, CPU time, the level of conservatism, the degree of closeness to the ideal solution, the degree of balance involved in developing a compromise solution, and satisfaction degree.

Object Details

• Language: Englisch

References and Relationships

• Bibliographic citation: Journal: Journal of Industrial Engineering International ; ISSN: 2251-712X ; Volume: 11 ; Year: 2015 ; Pages: 237-252 ; Heidelberg: Springer

Classification and Topics

• Classification: Management
• Subject: Closed-loop logistics ; Interactive fuzzy goal programming ; Multi-objective problem ; Robust optimization

Contributors, Places and Time

• Event: Geistige Schöpfung
• (who): Mehrbod, Mehrdad ; Tu, Nan ; Miao, Lixin
• Event: Veröffentlichung
• (who): Springer
• (where): Heidelberg
• (when): 2015

Further information

• DOI: doi:10.1007/s40092-014-0089-z
• Handle: http://hdl.handle.net/10419/157436
• Last update: 10.03.2025, 11:43 AM CET