NEW MATHEMATICAL MODELING FOR A LOCATION– ROUTING– INVENTORYPROBLEM IN A MULTI-PERIOD CLOSED-LOOP SUPPLY CHAIN IN A CARINDUSTRY

Q: How can I download an article?

To download an article from SID, first log in to the site, search for the article title, and click on the 'Download Article' option.

Q: How can I download an ISI article?

To download an ISI article on SID, enter the keyword or article title in the search bar, view the relevant results, click on the desired article, and select the 'Download Article' option.

Q: How can I access the SID database?

To access the SID database, visit SID.ir, create an account, and log in to access scientific resources.

Q: Is downloading articles from SID free?

Some articles on SID are available for free, while others require payment. Details are specified on the article's page.

FOROUZANFAR F.; TAVAKKOLI MOGHADDAM R.; BASHIRI M.; BABOLI A.; HADJI MOLANA S.M.

مرکز اطلاعات علمی Scientific Information Database (SID) - Trusted Source for Research and Academic Resources

Journal Paper

Paper Information

Journal: JOURNAL OF INDUSTRIAL ENGINEERING INTERNATIONAL Year:2018 | Volume:14 | Issue:3 Page(s): 537-553

Download Full-Text

View:

211

Download:

158

Cites:

Information Journal Paper

Title

NEW MATHEMATICAL MODELING FOR A LOCATION– ROUTING– INVENTORYPROBLEM IN A MULTI-PERIOD CLOSED-LOOP SUPPLY CHAIN IN A CARINDUSTRY

Author(s)

Keywords

LOCATION–

ROUTING–

INVENTORY

MULTI-PERIOD

CLOSED-LOOP SUPPLY CHAIN

LOST SALES

BACKLOG

Abstract

This paper studies a LOCATION–; ROUTING–; inventoryproblem in a multi-period closed-loop supply chain withmultiple suppliers, producers, distribution centers, customers, collection centers, recovery, and recycling centers. In thissupply chain, centers are multiple levels, a price increasefactor is considered for operational costs at centers, inventoryand shortage (including lost sales and BACKLOG) are allowed atproduction centers, arrival time of vehicles of each plant to itsdedicated distribution centers and also departure from themare considered, in such a way that the sum of system costs andthe sum of maximum time at each level should be minimized. The aforementioned problem is formulated in the form of abi-objective nonlinear integer programming model. Due tothe NP-hard nature of the problem, two meta-heuristics, namely, non-dominated sorting genetic algorithm (NSGA-II)and multi-objective particle swarm optimization (MOPSO), are used in large sizes. In addition, a Taguchi method is usedto set the parameters of these algorithms to enhance theirperformance. To evaluate the efficiency of the proposedalgorithms, the results for small-sized problems are comparedwith the results of the e-constraint method. Finally, fourmeasuring metrics, namely, the number of Pareto solutions, mean ideal distance, spacing metric, and quality metric, areused to compare NSGA-II and MOPSO.

Multimedia

No record.

Cites

No record.

References

No record.

Cite

APA: Copy

FOROUZANFAR, F., TAVAKKOLI MOGHADDAM, R., BASHIRI, M., BABOLI, A., & HADJI MOLANA, S.M.. (2018). NEW MATHEMATICAL MODELING FOR A LOCATION– ROUTING– INVENTORYPROBLEM IN A MULTI-PERIOD CLOSED-LOOP SUPPLY CHAIN IN A CARINDUSTRY. JOURNAL OF INDUSTRIAL ENGINEERING INTERNATIONAL, 14(3), 537-553. SID. https://sid.ir/paper/310147/en

Vancouver: Copy

FOROUZANFAR F., TAVAKKOLI MOGHADDAM R., BASHIRI M., BABOLI A., HADJI MOLANA S.M.. NEW MATHEMATICAL MODELING FOR A LOCATION– ROUTING– INVENTORYPROBLEM IN A MULTI-PERIOD CLOSED-LOOP SUPPLY CHAIN IN A CARINDUSTRY. JOURNAL OF INDUSTRIAL ENGINEERING INTERNATIONAL[Internet]. 2018;14(3):537-553. Available from: https://sid.ir/paper/310147/en

IEEE: Copy

F. FOROUZANFAR, R. TAVAKKOLI MOGHADDAM, M. BASHIRI, A. BABOLI, and S.M. HADJI MOLANA, “NEW MATHEMATICAL MODELING FOR A LOCATION– ROUTING– INVENTORYPROBLEM IN A MULTI-PERIOD CLOSED-LOOP SUPPLY CHAIN IN A CARINDUSTRY,” JOURNAL OF INDUSTRIAL ENGINEERING INTERNATIONAL, vol. 14, no. 3, pp. 537–553, 2018, [Online]. Available: https://sid.ir/paper/310147/en

Related Journal Papers

No record.

Related Seminar Papers

No record.

Related Plans

No record.

Recommended Workshops