DEVELOPING AND SOLVING A BI-OBJECTIVE JOINT REPLENISHMENT PROBLEM UNDER STORING SPACE CONSTRAINT

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.

YOUSEFI OMMOLBANIN; GHOLI ARIYANEZHAD MIR BAHADOR; SADJADI SEYED JAFAR

Scientific Information Database (SID) - Trusted Source for Research and Academic Resources

Journal Paper

Paper Information

Journal: PRODUCTION AND OPERATIONS MANAGEMENT Year:2011 | Volume:1 | Issue:1 Page(s): 1-18

Download Full-Text

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

Persian Verion

View:

1,050

Download:

Cites:

Information Journal Paper

Title

DEVELOPING AND SOLVING A BI-OBJECTIVE JOINT REPLENISHMENT PROBLEM UNDER STORING SPACE CONSTRAINT

Author(s)

YOUSEFI OMMOLBANIN | GHOLI ARIYANEZHAD MIR BAHADOR | SADJADI SEYED JAFAR | Issue Writer Certificate

Keywords

JOINT REPLENISHMENT PROBLEMQ3

MULTI-OBJECTIVE OPTIMIZATIONQ1

STORING SPACE CONSTRAINTQ3

GENETIC ALGORITHMQ2

Abstract

In this research, a bi-objective JOINT REPLENISHMENT PROBLEM has been developed and solved with the assumption of one restricted resource. The proposed model has a STORING SPACE CONSTRAINT and tries to optimize two objective functions simultaneously. They include minimizing annual holding and setup costs and minimizing annual inventory investment. Then, for solving this problem, a multi-objective GENETIC ALGORITHM (MOGA) has been developed. In order to analyze the algorithm efficiency, its performance has been examined in solving 1600 randomly produced problems using parameters extracted from literature. The findings imply that the proposed algorithm is capable of producing a good set of Pareto optimal solutions. Finally, the application of the problem solving approach and the findings of the proposed algorithm have been illustrated for a special problem, which has been randomly produced.

Cites

No record.

References

No record.

Cite

APA: Copy

YOUSEFI, OMMOLBANIN, GHOLI ARIYANEZHAD, MIR BAHADOR, & SADJADI, SEYED JAFAR. (2011). DEVELOPING AND SOLVING A BI-OBJECTIVE JOINT REPLENISHMENT PROBLEM UNDER STORING SPACE CONSTRAINT. PRODUCTION AND OPERATIONS MANAGEMENT, 1(1), 1-18. SID. https://sid.ir/paper/217604/en

Vancouver: Copy

YOUSEFI OMMOLBANIN, GHOLI ARIYANEZHAD MIR BAHADOR, SADJADI SEYED JAFAR. DEVELOPING AND SOLVING A BI-OBJECTIVE JOINT REPLENISHMENT PROBLEM UNDER STORING SPACE CONSTRAINT. PRODUCTION AND OPERATIONS MANAGEMENT[Internet]. 2011;1(1):1-18. Available from: https://sid.ir/paper/217604/en

IEEE: Copy

OMMOLBANIN YOUSEFI, MIR BAHADOR GHOLI ARIYANEZHAD, and SEYED JAFAR SADJADI, “DEVELOPING AND SOLVING A BI-OBJECTIVE JOINT REPLENISHMENT PROBLEM UNDER STORING SPACE CONSTRAINT,” PRODUCTION AND OPERATIONS MANAGEMENT, vol. 1, no. 1, pp. 1–18, 2011, [Online]. Available: https://sid.ir/paper/217604/en

Related Journal Papers